Conjecture on generating a lattice with n+1 random vectors
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.
References
- Felix Fontein and Pawel Wocjan, “On the Probability of Generating a Lattice”, arXiv:1211.6246 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.