Counting cycles in a Sylow 2-subgroup
Count the permutations in a Sylow 2-subgroup of the symmetric group on 2n points by their number of cycles. Richard Stanley observed on MathOverflow (question 489315) that a closely related polynomial, after adding a power of 2, splits into two factors of equal degree that appear to be irreducible; the factorization was proved there and irreducibility was left open. We prove that both factors are irreducible over Q for every n, for the Sylow polynomials and for the family as printed in the question (which is one index off). After scaling, both are iterates of the triangular-number map; the factorization is a difference of two squares, and irreducibility follows modulo 5 from the critical orbit and the quadratic case of Capelli's lemma. The main results are formally verified in Lean 4. This record is identical to the folder sylow-cycle-polynomials at tag sylow-cycle-polynomials-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (9 October 2026) was released on GitHub only.
Authors
- Vamshi Jandhyala (ORCID: https://orcid.org/0009-0006-6708-5805)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24353375
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint