The beta-conjecture for Gaussian-polynomial inequalities

Let aa and bb be integers with 0<a<b0<a<b, and let β1\beta\geq1. The β\beta-conjecture. One has

(b+βab)q(a+βba)q,\binom{b+\beta a}{b}_q\geq\binom{a+\beta b}{a}_q,

where the inequality is coefficientwise for polynomials in qq. This is the three-parameter specialization of the preceding Gaussian inequality. The source says that the paper proves the case β=2\beta=2, while the conjecture for general β1\beta\geq1 is left open there.

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.