Related papers: Graph of groups decompositions of graph braid grou…
Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof of the standard Artin's representation…
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…
We study coarse separation in one-ended hyperbolic groups from a quantitative point of view, focusing on the volume growth of separating subsets. We prove that a one-ended hyperbolic group that is not virtually a surface group is coarsely…
In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
In this paper, we establish a new criterion for determining whether an Artin group is subgroup separable (LERF), building upon a criterion introduced in a previous work. Specifically, we prove an Artin group is LERF if and only if it does…
We establish a criterion that implies the acylindrical hyperbolicity of many Artin groups admitting a visual splitting. This gives a variety of new examples of acylindrically hyperbolic Artin groups, including many Artin groups of FC-type.…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
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…
In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…
We give a condition on the defining graph of a right-angled Artin group which implies its automorphism group is virtually indicable, that is, it has a finite-index subgroup that admits a homomorphism onto $\Z$. We use this as part of a…
We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birman-Ko-Lee and by the author of new Garside monoids for Artin…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
A classical result of Schreier states that nontrivial finitely generated normal subgroups of free groups are of finite index, that is, free groups can only quotient to finite groups with finitely generated kernel. In this note we extend…
We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is "admitting exponentially many…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent research on network geometry has shown that those real networks…