Almost-covering problem for Golomb-ruler difference packings
Statement
Fix an integer . For a -element set , let be its set of positive differences. Call a Golomb ruler if all elements of are distinct. For a family of -mark Golomb rulers whose difference sets are pairwise disjoint and satisfy , define to be the maximum possible value of . The claimed threshold theorem is as if and only if . For every fixed , the claimed obstruction is , where is the first positive solution of and .
Record
- Added
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.