AN INVITATION TO THE GENERALIZED SATURATION CONJECTURE
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
Statement
Let \alpha, \beta and \mu be partitions of the same size. The generating function \sum_{N \ge 0} L_{N\alpha,N\beta}^{N\mu}(q) t^N is a rational function of q and t.
Context
Candidate 14 of the open problems stated in "AN INVITATION TO THE GENERALIZED SATURATION CONJECTURE", extracted for the Scalable Mathematical Discovery run.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
NEW
Problem: Reconstructed statement. Let be partitions of the same size. For , define the internal product by
where are Kronecker coefficients. Define by
with the Hall--Littlewood functions. Equivalently,
For , let . The conjecture is:
This is exactly Conjecture 2.25 as quoted; the definition of is from the surrounding section.
Result: The conjecture is true.
If , then all partitions are empty and the series is . Assume henceforth . Put
and choose vector spaces of dimensions . Let
with the natural action of , and let be the product of the standard maximal unipotent subgroups.
By Schur--Weyl duality,
Hence the multigraded Hilbert series
is the character of . By Grosshans finite generation, is finitely generated, so Hilbert--Serre gives as a rational function with denominator a finite product of binomials .
Now use Kostant’s formula for Kostka--Foulkes polynomials. Let
For partitions of the same size and length at most ,
where . No terms are lost by restricting to , since implies , hence .
For each , define
Taking the constant term in , expansion gives
Therefore
It remains only to note that each is rational in . Indeed, after writing by Hilbert--Serre, every is a rational function whose denominator is a finite product of terms , with a Laurent monomial in the constant-term variables times a monomial in . Expanding these factors, the constant term counts integer solutions of a finite system of linear equations in nonnegative variables, weighted by monomials in . By Gordan’s lemma, such affine semigroup generating functions are rational. Thus each , and the finite alternating sum is rational.
Verification audit. The proof uses exactly the defined by Hall--Littlewood expansion, includes , imposes no nonzero or saturation hypothesis, and applies Kostant’s formula only after verifying the required length bound. The conclusion is precisely rationality of .
Citation: No prior source is invoked as proving Conjecture 2.25 exactly. Standard ingredients used: Macdonald, Symmetric Functions and Hall Polynomials, Ch. I §7 and Ch. III §6; Grosshans, Algebraic Homogeneous Spaces and Invariant Theory, LNM 1673; Stanley, Enumerative Combinatorics, Vol. 1, on affine semigroup rational generating functions.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Full solution as submitted; SMD novelty classification TYPE1
PASS
The proof attacks the correct statement and is mathematically sound. It uses Kirillov’s definition , obtains rationality of the multigraded Kronecker generating series via Schur–Weyl duality and Grosshans/Hilbert–Serre, then applies Kostant’s formula for Kostka–Foulkes polynomials and constant-term extraction. The final constant-term rationality follows from standard affine semigroup generating-function rationality. I found no exact prior published resolution of this conjecture, only related general rationality machinery.
Novelty assessment
TYPE1
Classification rationale: The result appears to be genuinely new in this exact form, but its proof is a short standard application of Grosshans finite generation/Hilbert–Serre rationality, Kostant’s formula for Kostka–Foulkes polynomials, and affine semigroup generating-function rationality. It resolves Kirillov’s stated Conjecture 2.25, but does not introduce a new combinatorial model, positivity theorem, saturation theorem, or refined denominator structure. Borderline as a short note, but I grade lower because it is essentially an immediate corollary of standard machinery.
Literature check: I found Kirillov’s 2004 paper stating Conjecture 2.25, but no paper proving this exact rationality for . Searches for the exact notation, “Liskova polynomials,” “Kostka-Foulkes Kronecker,” “Generalized Saturation Conjecture,” and “Conjecture 2.25 Kirillov” found only related work: Kirillov’s later paper on stretched parabolic Kostka polynomials, Briand–Orellana–Rosas on rectangular symmetries, and Pak–Slonim on a different Kirillov rationality conjecture for Schubert coefficients. General rationality tools in invariant theory and partition analysis are known and essentially imply the proof strategy, but I did not find the exact statement or a stronger published theorem explicitly covering these -weighted Kronecker/Kostka sums.
Citation: No prior exact citation found. Relevant background: A. N. Kirillov, “An Invitation to the Generalized Saturation Conjecture,” arXiv:math/0404353, Conj. 2.25; F. D. Grosshans, Algebraic Homogeneous Spaces and Invariant Theory, LNM 1673; I. G. Macdonald, Symmetric Functions and Hall Polynomials.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.