Related papers: The Relaxation Normal Form of Braids is Regular
Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof of the standard Artin's representation…
We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…
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…
We use convex relaxation techniques to provide a sequence of solutions to the matrix completion problem. Using the nuclear norm as a regularizer, we provide simple and very efficient algorithms for minimizing the reconstruction error…
Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
Starting from the geometric construction of the framed braid group, we define and study the framization of several Brauer-type monoids and also the set partition monoid, all of which appear in knot theory. We introduce the concept of…
Combining the results by Birman and Goldberg, it was proved the normal closure of the pure braid group of the disk $P_n(D)$ in the pure braid group of the torus $P_n(T)$ is the commutator subgroup $[P_n(T),P_n(T)]$. In this paper we are…
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 define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid…
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…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
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 define and study extensions of Artin's representation and braid monodromy representation to the case of topological and algebraical generalisations of braid groups. In particular we provide faithful representations of braid groups of…
Harmonic surface deformation is a well-known geometric modeling method that creates plausible deformations in an interactive manner. However, this method is susceptible to artifacts, in particular close to the deformation handles. These…
We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…
We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…
We linearize the Artin representation of the braid group given by (right) automorphisms of a free group providing a linear faithful representation of the braid group. This result is generalized to obtain linear representations for the…
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…