Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the modular Jones polynomial
51
0
0.0
(
0
)
Authors
Guillaume Pagel
Ask ChatGPT about the research
No Arabic abstract
A major problem in knot theory is to decide whether the Jones polynomial detects the unknot. In this paper we study a weaker related problem, namely whether the Jones polynomial reduced modulo an integer $n$ detects the unknot. The answer is known to be negative for $n=2^k$ with $kgeq 1$ and $n=3$. Here we show that if the answer is negative for some $n$, then it is negative for $n^k$ with any $kgeq 1$. In particular, for any $kgeq 1$, we construct nontrivial knots whose Jones polynomial is trivial modulo~$3^k$.
rate research
Read More
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.
In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this construction is a generalization of the $U$-polynomial to rooted graphs, which we introduce and study in this article. Most notably we show that rooted trees can be reconstructed from its rooted $U$-polynomial.
Topological nodal line semimetals host stable chained, linked, or knotted line degeneracies in momentum space protected by symmetries. In this paper, we use the Jones polynomial as a general topological invariant to capture the global knot topology of the nodal lines. We show that every possible change in Jones polynomial is attributed to the local evolutions around every point where two nodal lines touch. As an application of our theory, we show that nodal chain semimetals with four touching points can evolve to a Hopf-link. We extend our theory to 3D non-Hermitian multi-band exceptional line semimetals.
Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection provides a new proof of Turans theorem. Recently, an extension of Motzkin-Straus theorem was proved for non-uniform hypergraphs whose edges contain 1 or 2 vertices in cite{PPTZ}. It is interesting if similar results hold for other non-uniform hypergraphs. In this paper, we give some connection between polynomial programming and the clique of non-uniform hypergraphs whose edges contain 1, or 2, and more vertices. Specifically, we obtain some Motzkin-Straus type results in terms of the graph-Lagrangian of non-uniform hypergraphs whose edges contain 1, or 2, and more vertices.
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al. that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
