Related papers: Braid Family Representatives
We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…
For families of knots and links given in Conway notation we compute lower maximal and upper minimal bound of hyperbolic volume by using source links and augmented links.
We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, including the Lawrence-Bigelow representations of the classical braid groups. These representations naturally…
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…
We propose a family of new representations of the braid groups on surfaces that extend linear representations of the braid groups on a disc such as the Burau representation and the Lawrence-Krammer-Bigelow representation.
We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin…
This paper is concerned with detecting when a closed braid and its axis are 'mutually braided' in the sense of Rudolph. It deals with closed braids which are fibred links, the simplest case being closed braids which present the unknot. The…
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la…
The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.
In 1996, Tong, Yang and Ma defined a family of representations of the braid group which have the same dimensions as the (unreduced) Burau representations but are not equivalent. The Burau representation was defined homologically and…
We give a simple topological construction of the Burau representations of the loop braid groups. There are four versions: defined either on the non-extended or extended loop braid groups, and in each case there is an unreduced and a reduced…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
Roberts proved that a family of alternating, arborescent, prime knots each have at least $2^{2n-1}$ distinct minimal genus Seifert surfaces, where $n$ is the genus of the knot in question. We give a subfamily of these knots that have…
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…
We give a simple characterization of braids that can be unplaited keeping separately their upper ends and their lower ends tied together
This paper is a survey of some properties of the braid groups and related groups that lead to questions on mapping class groups.
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional…
We give a general procedure that provides, given any particular pretzel link, a braid whose closure is the pretzel link. Moreover, we manage to give a specific braid word in terms of the entries of the pretzel link.