2002
DOI: 10.1515/advg.2002.018
|View full text |Cite
|
Sign up to set email alerts
|

Rigidity of skew-angled Coxeter groups

Abstract: A Coxeter system is called skew-angled if its Coxeter matrix contains no entry equal to 2. In this paper we prove rigidity results for skew-angled Coxeter groups. As a consequence of our results we obtain that skew-angled Coxeter groups are rigid up to diagram twisting.3. If S has at least 3 elements and if GðW ; SÞ is edge-connected, then there exists w A W such that S w ¼ S.Reformulating statement (1) of the main theorem in the language of [3] we get the following corollary. It implies that Conjecture 8.1 in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
25
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(28 citation statements)
references
References 12 publications
3
25
0
Order By: Relevance
“…We remark that the classification up to isomorphism is already contained in the work of Mühlherr and Weidmann [18] on reflection rigidity and reflection independance in large type (what they call "skew-angled") Coxeter groups. Also, the automorphism groups have already been determined in many of the cases covered here (and some besides) by Bahls [2].…”
Section: Isomorphisms Of Coxeter Groupsmentioning
confidence: 92%
See 1 more Smart Citation
“…We remark that the classification up to isomorphism is already contained in the work of Mühlherr and Weidmann [18] on reflection rigidity and reflection independance in large type (what they call "skew-angled") Coxeter groups. Also, the automorphism groups have already been determined in many of the cases covered here (and some besides) by Bahls [2].…”
Section: Isomorphisms Of Coxeter Groupsmentioning
confidence: 92%
“…Recently, Mühlherr and Weidmann [18] have proved results on reflection rigidity and reflection independance in the wider class of large type (LT) Coxeter groups which give the same solution to the classification problem as given by Theorem 4 above. We note that Bahls [3] has also obtained a similar classification for those Coxeter groups having 2-dimensional Davis complex (equivalently, those associated to 2-dimensional Artin groups).…”
Section: Theoremmentioning
confidence: 94%
“…Indeed, it is crucial in most of the preceding arguments for finitely-generated case that a maximal finite subgroup containing a given element always exists in these cases; however, this property is not assured in general case. (Note that the preceding arguments still work in certain cases; see [MW02] and [Bah05] for instance. )…”
Section: On Non-finitely Generated Coxeter Groupsmentioning
confidence: 96%
“…In [BMMN02], the four authors in that paper proposed the following important conjecture. For example, this conjecture is proved for finitely generated skew-angled Coxeter groups [MW02]. Note that the finiteness of the Coxeter graphs is not assumed in the original conjecture, but a counterexample exists when infinite graphs are allowed, as follows.…”
Section: Toward the Complete Solution -Finitely Generated Casementioning
confidence: 99%
See 1 more Smart Citation