Timeline for Computing Deligne-Lusztig Characters in General
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2019 at 20:35 | comment | added | Jim Humphreys | I'm skeptical about combinatorial formulas for Deligne-Lusztig characters, since the subject involves a range of techniques from combinatorics to geometric representation theory. It might be worthwhile to look at the most recent preprint on arXiv by Meinolf Geck, where he looks for Green functions when $p$ is small. | |
| May 16, 2019 at 21:26 | comment | added | Sheel Stueber | Thank you for the reply Prof Humphreys, I have seen the Srinivasan paper before and it was definitely helpful in understanding the theory. . Specifically I suppose what I am looking for is a method of computing the characters in an algorithmic sense without having to actually compute any cohomology groups, as the known algorithms for this are very expensive from the complexity theory perspective. Do you know if such a computation is possible? | |
| May 16, 2019 at 20:49 | history | answered | Jim Humphreys | CC BY-SA 4.0 |