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

Trend · papers per month

295886115 · Jun 202019922001200920172026
48 results for multivariate polynomials

We study various specializations of the colored HOMFLY-PT polynomial. These specializations are used to show that the multivariable link invariants arising from a complex family of sl(m|n) super-modules previously defined by the authors contains both the multivariable Alexander polynomial and Kashaev's invariants. We c…

2007-11-27abs ↗pdf ↗

We show how Conway's multivariable potential function can be constructed using braids and the reduced Gassner representation. The resulting formula is a multivariable generalization of a construction, due to Kassel-Turaev, of the Alexander-Conway polynomial in terms of the Burau representation. Apart from providing an …

2017-09-11abs ↗pdf ↗

We show two results about the Conway potential function which is known as the normalized multivariable Alexander polynomial. We first show that the Conway potential function introduced by Kauffman in "Formal Knot Theory" is indeed a link invariant. Next we show that Kauffman's potential function equals Hartley's potent…

2011-03-12abs ↗pdf ↗

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.

Polylab is a MATLAB toolbox for multivariate polynomial modeling.

problem Efficiently modeling and manipulating multivariate polynomials across CPU and GPU.
method Unified symbolic-numeric interface, three aligned classes (MPOLY, MPOLY_GPU, MPOLY_HP), polynomial operations, differentiation, matrix computations.
result Advantages of MPOLY-HP for reduction-heavy simplification and large-scale computations, and the stochastic log-determinant variant for sparse regimes.

This article describes a multivariate polynomial regression method where the uncertainty of the input parameters are approximated with Gaussian distributions, derived from the central limit theorem for large weighted sums, directly from the training sample. The estimated uncertainties can be propagated into the optimal…

2013-10-03abs ↗pdf ↗

Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my algorithm is that it generalizes to a multivariate tangle invariant up to Reidemeist…

2012-05-25abs ↗pdf ↗

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 AA-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of …

2008-02-27abs ↗pdf ↗

Study the relationship between canonical polynomials and elliptic sequences for elliptic singularities.

problem Understanding the relationship between canonical polynomials and elliptic sequences for elliptic singularities.
method An inductive setup of elliptic germs and comparison of their canonical polynomials.
result The exponents of the canonical polynomial determine the elliptic sequence and vice versa under certain conditions.

We show that if {L_n} is any infinite sequence of links with twist number tau(L_n) and with cyclotomic Jones polynomials of increasing span, then lim sup tau(L_n)=infty. This implies that any infinite sequence of prime alternating links with cyclotomic Jones polynomials must have unbounded hyperbolic volume. The main t…

2006-05-23abs ↗pdf ↗

The paper explores how low-degree polynomials can detect shuffled linear regression models.

problem Detecting multivariate shuffled linear regression models from independent Gaussian random matrices.
method Investigates the effectiveness of low-degree polynomial algorithms for distinguishing the model from independent Gaussian random matrices.
result Establishes a phase transition phenomenon in the performance of low-degree polynomial algorithms for distinguishing the model.

Efficiently finds sparse solutions to max-plus equations for convex regression.

problem Finding sparse solutions to max-plus equations for convex multivariate regression.
method Polynomial-time algorithm for sparse approximate solutions.
result Optimal piecewise-linear fitting with minimum number of regions.

The paper defines strong emergence in field theories and proves it exists between certain theories.

problem Defining and proving the existence of strong emergence phenomena between field theories.
method Formal definition and sufficient conditions for emergence, proving existence in Euclidean background.
result Strong emergence exists between certain parameterized Lagrangian field theories.

Given an oriented link in the 3-sphere, the Euler characteristic of its link Floer homology is known to coincide with its multivariate Alexander polynomial, an invariant only defined up to a sign and powers of the variables. In this paper, we get rid of this ambiguity by proving that this Euler characteristic is equal …

2014-08-15abs ↗pdf ↗

We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) a…

2015-10-06abs ↗pdf ↗

Finite quotients of fibered hyperbolic 3-manifold groups detect taut polynomials.

problem Detecting taut polynomials of fibered faces of Thurston norm balls
method Developing a framework for profinite invariance of twisted multivariable Alexander polynomials
result Proving finite quotients detect taut polynomials

A string link S can be closed in a canonical way to produce an ordinary closed link L. We also consider a twisted closing which produces a knot K. We give a formula for the Conway polynomial of L as a product of the Conway polynomial of K times a power series whose coefficients are given as explicit functions of the Mi…

1997-11-08abs ↗pdf ↗

HaKAN uses Hahn-KAN blocks to forecast multivariate time series.

problem Long-term time series forecasting challenges with high complexity and spectral bias.
method HaKAN integrates channel independence, patching, and a stack of Hahn-KAN blocks with residual connections. It uses Hahn polynomial-based learnable activation functions.
result HaKAN consistently outperforms state-of-the-art methods on various forecasting benchmarks.

New matching estimators correct bias in multivariate settings without smoothing parameters.

problem Bias in nearest-neighbor and matching estimators in multiple dimensions.
method Polynomial least squares fits on Voronoi tessellations.
result Novel estimators converge at n\sqrt{n} rate under mild smoothness assumptions.

Dye and Kauffman defined surface bracket polynomials for virtual links by use of surface states, and found a relationship between the surface states and the minimal genus of a surface in which a virtual link diagram is realized. They and Miyazawa independently defined a multivariable polynomial invariant of virtual lin…

2014-01-08abs ↗pdf ↗

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 ↗

Study proposes a method to construct copulas using corrected Hermite polynomial expansion for estimating foreign exchange volatility.

problem Estimating cross foreign exchange volatility with complex correlation structures.
method Applying corrections to the finite sum of multivariate Hermite polynomial expansions to construct copulas.
result The proposed copula method accurately reproduces the volatility smile of cross currency pairs.

A polynomial counterpart of the Seiberg-Witten invariant associated with a negative definite plumbed 3-manifold has been proposed by earlier work of the authors. It is provided by a special decomposition of the zeta-function defined by the combinatorics of the manifold. In this article we give an algorithm, based on mu…

2017-08-03abs ↗pdf ↗

We introduce closed-form transition density expansions for multivariate affine jump-diffusion processes. The expansions rely on a general approximation theory which we develop in weighted Hilbert spaces for random variables which possess all polynomial moments. We establish parametric conditions which guarantee existen…

2011-04-28abs ↗pdf ↗

The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of quantized gl(1|1) and sl(2). The corresponding face state sum models for the generalized…

2002-04-24abs ↗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.

The paper provides an almost optimal learning and testing algorithm for sparse polynomials.

problem Learning and testing sparse multivariate polynomials efficiently.
method The paper presents an algorithm with sublinear query complexity in 1/ε1/ε and almost linear in ss for learning and testing ss-sparse polynomials.
result The algorithm achieves almost optimal query complexity, making it the first of its kind.

Study Type CC skein modules using Sp(2n)Sp(2n) webs and construct transparent elements.

problem Understanding Type CC skein modules and constructing transparent elements.
method Diagrammatic approach using multivariable Chebyshev polynomials and explicit braiding formulas.
result Construction of transparent elements in the skein module at roots of unity.

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