arXiv · 2505.24555
Computing finite Weyl groupoids
Abstract
We present algorithms to compute generalized root systems of Nichols algebras of diagonal type and of contragredient Lie superalgebras. As a consequence, we obtain an algorithm to compute the Lyndon words in the Kharchenko PBW basis associated to each positive root, along with their corresponding hyperwords. This data is essential for obtaining a minimal presentation of Nichols algebras of diagonal type with a finite root system.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Iván Angiono, Leandro Vendramin. 2025-05-30. Computing finite Weyl groupoids. https://doi.org/10.1007/s11565-026-00736-y
Cite the original work for its findings. Save a collection to share your selection of sources.