Search arXivSearch

arXiv · 1709.08960

Volumes and distributions for random unimodular complex and quaternion lattices

Abstract

Two themes associated with invariant measures on the matrix groups ${\rm SL}_N(\mathbb F)$, with $\mathbb F = \mathbb R, \mathbb C$ or $\mathbb H$, and their corresponding lattices parametrised by ${\rm SL}_N(\mathbb F)/{\rm SL}_N(\mathbb O)$, $\mathbb O$ being an appropriate Euclidean ring of integers, are considered. The first is the computation of the volume of the subset of ${\rm SL}_N(\mathbb F)$ with bounded 2-norm or Frobenius norm. Key here is the decomposition of measure in terms of the singular values. The form of the volume, for large values of the bound, is relevant to asymptotic counting problems in ${\rm SL}_N(\mathcal O)$. The second is the problem of lattice reduction in the case $N=2$. A unified proof of the validity of the appropriate analogue of the Lagrange--Gauss algorithm for computing the shortest basis is given. A decomposition of measure corresponding to the QR decomposition is used to specify the invariant measure in the coordinates of the shortest basis vectors. With $\mathbb F = \mathbb C$ this allows for the exact computation of the PDF of the first minimum (for $\mathcal O = \mathbb Z[i]$ and $\mathbb Z[(1+\sqrt{-3})/2]$), and the PDF of the second minimum and that of the angle between the minimal basis vectors (for $\mathcal O = \mathbb Z[i]$). It also encodes the specification of fundamental domains of the corresponding quotient spaces. Integration over the latter gives rise to certain number theoretic constants, which are also present in the asymptotic forms of the PDFs of the lengths of the shortest basis vectors. Siegel's mean value gives an alternative method to compute the arithmetic constants, allowing in particular the computation of the leading form of the PDF of the first minimum for $\mathbb F = \mathbb H$ and $\mathcal O$ the Hurwitz integers, for which direct integration was not possible.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter J. Forrester, Jiyuan Zhang. 2018-06-18. Volumes and distributions for random unimodular complex and quaternion lattices. https://doi.org/10.1016/j.jnt.2018.03.010

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT