3 papers
math.GR2021
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…
math.GR2020
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…
math.PR2018
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…