The polynomial-independence conjecture for normalized symmetric-group character values

For each partition λ\lambda, let tλt_\lambda denote a formal variable corresponding to the normalized character value χ(λ)/χ(1)\chi(\lambda)/\chi(1), and let TλT_\lambda be the specified rational function in NN from the surrounding construction. Consider the polynomial ring Q(N)[t(2),t(3),t(22),t(4),… ]\mathbb{Q}(N)[t_{(2)},t_{(3)},t_{(2^2)},t_{(4)},\dots]. Polynomial-independence conjecture. There is no polynomial relation between nn and the values of χ/χ(1)\chi/\chi(1) at finitely many classes, valid for all sufficiently large integers nn and all χ∈Irr⁡(Sn)\chi\in\operatorname{Irr}(S_n), other than the polynomials in the ideal generated by {tλ−Tλ∣λ any partition}\{t_\lambda-T_\lambda\mid \lambda\text{ any partition}\}. The statement proposes a complete description of the polynomial relations among these normalized character values; the source gives no resolution status.

References

Primary source

Lee Tae Young, “Relations between values and zeros of irreducible characters of symmetric groups”, arXiv:2601.01379 (2026).

Progress summary

Refreshed
Open

The conjecture remains unproved: a published result settles only the case of two character values, while an unverified submitted proof claims the full statement.

The conjecture asks whether the known relations completely describe all polynomial relations among the size of the symmetric group and finitely many normalized character values. A January 2026 paper states this as Conjecture 6.6 and does not resolve it.

Known results

  • The January 2026 paper proves that no nonzero polynomial relation exists among NN, t(2)t_{(2)}, and t(3)t_{(3)} for all n≥3n\geq3 and all irreducible characters.
  • It notes that extending this to arbitrarily many character values may require a different method.

Community submission (unverified), August 25, 2026

A submitted proof argues that the full relation ideal is generated by tμ−Tμt_\mu-T_\mu, using shifted power sums and a triangular character formula; it further claims algebraic independence of N,t(2),t(3),…N,t_{(2)},t_{(3)},\ldots and a bounded-row variant. No independent verification is available.

Current status (as of August 2026): The two-value case is established, but the full polynomial-independence conjecture remains open; the August 2026 submitted proof is unverified.

Sources

Solutions 1

ProofThis solution needs a summarySee full solutionHide full solution

Theorem. Let P≥2\mathcal P_{\geq2} denote the partitions having no parts equal to 11, and put

R=Q(N)[tμ:μ∈P≥2].(1)\mathcal R=\mathbb Q(N)[t_\mu:\mu\in\mathcal P_{\geq2}]. \tag{1}

For each μ\mu, let TμT_\mu be the polynomial in single-cycle variables furnished by Theorem 2.4 of the source, with T(k)=t(k)T_{(k)}=t_{(k)}. For a partition λ⊢n\lambda\vdash n, write

rμ(λ)=χλ(μ,1n−∣μ∣)χλ(1n)(n≥∣μ∣).(2)r_\mu(\lambda) =\frac{\chi^\lambda(\mu,1^{n-|\mu|})}{\chi^\lambda(1^n)} \qquad(n\geq|\mu|). \tag{2}

Then the ideal of all relations valid for every sufficiently large nn and every λ⊢n\lambda\vdash n is exactly

I=(tμ−Tμ:μ∈P≥2)⊆R.(3)\boxed{ \mathcal I =\left(t_\mu-T_\mu:\mu\in\mathcal P_{\geq2}\right) \subseteq\mathcal R. } \tag{3}

Here a rational coefficient is evaluated only away from its finitely many poles. In particular, the size and all single-cycle character ratios are jointly algebraically independent:

N,t(2),t(3),t(4),….(4)N,\quad t_{(2)},\quad t_{(3)},\quad t_{(4)},\quad\ldots. \tag{4}

The assertion continues to hold if, for any fixed number KK of these variables, the tested representations are restricted to partitions with at most KK rows.

Proof. For a Young diagram λ\lambda, define the shifted power sums

pj(λ)=∑i≥1[(λi−i+12)j−(−i+12)j](j≥1).(5)p_j(\lambda) =\sum_{i\geq1} \left[ \left(\lambda_i-i+\frac12\right)^j -\left(-i+\frac12\right)^j \right] \qquad(j\geq1). \tag{5}

Let A\mathcal A be the algebra of polynomial functions on Young diagrams. The classical Kerov--Olshanski theorem, in the explicit form of Ivanov--Olshanski, identifies

A=Q[p1,p2,p3,…],deg⁡pj=j.(6)\mathcal A=\mathbb Q[p_1,p_2,p_3,\ldots], \qquad \deg p_j=j. \tag{6}

Define the central character of a single jj-cycle by

Pj(λ)={nj‾ r(j)(λ),n=∣λ∣≥j,0,n<j,nj‾=n(n−1)⋯(n−j+1).(7)P_j(\lambda) = \begin{cases} n^{\underline j}\,r_{(j)}(\lambda),&n=|\lambda|\geq j,\\ 0,&n<j, \end{cases} \qquad n^{\underline j}=n(n-1)\cdots(n-j+1). \tag{7}

For j=1j=1, the character ratio is 11, so P1(λ)=nP_1(\lambda)=n. Ivanov--Olshanski's triangular character formula gives

Pj=pj+a polynomial of canonical degree strictly less than j.(8)P_j=p_j+\text{a polynomial of canonical degree strictly less than }j. \tag{8}

Consequently, triangular change of generators in (6) yields

A=Q[P1,P2,P3,…],P1(λ)=∣λ∣.(9)\boxed{ \mathcal A=\mathbb Q[P_1,P_2,P_3,\ldots], \qquad P_1(\lambda)=|\lambda|. } \tag{9}

We must strengthen ordinary algebraic independence to the eventual-size quantifier in the conjecture. Let

0≠H∈Q[P1,…,PK],d=deg⁡AH.(10)0\neq H\in\mathbb Q[P_1,\ldots,P_K], \qquad d=\deg_{\mathcal A}H. \tag{10}

Write its nonzero top homogeneous component as h(p1,…,pK)h(p_1,\ldots,p_K). For any strictly decreasing positive real numbers x1>⋯>xK>0x_1>\cdots>x_K>0, define

λ(a)=(⌊ax1⌋,…,⌊axK⌋),a⟶∞.(11)\lambda^{(a)} =\left(\lfloor ax_1\rfloor,\ldots,\lfloor ax_K\rfloor\right), \qquad a\longrightarrow\infty. \tag{11}

These are partitions for all sufficiently large aa, their sizes tend to infinity, and (5) gives

pj(λ(a))=aj∑i=1Kxij+O(aj−1).(12)p_j(\lambda^{(a)}) =a^j\sum_{i=1}^Kx_i^j+O(a^{j-1}). \tag{12}

Therefore

lim⁡a→∞H(λ(a))ad=h(∑i=1Kxi,∑i=1Kxi2,…,∑i=1KxiK).(13)\lim_{a\to\infty} \frac{H(\lambda^{(a)})}{a^d} =h\left( \sum_{i=1}^Kx_i, \sum_{i=1}^Kx_i^2, \ldots, \sum_{i=1}^Kx_i^K \right). \tag{13}

If HH vanished on all sufficiently large partitions with at most KK rows, the right-hand side would vanish throughout the open cone x1>⋯>xK>0x_1>\cdots>x_K>0. However, the Jacobian of its power-sum coordinates is

det⁡(jxij−1)1≤j,i≤K=K!∏1≤i<j≤K(xj−xi)≠0.(14)\det\left(jx_i^{j-1}\right)_{1\leq j,i\leq K} =K!\prod_{1\leq i<j\leq K}(x_j-x_i)\neq0. \tag{14}

Their image therefore contains an open set, and the polynomial hh would be identically zero, contradicting its definition. Thus no nonzero HH can vanish eventually, even on this bounded-row subfamily.

Now let

F(N,u2,…,uK)∈Q(N)[u2,…,uK](15)F(N,u_2,\ldots,u_K) \in\mathbb Q(N)[u_2,\ldots,u_K] \tag{15}

be a relation among the size and finitely many single-cycle ratios. Substitute

N=P1,uj=PjP1j‾(2≤j≤K).(16)N=P_1, \qquad u_j=\frac{P_j}{P_1^{\underline j}} \quad(2\leq j\leq K). \tag{16}

Since P1,…,PKP_1,\ldots,P_K are algebraically independent by (9), this substitution embeds the polynomial ring in (15) into Frac⁡(A)\operatorname{Frac}(\mathcal A). If F≠0F\neq0, clearing the finitely many denominators produces a nonzero polynomial function

H=D(P1)F(P1,P2P12‾,…,PKP1K‾)∈A,D∈Q[N]∖{0}.(17)H =D(P_1) F\left( P_1, \frac{P_2}{P_1^{\underline2}}, \ldots, \frac{P_K}{P_1^{\underline K}} \right) \in\mathcal A, \qquad D\in\mathbb Q[N]\setminus\{0\}. \tag{17}

An eventual relation would make HH vanish on every sufficiently large diagram, contradicting (13)--(14). This proves (4).

Finally, define the reduction homomorphism

red⁡:R⟶Q(N)[t(2),t(3),…],red⁡(tμ)=Tμ.(18)\operatorname{red}:\mathcal R \longrightarrow\mathbb Q(N)[t_{(2)},t_{(3)},\ldots], \qquad \operatorname{red}(t_\mu)=T_\mu. \tag{18}

Because T(j)=t(j)T_{(j)}=t_{(j)}, this is a retraction. Successive substitution in the finitely many variables appearing in any polynomial gives

ker⁡(red⁡)=(tμ−Tμ:μ∈P≥2).(19)\ker(\operatorname{red}) =\left(t_\mu-T_\mu:\mu\in\mathcal P_{\geq2}\right). \tag{19}

The source's Theorem 2.4 shows that every generator on the right is an eventual character relation. Conversely, if F∈RF\in\mathcal R is any eventual relation, then red⁡(F)\operatorname{red}(F) is an eventual relation involving only single cycles. By (17), it must be zero, so F∈ker⁡(red⁡)F\in\ker(\operatorname{red}). This proves (3).

For example, the double-transposition relation becomes

t(2,2)=N(N−1)t(2)2−4(N−2)t(3)−2(N−2)(N−3).(20)t_{(2,2)} = \frac{ N(N-1)t_{(2)}^2-4(N-2)t_{(3)}-2 }{(N-2)(N-3)}. \tag{20}

The same notation TμT_\mu is reused in Example 2.7 of the source for the vanishing relation polynomial, rather than for the single-cycle expression. Throughout (3), (18), and (19), TμT_\mu has its original Theorem 2.4 meaning, exactly as required by Conjecture 6.6.

Attribution. The precise conjecture and reduction polynomials are from T. Y. Lee, Relations between values and zeros of irreducible characters of symmetric groups, version 2, Theorem 2.4 and Conjecture 6.6. The classical free polynomial algebra and triangular character formula used in (6)--(9) are due to V. Ivanov and G. Olshanski, Kerov's central limit theorem for the Plancherel measure on Young diagrams, Symmetric Functions 2001 (2002), Propositions 1.5 and 3.4; see also the authors' full preprint. The eventual-size argument and reduction (13)--(19) apply those established results to prove the full stated conjecture, including the bounded-row strengthening.