Overview
- Is the -polynomial irreducible at every odd prime index except ?
- Does every reducible have a cyclotomic factor?
- What is known about zeros and irreducibility in the sequence ?
Stern (0,1)-polynomials
Define , and, for ,
These have coefficients 0 and 1. If a prime has 2 as a primitive root, then is irreducible over .
References 1
- DilcherEricksen2014Stern · §1, equations (2)–(3), Proposition 1Source
Example
Example
Direct recursion and multiplication give
Thus prime index alone does not imply irreducibility in this sequence.
A different Stern sequence
The polynomials ,
are different: for example, , whereas . Altizio’s 2025 preprint proves prime-index irreducibility for by excluding roots from . It does not resolve the questions about below.
References 2
- Altizio2025Stern · §1, Theorem 2 and Corollary 1Source
- DilcherKidwaiTomkins2017Stern · §1; Conjecture 3.1Source
Stern numbers as coefficients
A third construction uses the Stern numbers , , , as coefficients:
Dilcher–Ericksen study this sequence separately. Their examples include , , and . Proposition 21 turns the relevant divisibility into equality of Stern-number sums in residue classes. These examples rule out a blanket irreducibility assertion for .
References 1
- DilcherEricksen2021SternCoefficients · Equation (3), §5.3, Table 5 and Proposition 21Source
Questions
Is irreducible for every odd prime ?
Scope. The (0,1)-sequence ; rational irreducibility.
Dilcher–Ericksen formulate this conjecture in 2014.
References 1
- DilcherEricksen2014Stern · §8.1, Conjecture 1, p. 99Source
Must every reducible have a cyclotomic factor?
Scope. , with nonconstant.
The conjectured factor is for some .
References 1
- DilcherEricksen2014Stern · §8.2, Conjecture 3, p. 99Source
Is the nonreciprocal part of irreducible or 1?
Scope. ; remove every irreducible reciprocal factor over .
This is a separate conjecture concerning the remaining factor.
References 1
- DilcherEricksen2014Stern · §8.3, Conjecture 4, p. 100Source
Do these cyclotomic factors force divisibility of the index?
Scope. Prime with 2 primitive modulo ; .
Conjecture: if or divides , then .
References 1
- DilcherEricksen2014Stern · §8.2, Conjecture 2, p. 99Source
Do all zeros of have real part less than 1?
Scope. Integers ; complex zeros of the recurrence-defined polynomial .
Define , , and, for integers ,
Must every zero of every , , satisfy ? The preprint proves the weaker exclusion of zeros from . The half-plane conjecture remains stated separately. See this Stern sequence and its distinction from the (0,1)-polynomials.
References 2
- Altizio2025Stern · §1, Conjecture 1 and Theorem 2Source
- DilcherKidwaiTomkins2017Stern · Conjecture 3.1, p. 413Source
Are the coefficients of every unimodal?
Scope. The recurrence-defined sequence S_n in this article; n≥1.
Dilcher–Kidwai–Tomkins ask whether the coefficients increase and then decrease, allowing equalities. This is a coefficient-shape question, separate from prime-index irreducibility and from the -sequence .
References 1
- DilcherKidwaiTomkins2017Stern · Conjecture 3.15, p. 421Source
Related topics
Irreducibility from integer values
Prime values can imply irreducibility when root bounds control possible factors.
UsesReciprocal polynomials
Removing reciprocal factors gives a precise remaining irreducibility question.
Linked from 2 articles
References
- Reducibility and irreducibility of Stern (0,1)-polynomials
Dilcher, Karl and Ericksen, Larry. Communications in Mathematics, 22(1), 77–102, 2014.
Read the source - Zeros of Stern polynomials in the complex plane
Altizio, David. arXiv, 2025.
Read the source - Zeros and irreducibility of Stern polynomials
Dilcher, Karl and Kidwai, Mohammad and Tomkins, Hayley. Publicationes Mathematicae Debrecen, 90(3--4), 407–433, 2017.
Read the source - Polynomials Whose Coefficients Are Stern Numbers
Dilcher, Karl and Ericksen, Larry. Journal of Integer Sequences, 24, Article 21.10.3, 2021.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.