Year: 2026
Type: preprint
Abstract: We prove that the language of palindromic reduced words in a Coxeter system is regular if and only if the Coxeter group is a direct product of a finite Coxeter group with finitely many copies of the infinite dihedral group.
Source: arXiv (Cornell University)
Author: Bapat, Asilata
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214282882