Related papers: Embedding problem between right-angled Artin group…

Let $A_\Gamma$ be an Artin group with defining graph $\Gamma$. We introduce the notion of $A_\Gamma$ being extra-large relative to a family of arbitrary parabolic subgroups. This generalizes a related notion of $A_\Gamma$ being extra-large…

We show that a large class of right-angled Artin groups (in particular, those with planar complementary defining graph) can be embedded quasi-isometrically in pure braid groups and in the group of area preserving diffeomorphisms of the disk…

We prove the $\Sigma^1$-conjecture for two families of Artin groups: Artin groups such that there exists a prime number $p$ dividing $\frac{l(e)}{2}$ for every edge $e$ with even label $>2$ and balanced Artin groups. The family of balanced…

In this paper we solve the isomorphism problem for all large-type Artin groups. Our strategy involves reconstructing the Coxeter groups associated with large-type Artin groups in a purely algebraic way. This answers several questions raised…

We study $2$-dimensional Artin groups of hyperbolic type from the viewpoint of measure equivalence, and establish rigidity theorems. We first prove that they are boundary amenable. So is every group acting discretely by simplicial…

Given an Artin group $A_\Gamma$, a common strategy in the study of $A_\Gamma$ is the reduction to parabolic subgroups whose defining graphs have small diameter, i.e. showing that $A_\Gamma$ has a specific property if and only if all "small"…

Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal{A}$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal{A}$ is a planar polyline drawing $\Gamma$ of $G$…

We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Let G be a finite group acting orthogonally on a pair (S^d,\Gamma) where \Gamma is a finite, connected graph of genus g>1 embedded in the sphere S^d. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y.…

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

Let $\Pi$ be a polar space of type $\textsf{D}_{n}$. Denote by ${\mathcal G}_{\delta}(\Pi)$, $\delta\in \{+,-\}$ the associated half-spin Grassmannians and write $\Gamma_{\delta}(\Pi)$ for the corresponding half-spin Grassmann graphs. In…

We give criteria for deciding whether or not a triangle-free simple graph is the presentation graph of a right-angled Coxeter group that is quasiisometric to some right-angled Artin group, and, if so, producing a presentation graph for such…

A T-graph (a special case of a chordal graph) is the intersection graph of connected subtrees of a suitable subdivision of a fixed tree T . We deal with the isomorphism problem for T-graphs which is GI-complete in general - when T is a part…

We compute the first $\ell^2$-Betti number of the automorphism and outer automorphism groups of arbitrary right-angled Artin groups (RAAGs), providing a complete characterization of when it is non-zero. We also analyse the algebraic fibring…

A planar orthogonal drawing $\Gamma$ of a planar graph $G$ is a geometric representation of $G$ such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two…

Given a property (graph class) $\Pi$, a graph $G$, and an integer $k$, the \emph{$\Pi$-completion} problem consists in deciding whether we can turn $G$ into a graph with the property $\Pi$ by adding at most $k$ edges to $G$. The…

The intersection ideal graph $\Gamma(S)$ of a semigroup $S$ is a simple undirected graph whose vertices are all nontrivial left ideals of $S$ and two distinct left ideals $I, J$ are adjacent if and only if their intersection is nontrivial.…

We generalize the peak-reduction algorithm (Whitehead's theorem) for free groups to a theorem about a general right-angled Artin group A_Gamma. As an application, we find a finite presentation for the automorphism group Aut A_Gamma that…