Polynomial growth conjecture for maximal arithmetic subgroups
Polynomial growth conjecture for maximal arithmetic subgroups
Let be a connected semi-simple Lie group without almost simple factors of type and without compact factors. For sufficiently large , consider maximal irreducible arithmetic subgroups of whose covolumes are less than . Polynomial growth conjecture for maximal arithmetic subgroups. There exists a constant , depending only on the types of the almost simple factors of , such that the number of their conjugacy classes is at most . This is the polynomial upper bound asserted for the counting function of maximal irreducible arithmetic subgroups; the supplied text gives no evidence that it has been resolved.
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
M. Belolipetsky, “Counting maximal arithmetic subgroups”, arXiv:math/0501198 (2007).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.