Related papers: RAAGedy right-angled Coxeter groups

For a hierarchically hyperbolic group, we provide sufficient conditions under which suitable powers of a finite collection of elements generate a right-angled Artin subgroup. Under additional hypotheses, we further show that this subgroup…

This article lays the foundations for an analogue of geometric group theory that studies actions on graphs by right quasigroups, including racks and quandles. We study markings of graphs that realize racks, and we introduce (di)graph…

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

The objective of this paper is to detect which combinatorial properties of a regular graph can completely determine the geodesic growth of the right-angled Coxeter or Artin group this graph defines, and to provide the first examples of…

In this note we give the quasi-isometry classification for a class of right angled Artin groups. In particular, we obtain the first such classification for a class of Artin groups with dimension larger than 2; our families exist in every…

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…

We study Morse subgroups and Morse boundaries of random right-angled Coxeter groups in the Erd\H{o}s--R\'enyi model. We show that at densities below $\left(\sqrt{\frac{1}{2}}-\epsilon\right)\sqrt{\frac{\log{n}}{n}}$ random right-angled…

We prove a new version of the classical peak-reduction theorem for automorphisms of free groups in the setting of right-angled Artin groups. We use this peak-reduction theorem to prove two important corollaries about the action of the…

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the…

The action of a right-angled Artin group on its extension graph is known to be acylindrical because the cardinality of the so-called $r$-quasi-stabilizer of a pair of distant points is bounded above by a function of $r$. The known upper…

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

In this paper, we study the structure of braid graphs in simply-laced Coxeter systems. We prove that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices,…

We characterize, in terms of the defining graph, when a twisted right-angled Artin group (a group whose only relations among pairs of generators are either commuting or Klein-bottle type relations) is left-orderable.

The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…