Conjectured interval for the minimum overlap constant
Statement
Let denote the minimum overlap constant in the Erdős minimum overlap problem. Conjectured interval for . The constant lies in the interval
This numerical conjecture is motivated by the output of a modified convex program and a computed optimum near . The source presents the interval as a conjecture based on computation, with no proof of the exact upper endpoint or of the claimed enclosure.
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.