12 citations · 22 across the 6 of their papers we have counts for
6 papers
Characterizing finite groups whose enhanced power graphs have universal vertices
David G. Costanzo, Mark L. Lewis, Stefano Schmidt +2
Let be a finite group and construct a graph by taking as the vertex set of and by drawing an edge between two vertices and if $\langle x…
Mixing Time and Cutoff for the k-SEP
Eyob Tsegaye
We investigate the mixing time of the capacity simple exclusion process (also called the partial exclusion process) of Schultz and Sandow with particles on a segment of len…
Explicit Constructions of Finite Groups as Monodromy Groups
Ra-Zakee Muhammad, Javier Santiago, Eyob Tsegaye
In 1963, Greenberg proved that every finite group appears as the monodromy group of some morphism of Riemann surfaces. In this paper, we give two constructive proofs of Greenberg's…
The Cyclic Graph of a Z-group
David G. Costanzo, Mark L. Lewis, Stefano Schmidt +2
For a group , we define a graph by letting be the set of vertices and by drawing an edge between distinct elements if and o…
The cyclic graph (deleted enhanced power graph) of a direct product
David G. Costanzo, Mark L. Lewis, Stefano Schmidt +2
Let be a finite group. Define a graph on the set by declaring distinct elements to be adjacent if and only if $\langle x,y\rangle…
Limit Theorems for Descents in Permutations and Arithmetic Progressions in
Bryce Cai, Annie Chen, Ben Heller +1
We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic f…