Related papers: Folding-like techniques for CAT(0) cube complexes
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…
In this article we study the asymptotically rigid mapping class groups of infinitely-punctured surfaces obtained by thickening planar trees. We present a family of CAT(0) cube complexes on which the latter groups act. Along the way, we…
We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
These notes grew out of two lectures I have given on CAT(0) cube complexes. I've tried to keep the material elementary and self-contained in order to keep the material easily accessible and to provide an elementary introduction on the topic…
We prove some finiteness results for discrete isometry groups $\Gamma$ of uniformly packed CAT$(0)$-spaces $X$ with uniformly bounded codiameter (up to group isomorphism), and for CAT$(0)$-orbispaces $M = \Gamma \backslash X$ (up to…
We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
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…
In the 1970s Stallings showed that one could learn a great deal about free groups and their automorphisms by viewing the free groups as fundamental groups of graphs and modeling their automorphisms as homotopy equivalences of graphs.…
In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…
We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…
This paper is a survey dedicated to the following question: given a group acting on some CAT(0) cube complex, how to exploit this action to determine whether or not the group is Gromov / relatively / acylindrically hyperbolic? As much as…
We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie…
The aim of this thesis is to present the notion of spaces whose curvature is bounded above, and to give some of its application in the context of Combinatorial Algebra. The thesis is made of two parts, one of theoretic purpose, and the…
We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group $G$, the derived and the stable categories…
We study uniform exponential growth of groups acting on CAT(0) cube complexes. We show that groups acting without global fixed points on CAT(0) square complexes either have uniform exponential growth or stabilize a Euclidean subcomplex.…
We examine distortion of finitely generated normal subgroups. We show a connection between subgroup distortion and group divergence. We suggest a method computing the distortion of normal subgroups by decomposing the whole group into…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We study lattices acting on $\mathrm{CAT}(0)$ spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of $\mathrm{CAT}(0)$…
How do vertices exert influence in graph data? We develop a framework for edge clustering, a new method for exploratory data analysis that reveals how both vertices and edges collaboratively accomplish directed influence in graphs,…