2025/09/24 by Jonathan Chapman, Chapman, Jonathan, Akshat Mudgal +1
Computer Science · Engineering · Mathematics · #11D09 #11D45 #11N37 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2509.20259
openalex publication_date 2025/09/24 · openalex created_date 2025/10/09 · openalex updated_date 2026/07/28
Given positive integers h, N satisfying 1 \leqslant h \leqslant 2N2, we define T(h,N) to be the number of 2× 2 integer matrices with determinant equal to h whose entries lie in [-N,N]. Our main result states that for any ε >0, one has T(h,N) = (16)/(ζ(2)) N2 ( ∑d |h (1)/(d) ) + Oε(Nε (N+ h)). This quantitatively improves upon recent work of Afifurrahman and Ganguly--Guria, and delivers square-root cancellation estimates when h ≤ N. We further show that when h is large, the error term is of approximately the correct order.