1 citations · 1 across the 4 of their papers we have counts for
8 papers
A new statistic on Dyck paths for counting 3-dimensional Catalan words
Kassie Archer, Christina Gravies
A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path , a recently defined statistic counts the nu…
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…
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…
On the Intersection Numbers of Finite Groups
Kassie Archer, Humberto Bautista Serrano, Kayla Cook +3
The covering number of a nontrivial finite group , denoted , is the smallest number of proper subgroups of whose set-theoretic union equals . In this article, we fo…
Arithmetical structures on bidents
Kassie Archer, Abigail Bishop, Alexander Diaz-Lopez +3
An arithmetical structure on a finite, connected graph is a pair of vectors with positive integer entries for which $(\operatorname{diag}(\mathbf{d})…
Pattern restricted quasi-Stirling permutations
Kassie Archer, Adam Gregory, Bryan Pennington +1
We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset that avoid the patterns 1212 and 21…