ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a fixed positive integer bb, let inv⁡(a,b)\operatorname{inv}(a,b) denote the inversion number and let In(b)I_n(b) be its nnth smallest value, where 1≤n≤61\leq n\leq6. Six-smallest-values conjecture. For 1≤n≤61\leq n\leq6, one has

In(b)≥(n−1)(b+1)(b+1−n)4n,I_n(b)\geq\frac{(n-1)(b+1)(b+1-n)}{4n},

with equality

inv⁡(n,b)=(n−1)(b+1)(b+1−n)4n\operatorname{inv}(n,b)=\frac{(n-1)(b+1)(b+1-n)}{4n}

when b≡−1(modn)b\equiv-1\pmod n. This extends the proved bounds for the second smallest and second largest values to a conjectural description of the six smallest inversion numbers; the source does not indicate that the full statement has been resolved.

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.