Related papers: Embedability between right-angled Artin groups

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

We show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all…

Inductive knowledge graph completion has been considered as the task of predicting missing triplets between new entities that are not observed during training. While most inductive knowledge graph completion methods assume that all entities…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We study the (virtual) indicability of the automorphism group $Aut(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$ associated to a simplicial graph $\Gamma$. First, we identify two conditions -- denoted (B1) and (B2) -- on $\Gamma$…

For a graph $G$ on $n$ vertices, denote by $a(G)$ the number of vertices in the largest induced forest in $G$. The Albertson-Berman conjecture, which has been open since 1979, states that $a(G) \geq \frac{n}{2}$ for every simple planar…

For all Artin groups, we characterise the girth (i.e. the length of a shortest cycle) of the defining graph algebraically, showing that it is an isomorphism invariant. Using this result, we prove that the Artin groups based on a cycle graph…

Given a regular covering map $\varphi:\Lambda \to \Gamma$ of graphs, we investigate the subgroup $\operatorname{LAut}(\varphi)$ of the automorphism group $\operatorname{Aut}(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$. This…

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

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…

Laman graphs are fundamental to rigidity theory. A graph G with n vertices and m edges is a generic minimally rigid graph (Laman graph), if m=2n-3 and every induced subset of k vertices spans at most 2k-3 edges. We consider the verification…

We generalize to (certain) Artin groups some results previously known for right-angled Artin groups (RAAGs). First, we generalize a result by Droms, B. Servatius, and H. Servatius, and prove that the derived subgroup of an Artin group is…

We consider $\Sigma$-invariants of Artin groups that satisfy the $K(\pi,1)$-conjecture. These invariants determine the cohomological finiteness conditions of subgroups that contain the derived subgroup. We extend a known result for even…

We show that given a collection $X=\{f_1$, \ldots , $f_m\}$ of pure mapping classes on a surface $S$, there is an explicit constant N, depending only on $X$, such that their Nth powers $\{f_1^N$, \ldots , $f_m^N\}$ generate the expected…

A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$…

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

We prove that if two transvection-free right-angled Artin groups are measure equivalent, then they have isomorphic extension graphs. As a consequence, two right-angled Artin groups with finite outer automorphism groups are measure…

We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…