An algorithm computes joins in the weak order of type B Coxeter groups, extending Markowsky's algorithm to signed permutations and confirming Dyer's geometric conjecture.
Markowsky (1994): Permutation lattices revised
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach
An algorithm computes joins in the weak order of type B Coxeter groups, extending Markowsky's algorithm to signed permutations and confirming Dyer's geometric conjecture.