相关论文: Exchange moves and braid representations of links

We show that if a link $L$ has a closed $n$-braid representative admitting non-degenerate exchange move, an exchange move that does not obviously preserve the conjugacy class, $L$ has infinitely many non-conjugate closed $n$-braid…

We use some Lie group theory and Budney's unitarization of the Lawrence-Krammer representation, to prove that for generic parameters of definite form the image of the representation (also on certain types of subgroups) is dense in the…

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…

In order to obtain a Markov theorem without stabilization, Birman and Menasco introduced the notion of exchange related braids. In this paper I study the way the Fiedler polynomial distinguishes conjugacy classes of some particular braided…

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…

Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We…

A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…

We consider oriented knots and links in a handlebody of genus $g$ through appropriate braid representatives in $S^3$, which are elements of the braid groups $B_{g,n}$. We prove a geometric version of the Markov theorem for braid equivalence…

The authors conjectured previously that a knot is nonfibered if and only if its infinite cyclic cover has uncountably many finite covers. We prove the conjecture for a class of knots that includes all knots of genus 1, using techniques from…

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…

It is shown that two braids represent transversally isotopic links if and only if one can pass from one braid to another by conjugations in braid groups, positive Markov moves, and their inverses.

We show that any pointed Hopf algebra with infinitesimal braiding associated to the conjugacy class of pi in S_n is infinite-dimensional, if either the order of pi is odd, or pi is a product of disjoint cycles of odd order except for…

We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We…

Given a knot and an SL(n,C) representation of its group that is conjugate to its dual, the representation that replaces each matrix with its inverse-transpose, the associated twisted Reidemeister torsion is reciprocal. An example is given…

Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…

We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…

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 obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We…

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist…