Overview
- Why does divide exactly when is even?
- Why are and irreducible for odd primes ?
- How does reciprocal symmetry restrict their Galois groups?
Definition and normalization
For , define , where a descent is an index with . Their generating function is
Complementing the values of a permutation gives . Set for even , and for odd . This notation distinguishes the normalized Eulerian polynomial from the Appell Euler polynomial . For , is monic, reciprocal, and has positive even degree.
References 1
- FoataSchutzenberger1970 Β· Chapters II and IVPermutation statistics and generating functions.Authorized digital retypesetting
Roots and reciprocity
The recurrence
gives simple negative roots by induction. At each negative root of , the factor reverses the sign of its derivative. Together with the signs at and at negative infinity, this places one root of in each intervening interval and one on each outside interval. Reciprocity then pairs roots by inversion. Since , the only possible fixed point of inversion is . It occurs exactly when is even, and simplicity makes its multiplicity one.
References 1
- FoataSchutzenberger1970 Β· Chapters II, IV, and VEulerian identities and the value at β1; the interlacing argument is explained here.Authorized digital retypesetting
Limiting zero distribution
Let be the roots of . Then
Melotti gives a combinatorial proof of this log-Cauchy limit, using exact stabilized moments after the transformation . His convention uses , including a zero root; deleting that one atom and changing the normalization leaves the weak limit unchanged. The limiting distribution does not determine the Galois orbits or settle the irreducibility conjecture.
References 1
- Melotti2025Eulerian Β· Theorems 1β2; arXiv:2507.15908v2The limiting law is older; the paper supplies a new proof via stabilized moments.Source
Prime indices
Theorem
For every odd prime , is irreducible over .
Fermat's congruence in the generating identity gives
Therefore . The shifted polynomial is monic, while its constant term is , divisible by but not . Eisenstein applies. This is the instance of SharmaβStraus, Theorem 6.
References 1
- SharmaStraus1974 Β· Theorem 6, r=1The classical prime-index case within the EulerβFrobenius family.Source
A large irreducible factor
Theorem
For , let be the largest prime at most . The normalized polynomial has an irreducible factor over of degree at least . In particular, and are irreducible for every odd prime .
Put . Bertrand's postulate gives and . Fermat's congruence and the generating identity imply
Since is a p-adic unit, the coefficient of is a unit and every preceding coefficient is divisible by . The constant term has valuation one. The first Newton edge is therefore from to . It gives an irreducible factor of degree over . Some rational irreducible factor must contain it, hence has at least this degree. At even , removing removes only a local linear factor with slope zero, because is odd.
Ta Thi Hoai An and Ngo Quoc Hoan attribute this bound to Heidrich; the original full text was not accessible in this review. It does not exclude an additional smaller factor at every composite index.
References 3
- Heidrich1984EulerianThe large-factor result; original full text was not accessible in this review, so no theorem number is asserted.Source
- FoataSchutzenberger1970 Β· Chapter IVGenerating identity used in the displayed proof.Authorized digital retypesetting
- TaNgo2026MultipleEulerian Β· Introduction, p. 2 of the institutional manuscriptSecondary attribution to Heidrich; the proof above is given directly. The corresponding locator in the final journal version was not checked.Source
Example
Example
The splitting field of is . If its roots are , then
Each radicand has norm , a nonsquare in , so neither is a square in . Their product is also a nonsquare in : a rational number is a square in only if it or its quotient by is a rational square; neither condition holds for . The two classes are independent, so the splitting field has degree . Thus , the dihedral group of order eight.
Modular factorizations
Modulo 2
- Factor degrees
- 1 + 1 + 1 + 1
- Squarefree reduction
- No
- Possible proper factor degrees
- 1, 2, 3
The reduction has repeated factors, so the Frobenius cycle criterion does not apply. It still restricts factor degrees because the degree is preserved.
Modulo 11
- Factor degrees
- 4
- Squarefree reduction
- Yes
- Possible proper factor degrees
- None
The irreducible reduction proves irreducibility over Q and gives a cycle of full length in the Galois group.
Modulo 13
- Factor degrees
- 1 + 1 + 1 + 1
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 1, 2, 3
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
Modulo 17
- Factor degrees
- 2 + 2
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 2
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
Modulo 23
- Factor degrees
- 1 + 1 + 2
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 1, 2, 3
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
Proof by reduction modulo primes
The irreducible reduction modulo 11 supplies a 4-cycle and proves irreducibility over . The factorization modulo 23 supplies a transposition.
Reciprocity bounds the group by , of order 8. A 4-cycle generates a subgroup of order 4, and a single transposition lies outside that cyclic subgroup. The generated subgroup has order 8, so it is the full wreath product.
References 1
- AndersonBertelliODorney2026 Β· Β§2The reciprocal group framework; this index-five calculation is worked out directly.Source
General indices
The general question is whether is irreducible over for every . The prime and prime-plus-one cases establish this in two infinite sets of indices. The largest-prime bound gives a large irreducible factor at every index, but can leave room for smaller factors.
Determining the Galois group requires two further steps: find the group of the trace polynomial, then determine the square-class relations in the quadratic extensions above its roots.
References 1
- SharmaStraus1974 Β· p. 266 and Theorem 6Conjectural scope in the original paper and one proven range.Source
Questions
Is the normalized Eulerian polynomial irreducible for every index nβ₯3?
Scope. The classical r=1 EulerβFrobenius specialization over Q; remove x+1 at even indices.
The prime and prime-plus-one cases and the general large-factor bound are proved above. The all-index statement is a conjecture in the cited 1974 source; this status does not exclude subsequent advances.
References 2
- SharmaStraus1974 Β· p. 266 and Theorem 6Source
- Heidrich1984EulerianGeneral large-factor results.Source
For which indices is the group the full signed-permutation group?
Scope. The separable reciprocal polynomial , of degree 2m.
The group is determined by the action on the degree-m trace polynomial and the rank of the square classes of the quadratic radicands. The index-five example computes both; this computation does not give a uniform argument.
References 1
Related topics
Connected diagrams
Browse all diagrams βSchΓΆnemannβEisenstein and Dumas criteria
After the shift xβ¦1+x, a prime divides every nonleading coefficient.
UsesReciprocal polynomials
The trace polynomial separates the pair action from its quadratic kernel.
Contrasts withBernoulli and Euler polynomials
Appell Euler polynomials use a different generating function and have different forced factors.
UsesFrobenius and factorization modulo primes
Good-prime factorizations give further cycle constraints.
References
- ThΓ©orie gΓ©omΓ©trique des polynΓ΄mes eulΓ©riens
Foata, Dominique and SchΓΌtzenberger, Marcel-Paul. Springer, Lecture Notes in Mathematics, vol. 138, 1970.
Authorized digital retypesetting - Distribution of the roots of Eulerian polynomials
Melotti, Paul. Electronic Communications in Probability, 30, 1β7, 2025.
Read the source - On the irreducibility of a class of Euler Frobenius polynomials
Sharma, A. and Straus, Ernst G. Canadian Mathematical Bulletin, 17(2), 265β273, 1974.
Read the source - On the factorization of Eulerian polynomials
Heidrich, ArnoΕ‘t J. J. Journal of Number Theory, 18(2), 157β168, 1984.
Read the source - Multiple Eulerian polynomials
Ta, Thi Hoai An and Ngo, Quoc Hoan. The Journal of Analysis, 34, 21β34, 2026.
Read the source - Galois groups of reciprocal polynomials and the van der Waerden-Bhargava theorem
Anderson, Theresa C. and Bertelli, Adam and O'Dorney, Evan M. Algebra & Number Theory, 20(3), 603β628, 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.