Visibility density conjecture for polynomially defined lattice points
Statement
Let denote the set of lattice points associated with the coefficient vector , and let denote its density. Visibility density conjecture. For every coefficient vector other than ,
The preceding results provide lower bounds for these densities and show that the exceptional vector has density . Numerical experiments motivate the conjecture that all other coefficient vectors have full density.
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.