Overview
- Which reciprocal factors must be separated in a large-gap theorem?
- What information is preserved when a factor is reversed?
- Under what hypotheses is the nonreciprocal part eventually irreducible?
Large gaps and reciprocal factors
Consider the family
where are fixed and . The high and low blocks of coefficients are separated by a gap. Write . A nonconstant irreducible factor is reciprocal when ; the nonreciprocal part is obtained by removing all such irreducible factors, including their multiplicities.
Cyclotomic polynomials are reciprocal up to sign, but other reciprocal factors can occur. Thus irreducibility of the nonreciprocal part proves irreducibility of the original polynomial only after all reciprocal factors have been excluded.
References 2
- Schinzel2000Lacunary polynomial factorization and reciprocal factors.Source
- sawinshustermanstoll2020 · §1Large-gap notation and definitions.Source
Schinzel’s theorem
Call Capellian if is a -th power in for some prime , or if is four times a fourth power. These power conditions lead to factorizations for infinitely many exponents.
Theorem · Schinzel, in large-gap form
Assume , , , and that is not Capellian. Then there is an effective bound , depending on , such that for the nonreciprocal part of is irreducible over .
This is the formulation in Sawin–Shusterman–Stoll, Theorem 1.2, deduced there from Schinzel’s work. Filaseta–Ford–Konyagin improve explicit thresholds. Sawin–Shusterman–Stoll give further bounds and algorithms under an additional robustness hypothesis (Theorems 1.5–1.6).
References 3
- Schinzel2000 · Theorem 74, as identified in Sawin–Shusterman–StollThe general lacunary result behind this formulation.Source
- filasetafordkonyagin2000Improved effective bounds with explicit exclusions.Source
- sawinshustermanstoll2020 · Theorems 1.2, 1.5, and 1.6Exact hypotheses of the large-gap theorem and the extra robustness assumption for its improved bound.Source
Factor reversal
For and a factorization , form . The reciprocal product does not change:
Equivalently, as Laurent polynomials, one may use ; multiplication by a power of only changes the presentation. On the unit circle, a real-coefficient polynomial satisfies . Consequently and have the same squared coefficient norm, by Parseval's identity:
For a sparse polynomial with small integral coefficients, the right side is small. Only finitely many multisets of nonzero integer coefficients have that norm, although their positions may vary. Comparing the full identity then restricts the possible positions as well as the coefficients. In suitable sparse families, these restrictions exclude nonreciprocal factorizations. Ljunggren’s method and its later extensions use this restriction.
References 3
- Ljunggren1960Original factor-reversal approach to sparse trinomials and quadrinomials.Source
- filaseta1999smallnormSmall Euclidean coefficient norm as a factorization constraint.Source
- sawinshustermanstoll2020 · §§3–4Reversal identity and the later algorithmic development.Source
Example
Example ·
Let be a primitive cube root of unity. Since ,
Thus divides exactly in that residue class. In degree , for example,
The cubic has no rational root, hence is irreducible over . Thus infinitely many members are reducible because of a recurring cyclotomic factor.
The periodicity is general for a fixed cyclotomic factor: evaluation at a root of unity depends on modulo its order. The large-gap literature combines this elementary observation with bounds that control other factors.
References 2
- Ljunggren1960Sparse trinomial factorization and reciprocal obstructions; the displayed root-of-unity calculation is given here.Source
- sawinshustermanstoll2020 · Corollary 1.4Effective eventual description by finitely many exceptional exponents and arithmetic progressions.Source
A family with an exceptional degree
Sawin–Shusterman–Stoll prove that is irreducible for every , and also for . The degree is exceptional:
Their general theory supplies an eventual threshold, and a finite check handles the remaining exponents in this example.
References 1
- sawinshustermanstoll2020 · Example 7.1The complete k=7 example and its exceptional quartic.Source
Questions
How small can a uniform large-gap threshold be?
Scope. Pairs satisfying the hypotheses of the large-gap theorem; degree sum δ and squared coefficient weight at most w
Sawin–Shusterman–Stoll define as the smallest uniform threshold for their Theorem 1.2 over pairs with and . Their Question 1.7 asks, for fixed , whether this is ; Question 1.8 asks for the uniform bound . This records the questions as posed in that paper; it is not a claim that all later work has been excluded.
References 1
- sawinshustermanstoll2020 · Questions 1.7 and 1.8Precise definition and proposed threshold questions.Source
Related topics
Reciprocal polynomials
Large-gap theorems concern the nonreciprocal part.
Applies toTrinomials
Trinomials give examples of factor reversal and recurring cyclotomic factors.
Contrasts withRoot bounds and prime-value criteria
Coefficient norms and root bounds supplement coefficient-dominance criteria.
UsesCapelli’s theorem and polynomial composition
Capellian obstructions are binomial power obstructions over a rational function field.
Contrasts withComposition and iteration
Large-gap families and iterated compositions have different parameter structures.
References
- Polynomials with Special Regard to Reducibility
Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.
Read the source - Irreducibility of polynomials with a large gap
Sawin, Will and Shusterman, Mark and Stoll, Michael. Acta Arithmetica, 192(2), 111–139, 2020.
Read the source - On an irreducibility theorem of A. Schinzel associated with coverings of the integers
Filaseta, Michael and Ford, Kevin and Konyagin, Sergei. Illinois Journal of Mathematics, 44(3), 633–643, 2000.
Read the source - On the irreducibility of certain trinomials and quadrinomials
Ljunggren, Wilhelm. Mathematica Scandinavica, 8, 65–70, 1960.
Read the source - On the factorization of polynomials with small Euclidean norm
Filaseta, Michael. Number Theory in Progress, Vol. 1, de Gruyter, 143–163, 1999.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.