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.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Polynomial method”
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.
New method proves Jones Polynomial's connect sum property.
problem Jones Polynomial's behavior under connect sums.
method Trip matrix method for calculating Jones Polynomial.
result Jones Polynomial is multiplicative under connect sums.
Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of Jones polynomials for some families of braids and to obtain general qualitative re…
The paper extends a method to compute A-polynomials of 2-bridge knots.
problem Computing A-polynomials of 2-bridge knots.
method Generalized symplectic quandle structure and conjugation quandle equations.
result Effective computation of A-polynomials, including previously unknown ones.
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.
Local high-degree polynomial integrals of geodesic flows and the generalized hodograph methodmath.DS
Study integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.
problem Integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.
method Semi-Hamiltonian systems of PDEs and generalized hodograph method.
result Construction of many local explicit and implicit integrable examples with polynomial first integrals of degrees 3, 4, 5.
Polynomial-time method solves complex combinatorial semi-bandits.
problem Optimal strategies for combinatorial semi-bandits with uncorrelated Gaussian rewards.
method Proposes a polynomial-time method to solve the Graves-Lai optimization problem for various combinatorial structures.
result First known approach to implement asymptotically optimal algorithms in polynomial time for combinatorial semi-bandits.
New Alexander polynomial for singular knots improves upon existing methods.
problem Defining a polynomial invariant for singular knots.
method Introducing a perturbed Alexander polynomial.
result The new polynomial agrees with previous definitions for long knots.
New algorithm speeds up polynomial kernel approximations.
problem Efficiently approximating polynomial kernels of high degree.
method Oblivious sketching combined with novel sampling.
result Polynomial factor slowdown removed in running time.
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.
Using the same method we provide negative answers to the following questions: Is it possible to find real equations for complex polynomials in two variables up to topological equivalence (Lee Rudolph) ? Can two topologically equivalent polynomials be connected by a continuous family of topologically equivalent polynomi…
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 -polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of …
Formulae for Vassiliev invariants derived from Kauffman polynomial.
problem Computing Vassiliev invariants from knot polynomials.
method State model of Kauffman polynomial, Gauss diagram identities, arrow diagram identities.
result Gauss diagram formulae for Vassiliev invariants of order 3.
The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the present paper is a generalization of Conway's mutation of knots and links. Instead of…
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…
Towards a mathematical framework to inform Neural Network modelling via Polynomial Regressionstat.ML
A mathematical framework connects neural networks and polynomial regression for better model understanding.
problem Neural networks are black boxes with challenges in dimensioning and prediction error evaluation.
method Developed a mathematical framework using Taylor expansion to relate neural networks and polynomial regression.
result Polynomial approximations from neural networks trained on polynomial data are accurate locally.
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.
The paper constructs biharmonic maps between spheres using polynomial maps.
problem Creating biharmonic maps between spheres.
method Using harmonic homogeneous polynomial maps of different degrees to generate proper biharmonic maps.
result Established a method for constructing proper biharmonic product maps.
Develops methods to calculate global index of real polynomials.
problem Calculating the global index of real polynomials.
method Two methods: via atypical fibres and Milnor arcs clusters.
result Derives upper bounds for the global index, refining Durfee's degree-based bound.
New methods assess topological entanglement in periodic systems.
problem Assessing topological entanglement in systems with periodic boundary conditions.
method Introducing Periodic Jones polynomial and Cell Jones polynomial.
result Periodic Jones polynomial is a recurring factor of Jones polynomial of finite cutoffs.
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.
Polynomial-time methods count and sample DAGs from equivalence classes.
problem Counting and sampling DAGs from Markov equivalence classes.
method Polynomial-time algorithms for DAGs.
result Counting and sampling can be done in polynomial time.
Polynomially parametrize interesting knotted surfaces.
problem Constructing polynomial parametrizations of knotted surfaces.
method Develop polynomial parametrization methods for specific knotted surfaces.
result Examples of polynomial parametrizations for knotted spheres, tori, and planes.
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.
Polynomial Jump-Diffusion Modelsq-fin.MF
We develop a comprehensive mathematical framework for polynomial jump-diffusions in a semimartingale context, which nest affine jump-diffusions and have broad applications in finance. We show that the polynomial property is preserved under polynomial transformations and Lévy time change. We present a generic method for…
In this paper, I give a method to calculate the HOMFLY polynomials of knots by using a representation of the braid group B4 into a group of 3 ? 3 matrices. Also, I will give examples of a 2-bridge knot and a 3-bridge knot that have the same Jone polynomial, but different HOMFLY polynomials.
Enhances polynomial chaos models with uncertainty intervals.
problem Uncertainty quantification in surrogate models.
method Jackknife-based conformal prediction integrated into polynomial chaos expansions.
result Produces accurate predictive intervals for low-accuracy models.
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.
Develops polynomial diffusion models for multi-factor commodity futures dynamics.
problem Modeling futures prices using latent state variables for short and long-term stochastic factors.
method Polynomial diffusion models to incorporate non-linear effects, two filtering methods for estimation.
result Accurate estimation of futures prices despite parameter identification issues in polynomial diffusion models.
We derive a factorization of the Alexander polynomial of the 4-strand Turk's head knot using hypergeometric representations.
problem Deriving a factorization of the Alexander polynomial of the 4-strand Turk's head knot
method Using the reduced Burau representation and multivariable resultant elimination over reciprocal constraints
result Deriving a factorization of the Alexander polynomial in terms of Chebyshev polynomials
Operator inference for non-intrusive model reduction of systems with non-polynomial nonlinear termsmath.NA
New method learns low-dimensional models for systems with non-polynomial terms.
problem Modeling systems with non-polynomial nonlinear terms that are spatially local and given in analytic form.
method Non-intrusive model reduction method that learns operators for linear and polynomially nonlinear dynamics via a least-squares problem incorporating given non-polynomial terms.
result Comparable accuracy to intrusive methods that require full knowledge of governing equations.
A state generating is introduced to determine the Jones polynomial of a link. Formulae for two infinite families of knots are shown by applying this method, the second family of which are proved to be non-alternating. Moreover, the method is generalized to compute the Jones-Kauffman polynomial of a virtual link. As exa…
In this paper, a method is given to calculate the Jones polynomial of the 6-plat presentations of knots by using a representation of the braid group into a group of matrices. We also can calculate the Jones polynomial of the -plat presentations of knots by generalizing the method for the …
Starting from a homogeneous polynomial in momenta of arbitrary order we extract multi-component hydrodynamic-type systems which describe 2-dimensional geodesic flows admitting the initial polynomial as integral. All these hydrodynamic-type systems are semi-Hamiltonian, thus implying that they are integrable according t…
A new algebraic method for computing helicity is developed, by discovering a relationship between helicity of fluid mechanics and algebraic polynomial invariants of knot theory. We have constructed a topological invariant for a link of knots, where is the helicity of a …
Multiparameter regularization and aggregation in the context of polynomial functional regressionstat.ML
Study introduces a new method for multiple parameter regularization in polynomial functional regression.
problem Handling varying regularization parameters in polynomial functional regression.
method Developed a theoretically grounded algorithm for multiple parameter regularization and model aggregation.
result Promising results from evaluations on synthetic and real-world data.
New knot polynomials derived from Nichols algebras and braided Hopf algebras.
problem Developing new knot invariants from algebraic structures.
method Constructing knot invariants from solutions to the Yang--Baxter equation over generalized Yetter--Drinfel'd modules.
result Reproduces known knot polynomials and discovers new multivariable invariants.
Low-degree method fails to predict robust subspace recovery problem.
problem Predicting computational tractability of robust subspace recovery problem.
method Low-degree polynomial framework, anti-concentration properties.
result Low-degree method fails to predict computational tractability of robust subspace recovery problem even up to high degree.
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.
New method measures entanglement of open and closed curves.
problem Measuring entanglement of curves in 3-space.
method Defining bracket polynomial and Jones polynomial for open and closed curves.
result Jones polynomial applies to both open and closed curves, with continuity properties.
Evaluating the Jones polynomial with tensor networkscond-mat.stat-mech
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a -state Potts model defined as a planar graph with weighted edges that corresponds to the knot. For any integer , we cast…
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.
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, t…
In this paper we study both analytic and numerical solutions of option pricing equations using systems of orthogonal polynomials. Using a Galerkin-based method, we solve the parabolic partial diferential equation for the Black-Scholes model using Hermite polynomials and for the Heston model using Hermite and Laguerre p…
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.
New method computes knot invariants using free group automorphisms.
problem Computing knot invariants efficiently and accurately.
method Using representations of braid groups by automorphisms of a free group.
result Compared isotopic invariants to Alexander polynomials.
We show that the ungraded ruling invariants of a Legendrian link can be realized as certain coefficients of the Kauffman polynomial which are non-vanishing if and only if the upper bound for the Bennequin number given by the Kauffman polynomial is sharp. This resolves positively a conjecture of Fuchs. Using similar met…