English
Related papers

Related papers: A polynomial time knot polynomial

200 papers

We study the equivariant genera of strongly invertible and periodic knots. Our techniques include some new strongly invertible concordance group invariants, Donaldson's theorem, and the g-signature. We find many new examples where the…

Geometric Topology · Mathematics 2021-01-15 Keegan Boyle , Ahmad Issa

Assuming that P is not equal to NP, the worst-case run time of any algorithm solving an NP-complete problem must be super-polynomial. But what is the fastest run time we can get? Before one can even hope to approach this question, a more…

Data Structures and Algorithms · Computer Science 2026-01-09 Jesper Nederlof

We give a volume formula of hyperbolic knot complements using twisted Alexander invariants.

Geometric Topology · Mathematics 2017-02-22 Hiroshi Goda

We introduce two polynomial invariants $V_1(K;t)$ and $V_2(K;t)$ of a long virtual knot $K$, which generalize the degree-two finite type invariants $v_{2,1}$ and $v_{2,2}$ of Goussarov, Polyak, and Viro. We establish their fundamental…

Geometric Topology · Mathematics 2026-01-23 Shin Satoh , Kodai Wada

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

Data Structures and Algorithms · Computer Science 2020-03-10 Peter Bürgisser , Cole Franks , Ankit Garg , Rafael Oliveira , Michael Walter , Avi Wigderson

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

Combinatorics · Mathematics 2025-09-23 Alexander Dunaykin , Vyacheslav Zhukov

I present a single algorithm which solves the clique problems, "What is the largest size clique?", "What are all the maximal cliques?" and the decision problem, "Does a clique of size k exist?" for any given graph in polynomial time. The…

Data Structures and Algorithms · Computer Science 2015-03-17 Michael LaPlante

In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.

q-alg · Mathematics 2008-02-03 Andrei Okounkov , Grigori Olshanski

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

Computational Complexity · Computer Science 2008-05-19 Jarek Duda

It is shown that for knots with a sufficiently regular character variety the Dubois' torsion detects the A-polynomial of the knot. A global formula for the integral of the Dubois torsion is given. The formula looks like the heat kernel…

Geometric Topology · Mathematics 2011-01-17 Charles Frohman , Joanna Kania-Bartoszynska

The topological framework of circuit topology has recently been introduced to complement knot theory and to help in understanding the physics of molecular folding. Naturally evolved linear molecular chains, such as proteins and nucleic…

Geometric Topology · Mathematics 2021-09-07 Alireza Mashaghi , Roland van der Veen

We introduce a new invariant of tangles along with an algebraic framework in which to understand it. We claim that the invariant contains the classical Alexander polynomial of knots and its multivariable extension to links. We argue that of…

Quantum Algebra · Mathematics 2013-09-16 Dror Bar-Natan , Sam Selmani

A weak chord index $Ind'$ is constructed for self crossing points of virtual links. Then a new writhe polynomial $W$ of virtual links is defined by using $Ind'$. $W$ is a generalization of writhe polynomial defined in [6]. Based on $W$,…

Geometric Topology · Mathematics 2018-12-14 Mengjian Xu

In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation.…

Geometric Topology · Mathematics 2009-04-30 Stavros Garoufalidis , Xinyu Sun

Virtual knot theory is a generalization of knot theory which is based on Gauss chord diagrams and link diagrams on closed oriented surfaces. A twisted knot is a generalization of a virtual knot, which corresponds to a link diagram on a…

Geometric Topology · Mathematics 2015-12-04 Naoko Kamada

A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…

Logic in Computer Science · Computer Science 2007-05-23 Klaus Aehlig , Helmut Schwichtenberg

In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…

Geometric Topology · Mathematics 2025-11-11 Charles Livingston

In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant…

Geometric Topology · Mathematics 2019-07-23 Heather A. Dye , Aaron Kaestner

The expectation value of Wilson loop operators in three-dimensional SO(N) Chern-Simons gauge theory gives a known knot invariant: the Kauffman polynomial. Here this result is derived, at the first order, via a simple variational method.…

High Energy Physics - Theory · Physics 2014-11-21 Marco Astorino

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

Dynamical Systems · Mathematics 2014-09-25 Vitaly Bergelson , Donald Robertson