Related papers: Braids and crossed modules
We give a complete characterisation of when the right-angled Artin group on one cycle graph can be quasiisometrically embedded in the right-angled Artin group on another cycle graph. In particular, we find infinitely many instances of…
Twisted right-angled Artin groups are defined through presentation based on mixed graphs. Each vertex corresponds to a generator, each undirected edge yields a commuting relation and each directed edge gives a Klein bottle relation. If…
We show that the map obtained by viewing a geometric (ie. representative) braid as a string link induces an isomorphism of the n-strand braid group onto the group of units of the n-strand string link monoid.
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…
In this paper, we focus our attention on the connections between the braid group and the Nielsen fixed point theory. A new forcing relation between braids is introduced, and shown that it can be fulfilled by using Nielsen fixed point…
We consider an interesting class of braidings defined by a combinatorial property in an earlier paper. We show that it consists exactly of those braidings that come from certain Yetter-Drinfeld module structures over pointed Hopf algebras…
Let $V$ be a vertex operator algebra satisfying suitable conditions such that in particular its module category has a natural vertex tensor category structure, and consequently, a natural braided tensor category structure. We prove that the…
In this expository paper, we discuss and compare the notions of braided and coboundary monoidal categories. Coboundary monoidal categories are analogues of braided monoidal categories in which the role of the braid group is replaced by the…
We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…
In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the…
We start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras
We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
Artin glueings provide a way to reconstruct a frame from a closed sublocale and its open complement. We show that Artin glueings can be described as the weakly Schreier split extensions in the category of frames with finite-meet preserving…
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
We generalize the notion of identities among relations, well known for presentations of groups, to presentations of n-categories by polygraphs. To each polygraph, we associate a track n-category, generalizing the notion of crossed module…
We give an explicit description for the nerve of crossed module of categories.