Explicit algorithms compute the finite generalized root systems of diagonal-type Nichols algebras and contragredient Lie superalgebras, together with the Lyndon words and hyperwords of their PBW bases.
GAP – Groups, Algorithms, and Programming, Version 4.4.12
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing finite Weyl groupoids
Explicit algorithms compute the finite generalized root systems of diagonal-type Nichols algebras and contragredient Lie superalgebras, together with the Lyndon words and hyperwords of their PBW bases.