Weakly Modular Graphs and Nonpositive Curvature
By Jérémie Chalopin, Victor Chepoi, Hiroshi Hirai, Damian Osajda. Memoirs of the American Mathematical Society, 2014
70 citations recorded by the source corpus.
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive curvature' and `local-to-global' properties and characterizations of weakly modular graphs and their subclasses. Weakly modular graphs have been introduced as a far-reaching common generalization of median graphs (and more generally, of modular and orientable modular graphs), Helly graphs, bridged graphs, and dual polar graphs occurring under different disguises in several seemingly-unrelated fields of mathematics: Metric graph theory, Geometric group theory, Incidence geometries and buildings, Theoretical computer science and combinatorial optimization. We give a local-to-global characterization of weakly modular graphs and their subclasses in terms of simple connectedness of associated triangle-square complexes and specific local combinatorial conditions. In particular, we revisit characterizations of dual polar graphs by Cameron and by Brouwer-Cohen. We also show that (disk-)Helly graphs are precisely the clique-Helly graphs with simply connected clique complexes. With $l_1$-embeddable weakly modular and sweakly modular graphs we associate high-dimensional cell complexes, having several strong topological and geometrical properties (contractibility and the CAT(0) property). Their cells have a specific structure: they are basis polyhedra of even $\triangle$-matroids in the first case and orthoscheme complexes of gated dual polar subgraphs in the second case. We resolve some open problems concerning subclasses of weakly modular graphs: we prove a Brady-McCammond conjecture about CAT(0) metric on the orthoscheme complexes of modular lattices; we answer Chastand's question about prime graphs for pre-median graphs.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/f0e77bc4baf3c5aa8efa268ef3cc6abd49d38945
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
In Mathematical Physics
Citations in the corpus
- Helly meets Garside and Artin (2019, methodology): “ While allowing to deduce ‘CAT(0)-like’ behavior as in the previous paragraph, the property of being Helly can be checked by local combinatorial conditions via a local-to-global characterization from [CCHO], see Theorem 3.2 below. The Main Theorem also provides a higher dimensional generalization of”