On the language of palindromic reduced words in a Coxeter group
arXiv:2609.29022
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.
Comments welcome