On the language of palindromic reduced words in a Coxeter group

arXiv:2609.29022 · math.GR · Submitted 2026-09-24 · Read on arXiv

math.GR

Submitted: 2026-09-24

Updated: 2026-10-26

Comments: 14 pages. Corrected error in proof of Proposition 4.1: thanks to Matthew Dyer for catching this. Further comments welcome!

License: http://creativecommons.org/licenses/by-sa/4.0/

The gist: 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…

Terminology

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.

Sources

Related papers