Counting matrices over finite rank multiplicative groups
Number Theory
2025-02-12 v1
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 infields 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 (2003).
Cite
@article{arxiv.2502.07100,
title = {Counting matrices over finite rank multiplicative groups},
author = {Aaron Manning and Alina Ostafe and Igor E. Shparlinski},
journal= {arXiv preprint arXiv:2502.07100},
year = {2025}
}