3 papers
math.CO2021
Pattern-restricted permutations composed of 3-cycles
Kassie Archer, Christina Graves
In this paper, we characterize and enumerate pattern-avoiding permutations composed of only 3-cycles. In particular, we answer the question for the six patterns of length 3. We fin…
math.CO2019
Counting acyclic and strong digraphs by descents
Kassie Archer, Ira M. Gessel, Christina Graves +1
A descent of a labeled digraph is a directed edge (s, t) with s > t. We count strong tournaments, strong digraphs, and acyclic digraphs by descents and edges. To count strong tourn…
math.CO2017
Enumerating Acyclic Digraphs by Descents
Kassie Archer, Christina Graves
A descent of a labeled acyclic digraph is a directed edge with . In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of…