Paper computes Alexander polynomials for arborescent links.
problem Explicit formulas for Alexander polynomials are hard to compute for most link families.
method Efficient method for arborescent links, using recursive polynomials.
result Explicit closed formulas for pretzel links derived.
Developed algorithms to compute three polynomial invariants of veering triangulations.
problem Computing polynomial invariants of veering triangulations.
method Introduced and used algorithms for taut, veering, and Teichmüller polynomials based on upper and lower tracks of veering triangulations.
result Proved that the lower and upper taut polynomials are equal but the veering polynomials can differ.
Computes minimal polynomials for generalized Heisenberg groups.
problem None explicitly stated; focus on method.
method Computes minimal polynomials for generalized Heisenberg groups.
result Explicit minimal polynomials for generalized Heisenberg groups.
Investigates polynomial time algorithms for computing Khovanov homology of braids.
problem Computing Khovanov homology for general braids is intractable.
method Examines polynomial time algorithms for 3-braids and a variation of the scanning algorithm for more general braids.
result Shows that for 3-braids, Khovanov homology can be computed in polynomial time, while for more general braids, it can be computed in polynomial time for bounded homological degrees.
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 th…
New algorithm speeds up knot polynomial calculations.
problem Computing Reshetikhin--Turaev knot polynomials efficiently.
method Fixed-parameter tractable computation via tensor networks.
result Knot polynomial computations are fixed-parameter tractable.
New methods compute Alexander polynomials for complex knots.
problem Efficiently computing higher order Alexander polynomials for complex knots.
method Developed new algorithms to compute the Smith normal form of Alexander matrices.
result Computed Alexander polynomials for knots up to 100 crossings.
The paper simplifies the computation of a complex polynomial using Yang-Baxter operators.
problem Computing the homology of Yang-Baxter operators for arbitrary m.
method Reduced the computation to initial conditions and produced explicit formulas.
result Explicit formulas for the third and fourth homology.
Method for computing Khovanov homology of tangles.
problem Limited explicit computational studies of Khovanov homology for tangles.
method Arc reduction approach to compute Khovanov homology.
result Derived and computed Poincaré polynomials for simple and complex tangles.
Researchers compute A-polynomials of manifolds using symplectic properties and cluster algebras.
problem Computing A-polynomials of infinite families of knots and related manifolds is difficult.
method Starting with a triangulation, they use symplectic properties of the Neumann-Zagier matrix to simplify the computation.
result The defining equations of A-polynomials of manifolds obtained by Dehn filling are Ptolemy equations.
Computes Kauffman bracket polynomial for specific 2-tangle shadows.
problem Calculating Kauffman bracket polynomial for complex tangle structures.
method Computed Kauffman bracket polynomial for specific 2-tangle shadows with up to 4 crossings.
result Computed polynomial for specific 2-tangle shadows.
In recent years, twisted Alexander polynomial has been playing an important role in low-dimensional topology. For Montesinos links, we develop an efficient method to compute the twisted Alexander polynomial associated to any linear representation. In particular, formulas for multi-variable Alexander polynomials of thes…
The paper improves bounds on the complexity of computing link polynomials.
problem Computing link polynomials by the skein relation is complex.
method Proved new upper and lower bounds on skein tree depth.
result New bounds on skein tree depth are stronger than previous ones.
Computes knot types using HOMFLY-PT polynomial.
problem Determining chiral knot and link types with small crossing numbers.
method Uses the HOMFLY-PT polynomial to compute knot types from 3D coordinates.
result Efficacy of HOMFLY-PT for knot types up to crossing number 16.
This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002),…
Paper extends Cohen's method to compute Jones polynomial for certain braid subfamilies.
problem Computing Jones polynomial for specific knot families.
method Using weighted adjacency matrices and determinants for certain subfamilies of braid groups.
result Jones polynomial can be computed in polynomial time for certain subfamilies of braid groups.
The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative A-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of …
Computes A-polynomials of knots from Whitehead sister link fillings.
problem Computing A-polynomials for knots from Whitehead sister link fillings.
method Using results on A-polynomials of Dehn fillings, formulas are derived for the A-polynomials of knots.
result Formulas to compute A-polynomials for knots from Whitehead sister link fillings.
Survey on using low-degree polynomials to assess statistical tasks complexity.
problem Understanding the complexity of statistical tasks using polynomial functions.
method Applying low-degree polynomials to measure the complexity of statistical tasks, including detection, recovery, and estimation.
result Low-degree polynomials provide a framework to predict and explain statistical-computational tradeoffs.
Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
Jones polynomials for knots and links with many crossings calculated efficiently.
problem Computing Jones polynomials for knots and links with a large number of crossings.
method Calculating Tutte polynomials for associated graphs and evaluating with specific substitutions.
result Jones polynomials for knots and links with many crossings calculated efficiently.
We study q-holonomic sequences that arise as the colored Jones polynomial of knots in 3-space. The minimal-order recurrence for such a sequence is called the (non-commutative) A-polynomial of a knot. Using the "method of guessing", we obtain this polynomial explicitly for the K_p = (-2, 3, 3+2p) pretzel knots for p = -…
The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.
problem Computing the Kauffman bracket polynomial for complex knots.
method Recursive concatenation of a 4-tangle shadow, followed by a closure operation and polynomial computation.
result A method to compute the Kauffman bracket polynomial for knots formed from 4-tangle shadows.
Researchers compute Khovanov polynomials for satellite knots.
problem Computing Khovanov polynomials for satellite knots.
method Explicit computation using a computer program for two families of satellite knots.
result Khovanov polynomials can be expressed as a linear combination of pattern and companion invariants, with a jump at a critical point.
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maxim…
This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the Jones polynomial.
The study computes trace fields and minimal polynomials for specific knots and links.
problem Computing trace fields and minimal polynomials for specific knots and links.
method Using factorization theorems for sparse polynomials.
result Results depend on the degrees of the trace fields over Q being sufficiently large.
Study on periodic knots, proving limitations on their Alexander polynomials.
problem Understanding Alexander polynomials of periodic knots.
method Polynomial factorization, number theory interpretation, computational methods.
result Alexander polynomials of freely periodic knots are restricted to products of cyclotomic polynomials.
In their precedent work, the authors constructed closed oriented hyperbolic surfaces with pseudo-Anosov homeomorphisms from certain class of integral matrices. In this paper, we present a very simple algorithm to compute the Teichmueller polynomial corresponding to those surface homeomorphisms by first constructing an …
Paper proves knots satisfy a conjecture using Jones polynomial.
problem Proving infinite families of knots satisfy the Cosmetic Surgery Conjecture.
method Computed Jones polynomial and invariants for two knot families.
result Two infinite families of knots satisfy the Purely Cosmetic Surgery Conjecture.
Computed formulas for curvature operators and Poincaré polynomials of symmetric spaces.
problem Calculating curvature operators and Poincaré polynomials for symmetric spaces.
method Explicit formulas derived using quantum numbers and eigenvalue analysis.
result Maximum eigenvalue of curvature operators bounded by Einstein constant, with equality for Hermitian spaces.
A new method calculates HOMFLY-PT polynomials for bipartite links.
problem Computing HOMFLY-PT polynomials for bipartite links efficiently.
method Generalizes Goeritz matrix method for bipartite links.
result Reduces HOMFLY-PT polynomial calculation to matrix algebra.
We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For example, we can use these geodesics to compute the asymptotic translation length, Ni…
New evidence shows computational barriers in graphon estimation using low-degree polynomials.
problem Estimating graphons efficiently and accurately.
method Low-degree polynomials to analyze computational limits.
result Low-degree polynomial estimators cannot significantly outperform USVT in graphon estimation.
Paper defines half-Conway polynomial and computes it for knots up to 12 crossings.
problem Computing and characterizing half-Conway polynomials of knots.
method Normalized Conway polynomial, equivariant skein relation, diagrammatic interpretation.
result First examples of non-slice strongly negative amphichiral knots with determinant one.
A new method computes link invariants from diagrams.
problem Computing link invariants efficiently.
method Single symmetric matrix from a link diagram.
result Multivariable Alexander polynomial computation.
New polynomial invariants for knots and links from quandle coloring quiver decategorification.
problem Defining new polynomial invariants for knots and links.
method Decategorification of the quandle coloring quiver to create polynomial invariants.
result The invariants are not determined by the quandle counting invariant.
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute the known polynomial invariants of knots using their braid representations. In th…
Jones polynomials compute weighted sums of Lefschetz numbers.
problem Computing Lefschetz numbers for braids.
method Colored Jones polynomials of braid closures.
result Jones polynomials compute abelianized Lefschetz numbers.
Strongly polynomial algorithm for approximate Forster transforms and halfspace learning.
problem Computing approximate Forster transforms and halfspace learning.
method Strongly polynomial time algorithm for approximate Forster transforms and halfspace learning.
result First strongly polynomial time algorithm for distribution-free PAC learning of halfspaces.
We describe the polynomial time complexity algorithm for computing first coefficients of the skein (Homflypt) and Kauffman polynomial invariants of links, discovered by D.Vertigan in 1992 but never published.
Researchers compute and predict knot volumes using colored Jones polynomials.
problem Computing and predicting volumes of hyperbolic knots.
method Vertex model approach, neural network training, polynomial evaluations.
result 3-colored Jones polynomials predict knot volumes with high accuracy.
The paper computes groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.
problem Computing groups and modules for wheel graphs.
method Utilized Fibonacci and Chebyshev polynomials to compute the Reduced Fox Coloring Group and Alexander-Burau-Fox Module.
result Computed groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.
New findings on computational limits for estimating hidden structures.
problem Estimating hidden structures in noisy data.
method Use of low-degree polynomials as a restricted model of computation.
result Established low-degree hardness of recovery problems for easy detection problems.
We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the critical values at infinity, and the Milnor numbers at infinity for all irregular…
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. Said differently, the colored Jones function of a knot is annihilated by a non-z…
Parallel algorithm speeds up Jones polynomial computation.
problem Efficient computation of knot complexity measures.
method First parallel algorithm for exact Jones polynomial computation.
result Reduces computational time by an exponential factor.