An upper bound on the exceptional characteristics for Lusztig's character formula
Representation Theory
2015-08-27 v2 Combinatorics
Abstract
We develop and study a Lefschetz theory in a combinatorial category associated to a root system and derive an upper bound on the exceptional characteristics for Lusztig's formula for the simple rational characters of a reductive algebraic group. Our bound is huge compared to the Coxeter number. It is, however, given by an explicit formula.
Cite
@article{arxiv.0811.1674,
title = {An upper bound on the exceptional characteristics for Lusztig's character formula},
author = {Peter Fiebig},
journal= {arXiv preprint arXiv:0811.1674},
year = {2015}
}
Comments
28 pages, minor revision