ProbXiv
sign in
machine only

FAMILIES OF MAJOR INDEX DISTRIBUTIONS: CLOSED FORMS AND UNIMODALITY

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.

families-of-major-index-distributions-closed-forms-and-unimodalityRepresentation Theorymath.COmath.RTposed by William J. Keithrecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

Conjecture 2. f(n,n,3),3=qn+8[n+21]q[n3]q[21]qf_{(n,n,3),3}=q^{n+8}\left[\begin{array}{c}n+2\\1 \end{array}\right]_{q}\left[\begin{array}{l}n\\3 \end{array}\right]_{q}\left[\begin{array}{l}2\\1 \end{array}\right]_{q} f(n,4,4),3=q14[n−22]q[n1]q[61]q−q17(1−q4)(1−qn−3)2(1−qn−2)(1−q)2(1−q2)2f_{(n,4,4),3}=q^{14}\left[\begin{array}{c}n-2\\2 \end{array}\right]_{q}\left[\begin{array}{l}n\\1 \end{array}\right]_{q}\left[\begin{array}{l}6\\1 \end{array}\right]_{q}-q^{17}\frac{\left(1-q^{4}\right)\left(1-q^{n-3}\right)^{2}\left(1-q^{n-2}\right)}{(1-q)^{2}\left(1-q^{2}\right)^{2}}

Context

Candidate 1 of the open problems stated in "FAMILIES OF MAJOR INDEX DISTRIBUTIONS: CLOSED FORMS AND UNIMODALITY", extracted for the Scalable Mathematical Discovery run.

People

no project yet · nobody looking

Projects

none yet

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.

begin a project on this problem →

Interest

nobody looking

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

1 attempt

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.

review this attempt →

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    — the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: Let λ⊢N\lambda\vdash N, and let SYT(λ)SYT(\lambda) be the standard Young tableaux of shape λ\lambda. For T∈SYT(λ)T\in SYT(\lambda), set

    Des⁡(T)={j:j+1 lies in a lower row than j},des⁡(T)=∣Des⁡(T)∣,maj⁡(T)=∑j∈Des⁡(T)j,\operatorname{Des}(T)=\{j: j+1\text{ lies in a lower row than }j\},\quad \operatorname{des}(T)=|\operatorname{Des}(T)|,\quad \operatorname{maj}(T)=\sum_{j\in\operatorname{Des}(T)}j,

    and

    fλ,i(q)=∑T∈SYT(λ)des⁡(T)=iqmaj⁡(T).f_{\lambda,i}(q)=\sum_{\substack{T\in SYT(\lambda)\\ \operatorname{des}(T)=i}}q^{\operatorname{maj}(T)}.

    With [ab]q\left[\begin{smallmatrix}a\\b\end{smallmatrix}\right]_q denoting the Gaussian binomial coefficient, the conjecture is naturally reconstructed as:

    For all n≥3n\ge 3,

    f(n,n,3),3=qn+8[n+21]q[n3]q[21]q,f_{(n,n,3),3} = q^{n+8} \left[\begin{matrix}n+2\\1\end{matrix}\right]_q \left[\begin{matrix}n\\3\end{matrix}\right]_q \left[\begin{matrix}2\\1\end{matrix}\right]_q,

    and for all n≥4n\ge 4,

    f(n,4,4),3=q14[n−22]q[n1]q[61]q−q17(1−q4)(1−qn−3)2(1−qn−2)(1−q)2(1−q2)2.f_{(n,4,4),3} = q^{14} \left[\begin{matrix}n-2\\2\end{matrix}\right]_q \left[\begin{matrix}n\\1\end{matrix}\right]_q \left[\begin{matrix}6\\1\end{matrix}\right]_q - q^{17}\frac{(1-q^4)(1-q^{n-3})^2(1-q^{n-2})}{(1-q)^2(1-q^2)^2}.

    The ranges come from requiring the displayed triples to be partitions.

    Result: The conjecture is true.

    Use the standard finite principal specialization identity

    sλ(1,q,…,qM−1)=∑ifλ,i(q)[M+N−1−iN]q,N=∣λ∣.s_\lambda(1,q,\dots,q^{M-1}) = \sum_i f_{\lambda,i}(q) \left[\begin{matrix}M+N-1-i\\N\end{matrix}\right]_q, \qquad N=|\lambda|.

    For any three-row shape, every tableau has at least two descents, so fλ,0=fλ,1=0f_{\lambda,0}=f_{\lambda,1}=0. Hence

    fλ,2=sλ(1,q,q2),f_{\lambda,2}=s_\lambda(1,q,q^2),

    and

    fλ,3=sλ(1,q,q2,q3)−[N+11]qfλ,2.f_{\lambda,3}=s_\lambda(1,q,q^2,q^3) - \left[\begin{matrix}N+1\\1\end{matrix}\right]_q f_{\lambda,2}.

    By the hook-content principal specialization formula,

    sλ(1,q,…,qM−1)=q∑i(i−1)λi∏1≤i<j≤M1−qλi−λj+j−i1−qj−i,s_\lambda(1,q,\dots,q^{M-1}) = q^{\sum_i(i-1)\lambda_i} \prod_{1\le i<j\le M} \frac{1-q^{\lambda_i-\lambda_j+j-i}}{1-q^{j-i}},

    with λj=0\lambda_j=0 for j>ℓ(λ)j>\ell(\lambda).

    For λ=(n,n,3)\lambda=(n,n,3), N=2n+3N=2n+3 and ∑(i−1)λi=n+6\sum(i-1)\lambda_i=n+6. Thus

    fλ,2=qn+6[n−12]q.f_{\lambda,2} = q^{n+6}\left[\begin{matrix}n-1\\2\end{matrix}\right]_q.

    Also

    sλ(1,q,q2,q3)=qn+6[n−12]q(1−qn+2)(1−qn+3)(1−q4)(1−q)(1−q2)(1−q3).s_\lambda(1,q,q^2,q^3) = q^{n+6}\left[\begin{matrix}n-1\\2\end{matrix}\right]_q \frac{(1-q^{n+2})(1-q^{n+3})(1-q^4)} {(1-q)(1-q^2)(1-q^3)}.

    Therefore

    fλ,3=qn+6[n−12]q((1−qn+2)(1−qn+3)(1−q4)(1−q)(1−q2)(1−q3)−1−q2n+41−q).f_{\lambda,3} = q^{n+6}\left[\begin{matrix}n-1\\2\end{matrix}\right]_q \left( \frac{(1-q^{n+2})(1-q^{n+3})(1-q^4)} {(1-q)(1-q^2)(1-q^3)} - \frac{1-q^{2n+4}}{1-q} \right).

    The elementary identity

    (1−qn+2)(1−qn+3)(1−q4)(1−q)(1−q2)(1−q3)−1−q2n+41−q=q2(1+q)(1−qn)(1−qn+2)(1−q)(1−q3)\frac{(1-q^{n+2})(1-q^{n+3})(1-q^4)} {(1-q)(1-q^2)(1-q^3)} - \frac{1-q^{2n+4}}{1-q} = q^2(1+q)\frac{(1-q^n)(1-q^{n+2})}{(1-q)(1-q^3)}

    gives

    f(n,n,3),3=qn+8[n+21]q[n3]q[21]q.f_{(n,n,3),3} = q^{n+8} \left[\begin{matrix}n+2\\1\end{matrix}\right]_q \left[\begin{matrix}n\\3\end{matrix}\right]_q \left[\begin{matrix}2\\1\end{matrix}\right]_q.

    For λ=(n,4,4)\lambda=(n,4,4), N=n+8N=n+8 and ∑(i−1)λi=12\sum(i-1)\lambda_i=12. Hence

    fλ,2=q12[n−22]q,f_{\lambda,2} = q^{12}\left[\begin{matrix}n-2\\2\end{matrix}\right]_q,

    and

    sλ(1,q,q2,q3)=q12[n−22]q(1−qn+3)(1−q5)(1−q6)(1−q)(1−q2)(1−q3).s_\lambda(1,q,q^2,q^3) = q^{12}\left[\begin{matrix}n-2\\2\end{matrix}\right]_q \frac{(1-q^{n+3})(1-q^5)(1-q^6)} {(1-q)(1-q^2)(1-q^3)}.

    Thus

    fλ,3=q12[n−22]q((1−qn+3)(1−q5)(1−q6)(1−q)(1−q2)(1−q3)−1−qn+91−q).f_{\lambda,3} = q^{12}\left[\begin{matrix}n-2\\2\end{matrix}\right]_q \left( \frac{(1-q^{n+3})(1-q^5)(1-q^6)} {(1-q)(1-q^2)(1-q^3)} - \frac{1-q^{n+9}}{1-q} \right).

    Using

    (1−qn+3)(1−q5)(1−q6)(1−q)(1−q2)(1−q3)−1−qn+91−q=q2[n1]q[61]q−q5(1−q4)(1−qn−3)(1−q)(1−q2),\frac{(1-q^{n+3})(1-q^5)(1-q^6)} {(1-q)(1-q^2)(1-q^3)} - \frac{1-q^{n+9}}{1-q} = q^2\left[\begin{matrix}n\\1\end{matrix}\right]_q \left[\begin{matrix}6\\1\end{matrix}\right]_q - q^5\frac{(1-q^4)(1-q^{n-3})}{(1-q)(1-q^2)},

    we obtain

    f(n,4,4),3=q14[n−22]q[n1]q[61]q−q17(1−q4)(1−qn−3)2(1−qn−2)(1−q)2(1−q2)2.f_{(n,4,4),3} = q^{14} \left[\begin{matrix}n-2\\2\end{matrix}\right]_q \left[\begin{matrix}n\\1\end{matrix}\right]_q \left[\begin{matrix}6\\1\end{matrix}\right]_q - q^{17}\frac{(1-q^4)(1-q^{n-3})^2(1-q^{n-2})}{(1-q)^2(1-q^2)^2}.

    Verification audit: the only reconstructed ambiguity was the range of nn, fixed by partition validity. The proof uses exactly those ranges, includes the endpoint cases n=3n=3 and n=4n=4, and proves the two displayed polynomial identities exactly.

    Citation: No prior proof of this specific conjecture is used here. Standard tools used: Stanley, Enumerative Combinatorics, Vol. 2, Ch. 7, for the finite principal specialization/P-partition identity and the hook-content specialization formula.

    Reviews

    0 human reviews · 1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification TYPE1

      PASS

      The proof attacks the exact two conjectured formulas. The principal-specialization identity is correctly applied with M=3,4M=3,4, and the fact that three-row SYT have at least two descents correctly isolates fλ,2f_{\lambda,2} and fλ,3f_{\lambda,3}. The hook-content evaluations for (n,n,3)(n,n,3) and (n,4,4)(n,4,4) check out, as do the two algebraic simplifications to the stated closed forms, including endpoint cases. I found no fatal gap or mismatch.

      Novelty assessment

      TYPE1

      Classification rationale: The result is not significant as a standalone combinatorics contribution. It is an immediate application of the standard PP-partition/principal-specialization identity for Schur functions, followed by the hook-content formula and elementary algebra. It resolves the two displayed formulas, but does not introduce a new method or substantial new theorem.

      Literature check: I found no explicit later paper, erratum, note, or forum post proving Keith’s Conjecture 2 in exactly these two forms. The arXiv page for Keith’s paper has no journal update and only an unrelated trackback. Searches for the title, the two shapes (n,n,3)(n,n,3), (n,4,4)(n,4,4), and the displayed fλ,if_{\lambda,i} formulas did not reveal a resolving citation. However, the proof uses only classical identities already in the literature, so the novelty is only the observation and simplification for these two cases.

      Citation: William J. Keith, “Families of major index distributions: closed forms and unimodality,” arXiv:1808.01362, Conjecture 2. Standard background: R. P. Stanley, Enumerative Combinatorics, Vol. 2, Ch. 7, on PP-partitions, Schur principal specializations, and hook-content specialization.

      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 endorsements

    No 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

no comments

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.