A coefficientwise Gaussian-polynomial product inequality

Let aa and bb be integers with 0ka<b0\leq k\leq a<b. The codicil conjecture. The following equivalent-looking coefficientwise inequalities hold:

(ak)q(a+bbk)q(bk)q(a+bak)q,\binom{a}{k}_q\binom{a+b}{b-k}_q\geq\binom{b}{k}_q\binom{a+b}{a-k}_q,

or

(ak)q(bk)q(b+ab)q[1(a+kk)q1(b+kk)q]0.\binom{a}{k}_q\binom{b}{k}_q\binom{b+a}{b}_q\left[\frac{1}{\binom{a+k}{k}_q}-\frac{1}{\binom{b+k}{k}_q}\right]\geq0.

Here (nk)q\binom{n}{k}_q denotes the Gaussian polynomial and \geq denotes coefficientwise comparison. The source presents this as a codicil arising from calculations related to the β\beta-conjecture; no resolution is given in the supplied text.

Sources & referencesView supporting material

Primary source

Tewodros Amdeberhan and David Callan, “Gaussian inequality”, arXiv:2304.03395 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.