Logarithmic representation-growth conjecture for
Logarithmic representation-growth conjecture for
Let be a constant. For each and prime , consider the irreducible smooth representations of , with dimension measured as the vector-space dimension of the representation. Logarithmic representation-growth conjecture. For every constant there exists a bound such that, for all and , there are at most irreducible smooth representations of having dimension less than . This is proposed as a low-dimensional, logarithmic analogue of the Aizenbud–Avni representation-counting bounds; those bounds control fixed as dimension grows, whereas the conjecture seeks uniform control over and below an exponential dimension threshold.
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
Nate Harman, “Effective and Infinite-Rank Superrigidity in the Context of Representation Stability”, arXiv:1902.05603 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.