相关论文: Braids in trivial braid diagrams

We give a short proof for the fact, already proven by Thomas Haettel, that the arbitrary intersection of parabolic subgroups in Euclidean Braid groups $A[\tilde{A}_n]$ is again a parabolic subgroup. To that end, we use that the…

Every embedded surface $\mathcal{K}$ in the 4-sphere admits a bridge trisection, a decomposition of $(S^4,\mathcal{K})$ into three simple pieces. In this case, the surface $\mathcal{K}$ is determined by an embedded 1-complex, called the…

We prove that fibred knots cannot be untied with $\bar{t}_{2k}$-moves, for all $k \geq 2$. More generally, we give an upper bound on the number of two strand twist operations that allow to untie a knot with non-trivial HOMFLY polynomial, in…

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

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…

We study braid varieties and their relation to open positroid varieties. We discuss four different types of braids associated to open positroid strata and show that their associated Legendrian links are all Legendrian isotopic. In…

Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…

In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…

In 1947, in the paper "Theory of Braids", Artin raised the question of whether isotopy and homotopy of braids on the disk coincide. Twenty seven years later, Goldsmith answered his question: she proved that in fact the group structures are…

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…

We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set…

The Jones problem is a question whether there is a non-trivial knot with the trivial Jones polynomial in one variable $q$. The answer to this fundamental question is still unknown despite numerous attempts to explore it. In braid…

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…

This paper gives a description of the full space of Bridgeland stability conditions on the bounded derived category of a contraction algebra associated to a 3-fold flop. The main result is that the stability manifold is the universal cover…

We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have…

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…

We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

We prove that the pure braid groups on closed, orientable surfaces are bi-orderable, and that the pure braid groups on closed, non-orientable surfaces have generalized torsion, thus they are not bi-orderable.

We describe all finite-dimensional pointed Hopf algebras whose infinitesimal braiding is a fixed Yetter-Drinfeld module decomposed as the sum of two simple objects: a point and the one of transpositions of the symmetric group in three…