Interval-rank conjecture for finite simple groups
Interval-rank conjecture for finite simple groups
For a finite simple group , consider the set of integers that occur as ranks of string C-group representations of . A set of integers is an interval if it contains every integer between any two of its elements.
Interval-rank conjecture. The group is the only finite simple group whose set of ranks of string C-group representations is not an interval in the set of integers.
This conjecture predicts a strong interval property for the possible ranks of string C-group representations of finite simple groups, with as the unique exception. It was recalled from earlier work by Brooksbank and the author; the supplied text gives no resolution status.
Sources & referencesView supporting material
Primary source
Dimitri Leemans, “String C-group representations of almost simple groups: a survey”, arXiv:1910.08843 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.