A finiteness property and an automatic structure for Coxeter groups (Q1318105): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5580319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coxeter groups are almost convex / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small cancellation theory and automatic groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Schubert calculus of a Coxeter group / rank | |||
Normal rank |
Latest revision as of 12:47, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A finiteness property and an automatic structure for Coxeter groups |
scientific article |
Statements
A finiteness property and an automatic structure for Coxeter groups (English)
0 references
14 August 1994
0 references
If \(\alpha\) and \(\beta\) are positive roots in the root system of a Coxeter group \(W\), we say that \(\alpha\) dominates \(\beta\) if \(w\cdot\beta\) is negative for every \(w\in W\) such that \(w\cdot\alpha\) is negative. It is shown that if the distinguished generating set of \(W\) is finite, then the set of all positive roots \(\alpha\) for which there is no \(\beta\) dominated by \(\alpha\) is finite. It follows as a consequence that the group \(W\) is automatic.
0 references
Coxeter groups
0 references
automatic groups
0 references
positive roots
0 references
root systems
0 references
generating sets
0 references