Overview
- Which rational factors follow from the generating functions?
- For which indices does Carlitz’s criterion prove irreducibility?
- Which Bernoulli and Euler polynomials have repeated roots?
- How does reflection constrain the Galois group?
Definitions
Define the standard Appell families by
The Bernoulli difference identity explains their role in sums of powers. The Euler identity is the corresponding alternating relation. Both families satisfy the Appell derivative rule . The derivative identity relates multiple roots to common roots of adjacent polynomials.
The notation here always denotes the Euler polynomial defined above, not a normalized Eulerian descent polynomial.
References 1
- DLMFBernoulliEuler · §§24.2 and 24.4Generating functions, difference equations, and derivative identities.Source
Reflection symmetry
Identity
Replacing by makes each polynomial even or odd according to . Hence for odd , is forced. After removing that factor, the polynomial is a polynomial in . Its nonfixed roots come in pairs . For a separable remaining degree , the Galois action embeds in , just as for sign pairs of an even polynomial.
The irreducibility problem and the permutation action depend on which forced and repeated factors have been removed.
References 2
- DLMFBernoulliEuler · §24.4(ii)Reflection identities; the group restriction follows from the displayed pairing.Source
- Cox2012Galois actions preserving a root partition.Source
Rational factors
For odd , the Bernoulli values at and vanish, so divides . For even , the Euler polynomial vanishes at and , so divides . These statements follow directly from the generating functions and reflection. Their removal need not leave an irreducible polynomial.
References 3
- DLMFBernoulliEuler · §§24.2 and 24.4Special values and reflection.Source
- Carlitz1952BernoulliEulerClassical irreducibility investigations in the Appell families.Source
- Brillhart1969Factorization and roots of Euler and Bernoulli polynomials.Source
Carlitz’s irreducibility criterion
Theorem (Carlitz)
Let be prime and be even, with and . Then is irreducible over . For , the evenness condition means with .
Proof sketch
Write . Von Staudt–Clausen says that for even , the denominator of contains exactly when , and then only to the first power. The base- digits of have sum . If and , Lucas’s congruence gives : otherwise each digit of would be bounded by the corresponding digit of , forcing its positive digit sum, a multiple of , to equal , and hence .
Consequently every nonconstant coefficient of is divisible by in , whereas its constant coefficient is a unit. Its leading coefficient is exactly . The exceptional Bernoulli number causes no problem: for , its coefficient is , which is even. Thus is Eisenstein over . Taking reciprocals preserves irreducibility.
Example (n=4, p=5)
Its reciprocal is Eisenstein at . Hence the polynomial is irreducible over .
References 3
- Carlitz1952BernoulliEulerOriginal irreducibility source. The stated scope is explicitly restated in Kimura’s report; no unchecked original theorem number is claimed.Source
- Kimura2003Bernoulli · §2, p. 3, theorem attributed to Carlitz (1952)The report uses the reversed coefficient convention for a p-Eisenstein polynomial; the reciprocal formulation above uses the usual convention.Source
- DLMFBernoulliEuler · §24.10(i), equation (24.10.1)Bernoulli denominators; the displayed proof supplies the digit argument explicitly.Source
Examples
Example
After removing the three rational factors, the quadratic has discriminant , so its splitting field is .
Example
The residual polynomial is a square. Its distinct roots generate only . Thus removing the rational factor alone need not leave an irreducible or separable polynomial. The splitting field and its Galois action are defined using the distinct roots.
References 2
- Brillhart1969The Euler/Bernoulli factorization literature; the displayed identities are verified by expansion.Source
- DLMFBernoulliEuler · §24.12(iv)The repeated-factor example E_5.Source
Multiple roots
Theorem (Brillhart; Dilcher)
Every , , is squarefree. Among the Euler polynomials, only has multiple roots; its two irrational roots each have multiplicity two.
Brillhart proved the odd Bernoulli case and restricted any possible even-degree multiple root to a root of , with a positive odd integer. Dilcher’s Theorem 2 eliminates these remaining possibilities. The method combines centered expansions, Bernoulli denominator congruences, and the requirement that a multiple root also annihilate the adjacent Appell polynomial. Brillhart’s Euler classification is also recorded in Dilcher’s §4.
References 3
- Dilcher2008MultipleZeros · Theorem 2, p. 150; proof in §3; Euler discussion in §4Complete Bernoulli squarefreeness theorem and the earlier Euler classification.Source
- Brillhart1969Original Euler classification and earlier Bernoulli restrictions.Source
- DLMFBernoulliEuler · §24.12(iv)Authoritative concise statement of both complete multiplicity classifications.Source
Fixed-point-free automorphisms
Theorem (Patel–Siksek)
For every even , contains an element fixing none of the roots. Also has no root in .
The proof uses the -adic Newton polygon, the pairing , and a decomposition-group argument. Chebotarev then supplies a positive density of primes at which has no root. This yields obstructions to equations involving sums of consecutive powers. A permutation without fixed points does not by itself imply that the entire Galois action is transitive.
References 1
- PatelSiksek2017Powers · Proposition 3.1, Theorem 4, and §§3.2, 5The group and local-root conclusions are unconditional, independent of the conjectured irreducibility of every even Bernoulli polynomial.Source
Normalized polynomials
After the rational factors are removed, centering at gives an even polynomial. Writing it as separates the action on root pairs from the quadratic extensions within the pairs. The reciprocal-polynomial article explains the same construction with opposite pairs. For the standard Euler family, the repeated factor of must first be removed.
References 2
- Dilcher2008MultipleZeros · Theorem 2 and §4Source
- DLMFBernoulliEuler · §§24.4(vii), 24.12(iv)Source
Higher-order Bernoulli polynomials
The order is a separate parameter:
Adelberg conjectures that the diagonal member is irreducible over for every even , and that is irreducible for every odd . The linear factor follows from reflection about . This conjecture concerns order , not the ordinary family of order one.
Adelberg–Filaseta prove that Eisenstein’s criterion applies to a set of indices with lower density greater than . Filaseta–Luckner later improve this lower bound to , and prove the same bound for diagonal higher-order Euler polynomials, defined by replacing with . These density results leave the universal Bernoulli assertion unresolved in the cited sources.
References 3
- AdelbergFilaseta2002 · Theorem 1, p. 21; conjecture stated on p. 22Source
- Adelberg1998Newton · §5Original conjecture source, explicitly attributed in Adelberg–Filaseta (2002). The conjecture itself was checked in that later primary paper.Source
- FilasetaLuckner2024Euler · Theorem 2 and the paragraph following Table 1 in §1Bernoulli improvement is stated separately after the Euler theorem.Source
Fixed order
Keeping the order fixed gives a different problem from the diagonal . McCarthy proves that, for each positive integer ,
More generally, for a fixed prime , fixed order , and , the polynomials are irreducible once exceeds an effective bound. The proof compares coefficients modulo as the order decreases and applies Eisenstein’s criterion to a reciprocal polynomial.
Arbitrary degree and order cannot be combined into an unrestricted irreducibility assertion. For example, .
References 1
- McCarthy1962 · Theorems 1–2 and Corollary, p. 566; degree-two criterion on p. 567The full page scan confirms t≥k (not t>k). The historical broad conjecture in the final paragraph is not adopted.Source
Questions
Is every even Bernoulli polynomial irreducible over Q?
Scope. The standard Bernoulli polynomial B_n(x), for every even n≥2; explicitly described as a conjecture by Patel–Siksek (2017), §3.
Carlitz’s criterion proves irreducibility for infinite sets of indices. The unconditional derangement theorem does not settle the general question. The cited paper states the general assertion as a conjecture.
References 2
- PatelSiksek2017Powers · §3, immediately after Proposition 3.1Source
- Carlitz1952BernoulliEulerSource
What are the Galois groups of the normalized polynomials?
Scope. A stated parity class in the Bernoulli or Appell Euler family, with an explicit squarefree normalization.
The degree-five Euler example shows that the choice of normalization matters. The group on pairs and the kernel of the corresponding quadratic extensions are separate parts of the problem.
References 2
Which Bernoulli or Euler polynomials have repeated roots?
Scope. The standard Appell families B_n and E_n over characteristic zero, n≥1.
None of the Bernoulli polynomials does. The unique Euler exception is , with factorization displayed above.
References 3
- Dilcher2008MultipleZeros · Theorem 2 and §4Source
- Brillhart1969Source
- DLMFBernoulliEuler · §24.12(iv)Source
Are the diagonal higher-order Bernoulli polynomials irreducible after removing the forced factor?
Scope. B_n^(n) for even n≥2; B_n^(n)/(x−n/2) for odd n≥3, over Q.
This is Adelberg’s conjecture. Degree one is excluded from the quotient formulation because it leaves a constant. The ordinary odd Bernoulli normalization is a different problem.
References 2
- AdelbergFilaseta2002 · p. 22, first paragraphSource
- Adelberg1998Newton · §5Source
Related topics
Eulerian polynomials
The similarly named descent polynomials have a different definition and symmetry.
GeneralizesReciprocal polynomials
Reflection becomes sign pairing after an affine change of variable.
UsesDiscriminants, parity, and ramification
Repeated factors make the discriminant zero; the squarefree part has the same splitting field.
Supplies examples forComposition and iteration
Centering gives a quadratic composition that constrains the Galois action.
UsesNewton polygons and Galois groups
Denominator valuations and slopes yield local irreducible factors and Galois information.
UsesFrobenius and factorization modulo primes
A derangement produces primes with no linear factor through Chebotarev.
Related familyTouchard polynomials
Set-partition polynomials have a separate rational-root conjecture.
Linked from 2 articles
References
- Bernoulli and Euler Polynomials (Chapter 24)
NIST Digital Library of Mathematical Functions. NIST Digital Library of Mathematical Functions.
Read the source - Galois Theory
Cox, David A. Edition 2. John Wiley & Sons, 2012.
Read the source - Note on irreducibility of the Bernoulli and Euler polynomials
Carlitz, Leonard. Duke Mathematical Journal, 19, 475–481, 1952.
Read the source - On the Euler and Bernoulli polynomials
Brillhart, John. Journal für die reine und angewandte Mathematik, 234, 45–64, 1969.
Read the source - On universal higher order Bernoulli numbers and polynomials
Kimura, Noriaki. Report of the Research Institute of Industrial Technology, Nihon University, Report 70, 1–22, 2003.
Read the source - On multiple zeros of Bernoulli polynomials
Dilcher, Karl. Acta Arithmetica, 134(2), 149–155, 2008.
Read the source - On powers that are sums of consecutive like powers
Patel, Vandita and Siksek, Samir. Research in Number Theory, 3, Article 2, 2017.
Read the source - On mth order Bernoulli polynomials of degree m that are Eisenstein
Adelberg, Arnold and Filaseta, Michael. Colloquium Mathematicum, 93(1), 21–26, 2002.
Read the source - Higher Order Bernoulli Polynomials and Newton Polygons
Adelberg, Arnold. Applications of Fibonacci Numbers, Volume 7, Kluwer Academic Publishers, 1–8, 1998.
Read the source - On nth order Euler polynomials of degree n that are Eisenstein
Filaseta, Michael and Luckner, Thomas. Indagationes Mathematicae, 35(1), 76–86, 2024.
Read the source - Irreducibility of Bernoulli polynomials of higher order
McCarthy, P. J. Canadian Journal of Mathematics, 14, 565–567, 1962.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.