On the language of palindromic reduced words in a Coxeter group
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
- On generating functions and automata associated to reflections in Coxeter systems
- Some open problems on Coxeter groups and unimodality
Related papers
- Idempotence criteria for lazy cellular automata
- From algebraic orthogonality to RAAG embedding obstructions in hierarchically hyperbolic groups
- A finitely generated Linear group without property (T) that is neither inner amenable nor properly proximal
- On the Order of Products of Coprime Elements in Finite Groups
- Word length, Morse theory, and Vietoris-Rips complexes
- From almost tight p-group enumeration to 2-group domination among finite groups