Research
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,657 papers · 148 categories

Trend · papers per month

2695388071,076 · Jun 202019922001200920172026
48 results for polynomial resultant

For a graph G embedded in an orientable surface Σ, we consider associated links L(G) in the thickened surface Σ\times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon graph. This generalizes celebrated results of Jaeger and Traldi. We use knot theory to prove re…

2006-05-17abs ↗pdf ↗

The paper connects knot theory and cluster algebras via dimer face polynomials.

problem Understanding the relationship between knot theory and cluster algebras.
method Analyzing dimer face polynomials and their connections to Alexander polynomials and cluster algebras.
result Dimer face polynomials are multivariate generalizations of Alexander polynomials and FF-polynomials in cluster algebras.

We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial coefficients. We discuss which polynomials can be realized as plucking polynomial…

2016-01-14abs ↗pdf ↗

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.

Quantum polynomials are derived from a specific tribracket structure.

problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.

Study improves HOMFLY polynomial coefficients for positive braid links.

problem Determining HOMFLY polynomial coefficients for positive braid links.
method Using geometric invariants like maximum Euler characteristics, number of split and prime factors.
result Improvements in known results for Conway and Jones polynomials of positive braid links.

Associated with each oriented link is the two variable Homflypt polynomial. The Morton-Franks-Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient polynomials are labelled in a braid-dependent manner and may be zero, but display a numb…

2010-09-26abs ↗pdf ↗

The normalized Yamada polynomial is a polynomial invariant in variable A for theta-curves. In this work, we show that the coefficients of the power series obtained from this polynomial by the substitution A=e^x=1+x+x^2/2+x^3/6+... are finite-type invariants for theta-curves although the coefficients of original polynom…

2001-04-18abs ↗pdf ↗

Murasugi discovered two criteria that must be satisfied by the Alexander polynomial of a periodic knot. We generalize these to the case of twisted Alexander polynomials. Examples demonstrate the application of these new criteria, including to knots with trivial Alexander polynomial, such as the two polynomial 1 knots w…

2004-12-19abs ↗pdf ↗

New results on algebraic knots with Brieskorn polynomials.

problem Understanding cobordisms of algebraic knots defined by Brieskorn polynomials.
method Analyzing Fox--Milnor type relations, decomposing algebraic cobordism classes, and studying cyclic suspensions.
result Spherical algebraic knots associated with Brieskorn polynomials have infinite order in the knot cobordism group.

We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We recover the classical torsionness and divisibility results, which say that, unde…

2015-01-24abs ↗pdf ↗

Ancient caloric functions on manifolds with polynomial growth are studied under volume doubling barrier.

problem Analyzing ancient caloric functions on manifolds beyond volume doubling.
method Time polynomial structure result on ancient caloric functions with polynomial growth.
result Finiteness result for ancient caloric functions is essentially sharp, except for multi-end cases.

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…

2010-02-19abs ↗pdf ↗

We generalize the index polynomial invariant to the case of virtual tangles. Three polynomial invariants result from this generalization; we give a brief overview of their definition and some basic properties.

2018-05-21abs ↗pdf ↗

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 paper explores how polynomial roots and operator eigenvalues change with parameters.

problem How do roots of polynomials and eigenvalues of operators vary with parameter changes?
method Analyzes parameter dependence of polynomials and linear operators, covering real analytic to differentiable of finite order.
result Definitive optimal results for perturbation theory of polynomials and linear operators, including hyperbolic polynomials.

Relative Thom polynomials for maps around boundaries established.

problem Understanding singularities in maps around boundaries.
method Introducing and analyzing Thom polynomials relative to prescribed maps around boundaries, establishing structure theorems and correction terms.
result Unified framework for invariants of immersions and singularities of their extensions.

We introduce a polynomial invariant of graphs on surfaces, PGP_G, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for PGP_G, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statisti…

2009-03-31abs ↗pdf ↗

Algorithm learns polynomial transformations of Gaussian distributions.

problem Learning high-dimensional polynomial transformations of Gaussian distributions.
method Polynomial-time algorithms for smoothed settings, tensor ring decomposition.
result First end-to-end guarantees for learning pushforwards under neural networks.

Recently, it has been shown that the Jones polynomial, in [LS19], and the Alexander polynomial, in [NT18], of rational knots can be obtained by specializing FF-polynomials of cluster variables. At the core of both results are continued fractions, which parameterize rational knots and are used to obtain cluster variabl…

2019-10-22abs ↗pdf ↗

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 show that the standard stochastic gradient decent (SGD) algorithm is guaranteed to learn, in polynomial time, a function that is competitive with the best function in the conjugate kernel space of the network, as defined in Daniely, Frostig and Singer. The result holds for log-depth networks from a rich family of ar…

2017-02-27abs ↗pdf ↗

We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollobás-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally behaves with respect to the partial duality of ribbon graphs. We construct an arrow ri…

2011-07-16abs ↗pdf ↗

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

It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs and show that the Jones polynomial of any link can be expressed as a vertex model…

2007-10-22abs ↗pdf ↗

New bound on Jones polynomial for specific positive links.

problem Finding bounds on the Jones polynomial for positive links.
method Using previous results on positive fibered links, we found a new bound for a specific family of positive links.
result We provided a bound on the maximum degree of the Jones polynomial for positive links with a specific coefficient.

This study shows the moment-SOS hierarchy converges in polynomial optimization over product of spheres.

problem Minimizing multihomogeneous polynomials over product of spheres.
method Moment-SOS hierarchy, local optimality conditions, differential geometry, Morse theory.
result The moment-SOS hierarchy has finite convergence for generic multihomogeneous objective functions.