Proves that inversion-set intersection sets in Coxeter groups are convex in weak order with unique minimal elements, enabling computational cone-type checks.
Encyclopaedia of Mathematical Sciences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorics of cone types in Coxeter groups
Proves that inversion-set intersection sets in Coxeter groups are convex in weak order with unique minimal elements, enabling computational cone-type checks.