Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
o3 Pro
5 tokens/sec
GPT-4.1 Pro
37 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
Gemini 2.5 Flash Deprecated
12 tokens/sec
2000 character limit reached

Counting Co-Cyclic Lattices (1505.06429v1)

Published 24 May 2015 in math.NT and cs.DM

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 $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 $\left(\zeta(6) \prod_{k=4}n \zeta(k)\right){-1} \approx 85\%$. The problem is motivated by complexity theory, namely worst-case to average-case reductions for lattice problems.

Citations (13)

Summary

We haven't generated a summary for this paper yet.