Download this article
 Download this article For screen
For printing
Recent Issues
Vol. 340: 1
Vol. 339: 1  2
Vol. 338: 1  2
Vol. 337: 1  2
Vol. 336: 1
Vol. 335: 1  2
Vol. 334: 1  2
Vol. 333: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Counting matrices over finite rank multiplicative groups

Aaron Manning, Alina Ostafe and Igor E. Shparlinski

Vol. 340 (2026), No. 1, 115–138
Abstract

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets 𝒜 of finite rank multiplicative groups in fields of characteristic zero. We obtain upper bounds, in terms of the size of 𝒜, on the number of such matrices of a given rank, with a given determinant and with a prescribed characteristic polynomial. In particular, in the case of ranks, our results can be viewed as a statistical version of work by Alon and Solymosi (2023).

Keywords
matrices over finite rank multiplicative groups, rank, determinant, characteristic polynomial
Mathematical Subject Classification
Primary: 11C20, 15B36, 60B20
Milestones
Received: 19 February 2025
Revised: 25 August 2025
Accepted: 18 September 2025
Published: 31 October 2025
Authors
Aaron Manning
School of Mathematics and Statistics
University of New South Wales
Sydney NSW
Australia
Alina Ostafe
School of Mathematics and Statistics
University of New South Wales
Sydney NSW
Australia
Igor E. Shparlinski
School of Mathematics and Statistics
University of New South Wales
Sydney NSW
Australia