arXiv Analytics

Sign in

arXiv:1308.1468 [math.CO]AbstractReferencesReviewsResources

Reflection factorizations of Singer cycles

Joel Brewster Lewis, Victor Reiner, Dennis Stanton

Published 2013-08-07, updated 2014-03-12Version 2

The number of shortest factorizations into reflections for a Singer cycle in GL_n(F_q) is shown to be (q^n-1)^(n - 1). Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also given. The method is a standard character-theory technique, requiring the compilation of irreducible character values for Singer cycles, semisimple reflections, and transvections. The results suggest several open problems and questions, which are discussed at the end.

Comments: Historical references added; final version to appear in J. Algebraic Combinatorics
Categories: math.CO, math.RT
Subjects: 05A15, 05E10, 20C15
Related articles: Most relevant | Search more
arXiv:1102.5727 [math.CO] (Published 2011-02-28)
Open problems in Costas arrays
arXiv:1406.1949 [math.CO] (Published 2014-06-08, updated 2015-05-19)
Distinct Distances: Open Problems and Current Bounds
arXiv:1805.03334 [math.CO] (Published 2018-05-09)
$P$-Matchings in Graphs: A Brief Survey with Some Open Problems