14 citations · 26 across the 27 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 1 cited
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.GR2019★ 1 cited
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…
math.CO2019★ 8 cited
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})…