Counting Co-Cyclic Lattices - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2016

Counting Co-Cyclic Lattices

Résumé

There is a well-known asymptotic formula, due to W. M. Schmidt [Duke Math. J., 35 (1968), pp. 327--339], for the number of full-rank integer lattices of index at most $V$ in ${\mathbb{Z}}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor group ${\mathbb{Z}}^n/L$. Accordingly, we count the number of full-rank integer lattices $L \subseteq {\mathbb{Z}}^n$ such that ${\mathbb{Z}}^n/L$ is cyclic and of order at most $V$, and deduce that these co-cyclic lattices are dominant among all integer lattices: their natural density is $(\zeta(6) \prod_{k=4}^n \zeta(k))^{-1} \approx 85\%$. The problem is motivated by complexity theory, namely worst-case to average-case reductions for lattice problems.

Dates et versions

hal-01382385 , version 1 (17-10-2016)

Identifiants

Citer

Phong Q. Nguyen, Igor E. Shparlinski. Counting Co-Cyclic Lattices. SIAM Journal on Discrete Mathematics, 2016, 30 (3), pp.1358-1370. ⟨10.1137/15M103950X⟩. ⟨hal-01382385⟩
117 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More