Overview

  • Must the three Galois-group proportions converge?
  • Can the set of degrees with symmetric group be prescribed?
  • Which coefficient conditions are claimed to give symmetric group in density one?
  • What is claimed for binomial and Catalan sections?

Katz–Rivin questions

Let f(x)=∑j≥0ajxjf(x)=\sum_{j\ge0}a_jx^j, with every aj∈Q×a_j\in\mathbb Q^\times, and put fn=∑j=0najxjf_n=\sum_{j=0}^n a_jx^j. For n≥3n\ge3, classify the natural root action as SnS_n, AnA_n, or other; a repeated-root section belongs to the last class. Let sf(N),af(N),of(N)s_f(N),a_f(N),o_f(N) be the corresponding counts through degree NN, divided by NN.

Katz–Rivin ask whether these proportions always converge and, when they do, whether the third limit must be zero or one. Their first question also asks which series have convergent proportions. Write (S(f),A(f),O(f))(S(f),A(f),O(f)) for the limits when they exist.

The 2026 results below are preprint claims. Their full proofs have not been independently verified here; all Nguyen-Dang locators refer to version 3.

References 2

Prescribing the symmetric degrees

Preprint theorem (Nguyen-Dang, Theorem A)

For any set B⊆{3,4,…}B\subseteq\{3,4,\ldots\}, there is an entire function

f(z)=1+z+∑n≥2anzn,an∈Q>0,f(z)=1+z+\sum_{n\ge2}a_nz^n,\qquad a_n\in\mathbb Q_{>0},

such that

Gal⁡(fn/Q)={Sn,n∈B,1⊕Sn−1,n∉B,n≥3.\operatorname{Gal}(f_n/\mathbb Q)=\begin{cases}S_n,&n\in B,\\1\oplus S_{n-1},&n\notin B,\end{cases}\qquad n\ge3.

The second action fixes one root and permutes the other roots arbitrarily. Its fixed root is a negative integer. Every section has distinct negative real roots, and ff has order zero.

If BB has density δ\delta, the frequency triple is (δ,0,1−δ)(\delta,0,1-\delta). If BB has no density, the first and third proportions fail to converge. Thus the proposed construction answers both universal questions negatively. It does not classify the series for which convergence holds.

The preprint also claims control of every consecutive coefficient block after its initial power of xx is removed: each proper block of degree at least two has full symmetric group. The splitting fields of these segments and of the full sections of degree at least two are jointly linearly disjoint over Q\mathbb Q.

References 1

Construction

Choose one coefficient at a time. Reversal turns the new coefficient into a constant parameter:

xnfn(1/x)=gn(x)+an,gn(x)=∑j<najxn−j.x^nf_n(1/x)=g_n(x)+a_n,\qquad g_n(x)=\sum_{j<n}a_jx^{n-j}.

The construction arranges simple critical points with distinct critical values. These conditions give symmetric groups before specialization. Hilbert irreducibility supplies rational specializations with the required groups and field disjointness. Specializing after adjoining one root produces the fixed-root alternative.

The choices can be positive and arbitrarily small, with an−12>4an−2ana_{n-1}^2>4a_{n-2}a_n and an<2−n2a_n<2^{-n^2}. The first inequality controls real roots; the second gives convergence on the whole complex plane and order zero. Real-rootedness and rapid coefficient decay therefore coexist with arbitrary symmetric-degree patterns in the stated construction.

References 1

Example

A simpler zero–one counterexample in the same preprint is

h(x)=1+x21−x=1+x+2x2+2x3+⋯ .h(x)=\frac{1+x^2}{1-x}=1+x+2x^2+2x^3+\cdots.

Proposition 6.2 states that every even section has group SnS_n, while every odd section of degree at least three has the factor x+1x+1. Hence its frequency triple is (1/2,0,1/2)(1/2,0,1/2). For instance,

h2=1+x+2x2,h3=(1+x)(1+2x2).h_2=1+x+2x^2,\qquad h_3=(1+x)(1+2x^2).

The quadratic has discriminant −7-7. This rational function illustrates the zero–one question; it is different from the entire functions constructed above.

References 1

A condition on coefficient denominators

Preprint theorem (Nguyen-Dang, Theorem B)

Fix s=a/b∈Q∖Zs=a/b\in\mathbb Q\setminus\mathbb Z in lowest terms, b≥2b\ge2, a constant C≥0C\ge0, and a number field FF. Let

Rn(x)=∑j=0nun,jss+jxj,un,j∈Q×.R_n(x)=\sum_{j=0}^n u_{n,j}\frac{s}{s+j}x^j,\qquad u_{n,j}\in\mathbb Q^\times.

Assume each multiplier is a pp-adic unit at every prime p>n+Cp>n+C. Then, for all sufficiently large nn, RnR_n is irreducible over FF and its group contains AnA_n. Odd degrees have group SnS_n, and, for every ε>0\varepsilon>0,

#{n≤X:Gal⁡(Rn/F)≠Sn}≪s,C,F,εX1/2+ε.\#\{n\le X:\operatorname{Gal}(R_n/F)\ne S_n\}\ll_{s,C,F,\varepsilon}X^{1/2+\varepsilon}.

The threshold and implied constant are uniform in the multipliers.

Primes larger than the degree produce two primitive Newton edges and inertia cycles of lengths j,n−jj,n-j. Several primes exclude proper factors and block systems. A permutation-group classification gives AnA_n-containment, and a quadratic large sieve bounds the remaining degrees. The nonintegral hypothesis on ss is essential to this argument.

References 1
  • NguyenDang2026Taylor · Theorem B; §§3–4, especially §§4.5–4.6The containment step invokes Müller’s classification of primitive groups with a two-cycle element.Source

Nonintegral binomial powers

For fixed s=a/b∈Q∖Zs=a/b\in\mathbb Q\setminus\mathbb Z, put

Bs,n(x)=∑j=0n(s)jj!xj,(s)0=1,(s)j=s(s+1)⋯(s+j−1) (j≥1).B_{s,n}(x)=\sum_{j=0}^n\frac{(s)_j}{j!}x^j,\qquad (s)_0=1,\quad (s)_j=s(s+1)\cdots(s+j-1)\ (j\ge1).

These are the sections of (1−x)−s(1-x)^{-s}. Wei’s preprint claims the eventual group classification over Q\mathbb Q. Nguyen-Dang’s Theorem C extends it to each fixed number field FF: for sufficiently large nn,

Gal⁡(Bs,n/F)={An,n even and (−1)n/2a(a+bn)∈F×2,Sn,otherwise.\operatorname{Gal}(B_{s,n}/F)=\begin{cases}A_n,&n\text{ even and }(-1)^{n/2}a(a+bn)\in F^{\times2},\\S_n,&\text{otherwise}.\end{cases}

Here F×2F^{\times2} denotes the nonzero squares. An affine substitution gives the reciprocal-coefficient form above. The discriminant then determines the group.

Theorem C also states that the number of exceptions to SnS_n through degree XX is cs,FX+Os,F(1)c_{s,F}\sqrt X+O_{s,F}(1), with an explicit constant. Thus the symmetric degrees have density one, even when infinitely many alternating degrees occur. The exponent is fixed throughout; this is not a uniform all-parameter classification in small degree.

References 2

Central-binomial sections

Let Cn(x)=∑j=0n(2jj)xjC_n(x)=\sum_{j=0}^n\binom{2j}{j}x^j. Wei’s preprint claims all-degree irreducibility and the eventual group formula. Nguyen-Dang’s Theorem D states the formula in every degree n≥1n\ge1:

Gal⁡(Cn/Q)={An,n=2r(r+1), r≥1,Sn,otherwise.\operatorname{Gal}(C_n/\mathbb Q)=\begin{cases}A_n,&n=2r(r+1),\ r\ge1,\\S_n,&\text{otherwise}.\end{cases}

For the monic reciprocal Qn=xnCn(1/x)Q_n=x^nC_n(1/x), it also states Sun’s criterion: an irreducible reduction modulo a prime exists exactly outside those exceptional degrees. In the permitted degrees, these primes have relative natural density 1/n1/n among all primes.

Example

Q4=x4+2x3+6x2+20x+70.Q_4=x^4+2x^3+6x^2+20x+70.

Here is an exact certificate. Set

T(y)=1−43y+65y2−47y3+19y4.T(y)=1-\frac43y+\frac65y^2-\frac47y^3+\frac19y^4.

Direct expansion gives C4(x)=315128T(1−4x)C_4(x)=\frac{315}{128}T(1-4x). The Newton polygons of TT at 55 and 77 have vertices

(0,0),(2,−1),(4,0),(0,0),(3,−1),(4,0).(0,0),(2,-1),(4,0),\qquad (0,0),(3,-1),(4,0).

They restrict a proper rational factor to degree 22, respectively degree 11 or 33. Hence C4C_4, and therefore Q4Q_4, is irreducible. Moreover,

Q4≡(x+3)(x3−x2−4x+6)(mod13).Q_4\equiv(x+3)(x^3-x^2-4x+6)\pmod{13}.

The cubic has no root in F13\mathbb F_{13}, giving a 3-cycle. The discriminant is 756027560^2, so transitivity and this cycle force A4A_4. Every prime reduction is reducible: an irreducible quartic reduction would supply an odd 4-cycle.

References 3

Connections and evidence

Claimed · preprint

Central-binomial sections: exact groups and prime reductions

A complete degree classification separates AnA_n from SnS_n and determines exactly when an irreducible reduction can occur.

Scope. For Cn(X)=∑j=0n(2jj)XjC_n(X)=\sum_{j=0}^{n}\binom{2j}{j}X^j, every integer n≥1n\ge1, over Q\mathbb Q; prime reductions concern the monic reciprocal Qn=XnCn(1/X)Q_n=X^nC_n(1/X). The all-degree group classification is a preprint claim.

Central-binomial sections: exact groups and prime reductionsA complete degree classification separates \(A_n\) from \(S_n\) and determines exactly when an irreducible reduction can occur. Connection 1: Central-binomial sections leads to All-degree irreducibility. Wei’s theorem supplies rational irreducibility in every positive degree. Preprint claim. Connection 2: Central-binomial sections is an input to Half-integral witnesses; finite cases. An affine transform has coefficients (−1)^j binomial(n,j)/(2j+1), exposing prime witnesses; the degree-six case is checked separately. Preprint claim. Connection 3: All-degree irreducibility is an input to AND. Transitivity must be combined with the local witness argument. Connection 4: Half-integral witnesses; finite cases is an input to AND. The witness argument and its finite cases supply group-theoretic information. Connection 5: AND leads to G contains Aₙ. Proposition 4.13 and the separate degree-six argument yield Aₙ containment for every n ≥ 1. Preprint claim. Connection 6: Central-binomial sections leads to Exact discriminant square class. For n ≥ 2 the discriminant is a square exactly when n=2r(r+1), r ≥ 1; degree one is handled directly. Preprint claim. Connection 7: G contains Aₙ is an input to AND. Alternating containment limits the possible groups to Aₙ and Sₙ. Connection 8: Exact discriminant square class is an input to AND. The square class decides which group occurs. Connection 9: AND is an input to OR. The selected degree condition separates the two cases in the complete classification. Preprint claim. Connection 10: OR leads to n = 2r(r + 1): Aₙ. The exceptional degrees have group Aₙ and are all divisible by four. Preprint claim. Connection 11: OR leads to Other degrees: Sₙ. Every other positive degree has group Sₙ, including degree one. Preprint claim. Connection 12: n = 2r(r + 1): Aₙ leads to Every prime reduction is reducible. An irreducible degree-n reduction would give an n-cycle; n is even in this branch, so that cycle would be odd. Connection 13: Other degrees: Sₙ leads to Irreducible-prime density 1/n. The n-cycles occupy a proportion 1/n of Sₙ, giving the stated relative natural density among primes.Central-binomial sections — related articleCentral-binomial sectionsAll-degree irreducibility — related articleAll-degree irreducibilityHalf-integral witnesses; finite cases — related articleHalf-integral witnesses;finite casesANDANDG contains Aₙ — related articleG contains AₙExact discriminant square class — related articleExact discriminant squareclassANDANDORORn = 2r(r + 1): Aₙ — related articlen = 2r(r + 1): AₙOther degrees: Sₙ — related articleOther degrees: SₙEvery prime reduction is reducible — related articleEvery prime reduction isreducibleIrreducible-prime density 1/n — related articleIrreducible-prime density1/nConnection 1: Wei’s theorem supplies rational irreducibility in every positive degree.Wei: Theorem B(i) [1]Connection 2: An affine transform has coefficients (−1)^j binomial(n,j)/(2j+1), exposing prime witnesses; the degree-six case is checked separately.Half-integraltransformation [2]Connection 3: Transitivity must be combined with the local witness argument.input [3]Connection 4: The witness argument and its finite cases supply group-theoretic information.input [4]Connection 5: Proposition 4.13 and the separate degree-six argument yield Aₙ containment for every n ≥ 1.All-degree containment[5]Connection 6: For n ≥ 2 the discriminant is a square exactly when n=2r(r+1), r ≥ 1; degree one is handled directly.Wei: Theorem B(ii) [6]Connection 7: Alternating containment limits the possible groups to Aₙ and Sₙ.input [7]Connection 8: The square class decides which group occurs.input [8]Connection 9: The selected degree condition separates the two cases in the complete classification.Theorem D [9]Connection 10: The exceptional degrees have group Aₙ and are all divisible by four.r ≥ 1 [10]Connection 11: Every other positive degree has group Sₙ, including degree one.Complementary degrees[11]Connection 12: An irreducible degree-n reduction would give an n-cycle; n is even in this branch, so that cycle would be odd.No n-cycle in Aₙ [12]Connection 13: The n-cycles occupy a proportion 1/n of Sₙ, giving the stated relative natural density among primes.Frobenius andChebotarev [13]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow preprint claimAND joint hypothesesOR alternatives

For the central-binomial sections CnC_n, Wei’s preprint states irreducibility in every degree and the exact square-discriminant condition. Theorem D of Nguyen-Dang’s version 3 claims the complete group classification

Gal⁡(Cn/Q)={An,n=2r(r+1), r≥1,Sn,otherwise,n≥1.\operatorname{Gal}(C_n/\mathbb Q)=\begin{cases}A_n,&n=2r(r+1),\ r\ge1,\\S_n,&\text{otherwise},\end{cases}\qquad n\ge1.

For the monic reciprocal Qn=XnCn(1/X)Q_n=X^nC_n(1/X), an irreducible reduction modulo a prime exists exactly in the symmetric cases. Such primes have relative natural density 1/n1/n.

The distinction has a group-theoretic explanation. An irreducible reduction corresponds to an nn-cycle. Every exceptional degree is even, so an nn-cycle is odd and cannot lie in AnA_n. In SnS_n, precisely (n−1)!(n-1)! of the n!n! permutations are nn-cycles. Thus rational irreducibility can coexist with reducibility modulo every prime.

Inspect all 13 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Central-binomial sections → All-degree irreducibilityDeduction · preprint

Wei’s theorem supplies rational irreducibility in every positive degree.

  • R1 · Wei (2026)Theorem B(i)–(ii), p. 3; proofs in §§4.2 and 5; second deposited version, 3 October 2026The same theorem gives only an eventual group classification in part (iv); the all-degree group step comes from the later source.Primary source
2Central-binomial sections → Half-integral witnesses; finite casesConstruction / input · preprint

An affine transform has coefficients (−1)^j binomial(n,j)/(2j+1), exposing prime witnesses; the degree-six case is checked separately.

  • R2 · Nguyen-Dang (2026)Propositions 4.12–4.13; proof of Theorem D in §4.11, pp. 24–26; version 3The degree-six exception to Proposition 4.13 is resolved in the proof of Theorem D.Primary source
3All-degree irreducibility → ANDConstruction / input

Transitivity must be combined with the local witness argument.

4Half-integral witnesses; finite cases → ANDConstruction / input

The witness argument and its finite cases supply group-theoretic information.

5AND → G contains AₙDeduction · preprint

Proposition 4.13 and the separate degree-six argument yield Aₙ containment for every n ≥ 1.

  • R2 · Nguyen-Dang (2026)Propositions 4.12–4.13; proof of Theorem D in §4.11, pp. 24–26; version 3The degree-six exception to Proposition 4.13 is resolved in the proof of Theorem D.Primary source
6Central-binomial sections → Exact discriminant square classDeduction · preprint

For n ≥ 2 the discriminant is a square exactly when n=2r(r+1), r ≥ 1; degree one is handled directly.

  • R1 · Wei (2026)Theorem B(i)–(ii), p. 3; proofs in §§4.2 and 5; second deposited version, 3 October 2026The same theorem gives only an eventual group classification in part (iv); the all-degree group step comes from the later source.Primary source
7G contains Aₙ → ANDConstruction / input

Alternating containment limits the possible groups to Aₙ and Sₙ.

8Exact discriminant square class → ANDConstruction / input

The square class decides which group occurs.

9AND → ORConstruction / input · preprint

The selected degree condition separates the two cases in the complete classification.

10OR → n = 2r(r + 1): AₙDeduction · preprint

The exceptional degrees have group Aₙ and are all divisible by four.

11OR → Other degrees: SₙDeduction · preprint

Every other positive degree has group Sₙ, including degree one.

12n = 2r(r + 1): Aₙ → Every prime reduction is reducibleDeduction

An irreducible degree-n reduction would give an n-cycle; n is even in this branch, so that cycle would be odd.

  • R4 · ConradTheorem 1 and its proof, p. 1An irreducible reduction is separable, so its prime does not divide the polynomial discriminant.Primary source
13Other degrees: Sₙ → Irreducible-prime density 1/nDeduction

The n-cycles occupy a proportion 1/n of Sₙ, giving the stated relative natural density among primes.

Sources and scope checked .

Catalan sections

Write cj=(2jj)/(j+1)c_j=\binom{2j}{j}/(j+1) and Pn(x)=∑j=0ncjxjP_n(x)=\sum_{j=0}^n c_jx^j. Seki’s preprint states irreducibility for every n≥1n\ge1. Nguyen-Dang’s Theorem E states the stronger conclusion

Gal⁡(Pn/Q)=Sn(n≥1).\operatorname{Gal}(P_n/\mathbb Q)=S_n\qquad(n\ge1).

The proof starts from Seki’s transitivity result. Inertia and estimates for sums of roots exclude proper block systems; a long cycle gives alternating containment, and an odd inertia permutation gives the symmetric group.

Theorem E also gives Gal⁡(Pn/F)=Sn\operatorname{Gal}(P_n/F)=S_n for n≥RFn\ge R_F, where RFR_F is the largest rational prime ramified in the fixed number field FF, with RQ=1R_{\mathbb Q}=1. Sun’s separate bound n2+n+5n^2+n+5 for the least prime giving an irreducible reduction of xnPn(1/x)x^nP_n(1/x) remains open in the cited sources.

References 3

Connections and evidence

Claimed · preprint

Catalan sections: factor reflection, resultants, and full symmetric groups

The irreducibility proof combines root geometry with an integer resultant; a later preprint adds the group SnS_n in every degree.

Scope. For Pn(X)=∑j=0n1j+1(2jj)XjP_n(X)=\sum_{j=0}^{n}\frac{1}{j+1}\binom{2j}{j}X^j, every integer n≥1n\ge1, over Q\mathbb Q. Both all-degree assertions cited here are preprint claims.

Catalan sections: factor reflection, resultants, and full symmetric groupsThe irreducibility proof combines root geometry with an integer resultant; a later preprint adds the group \(S_n\) in every degree. Connection 1: Catalan monic reciprocals Qₙ leads to Root annulus for n ≥ 320. For n ≥ 320 every root of the monic reciprocal lies strictly between radii 31/8 and 4. Preprint claim. Connection 2: Catalan monic reciprocals Qₙ leads to Reflected factor when n ≥ 320. For n ≥ 320, a hypothetical proper factorization has a monic factor F satisfying F(4−X)=(−1)^deg(F)F(X). Preprint claim. Connection 3: Root annulus for n ≥ 320 is an input to AND. The annulus bounds both a root of F and its reflected partner. Connection 4: Reflected factor when n ≥ 320 is an input to AND. The reflected factor is obtained only under the temporary assumption of reducibility. Connection 5: AND leads to Integer-resultant contradiction. The hypothetical factor gives 0 < |Res(F,X²−4X+16)| < 1, contradicting integrality and excluding reducibility for n ≥ 320. Preprint claim. Connection 6: Catalan monic reciprocals Qₙ is an input to Degrees 1–319: exact checks. The paper combines its large-degree argument with the already computed small-degree irreducibility checks. Preprint claim. Connection 7: Integer-resultant contradiction is an input to AND. The contradiction covers n ≥ 320. Connection 8: Degrees 1–319: exact checks is an input to AND. The finite checks cover the complementary positive degrees. Connection 9: AND leads to Irreducible in every degree. Together the two degree ranges give irreducibility for every n ≥ 1. Preprint claim. Connection 10: Catalan monic reciprocals Qₙ is an input to Inertia, block traces, finite checks. The later proof studies tame inertia, possible block systems and root traces, and supplies small-degree group certificates. Preprint claim. Connection 11: Irreducible in every degree is an input to AND. Irreducibility supplies transitivity for the group argument. Connection 12: Inertia, block traces, finite checks is an input to AND. The local permutations and block analysis supply the information beyond transitivity. Connection 13: AND leads to Galois group Sₙ for every n ≥ 1. The joint argument establishes primitivity, alternating containment and an odd permutation, with finite certificates in the small degrees. Preprint claim.Catalan monic reciprocals Qₙ — related articleCatalan monic reciprocalsQₙRoot annulus for n ≥ 320 — related articleRoot annulus for n ≥ 320Reflected factor when n ≥ 320 — related articleReflected factor when n ≥320ANDANDInteger-resultant contradiction — related articleInteger-resultantcontradictionDegrees 1–319: exact checks — related articleDegrees 1–319: exactchecksANDANDIrreducible in every degree — related articleIrreducible in everydegreeInertia, block traces, finite checks — related articleInertia, block traces,finite checksANDANDGalois group Sₙ for every n ≥ 1 — related articleGalois group Sₙ for everyn ≥ 1Connection 1: For n ≥ 320 every root of the monic reciprocal lies strictly between radii 31/8 and 4.Seki: Proposition 2.2 [1]Connection 2: For n ≥ 320, a hypothetical proper factorization has a monic factor F satisfying F(4−X)=(−1)^deg(F)F(X).Conditional factorsymmetry [2]Connection 3: The annulus bounds both a root of F and its reflected partner.input [3]Connection 4: The reflected factor is obtained only under the temporary assumption of reducibility.input [4]Connection 5: The hypothetical factor gives 0 < |Res(F,X²−4X+16)| < 1, contradicting integrality and excluding reducibility for n ≥ 320.A nonzero integer below 1[5]Connection 6: The paper combines its large-degree argument with the already computed small-degree irreducibility checks.Degrees below 320 [6]Connection 7: The contradiction covers n ≥ 320.input [7]Connection 8: The finite checks cover the complementary positive degrees.input [8]Connection 9: Together the two degree ranges give irreducibility for every n ≥ 1.Seki: Theorem 1.1 [9]Connection 10: The later proof studies tame inertia, possible block systems and root traces, and supplies small-degree group certificates.Local and group analysis[10]Connection 11: Irreducibility supplies transitivity for the group argument.input [11]Connection 12: The local permutations and block analysis supply the information beyond transitivity.input [12]Connection 13: The joint argument establishes primitivity, alternating containment and an odd permutation, with finite certificates in the small degrees.Theorem E [13]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow preprint claimAND joint hypotheses

For the Catalan sections PnP_n, put Qn(X)=XnPn(1/X)Q_n(X)=X^nP_n(1/X). Seki’s Theorem 1.1 states that every PnP_n, n≥1n\ge1, is irreducible over Q\mathbb Q.

For n≥320n\ge320, roots of QnQ_n satisfy 31/8<∣α∣<431/8<|\alpha|<4. A proper factorization would supply a monic integral factor FF invariant under reflection X↦4−XX\mapsto4-X, up to sign. With W=X2−4X+16W=X^2-4X+16, these two facts force

0<∣Res⁡(F,W)∣=∏F(α)=0∣W(α)∣<1,0<|\operatorname{Res}(F,W)|=\prod_{F(\alpha)=0}|W(\alpha)|<1,

impossible for a nonzero integer. The complementary degrees are handled by finite checks.

Theorem E of Nguyen-Dang’s version 3 further claims the complete group result

Gal⁡(Pn/Q)=Sn(n≥1).\operatorname{Gal}(P_n/\mathbb Q)=S_n\qquad(n\ge1).

Its proof combines transitivity with local inertia and block-trace arguments.

Inspect all 13 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Catalan monic reciprocals Qₙ → Root annulus for n ≥ 320Deduction · preprint

For n ≥ 320 every root of the monic reciprocal lies strictly between radii 31/8 and 4.

2Catalan monic reciprocals Qₙ → Reflected factor when n ≥ 320Deduction · preprint

For n ≥ 320, a hypothetical proper factorization has a monic factor F satisfying F(4−X)=(−1)^deg(F)F(X).

3Root annulus for n ≥ 320 → ANDConstruction / input

The annulus bounds both a root of F and its reflected partner.

4Reflected factor when n ≥ 320 → ANDConstruction / input

The reflected factor is obtained only under the temporary assumption of reducibility.

5AND → Integer-resultant contradictionDeduction · preprint

The hypothetical factor gives 0 < |Res(F,X²−4X+16)| < 1, contradicting integrality and excluding reducibility for n ≥ 320.

6Catalan monic reciprocals Qₙ → Degrees 1–319: exact checksConstruction / input · preprint

The paper combines its large-degree argument with the already computed small-degree irreducibility checks.

7Integer-resultant contradiction → ANDConstruction / input

The contradiction covers n ≥ 320.

8Degrees 1–319: exact checks → ANDConstruction / input

The finite checks cover the complementary positive degrees.

9AND → Irreducible in every degreeDeduction · preprint

Together the two degree ranges give irreducibility for every n ≥ 1.

  • R1 · Seki (2026)Theorem 1.1, p. 1; arXiv:2609.10526v1This source states irreducibility and explicitly leaves the stronger symmetric-group conjecture untreated.Primary source
10Catalan monic reciprocals Qₙ → Inertia, block traces, finite checksConstruction / input · preprint

The later proof studies tame inertia, possible block systems and root traces, and supplies small-degree group certificates.

  • R6 · Nguyen-Dang (2026)Theorem E, p. 5; §§5.1–5.6, pp. 28–31; Hexagon 2610.00527v3The full-group claim uses Seki’s irreducibility theorem; it is not a consequence of irreducibility alone.Primary source
11Irreducible in every degree → ANDConstruction / input

Irreducibility supplies transitivity for the group argument.

12Inertia, block traces, finite checks → ANDConstruction / input

The local permutations and block analysis supply the information beyond transitivity.

13AND → Galois group Sₙ for every n ≥ 1Deduction · preprint

The joint argument establishes primitivity, alternating containment and an odd permutation, with finite certificates in the small degrees.

  • R6 · Nguyen-Dang (2026)Theorem E, p. 5; §§5.1–5.6, pp. 28–31; Hexagon 2610.00527v3The full-group claim uses Seki’s irreducibility theorem; it is not a consequence of irreducibility alone.Primary source

Sources and scope checked .

Questions

ClaimedPolynomial families

Must all three Taylor Galois proportions converge?

Scope. Every coefficient is a nonzero rational number; degrees n≥3 and the natural root actions.

Theorem A prescribes the set of symmetric degrees. Choosing a set without a natural density gives the claimed counterexample, even for an entire function with positive rational coefficients and simple negative roots in every section. The structural part of Katz–Rivin’s question remains separate.

References 2
Discuss this question →
ClaimedPolynomial families

Must the limiting proportion of other groups be zero or one?

Scope. A rational-coefficient Taylor sequence for which all three frequencies exist.

Theorem A gives every triple (δ,0,1−δ)(\delta,0,1-\delta), 0≤δ≤10\le\delta\le1. Proposition 6.2 gives the rational-function example with triple (1/2,0,1/2)(1/2,0,1/2).

References 2
Discuss this question →
OpenPolynomial families

Do the frequencies converge for every rational generating function?

Scope. A fixed f∈Q(x) regular at zero, with every Taylor coefficient nonzero.

The preprint leaves this question open, including the class P(x)/(1−x)P(x)/(1-x). For n≥deg⁡Pn\ge\deg P,

(1−x)fn=P(x)−P(1)xn+1.(1-x)f_n=P(x)-P(1)x^{n+1}.

This identity connects the question to sparse polynomials with a growing exponent. The arbitrary-coefficient construction does not settle it.

References 1
Discuss this question →
OpenPolynomial families

Can the frequencies fail to converge when all sufficiently large sections are irreducible?

Scope. A series in Q[[x]] with nonzero coefficients and eventually irreducible sections.

The constructed nonconvergent examples use reducible sections. The preprint asks whether one can instead arrange nonconvergence among transitive groups, for example by alternating between symmetric and alternating groups. Prescribing arbitrary alternating degrees is also left open.

References 1
Discuss this question →
OpenPolynomial families

Is the least irreducible-reduction prime at most n²+n+5?

Scope. Every n≥1; the monic reciprocal Q_n(x)=Σ_{j=0}^n c_j x^(n−j) of the Catalan section.

Sun conjectures a prime p≤n2+n+5p\le n^2+n+5 for which Qn mod pQ_n\bmod p is irreducible. Knowing the group is SnS_n gives infinitely many such primes, but does not give this explicit bound.

References 2
Discuss this question →
OpenPolynomial families

Does each central-trinomial section have a small irreducible-reduction prime?

Scope. Every n≥1; central-trinomial coefficients T_j=[z^j](z²+z+1)^j.

Sun asks whether

Un(x)=∑j=0nTjxn−jU_n(x)=\sum_{j=0}^n T_jx^{n-j}

is irreducible modulo some prime p≤n2+n+5p\le n^2+n+5. This would imply rational irreducibility and an nn-cycle in the Galois group. It is a separate conjecture from the Catalan and central-binomial statements.

References 1
Discuss this question →

Related topics

References

  1. Speculations in Galois Theory

    Katz, Nicholas M. and Rivin, Igor. Laumon volume (online contribution).

    Read the source
  2. Galois groups of Taylor polynomials: prescriptions and arithmetic families

    Nguyen-Dang, Khai-Hoan. Hexagon preprint, 2026.

    Read the source
  3. Prime Witnesses and Eventual Alternating–Symmetric Galois Groups in a Jacobi Family

    Wei, Dongsheng. Zenodo, 2026.

    Read the source
  4. A224416: least prime giving an irreducible reduction of a reversed Catalan section

    Sun, Zhi-Wei. The On-Line Encyclopedia of Integer Sequences, 2013.

    Read the source
  5. Irreducibility of truncations of the Catalan generating function

    Seki, Shin-ichiro. arXiv preprint, 2026.

    Read the source
  6. Galois groups over Q and factorizations mod p

    Conrad, Keith. Author-hosted expository note.

    Read the source
  7. Chebotarëv and his density theorem

    Stevenhagen, Peter and Lenstra, Jr., Hendrik W. The Mathematical Intelligencer, 18(2), 26–37, 1996.

    Read the source