ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,b,c,d∈Na,b,c,d\in\mathbb{N} satisfy ab⩽cdab\leqslant cd and a=min⁡(a,b,c,d)a=\min(a,b,c,d). Let [nk]\genfrac{[}{]}{0pt}{}{n}{k} denote the Gaussian binomial coefficient and let N0[q]\mathbb{N}_0[q] be the polynomials in qq with nonnegative integer coefficients. Troyka's conjecture.

[c+dc]−[a+ba]∈N0[q].\genfrac{[}{]}{0pt}{}{c+d}{c}-\genfrac{[}{]}{0pt}{}{a+b}{a}\in\mathbb{N}_0[q].

The source explains that this positivity is proved when aa divides either cc or dd, and attributes the conjecture without that divisibility condition to Troyka. The remaining general case is open in the supplied text.

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.