Related papers: Graphical complexes of groups
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…
We introduce the notion of weakly systolic complexes and groups, and initiate regular studies of them. Those are simplicial complexes with nonpositive-curvature-like properties and groups acting on them geometrically. We characterize weakly…
We prove that numerous negatively curved simply connected locally compact polyhedral complexes, admitting a discrete cocompact group of automorphisms, have automorphism groups which are locally compact, uncountable, non linear and virtually…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
We introduce and investigate bucolic complexes, a common generalization of systolic complexes and of CAT(0) cubical complexes. They are defined as simply connected prism complexes satisfying some local combinatorial conditions. We study…
Graphical small cancellation extends the classical small cancellation theory and provides a powerful method for constructing groups with interesting features. In the classical setting, C(3)-T(6) small cancellation complexes are known to…
We determine the large scale geometry of the minimal displacement set of a hyperbolic isometry of a systolic complex. As a consequence, we describe the centraliser of such an isometry in a systolic group. Using these results, we construct a…
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
In this paper, we study the geometry of cone-offs of CAT(0) cube complexes over a family of combinatorially convex subcomplexes, with an emphasis on their Gromov-hyperbolicity. A first application gives a direct cubical proof of the…
We use the interplay between combinatorial and coarse geometric versions of negative curvature to investigate the geometry of infinitely presented graphical $Gr'(1/6)$ small cancellation groups. In particular, we characterize their…
We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…
We introduce the notion of coupled link cube complex (CLCC) as a means of constructing interesting cocompactly cubulated groups. CLCCs are defined locally, making them a useful tool when precise control over the links is required. In this…
We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…
Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
The $\widetilde{A}_n$ Coxeter groups are known to not be systolic or cocompactly cubulated for $n\geq 3$. We prove that these groups act geometrically on weakly modular graphs, a weak notion of nonpositive curvature generalizing the…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…