pith. sign in

arxiv: 1608.00767 · v1 · pith:HTQTW4CMnew · submitted 2016-08-02 · 🧮 math.NT

The behavior of random reduced bases

classification 🧮 math.NT
keywords baseslatticereducedanalysisreductionaroundbecomesbehave
0
0 comments X
read the original abstract

We prove that the number of Siegel-reduced bases for a randomly chosen $n$-dimensional lattice becomes, for $n \rightarrow \infty$, tightly concentrated around its mean. We also show that most reduced bases behave as in the worst-case analysis of lattice reduction. Comparing with experiment, these results suggest that most reduced bases will, in fact, "very rarely" occur as an output of lattice reduction. The concentration result is based on an analysis of the spectral theory of Eisenstein series and uses (probably in a removable way) the Riemann hypothesis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.