Abstract
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most in . This set of lattices can naturally be partitioned with respect to the factor group . Accordingly, we count the number of full-rank integer lattices such that is cyclic and of order at most , and deduce that these co-cyclic lattices are dominant among all integer lattices: their natural density is . The problem is motivated by complexity theory, namely worst-case to average-case reductions for lattice problems.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.