Search arXivSearch

arXiv · 2509.02725

Counting factorizations of Singer cycles in linear and unitary groups

Abstract

We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking product formula resembling the count for minimum-length factorizations of Coxeter elements into reflections in complex reflections groups. Moreover, for minimum length, the answers for the unitary and linear groups exhibit the phenomenon of Ennola duality, where the number of factorizations in a unitary group over the field $\mathbb{F}_q$ is given by replacing `$q$' with `$-q$' in the corresponding answer for a linear group. We use the character theory of these groups to make this count, and in particular we employ the Deligne--Lusztig theory of characters for finite reductive groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joel Brewster Lewis, C. Ryan Vinroot. 2026-09-15. Counting factorizations of Singer cycles in linear and unitary groups. https://arxiv.org/abs/2509.02725

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO