Related papers: The planar pure braid group is a diagram group
We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…
For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…
In this article, we study the cuts of a totally ordered abelian group $\Gamma$. We begin by recalling some results on ordered sets I and on the associated sets IS(I) and FS(I) of initial and final segments of I. For a totally ordered set I…
We show that if a right-angled Artin group $A(\Gamma)$ has a non-trivial, minimal action on a tree $T$ which is not a line, then $\Gamma$ contains a separating subgraph $\Lambda$ such that $A(\Lambda)$ stabilizes an edge in $T$.
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…
A bramble in an undirected graph $G$ is a family of connected subgraphs of $G$ such that for every two subgraphs $H_1$ and $H_2$ in the bramble either $V(H_1) \cap V(H_2) \neq \emptyset$ or there is an edge of $G$ with one endpoint in…
In this paper, we classify homomorphisms from the braid group of $n$ strands to the mapping class group of a genus $g$ surface. In particular, we show that when $g<n-2$, all representations are either cyclic or standard. Our result is sharp…
This paper gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the…
The Standard Model of particle physics provides very accurate predictions of phenomena occurring at the sub-atomic level, but the reason for the choice of symmetry group and the large number of particles considered elementary, is still…
To every semigroup presentation $\mathcal{P}= \langle \Sigma \mid \mathcal{R} \rangle$ and every baseword $w \in \Sigma^+$ can be associated a diagram group $D(\mathcal{P},w)$, defined as the fundamental group of the so-called Squier…
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…
Pure braid groups and pure mapping class groups of a punctured sphere have many features in common. In the paper the graded Lie algebra of the descending central series of the pure mapping class of a sphere is studied. A simple presentation…
A biperiodic planar network is a pair $(G,c)$ where $G$ is a graph embedded on the torus and $c$ is a function from the edges of $G$ to non-zero complex numbers. Associated to the discrete Laplacian on a biperiodic planar network is its…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…
Let $n\geq 1$. The pro-unipotent completion of the pure braid group of $n$ points on a genus 1 surface has been shown to be isomorphic to an explicit pro-unipotent group with graded Lie algebra using two types of tools: (a) minimal models…
We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…