Asymptotic sharpness conjecture for broadcast domination in the infinite grid
Statement
Let and be positive integers, and let denote the minimum density of a -broadcasting set in the infinite square grid. Asymptotic sharpness conjecture. For every , there exists an integer such that for every ,
This is proposed as a weakening of the earlier sharpness conjecture after computational evidence showed that the unrestricted assertion fails for some small parameters. The asymptotic range of the equality remains open in the supplied text.
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.