Asymptotic count of reducible integer matrices
Let denote the number of integer matrices whose entries have absolute value at most and whose characteristic polynomial is reducible over . For some nonzero constants , the source establishes bounds of the form
Asymptotic counting conjecture. The lower bound gives the true order of growth:
For , the upper and lower bounds already have the same order, whereas for larger the conjecture would close the gap between the available bounds.
References
- Igor Rivin, “Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms”, arXiv:math/0604489 (2006).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.