Uniform upper-bound conjecture for matrices with a given characteristic polynomial
Uniform upper-bound conjecture for matrices with a given characteristic polynomial
Let denote the number of matrices with characteristic polynomial , where is the set of integer matrices whose entries have absolute value at most . Uniform upper-bound conjecture. Uniformly over polynomials ,
as . The conjecture seeks a bound uniform in the coefficients of and applies without requiring to be irreducible. Existing asymptotic results for irreducible or otherwise restricted characteristic polynomials motivate it, but do not provide the required uniform estimate for arbitrary .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Philipp Habegger, Alina Ostafe and Igor E. Shparlinski, “Integer matrices with a given characteristic polynomial and multiplicative dependence of matrices”, arXiv:2203.03880 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.