Uniqueness of homogeneous CAT(0) polygonal complexes. (Q2439357)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Uniqueness of homogeneous CAT(0) polygonal complexes.
scientific article

    Statements

    Uniqueness of homogeneous CAT(0) polygonal complexes. (English)
    0 references
    0 references
    14 March 2014
    0 references
    The paper generalizes previous results of \textit{W. Ballmann} and \textit{M. Brin} [Geom. Dedicata 50, No. 2, 165-191 (1994; Zbl 0832.57002)] and \textit{F. Haglund} [C. R. Acad. Sci., Paris, Sér. I 313, No. 9, 603-606 (1991; Zbl 0749.52011)]. Given a finite connected graph \(L\) and an integer \(k\geq 3\), a \textit{\((k,L)\)-complex} is a polygonal complex \(X\) such that the link of each vertex of \(X\) is isomorphic to \(L\) and each \(2\)-cell of \(X\) is a regular \(k\)-gon. If \((k,L)\) satisfies the conditions \(k\geq n\) and \(\mathrm{girth}(L)\geq m\) where \((m,n)\) is one of the following pairs: \((6,3)\), \((4,4)\), \((3,6)\), then the complex \(X\) satisfies Gromov's Link Condition and hence has non-positive curvature. The universal cover of such a connected \((k,L)\)-complex is a CAT(0) \((k,L)\)-complex. Let \(\mathcal X(k,L)\) denote the set of all \(1\)-connected \((k,L)\)-complexes up to isomorphisms of complexes. The main results of the paper are: Theorem 1. Let \(k\geq 4\) and let \((k,L)\) be a pair which satisfies Gromov's Link Condition. If \(L\) is star-transitive and st(edge)-transitive then \(|\mathcal X(k,L)\leq 1|\), moreover, if \(k\) is even then \(|\mathcal X(k,L)=1|\) if and only if the above conditions are satisfied. -- For odd \(k\) there are known examples when \(\mathcal X(k,L)\) is empty. Theorem 2. Let \(k\geq 6\) be even and let \((k,L)\) be a pair which satisfies Gromov's Link Condition, then the cardinality of the set \(\mathcal X(k,L)\) is one or continuum. The proofs use Ballmann-Brin construction and Davis-Moussong complexes. The author remarks that Theorem 2 is also true for \(k=4\) but the proof requires different methods.
    0 references
    polygonal complexes
    0 references
    geometric group theory
    0 references
    non-positive curvature
    0 references
    finite connected graphs
    0 references
    Gromov link condition
    0 references
    universal covers
    0 references

    Identifiers