The polynomial-independence conjecture for normalized symmetric-group character values
For each partition , let denote a formal variable corresponding to the normalized character value , and let be the specified rational function in from the surrounding construction. Consider the polynomial ring . Polynomial-independence conjecture. There is no polynomial relation between and the values of at finitely many classes, valid for all sufficiently large integers and all , other than the polynomials in the ideal generated by . 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
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 , , and for all 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 , using shifted power sums and a triangular character formula; it further claims algebraic independence of 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
- arxiv.org
- arxiv.org
- aaltodoc.aalto.fi
- math.mit.edu
- math.ucla.edu
- cfc.nankai.edu.cn
- symmetricfunctions.com
- alignment.anthropic.com
- www-cdn.anthropic.com
- arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- community.openai.com
- www-cdn.anthropic.com
- cdn.openai.com
- www-cdn.anthropic.com
- cdn.openai.com
- x.com
Solutions 1
ProofThis solution needs a summarySee full solution
Theorem. Let denote the partitions having no parts equal to , and put
For each , let be the polynomial in single-cycle variables furnished by Theorem 2.4 of the source, with . For a partition , write
Then the ideal of all relations valid for every sufficiently large and every is exactly
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:
The assertion continues to hold if, for any fixed number of these variables, the tested representations are restricted to partitions with at most rows.
Proof. For a Young diagram , define the shifted power sums
Let be the algebra of polynomial functions on Young diagrams. The classical Kerov--Olshanski theorem, in the explicit form of Ivanov--Olshanski, identifies
Define the central character of a single -cycle by
For , the character ratio is , so . Ivanov--Olshanski's triangular character formula gives
Consequently, triangular change of generators in (6) yields
We must strengthen ordinary algebraic independence to the eventual-size quantifier in the conjecture. Let
Write its nonzero top homogeneous component as . For any strictly decreasing positive real numbers , define
These are partitions for all sufficiently large , their sizes tend to infinity, and (5) gives
Therefore
If vanished on all sufficiently large partitions with at most rows, the right-hand side would vanish throughout the open cone . However, the Jacobian of its power-sum coordinates is
Their image therefore contains an open set, and the polynomial would be identically zero, contradicting its definition. Thus no nonzero can vanish eventually, even on this bounded-row subfamily.
Now let
be a relation among the size and finitely many single-cycle ratios. Substitute
Since are algebraically independent by (9), this substitution embeds the polynomial ring in (15) into . If , clearing the finitely many denominators produces a nonzero polynomial function
An eventual relation would make vanish on every sufficiently large diagram, contradicting (13)--(14). This proves (4).
Finally, define the reduction homomorphism
Because , this is a retraction. Successive substitution in the finitely many variables appearing in any polynomial gives
The source's Theorem 2.4 shows that every generator on the right is an eventual character relation. Conversely, if is any eventual relation, then is an eventual relation involving only single cycles. By (17), it must be zero, so . This proves (3).
For example, the double-transposition relation becomes
The same notation 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), 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.