Counting Co-Cyclic Lattices
Number Theory
2015-05-26 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1505.06429,
title = {Counting Co-Cyclic Lattices},
author = {Phong Q. Nguyen and Igor E. Shparlinski},
journal= {arXiv preprint arXiv:1505.06429},
year = {2015}
}