Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA note on HOMFLY polynomial of positive braid links
64
0
0.0
(
0
)
Authors
Tetsuya Ito
Ask ChatGPT about the research
No Arabic abstract
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split factors, and the number of prime factors. Our results give improvements of known results for Conway and Jones polynomial of positive braid links. In Appendix, we present a simpler proof of theorem of Cromwell, a positive braid diagram represent composite link if and only if the the diagram is composite.
rate research
Read More
We give asymptotically sharp upper bounds for the Khovanov width and the dealternation number of positive braid links, in terms of their crossing number. The same braid-theoretic technique, combined with Ozsvath, Stipsicz, and Szabos Upsilon invariant, allows us to determine the exact cobordism distance between torus knots with braid index two and six.
The main goal is to find the Homfly polynomial of a link formed by decorating each component of the Hopf link with the closure of a directly oriented tangle. Such decorations are spanned in the Homfly skein of the annulus by elements Q_lambda, depending on partitions lambda. We show how to find the 2-variable Homfly invariant <lambda,mu> of the Hopf link arising from decorations Q_lambda and Q_mu in terms of the Schur symmetric function s_mu of an explicit power series depending on lambda. We show also that the quantum invariant of the Hopf link coloured by irreducible sl(N)_q modules V_lambda and V_mu, which is a 1-variable specialisation of <lambda,mu>, can be expressed in terms of an N x N minor of the Vandermonde matrix (q^{ij}).
Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter tractable in the treewidth of the link diagram, but the parameterised complexity of the more powerful HOMFLY-PT polynomial remained an open problem. Here we show that computing HOMFLY-PT is fixed-parameter tractable in the treewidth, and we give the first sub-exponential time algorithm to compute it for arbitrary links.
We show that two Dehn surgeries on a knot $K$ never yield manifolds that are homeomorphic as oriented manifolds if $V_K(1) eq 0$ or $V_K(1) eq 0$. As an application, we verify the cosmetic surgery conjecture for all knots with no more than $11$ crossings except for three $10$-crossing knots and five $11$-crossing knots. We also compute the finite type invariant of order $3$ for two-bridge knots and Whitehead doubles, from which we prove several nonexistence results of purely cosmetic surgery.
We generalize the notion of the quandle polynomial to the case of singquandles. We show that the singquandle polynomial is an invariant of finite singquandles. We also construct a singular link invariant from the singquandle polynomial and show that this new singular link invariant generalizes the singquandle counting invariant. In particular, using the new polynomial invariant, we can distinguish singular links with the same singquandle counting invariant.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
