# On commutator relations in $2$-spherical RGD-systems

@inproceedings{Bischof2021OnCR, title={On commutator relations in \$2\$-spherical RGD-systems}, author={Sebastian Bischof}, year={2021} }

In this paper we investigate the commutator relations for prenilpotent roots which are nested. These commutator relations are trivial in a lot of cases.

#### References

SHOWING 1-10 OF 14 REFERENCES

Twin buildings and applications to S-arithmetic groups

- Mathematics
- 1996

Groups acting on twin buildings.- Homotopy properties of ??0(a)?.- Finiteness properties of classical F q over F q[t].

The conjugacy problem for Coxeter groups

- Mathematics
- 2009

We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the conjugacy problem.

Rigidity of skew-angled Coxeter groups

- Mathematics
- 2002

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… Expand

PRESENTATION OF HYPERBOLIC KAC-MOODY GROUPS OVER RINGS

- Mathematics
- 2014

Tits has defined Kac-Moody and Steinberg groups over commutative rings, providing infinite dimensional analogues of the Chevalley-Demazure group schemes. Here we establish simple explicit… Expand

Simplicity and superrigidity of twin building lattices

- Mathematics
- 2009

Kac–Moody groups over finite fields are finitely generated groups. Most of them can naturally be viewed as irreducible lattices in products of two closed automorphism groups of non-positively curved… Expand

Coxeter Decompositions of Hyperbolic Polygons

- Computer Science, Mathematics
- Eur. J. Comb.
- 1998

The Coxeter decompositions of triangles, quadrilaterals and ideal polygons are classified. Expand

Reflection triangles in Coxeter groups and biautomaticity

- Mathematics
- 2005

Abstract A Coxeter system (W, S ) is called affine-free if its Coxeter diagram contains no affine subdiagram of rank ≥ 3. Let (W, S ) be a Coxeter system of finite rank (i.e. |S | is finite). The… Expand

Moufang Polygons

- 2001

1 Buildings Let Π be a Coxeter diagram with vertex set I and let W be the corresponding Coxeter group. Thus W is a group generated by the set I subject to relations which can be read off from the… Expand