Skip to main content
5 events
when toggle format what by license comment
Mar 10, 2023 at 21:27 comment added Alastair Litterick I would very much expect it to be do-able now, with a combination of the "feasible character" methods of my PhD thesis/Memoir and Craven's notion of "pressure" to bring in unipotent classes - In fact this is what most of the progress since then has done, more or less. I think it is mostly a lack of interest that hasn't closed the gap (caveat: I have been working on other things and may well have missed recent papers on this).
Mar 10, 2023 at 14:05 comment added LSpice Thank you! Given Liebeck and Seitz's work handling maximal positive-dimensional subgroups, which involves a lot of careful computations down to $q = 2$ and $q = 3$, which as I understand it was backed up by considerable WeightCompare-aided computation, I thought someone might have found a way to reduce these small cases to something that could have been handled by exhaustive search. Is the expectation that that's not possible, or just that no-one's been interested in doing it?
Mar 10, 2023 at 14:03 vote accept LSpice
Mar 10, 2023 at 14:03 history edited LSpice CC BY-SA 4.0
Names of references
Mar 10, 2023 at 11:21 history answered Alastair Litterick CC BY-SA 4.0