Abstract
We provide a combinatorial condition on a finite connected graph, L, for which there exists a unique CAT(0) polygonal complex such that the link at each vertex is L. Under the further assumption that the polygons have an even number of sides we prove that this condition is also necessary, and that there are either one or a continuum of non-isomorphic such complexes.
| Original language | English |
|---|---|
| Pages (from-to) | 397-414 |
| Number of pages | 18 |
| Journal | Geometriae Dedicata |
| Volume | 168 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2014 |
Keywords
- Coxeter groups
- Geometric group theory
- Non-positive curvature
- Polygonal complexes
All Science Journal Classification (ASJC) codes
- Geometry and Topology