Related papers: Graphical complexes of groups
We define strict C(n) small-cancellation complexes, intermediate to C(n) and C(n+1), and we prove groups acting properly cocompactly on a simply-connected strict C(6) complex are hyperbolic relative to a collection of maximal virtually free…
In this paper, we consider the automorphism groups of the Cayley graph with respect to the Coxeter generators and the Davis complex of an arbitrary Coxeter group. We determine for which Coxeter groups these automorphism groups are discrete.…
We consider the class of those Coxeter groups for which removing from the Cayley graph any tubular neighbourhood of any wall leaves exactly two connected components. We call these Coxeter groups bipolar. They include both the virtually…
We provide a systematic description of the automorphism groups of specially cocompact CAT(0) cube complexes. We show that these groups are topologically finitely generated, present a method to explicitly obtain generating sets, and prove a…
We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…
A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…
We show that every graph product of finitely generated abelian groups acts properly and cocompactly on a CAT(0) cubical complex. The complex generalizes (up to subdivision) the Salvetti complex of a right-angled Artin group and the Coxeter…
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…
The class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the…
An expansion set is a set $\mathcal{B}$ such that each $b \in \mathcal{B}$ is equipped with a set of expansions $\mathcal{E}(b)$. The theory of expansion sets offers a systematic approach to the construction of classifying spaces for…
Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
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…
A generic finite presentation defines a word hyperbolic group whose boundary is homeomorphic to the Menger curve. In this article, we produce the first known examples of non-hyperbolic $CAT(0)$ groups whose visual boundary is homeomorphic…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…
In previous work, we have defined---intrinsically, entirely within the digital setting---a fundamental group for digital images. Here, we show that this group is isomorphic to the edge group of the clique complex of the digital image…
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…