Paperlane

no. 3 · Tuesday 27 October 2026

On the language of palindromic reduced words in a Coxeter group

Asilata Bapat

math.GR · v2 · 14 pp

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
14 pages. Corrected error in proof of Proposition 4.1: thanks to Matthew Dyer for catching this. Further comments welcome!
fields
Group Theory
pdf ↗ page arXiv:2609.29022 ↗