Counting singular matrices with primitive row vectors

DOI10.1007/S00605-004-0250-7MaRDI QIDQ1769062zbMATHOpenAlexFDO

Authors Igor Wigman

Publication date 17 March 2005

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0305066

zbMATH Keywords

latticesprimitive vectorssingular matricessublattices

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)

Abstract: We solve an asymptotic problem in the geometry of numbers, where we count the number of singular $nimesn$ matrices where row vectors are primitive and of length at most T. Without the constraint of primitivity, the problem was solved by Y. Katznelson. We show that as $Toinfty$, the number is asymptotic to $frac(n-1)u_{n}zeta(n)zeta(n-1{)}^n{T}^{n^2-n}log(T)$ for $nge3$. The 3-dimensional case is the most problematic and we need to invoke an equidistribution theorem due to W. Schmidt.

Recommendations

• Counting nonsingular matrices with primitive row vectors
• Singular matrices and a uniform bound for congruence groups of \(SL_ n(\mathbb{Z})\)
• scientific article; zbMATH DE number 3273279
• Singular symmetric matrices
• scientific article; zbMATH DE number 3273280

Cited in

(2)

• Counting nonsingular matrices with primitive row vectors
• Some counting questions for matrices with restricted entries

This page was built for publication: Counting singular matrices with primitive row vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769062)