ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a=(a1,…,ar)\boldsymbol{a}=(a_1,\dotsc,a_r) and b=(b1,…,bs)\boldsymbol{b}=(b_1,\dotsc,b_s) be tuples of positive integers satisfying

∑i=1r⌊aix⌋−∑j=1s⌊bjx⌋⩾0for all  x⩾0.\sum_{i=1}^r\lfloor a_i x\rfloor-\sum_{j=1}^s\lfloor b_j x\rfloor\geqslant 0 \quad\text{for all}\; x\geqslant 0.

For a positive integer nn, write [n]!=[1][2]⋯[n][n]!=[1][2]\dotsm[n], where [m]=(1−qm)/(1−q)[m]=(1-q^m)/(1-q). qq-rious positivity conjecture. Then the polynomial

D(a,b;q)=[a1]!⋯[ar]![b1]!⋯[bs]!D(\boldsymbol{a},\boldsymbol{b};q)=\frac{[a_1]!\dotsm[a_r]!}{[b_1]!\dotsm[b_s]!}

is positive, meaning that all its coefficients are nonnegative. This is the original still-wide-open positivity problem; the proposed unimodality conjecture below is intended to imply it.

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.