Grobner-Shirshov Basis for affine Weyl Group $\widetilde{A_n}$
Erol Y{\i}lmaz, Cenap \"Ozel, U\u{g}ur Ustao\u{g}lu

TL;DR
This paper applies algebraic algorithms to derive a basis for the affine Weyl group A_n, enabling classification of all reduced words within this mathematical structure.
Contribution
It introduces a Grobner-Shirshov basis for A_n using Buchberger-Shirshov algorithm, providing a systematic method for understanding its reduced words.
Findings
Derived the reduced Grobner-Shirshov basis for A_n
Classified all reduced words of the affine Weyl group A_n
Established a new algebraic framework for affine Weyl groups
Abstract
Using Buchberger-Shirshov Algorithm and Composition-Diamond lemma we obtain the reduced Grobner-Shirshov bases of and classify all reduced words of the affine Weyl group .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
