On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups

zbMATH Open1228.05023MaRDI QIDQ3550129FDOQ3550129

Authors: Max B. Kutler, C. Ryan Vinroot 

Publication date: 30 March 2010

Full work available at URL: https://eudml.org/doc/230628

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A semi-recursion for the number of involutions in special orthogonal groups over finite fields
• Using recurrence relations to count certain elements in symmetric groups
• \(p\)-divisibility of the number of solutions of \(x^p=1\) in a symmetric group
• COUNTING ELEMENTS IN THE SYMMETRIC GROUP
• Asymptotics of the number of involutions in finite classical groups

zbMATH Keywords

recursionssymmetric group\(q\)-analogs\(q\)-binomial coefficientsvector spaces over finite fieldsEulerian generating functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Symmetric groups (20B30) Connections of basic hypergeometric functions with quantum groups, Chevalley groups, (p)-adic groups, Hecke algebras, and related topics (33D80)

Cited In (3)

• The perfect order subset conjecture for simple groups.
• Using recurrence relations to count certain elements in symmetric groups
• A semi-recursion for the number of involutions in special orthogonal groups over finite fields

Uses Software

• OEIS

This page was built for publication: On \(q\)-analogs of recursions for the number of involutions and prime order elements in symmetric groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550129)