Related papers: Braid presentation of spatial graphs
The braid group $B_n$ maps homomorphically into the Temperley-Lieb algebra $\TL_n$. It was shown by Zinno that the homomorphic images of simple elements arising from the dual presentation of the braid group $B_n$ form a basis for the vector…
Branch points of a real 2-surface S in a 4-manifold M generalize the branch points of complex curves in complex surfaces: for example, they can occur as singularities of minimal surfaces. We investigate such a branch point p when S is…
We introduce generalized arrow diagrams and generalized Reidemeister moves for diagrams of links in Seifert fibered spaces. We give a presentation of the fundamental group of the link complement. As a corollary we are able to compute the…
Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…
Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with…
S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation of the braid group into the general linear group of some field. Using this, we deduce from previously known results that the mapping class group…
This paper revisits the study of (minimum) broadcast graphs, i.e., graphs enabling fast information dissemination from every source node to all the other nodes (and having minimum number of edges for this property). This study is performed…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…
We show that every quasipositive link has a quasipositive minimal braid representative, partially resolving a question posed by Orevkov. These quasipositive minimal braids are used to show that the maximal self-linking number of a…
A classic result of representation theory is Brauer's construction of a diagrammatical (geometrical) algebra whose matrix representation is a certain given matrix algebra, which is the commutating algebra of the enveloping algebra of the…
We investigate edge-intersection graphs of paths in the plane grid, regarding a parameter called the bend-number. I.e., every vertex is represented by a grid path and two vertices are adjacent if and only if the two grid paths share at…
Schwartz's solution to the Bj\"orling problem leads to an equivalence class of spatial strips S(t)=(c(t),n(t)) which produce equivalent minimal surfaces. For the particular case when the generating strip S(t) belongs to some plane E and…
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…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We introduce the \emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\ E)$ with diameter $d$, we let $f:V\longrightarrow \mathbb{R}$ assign \emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a…
The notion of a braid is generalized into two and three dimensions. Two-dimensional braids are described by braid monodromies or graphics called charts. In this paper we introduce the notion of curtains, and show that three-dimensional…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased graph $\Omega$ has two natural matroids, the frame matroid…
A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…
By evaluating the Burau representation at t=-1, we obtain a symplectic representation of the braid group. We define the congruence subgroups of the braid group to be the preimages of the principal congruence subgroups of the symplectic…