Kazhdan-Lusztig cells in planar hyperbolic Coxeter groups and automata. (Q2923345)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kazhdan-Lusztig cells in planar hyperbolic Coxeter groups and automata. |
scientific article; zbMATH DE number 6356173
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kazhdan-Lusztig cells in planar hyperbolic Coxeter groups and automata. |
scientific article; zbMATH DE number 6356173 |
Statements
15 October 2014
0 references
Kazhdan-Lusztig cells
0 references
word hyperbolic groups
0 references
finite state automata
0 references
hyperbolic Coxeter groups
0 references
regular languages
0 references
Kazhdan-Lusztig cells in planar hyperbolic Coxeter groups and automata. (English)
0 references
Let \(W\) be a Coxeter group. If \(X\subseteq W\) define \(\mathrm{Red}(X)\) to be the set of all reduced expressions for elements of \(X\).NEWLINENEWLINE The main results that the authors obtain are the following:NEWLINENEWLINE (1) Let \(W\) be a word hyperbolic group, let \(S\) be any finite generating set for \(W\) satisfying \(S=S^{-1}\), and let \(\mu\) be any word in \(\mathrm{Red}(W)\). Then \(\mathrm{Red}(X_\mu)\) is a regular language.NEWLINENEWLINE (2) Let \(W\) be a word hyperbolic group, and let \(S\) be any generating set for \(W\). Suppose \(X\subseteq W\) is such that \(\mathrm{Red}(X)\) is a regular language. Then for any \(w\in W\), the language \(\mathrm{Red}(w\cdot X)\) is also regular.NEWLINENEWLINE The authors give two conjectures. Using these conjectures and the results above, they show that the language \(\mathrm{Red}(C)\) is regular for any left, right, or 2-sided Kazhdan-Lusztig cell \(C\).
0 references