Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function. We compute explicitly the geometric generating function for the group of braids on three strands and prove that it is neither rational nor algebraic, nor even holonomic. This result may appear as counterintuitive. Indeed, the standard complexity (due to the Artin presentation of braid groups) is algorithmically harder to compute than the geometric complexity, yet the associated generating function for the group of braids on three strands is rational.
Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form.
The Bratteli diagram is an infinite graph which reflects the structure of projections in a C*-algebra. We prove that every strictly ergodic unimodular Bratteli diagram of rank 2g+m-1 gives rise to a minimal geodesic lamination with the m-component principal region on a surface of genus g greater or equal to 1. The proof is based on the Morse theory of the recurrent geodesics on the hyperbolic surfaces.
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which can be represented as closed 3-braids. Partial results are obtained about spanning sets for the algebra of chord diagrams of braid index 3.
We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph and a continuity argument.
A crossing in a knot is nugatory if changing the crossing does not change the knot type. Using an invariant of certain types of closed 3-braid diagrams, we show that if a closed 3-braid contains a nugatory crossing then its braid index is one or two. This proves a special case of a conjecture on nugatory crossings due to Xiao-Song Lin.
Let $β:=σ_1σ_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $σ_1, σ_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not divisible by $3$ the knot which is represented by the closure of the braid $β^n$ is algebraically slice if and only if $n$ is odd. As a consequence, we deduce some properties of Lucas numbers.
In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group $B_m$. We show that this Laurent polynomial satisfies the Conway skein relation and its coefficients are Vassiliev invariants of braids.
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
Artin groups of finite type are not as well understood as braid groups. This is due to the additional geometric properties of braid groups coming from their close connection to mapping class groups. For each Artin group of finite type, we construct a space (simplicial complex) analogous to Teichmueller space that satisfies a weak nonpositive curvature condition and also a space "at infinity" analogous to the space of projective measured laminations. Using these constructs, we deduce several group-theoretic properties of Artin groups of finite type that are well-known in the case of braid group…
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $α(L)$ for any knot or non-split link $L$, which are $b(L) \leq \frac{1}{2} c(L) + 1$ and $α(L) \leq c(L) + 2$. We also find a quadratic upper bound of the minimal crossing number of delta diagrams of $L$.
We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads and length of this braid does not exceed n(4n-5)+2.
Laundry surfaces for closed braid diagrams are presented. It is shown that braid diagrams are characterized by linking matrices obtained by lifting cycles from these surfaces. Oriented link types are then characterized by equivalence classes of linking matrices. Similar equivalence classes can be composed of Gordon and Litherland forms or Seifert matrices.
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is realized by diagram-valued invariants [ ] of knots such that [K]=K. It turns out that in the case of free braids, the same principle can be realized an unexpectedly easy way by a one-term invariant formula.
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility, stability and Reidemeister moves. We show that virtual braids are in a bijective correspondence with abstract braids. Finally we demonstrate that for any abstract braid, its representative of minimal genus is unique up to compatibility and Reidemeister moves. The genus of such a representative is thus an invariant for virtual braids. We also give a complete …
Khovanov and Rozansky's categorification of the HOMFLY-PT polynomial is invariant under braidlike isotopies for any link diagram and Markov moves for braid closures. To define HOMFLY-PT homology, they required a link to be presented as a braid closure, because they did not prove invariance under the other oriented Reidemeister moves. In this text we prove that the Reidemeister IIb move fails in HOMFLY-PT homology by using virtual crossing filtrations of the author and Rozansky. The decategorification of HOMFLY-PT homology for general link diagrams gives a deformed version of the HOMFLY-PT poly…
We use rational formality of configuration spaces and the bar construction to study the cohomology of the space of braids in dimension four or greater. We provide a diagram complex for braids and a quasi-isomorphism to the de Rham cochains on the space of braids. The quasi-isomorphism is given by a configuration space integral followed by Chen's iterated integrals. This extends results of Kohno and of Cohen and Gitler on the cohomology of the space of braids to a CDGA suitable for integration. We show that this integration is compatible with Bott-Taubes configuration space integrals for long l…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we present simple formulas for an infinite family of invariants in terms of counting surfaces of a certain genus and number of boundary components in a Gauss diagram associated with a closed braid. We then identify the resulting invariants with partial derivatives of the HOMFLY-PT polynomial.
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 factors, and the number of prime factors. Our results give improvements of known results for Conway and Jones polynomial of positive braid links. In Appendix, we present a simpler proof of theorem of Cromwell, a positive braid diagram represent composite link if and only if the the diagram is composite.
A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed to cross, but no threefold intersections are allowed. The set $Γ_{n}$ of all planar pure braids on $n$ strands is a group with respect to a natural stacking operation. We show that $Γ_{n}$ is always a diagram group, in the sense of Guba and Sapir. A number of consequences follow, including biautomaticity and bi-orderability of the groups $Γ_{n}$. Moreover, ea…
Humboldt-Universität zu Berlin（柏林洪堡大学）；Universität Heidelberg（海德堡大学）；ETH Zürich（苏黎世联邦理工学院）；Universität Regensburg（雷根斯堡大学）；Universidad de Sevilla（塞维利亚大学）
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 overpasses which give us some information related to the braid index. By this notion, we show that, for every nontrivial knot $K$, the braid index $b(K)$ of $K$ is not less than the minimum number $l(K)$ of overpasses of diagrams. Moreover, they are the same for a torus knot.
The based loop space of a configuration space of points in a Euclidean space can be viewed as a space of pure braids in a Euclidean space of one dimension higher. We continue our study of such spaces in terms of Kontsevich's CDGA of diagrams and Chen's iterated integrals. We construct a power series connection which yields a Hopf algebra isomorphism between the homology of the space of pure braids and the cobar construction on diagrams. It maps iterated Whitehead products to trivalent trees modulo the IHX relation. As an application, we establish a correspondence between Milnor invariants of B…
There is a well known injective homomorphism $ϕ:{\mathcal {B}}_n \rightarrow {\rm Aut}(F_n)$ from the classical braid group ${\mathcal {B}}_n$ into the automorphism group of the free group $F_n$, first described by Artin. This homomorphism induces an action of ${\mathcal {B}}_n$ on $F_n$ that can be recovered by considering the braid group as the mapping class group of $H_n$ (an upper half plane with $n$ punctures) acting naturally on the fundamental group of $H_n$. Kauffman introduced virtual links as an extension of the classical notion of a link in ${\mathbb {R}}^3$. As in the classical cas…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,ξ_std), we associate a corresponding multi-pointed nice Heegaard diagram. We then describe an explicit algorithm for computing the associated knot Floer homology groups. We compute explicit bounds for the computational complexity of our algorithm and demonstrate that, in many cases, it is significantly faster than the previous approach using grid diagrams.
It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of the braid index of an alternating link, Murasugi had conjectured that the number of Seifert circles in a reduced alternating diagram of the link equals the braid index of the link. This conjecture turned out to be false. In this paper we prove the next best thing that one could hope for: we characterize exactly those alternating links for which their braid ind…
In this paper, we define the set of singular grid diagrams $\mathcal{SG}$ which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on $\mathcal{SG}$ which induce the bijection onto each singular object. This is an extension of the known result of Ng-Thurston for non-singular links and braids.
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of meanders and braids. We also introduce and apply a method to compare the efficiency of various classes of curves that represent all knots.
We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine diagrams tilde{A}_n, tilde{B}_n, tilde{C}_n and tilde{D}_n as subgroups of the braid groups of various simple orbifolds. The cases D_n, tilde{B}_n, tilde{C}_n and tilde{D}_n are new. In each case the Artin group is a normal subgroup with abelian quotient; in all cases except tilde{A}_n the quotient is finite. We illustrate the value of our braid calculus by perform…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is obtainable from a braid by identifying the endpoints of each string. Because of this correspondence, the Jones and Alexander polynomials, two of the most important knot invariants, can be described completely using the braid group. There has been a recent growth of interest in other diagrammatic algebras, whose elements have a similar topological flavor to the…
We study the rational permutation braids, that is the elements of an Artin-Tits group of spherical type which can be written $x^{-1} y$ where $x$ and $y$ are prefixes of the Garside element of the braid monoid. We give a geometric characterization of these braids in type $A_n$ and $B_n$ and then show that in spherical types different from $D_n$ the simple elements of the dual braid monoid (for arbitrary choice of Coxeter element) embedded in the braid group are rational permutation braids (we conjecture this to hold also in type $D_n$).This property implies positivity properties of the polynom…
Université Clermont-Auvergne（克莱蒙奥弗涅大学）；Institute of Mathematics “Simion Stoilow” of the Romanian Academy（罗马尼亚科学院西蒙·斯托伊洛瓦数学研究所）；University of Oxford（牛津大学）
We present a generalization of the Dehornoy-Brin braided Thompson group $BV_2$ that uses recursive braids. Our new groups are denoted by $BV_{n,r}(H)$, for all $n\geq 2,r\geq 1$ and $H \leq \mathcal{B}_n$, where $\mathcal{B}_n$ is the braid group on $n$ strands. We give a new approach to deal with braided Thompson groups by using strand diagrams. We show that $BV_{n,r}(H)$ is finitely generated if $H$ is finitely generated.
We show that any knot which is smoothly the closure of a 3-braid cannot be Lagrangian concordant to and from the maximum Thurston-Bennequin Legendrian unknot except the unknot itself. Our obstruction comes from drawing the Weinstein handlebody diagrams of particular symplectic fillings of cyclic branched double covers of knots in $S^3$. We use the Legendrian contact homology differential graded algebra of the links in these diagrams to compute the symplectic homology of these fillings to derive a contradiction. As a corollary, we find an infinite family of contact manifolds which are rational …
Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve, i.e. the curves in the form $(y-y_1(x))...(y-y_n(x))=0$ where $n\in \mathbb{Z}^{+}$ and $y_i\in \mathbb{C}[x]$. Also, an algorithm is presented to compute the Alexander polynomial of these curve complements using Burau representations of braid groups. Examples for each computation are provided.
Every knot has a plat projection, obtained by closing up a braid with bridges. The plat projection is determined by the number of strands and the number of rows of twist regions in the braid, and an integer number of crossings in each twist region. In recent work, we showed that under certain restrictions, including that the number of rows is odd, a minimal width plat projection is unique. In this paper we extend the results to even plats. Using new arguments, we show that if each of their twist regions contains at least three crossings, and their length is sufficiently long with respect to th…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We give a unifying topological interpretation of virtuals and flats (virtual strings) and their isotopies via ribbon surfaces and abstract link diagrams. We also give reduced presentations for the virtual braid group, the flat virtual braid group, the welded braid group and several other categories of braids. The paper includes a discussion of the topological …
We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid $\hat β$ around the core of the corresponding solid torus. They can be calculated with polynomial complexity with respect to the braid length and their derivatives evaluated at $x=1$ are finite type invariants of closed braids. Let the solid torus V be standardly embedded in the 3-sphere and let L be the core of the complementary solid torus $S^3\setminus V$. We give examples which show that a natural refin…
Virtual knots arise in the study of Gauss diagrams and Vassiliev invariants of usual knots. Virtual braids correspond naturally to virtual knots. We consider the group of virtual braids on n strings VB_n and its Burau representation, in particular we study their homological properties. We prove that the plus-construction of the classifying space of the virtual braid group on the infinite number of strings is an infinite loop space which is equivalent to a product of Q(S^0), S^1 and an infinite loop space Y. Connections with the K-functor of the integers are discussed.
For an oriented surface link $F$ in $\mathbb{R}^4$, we consider a satellite construction of a surface link, called a 2-dimensional braid over $F$, which is in the form of a covering over $F$. We introduce the notion of an $m$-chart on a surface diagram $π(F)\subset \mathbb{R}^3$ of $F$, which is a finite graph on $π(F)$ satisfying certain conditions and is an extended notion of an $m$-chart on a 2-disk presenting a surface braid. A 2-dimensional braid over $F$ is presented by an $m$-chart on $π(F)$. It is known that two surface links are equivalent if and only if their surface diagrams are rel…
