Gonçalves–Ramos equality conjecture for the linear-programming bound
Statement
Let be a vector of increasing positive integers, and let and be the quantities defined in the paper. The upper bound
is attained in the cases listed in the paper: (i) all are odd; (ii) there are coprime integers such that and every integer in is not divisible by ; or (iii) for some integer , where 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 and . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.