ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let v=(v1,…,vn−1)\boldsymbol v=(v_1,\ldots,v_{n-1}) be a vector of increasing positive integers, and let gap⁡(v)\operatorname{gap}(\boldsymbol v) and λ+(v)\lambda_+(\boldsymbol v) be the quantities defined in the paper. The upper bound

gap⁡(v)⩽λ+(v)\operatorname{gap}(\boldsymbol v)\leqslant \lambda_+(\boldsymbol v)

is attained in the cases listed in the paper: (i) all viv_i are odd; (ii) there are coprime integers a,m⩾1a,m\geqslant 1 such that a{1,…,m−1}⊂{v1,…,vn−1}a\{1,\ldots,m-1\}\subset\{v_1,\ldots,v_{n-1}\} and every integer in {v1,…,vn−1}∖a{1,…,m−1}\{v_1,\ldots,v_{n-1}\}\setminus a\{1,\ldots,m-1\} is not divisible by mm; or (iii) v=av′\boldsymbol v=a\boldsymbol v' for some integer a⩾1a\geqslant 1, where v′\boldsymbol v' satisfies (i) or (ii). Gonçalves–Ramos equality conjecture. Equality is attained in the upper bound if and only if one of these three conditions holds.

The conjecture records the cases suggested by the authors' linear-programming computations, which covered n⩽20n\leqslant 20 and max⁡(v1,…,vn)⩽40\max(v_1,\ldots,v_n)\leqslant 40. The supplied source gives no proof or resolution of the converse.

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.