ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For r∈Q+r\in\mathbb{Q}^+ and an integer k≥1k\geq 1, define the integer trace of the generalized qq-binomial coefficient by retaining its integer exponents, and write

[r+kk]q∣Z=∑d≥0cr(d)qd.\left[ \genfrac{}{}{0pt}{}{r+k}{k} \right]_q\big|_{\mathbb{Z}}=\sum_{d\geq 0}c_r(d)q^d.

For power series with nonnegative coefficients, write A(q)≥qB(q)A(q)\geq_q B(q) when every coefficient of A(q)−B(q)A(q)-B(q) is nonnegative. The 1/21/2-conjecture. For every r∈Q+r\in\mathbb{Q}^+ and every integer k≥1k\geq 1,

[1/2+kk]q≥q[r+kk]q.\left[ \genfrac{}{}{0pt}{}{1/2+k}{k} \right]_q\geq_q\left[ \genfrac{}{}{0pt}{}{r+k}{k} \right]_q.

Thus r=12r=\tfrac12 would be a global maximizer of the integer-trace coefficients in the coefficientwise partial order. The conjecture is motivated by the nonnegative signs and maximal integer support arising for r=12r=\tfrac12; the paper reports computational verification for r=13r=\tfrac13 and r=14r=\tfrac14 when 1≤k≤1501\leq k\leq150, but no general proof is given.

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.