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

3672107143 · Jun 202019922001200920172026
48 results for universal polynomials

We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY and Kauffman polynomials at SL and SO/Sp lines on Vogel's plane, and give their ex…

2015-10-20abs ↗pdf ↗

The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.

problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted CkC^k-spaces and weighted Sobolev spaces over unbounded domains.

The universal sl_2 invariant of bottom tangles has a universality property for the colored Jones polynomial of links. Habiro conjectured that the universal sl_2 invariant of boundary bottom tangles takes values in certain subalgebras of the completed tensor powers of the quantized enveloping algebra U_h(sl_2) of the Li…

2011-03-11abs ↗pdf ↗

Kernel methods have been widely applied to machine learning and other questions of approximating an unknown function from its finite sample data. To ensure arbitrary accuracy of such approximation, various denseness conditions are imposed on the selected kernel. This note contributes to the study of universal, characte…

2013-10-21abs ↗pdf ↗

New quantum knot invariants derived from Verma modules.

problem Constructing universal quantum knot invariants from Verma modules.
method Defining level N universal invariants from finite quotients of Verma modules over quotient rings.
result Maximal universal invariants for prime N, interpolating Jones and ADO polynomials.

New geometric invariant from disc intersections captures all coloured Jones polynomials.

problem Constructing a universal knot invariant from configuration spaces.
method Defining a new local system and Lagrangian submanifolds in the disc.
result The new invariant recovers Habiro's universal invariant and more.

In the first of these two lectures, I describe a gauge theory approach to understanding quantum knot invariants as Laurent polynomials in a complex variable q. The two main steps are to reinterpret three-dimensional Chern-Simons gauge theory in four dimensional terms and then to apply electric-magnetic duality. The var…

2014-01-27abs ↗pdf ↗

Sample- and computationally-efficient distribution estimation is a fundamental tenet in statistics and machine learning. We present SURF, an algorithm for approximating distributions by piecewise polynomials. SURF is: simple, replacing prior complex optimization techniques by straight-forward {empirical probability} ap…

2020-02-22abs ↗pdf ↗

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.

Observational data hints at a finite universe, with spherical manifolds such as the Poincare dodecahedral space tentatively providing the best fit. Simulating the physics of a model universe requires knowing the eigenmodes of the Laplace operator on the space. The present article provides explicit polynomial eigenmodes…

2005-02-27abs ↗pdf ↗

We construct the universal sl(2)-tangle cohomology using an approach with webs and dotted foams. This theory depends on two parameters, and for the case of links it is a categorification of the unnormalized Jones polynomial of the link.

2008-02-20abs ↗pdf ↗

Constructs new topological theories in 2D not fitting standard axioms.

problem Developing new topological theories in 2D that don't conform to traditional axioms.
method Universal construction by Blanchet et al., Kronecker's characterization, field extension, Hankel matrices, Schur polynomials, and foam evaluation.
result Introduction of non-multiplicative theories and classification over finite-dimensional state spaces.

New invariant fully describes finite type invariants of knots in homology 3-spheres.

problem Constructing a universal finite type invariant for knots in homology 3-spheres.
method Refined construction of a new invariant that is strictly stronger and universal.
result New invariant fully describes the graded space of finite type invariants of knots in homology 3-spheres.

New approach to quantum knot invariants using perturbed Gaussian generating functions.

problem Developing universal quantum knot invariants.
method Introducing generating functions of the form PeGPe^G where GG is quadratic and PP is a perturbation, and developing a calculus for such functions.
result The rank one invariant ZD\mathbf{Z}_\mathbb{D} dominates sl2\mathfrak{sl}_2-colored Jones polynomials and relates to knot genus and Whitehead doubling.

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

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.

In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials. Applications to Artin groups and positive braids are given.

2008-05-17abs ↗pdf ↗

Novel approach to financial derivatives pricing using rough path theory.

problem No-arbitrage conditions in financial markets necessitating precise integration methods.
method Developed a polynomial-based approximation class for rough path functionals, extending to non-geometric rough paths.
result Motivated a hypothesis for payoff functionals in financial markets, facilitating analysis.

We prove explicit formulas for Chern classes of tensor products of vector bundles, with coefficients given by certain universal polynomials in the ranks of the two bundles.

2010-11-30abs ↗pdf ↗

The universal sl_2 invariant of string links has a universality property for the colored Jones polynomial of links, and takes values in the h-adic completed tensor powers of the quantized enveloping algebra of sl_2. In this paper, we exhibit explicit relationships between the universal sl_2 invariant and Milnor invaria…

2014-05-13abs ↗pdf ↗

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

Analyzes the differential expansion of knot polynomials, focusing on its applicability and modifications.

problem Understanding the differential expansion of colored knot polynomials, especially for non-trivial knots and those with defects.
method Examines the current status of differential expansion, analyzes its applicability to non-trivial knots, and introduces a new transformation.
result A new transformation VV that converts Z\cal{Z} to standard ZZ-factors and allows for the calculation of FF.

We define a graph algebra version of the stationary phase integration over the coadjoint orbits in the Reshetikhin formula for the colored Jones-HOMFLY polynomial. As a result, we obtain a `universal' U(1)-RCC invariant of links in rational homology spheres, which determines the U(1)-RCC invariants based on simple Lie …

2002-01-15abs ↗pdf ↗

Neural networks can approximate functions uniformly across various measures.

problem Universal approximation of functions across different probability measures.
method Proving neural networks are dense in Orlicz spaces, extending classical theorems.
result Neural networks uniformly approximate functions for weakly compact families of measures.

The Magnus expansion is a universal finite type invariant of pure braids with values in the space of horizontal chord diagrams. The Conway polynomial composed with the short circuit map from braids to knots gives rise to a series of finite type invariants of pure braids and thus factors through the Magnus map. We descr…

2010-01-14abs ↗pdf ↗

This paper improves support recovery in universal one-bit compressed sensing with fewer measurements.

problem Support recovery in universal one-bit compressed sensing.
method Developed algorithms to recover the support of sparse signals with a small number of false positives.
result Support recovery with ildeO(k3/2) ilde{O}(k^{3/2}) measurements, improving to ildeO(k) ilde{O}(k) with known dynamic range.

This paper improves support recovery in universal one-bit compressed sensing.

problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.

In this thesis we define and study a categorification of the sl(N)-link polynomial using foams, for N\geq 3. For N=3 we define the universal sl(3)-link homology, using foams, which depends on three parameters and show that it is functorial, up to scalars, with respect to link cobordisms. Our theory is integral. We show…

2008-07-16abs ↗pdf ↗