Some results on random unimodular lattices
Abstract
Let n ∈ Z≥ 3. Given any Borel subset A of Rn with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in Rn does not contain any R-linearly independent subset of A of cardinality (n-2) is bounded from above by a constant multiple, which depends only on n, of (vol(A))-1. This generalizes a result that is jointly due to J. S. Athreya and G. A. Margulis (see [Theorem 2.2]Log). We also generalize independent results of C. A. Rogers (see [Theorem 6]MeanRog) and W. M. Schmidt (see [Theorem 1]Metrical) about primitive lattice points of random lattices to the case of primitive tuples of rank less than n2. In addition to the work of the authors who were just mentioned, a crucial element of this present paper is the usage of a rearrangement inequality due to Brascamp Lieb Luttinger (see [Theorem 3.4]BLL).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.