Volumes and distributions for random unimodular complex and quaternion lattices
Peter J. Forrester, Jiyuan Zhang

TL;DR
This paper studies invariant measures and volume computations on matrix groups over real, complex, and quaternion fields, with applications to lattice counting and reduction algorithms, providing explicit formulas and probabilistic distributions.
Contribution
It introduces a unified approach to measure decomposition and volume calculation for unimodular lattices over different fields, and extends lattice reduction algorithms with explicit distribution results.
Findings
Derived volume formulas for matrix groups with bounded norms.
Computed PDFs of shortest basis vectors for complex lattices.
Provided a unified proof of lattice reduction algorithms for N=2.
Abstract
Two themes associated with invariant measures on the matrix groups , with or , and their corresponding lattices parametrised by , being an appropriate Euclidean ring of integers, are considered. The first is the computation of the volume of the subset of 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 . The second is the problem of lattice reduction in the case . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
