Related papers: The Relaxation Normal Form of Braids is Regular

We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…

The family of $J$-reflection groups can be seen as a combinatorial generalisation of irreducible rank two complex reflection groups and was introduced by the author in a previous article. In this article, we define the braid groups…

We study a family of algebras defined using a locally-finite endomorphism called a braiding map. When the braiding map is semi-simple, the algebra is a generalized vertex algebra, while when the braiding map is locally-nilpotent we have a…

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…

We study the representability problem for torsion-free arithmetic matroids. By using a new operation called "reduction" and a "signed Hermite normal form", we provide and implement an algorithm to compute all the representations, up to…

Any two reduced expressions for the same Coxeter group element are related by a sequence of commutation and braid moves. Two reduced expressions are said to be braid equivalent if they are related via a sequence of braid moves. Braid…

We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of…

In this paper, we define generalized braid theories in alignment with the language of Fenn and Bartholomew for knot theories, and compute a generating set for the pure generalized braid theories. Using this, we prove that every oriented…

Image registration is fundamental in medical imaging applications, such as disease progression analysis or radiation therapy planning. The primary objective of image registration is to precisely capture the deformation between two or more…

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…

Ab initio atomic relaxations often take large numbers of steps and long times to converge. An atomic relaxation method based on on-the-flight force learning and a corresponding new curved line minimization algorithm is presented to…

On the basis of physical considerations we propose a one-dimensional discrete lattice model for the density relaxation of granular materials under tapping. Solving the difference equation numerically, we find a logarithmic time-dependence…

Abstract Meaning Representations (AMR) are a broad-coverage semantic formalism which represents sentence meaning as a directed acyclic graph. To train most AMR parsers, one needs to segment the graph into subgraphs and align each such…

The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…

The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot…

In this article we show that the braid type of a set of $1$-periodic orbits of a non-degenerate Hamiltonian diffeomorphism on a surface is stable under perturbations which are sufficiently small with respect to the Hofer metric $d_{\rm…

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…

I present the most fundamental features of an implemented system designed to manipulate representations of regular languages. The system is structured into two layers, allowing regular languages to be represented in an increasingly compact,…

We use a variation on the commutator collection process to characterize those pure braids which become trivial when any one strand is deleted, or, more generally, those pure braids which become trivial when all the strands in any one of a…