ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk, mm, and bb be integers with k≥2k\ge 2, m≥km\ge k, and, for k≥3k\ge 3, k−2≤b≤km−4k+4k−2k-2\le b\le \frac{km-4k+4}{k-2}, where k(m−b)k(m-b) is even. Define

f(k,m,b)(q)=(mk)q−qk(m−b)2+b−2k+2(bk−2)q.f(k,m,b)(q)=\binom{m}{k}_q-q^{\frac{k(m-b)}{2}+b-2k+2}\binom{b}{k-2}_q.

Here (mk)q\binom{m}{k}_q denotes the qq-binomial coefficient. Reiner–Stanton conjecture. The polynomial f(k,m,b)(q)f(k,m,b)(q) is nonnegative and unimodal for all m≫k0m\gg_k0 and all b≤km−4k+4k−2b\le \frac{km-4k+4}{k-2} satisfying kb≡km(mod2)kb\equiv km\pmod 2, with the only exception of b=km−4k+2k−2b=\frac{km-4k+2}{k-2} when this is an integer.

The conjecture generalizes the original Reiner–Stanton prediction about symmetric differences of qq-binomial coefficients. The paper proves the case k=5k=5 and completely characterizes nonnegativity and unimodality for k≤5k\le 5; it also notes an isolated counterexample to the original conjecture when k=3k=3. The cases k≥6k\ge 6 remain open in general.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.