Related papers: The planar pure braid group is a diagram group

In~\cite{Ma} Manturov studied groups $G_{n}^{k}$ for fixed integers $n$ and $k$ such that $k<n$. In particular, $G_{n}^{2}$ is isomorphic to the group of free braids of $n$-stands. In~\cite{KiMa} Manturov and the author studied an invariant…

A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…

Let $D_n$ denote the $n$-punctured disk in the complex plane, where the punctures are on the real axis. An $n$-braid $\alpha$ is said to be \emph{reducible} if there exists an essential curve system $\C$ in $D_n$, called a \emph{reduction…

The CN matrix of an $n$-braid projection $B$ is an $n \times n$ matrix such that each $(i,j)$ entry indicates the number of crossings between $i^{th}$ and $j^{th}$ strands of $B$. In this paper, several patterns of an $n \times n$ matrix to…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

In this article we prove theorem on Lifting for the set of virtual pure braid groups. This theorem says that if we know presentation of virtual pure braid group $VP_4$, then we can find presentation of $VP_n$ for arbitrary $n > 4$. Using…

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We consider a finite, connected and simple graph $\Gamma$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(\Gamma)$, the local action $G_x^{\Gamma(x)}$ is the action of…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Sometime ago, we showed that a pure Artin braid group is not K\"ahler, i.e. it is not the fundamental group of a compact K\"ahler manifold. This used a result of Bressler, Ramachandran and the author that K\"ahler groups cannot be too…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$…

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

We produce an explicit description of the K-theory and K-homology of the pure braid group on $n$ strands. We describe the Baum--Connes correspondence between the generators of the left- and right-hand sides for $n=4$. Using functoriality of…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…