arXiv (All)
open access
On the language of palindromic reduced words in a Coxeter group
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Global patterns in signed permutations#1110087
- Avoiding patterns with three distinct letters in Canon permutations#821487
- Two optimal parallel algorithms on the commutation class of a word#643393
- On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups#822289
- Intersection Orbital Graphs of Permutation Groups and Reconstruction of Simple Groups#1116304
Record · ID 1076951
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive