A generating function approach to counting theorems for square-free polynomials and maximal tori

DOI10.1007/S00026-016-0310-4zbMath1347.05008arXiv1410.3540OpenAlexW1923591129MaRDI QIDQ331498

Jason Fulman

Publication date: 27 October 2016

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.3540

zbMATH Keywords

generating functionmaximal torussquare-free polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (3)

Statistics for $p$-ranks of Artin–Schreier covers ⋮ Statistical enumeration of groups by double cosets ⋮ Convergence criteria for \(\text{FI}_{\mathcal{W}}\)-algebras and polynomial statistics on maximal tori in type B/C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic interpretation of the Macdonald polynomials
• Representations of finite Chevalley groups. A survey
• Rational tori, semisimple orbits and the topology of hyperplane complements
• Rational points and cohomology of discriminant varieties
• Handbook of Finite Fields
• Representation stability in cohomology and asymptotics for families of varieties over finite fields
• Cycle indices for the finite classical groups
• Counting cyclic and separable matrices over a finite field
• Endomorphisms of linear algebraic groups

This page was built for publication: A generating function approach to counting theorems for square-free polynomials and maximal tori