For primitive diagonal type groups the greedy base sizes are computed exactly, proving Cameron's conjecture, while relational complexity is shown to be at least 4 with no upper bound.
Kleidman, The maximal subgroups of the finite 8-dimensional orthogonal groups PΩ + 8 (q) and of their automorphism groups, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Greedy bases and relational complexity of diagonal type groups
For primitive diagonal type groups the greedy base sizes are computed exactly, proving Cameron's conjecture, while relational complexity is shown to be at least 4 with no upper bound.