arXiv · 2512.05773
The sparsity of character tables over finite reductive groups and its additive analogue
Abstract
We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases. Furthermore, we prove that when considering a sequence of reductive groups with increasing semisimple rank, the proportion is asymptotically one. We also establish an additive analogue of this phenomenon in the context of a fixed reductive Lie algebra.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
GyeongHyeon Nam, Anna Puskás. 2025-12-05. The sparsity of character tables over finite reductive groups and its additive analogue. https://arxiv.org/abs/2512.05773
Cite the original work for its findings. Save a collection to share your selection of sources.