PreprintCC BY-SA 4.0arXiv
On the language of palindromic reduced words in a Coxeter group
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.
Related
- On the number of palindromic factors of low complexity words
- The q-Poincaré sum and separability in a Coxeter group
- Computable presentations of reduced group C*-algebras of hyperbolic groups
- Computable presentations of reduced group C*-algebras of groups with the rapid decay property
- Nonamenable groups whose reduced group C*-algebras are not pure
BibTeX
@misc{bapat2026language,
title = {{On the language of palindromic reduced words in a Coxeter group}},
author = {Asilata Bapat},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.29022},
eprint = {2609.29022},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.29022},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - On the language of palindromic reduced words in a Coxeter group
AU - Asilata Bapat
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2609.29022
UR - https://arxiv.org/abs/2609.29022
AB - 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.
ER -