2000 character limit reached
Computing finite Weyl groupoids
Published 30 May 2025 in math.RT, math.QA, and math.RA | (2505.24555v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.