Conjecture on generating a lattice with n+1 random vectors
Statement
Let . For a full-rank lattice , write for its determinant and for the length of a shortest nonzero vector. For , choose vectors independently and uniformly from .
Lattice-generation conjecture. For every , there exists a constant and a rational function satisfying
such that, whenever , the probability that chosen vectors generate is at least . Moreover, can be chosen close to
The conjecture strengthens the paper's proved result, which uses samples from two windows of different sizes. It is motivated by numerical evidence and predicts that samples from a single sufficiently large window suffice with a dimension-dependent constant success probability.
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.