On generating functions and automata associated to reflections in Coxeter systems
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914336688046080 |
|---|---|
| author | Biagioli, Riccardo Hohlweg, Christophe Sasso, Elisa |
| author_facet | Biagioli, Riccardo Hohlweg, Christophe Sasso, Elisa |
| contents | In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding formulas for the Poincaré series of reflections, namely the generating function of reflection lengths. These two problems were inspired by a conjecture of Stembridge stating that the Poincaré series of reflections is rational and by the solution provided by de Man.
To address the first problem, we introduce reflection-prefixes, arising naturally from palindromic reduced words. We study their connections with the root poset, dominance order on roots, and dihedral reflection subgroups. Using $m$-canonical automata associated with $m$-Shi arrangements, we prove that the language of reduced words for reflection-prefixes is regular. For the second problem, we focus on affine Coxeter groups. In this case, we derive a simple formula for the Poincaré series using symmetries of the Hasse diagram of the root poset. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16361 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On generating functions and automata associated to reflections in Coxeter systems Biagioli, Riccardo Hohlweg, Christophe Sasso, Elisa Group Theory Combinatorics Primary 20F55, secondary 05A05, 17B22, 05E16 In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding formulas for the Poincaré series of reflections, namely the generating function of reflection lengths. These two problems were inspired by a conjecture of Stembridge stating that the Poincaré series of reflections is rational and by the solution provided by de Man. To address the first problem, we introduce reflection-prefixes, arising naturally from palindromic reduced words. We study their connections with the root poset, dominance order on roots, and dihedral reflection subgroups. Using $m$-canonical automata associated with $m$-Shi arrangements, we prove that the language of reduced words for reflection-prefixes is regular. For the second problem, we focus on affine Coxeter groups. In this case, we derive a simple formula for the Poincaré series using symmetries of the Hasse diagram of the root poset. |
| title | On generating functions and automata associated to reflections in Coxeter systems |
| topic | Group Theory Combinatorics Primary 20F55, secondary 05A05, 17B22, 05E16 |
| url | https://arxiv.org/abs/2602.16361 |