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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199319922001200920172026
48 results for polynomial variable projection

Let KS3K\subset S^3 be a knot, X:=S3KX:= S^3\setminus K its complement, and T\mathbb{T} the circle group identified with R/Z\mathbb{R}/\mathbb{Z}. To any oriented long knot diagram of KK, we associate a quadratic polynomial in variables bijectively associated with the bridges of the diagram such that, when the variables pr…

2017-04-24abs ↗pdf ↗

Paper reduces turbomachinery CFD simulations by identifying key dimensions.

problem Reducing computational cost in turbomachinery 3D CFD simulations.
method Statistical sufficient dimension reduction methods and polynomial variable projection.
result Polynomial variable projection accurately identifies dimension reducing subspaces at lower cost.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

Proves divisibility relations for symplectic curve polynomials.

problem Divisibility relations for symplectic curve polynomials.
method New proofs of divisibility relations for Oka and Alexander polynomials of symplectic curves.
result Proves Libgober's divisibility relations for symplectic curves.

We construct a 2-variable link polynomial, called WLW_L, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two 1-variable polynomials, one of which is the Alexander polynomial. We refine WLW_L

2007-04-23abs ↗pdf ↗

The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the Tutte polynomial of planar graphs to graphs that are embedded in closed oriented s…

2006-05-21abs ↗pdf ↗

The paper certifies projective rigidity for once-punctured torus bundles using twisted Alexander polynomials.

problem Certifying infinitesimal projective rigidity for hyperbolic once-punctured torus bundles.
method Using twisted Alexander polynomials of representations associated with the holonomy.
result The induced action on the tangent space of the character variety matches the group theoretic action.

We define a family of generalizations of the two-variable quandle polynomial. These polynomial invariants generalize in a natural way to eight-variable polynomial invariants of finite biquandles. We use these polynomials to define a family of link invariants which further generalize the quandle counting invariant.

2008-01-18abs ↗pdf ↗

The Kauffman-Vogel polynomials are three variable polynomial invariants of 44-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented 44-valent rigid vertex graphs was given by using the Kauffman bracket and the Jones-Wenzl idempotent colored with 22. Bataineh, Elha…

2017-08-30abs ↗pdf ↗

The paper characterizes complex projective spaces using Ehrhart polynomials.

problem Characterizing complex projective spaces via Ehrhart polynomials.
method Using Ehrhart polynomials associated with integral multiples of the standard simplex, the paper proves characterizations of polarized toric manifolds.
result Characterizations of complex projective spaces (CPn)(\mathbb{C} P^n) are achieved for specific cases.

New method detects projective equivalences and symmetries in rational 3D curves.

problem Detecting projective equivalences and symmetries in rational 3D curves.
method Using differential invariants and Möbius transformations to avoid solving large polynomial systems.
result Efficient algorithm for detecting projective equivalences and symmetries without solving large polynomial systems.

We extend the state models for Jones and Alexander polynomials of classical links to state models of 2-variable polynomials in the case of singular links. Moreover, we extend both of them to polynomials with d+1 variables for long singular knots with exactly d double points. These extensions can detect non-invertibilit…

2007-06-01abs ↗pdf ↗

New findings on Jones polynomial for 4-strand braids.

problem Whether there are non-trivial knots with trivial Jones polynomial.
method Study of 4-strand braids, exploration of various properties of hypothetical HOMFLY-PT polynomials.
result Existence of a 1-parameter family of 2-variable polynomials that can be HOMFLY-PT polynomials of some knots.

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic properties of such chain complexes, including long-exact sequences associated to deletio…

2012-05-12abs ↗pdf ↗

A new polynomial invariant for strongly involutive links.

problem Characterizing strongly involutive links using polynomial invariants.
method Introducing a two-variable polynomial invariant \(P^e\) with equivariant skein relations.
result Specialisation of \(P^e\) recovers the graded Euler characteristic of a spectral sequence.

This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, Kaufman two-variable polynomial, and Khovanov polynomial.

2011-06-20abs ↗pdf ↗

F. Jaeger presented the two-variable Kauffman polynomial of an unoriented link L as a weighted sum of HOMFLY-PT polynomials of oriented links associated with L. Murakami, Ohtsuki and Yamada (MOY) used planar graphs and a recursive evaluation of these graphs to construct a state model for the sl(n)-link invariant (a one…

2013-04-17abs ↗pdf ↗

The Vol-Det Conjecture relates the volume and the determinant of a hyperbolic alternating link in S3S^3. We use exact computations of Mahler measures of two-variable polynomials to prove the Vol-Det Conjecture for many infinite families of alternating links. We conjecture a new lower bound for the Mahler measure of cer…

2018-05-14abs ↗pdf ↗

Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…

2009-06-18abs ↗pdf ↗

We present a new 2-variable generalization of the Jones polynomial that can be defined through the skein relation of the Jones polynomial. The well-definedness of this new generalization is proved both algebraically and diagrammatically as well as via a closed combinatorial formula. This new invariant is able to distin…

2016-08-05abs ↗pdf ↗

We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.

2015-09-28abs ↗pdf ↗

This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, and Kaufman two-variable polynomial, Khovanov homology, factorizability of the polynomials, and knot primeness detection.

2011-07-10abs ↗pdf ↗

Polynomial delay algorithm tests causal models with hidden variables.

problem Testing causal models with hidden variables in polynomial delay.
method c-component local Markov property (C-LMP) and polynomial delay algorithm.
result First algorithm for poly-delay testing of CIs in causal graphs with hidden variables.

Algorithm learns polynomials in Gaussian inputs with reduced sample complexity.

problem Learning polynomials of few relevant dimensions in high-dimensional data.
method Filtered PCA for warm start, geodesic SGD for accuracy.
result Sample complexity roughly N=Or,d(nlog2(1/ε)(logn)d)N = O_{r,d}(n \log^2(1/ε) (\log n)^d), runtime Or,d(Nn2)O_{r,d}(N n^2).

New invariant CWRCWR for alternating links is stronger than existing invariants.

problem Developing a stronger invariant for alternating links.
method Introducing CWRCWR invariant as an array of two-variable polynomials.
result The CWRCWR invariant is stronger than classical invariants like HOMFLYPT and Kauffman polynomials.

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ". The purpose of this paper is to extend such a point of view to differential module…

2012-12-19abs ↗pdf ↗

New geometric approach for analyzing compositional data like gut microbiomes.

problem Analyzing non-negative compositional data with relative values only.
method Reinterpret compositional data as quotient topology of a sphere, using spherical harmonics and reflection group actions.
result Construction of Reproducing Kernel Hilbert Space (RKHS) for compositional data.

This paper presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm introduced in Lee et al. (2013). In PPF, trees are constructed by splitting on linear combinations of randomly chosen variables. Projection pursuit is used to choos…

2018-07-19abs ↗pdf ↗

We define a multi-variable version of the Affine Index Polynomial for virtual links. This invariant reduces to the original Affine Index Polynomial in the case of virtual knots, and also generalizes the version for compatible virtual links recently developed by L. Kauffman. We prove that this invariant is a Vassiliev i…

2019-09-09abs ↗pdf ↗

Non-Gaussian component analysis (NGCA) is a problem in multidimensional data analysis which, since its formulation in 2006, has attracted considerable attention in statistics and machine learning. In this problem, we have a random variable XX in nn-dimensional Euclidean space. There is an unknown subspace ΓΓ of the …

2018-07-13abs ↗pdf ↗