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

4182122163 · Jun 202019922001200920172026
48 results for analytic polynomials

Analytic functions on specific domains are characterized by their smoothness and composites with polynomial curves.

problem Characterizing real analytic functions on closed subanalytic domains.
method Analyzing functions defined on closed uniformly polynomially cuspidal sets in Rn\mathbb{R}^n using composites with polynomial curves.
result Conditions for a function to be real analytic are effectively related to the regularity of the boundary of the domain.

Analytic networks with bounded coefficients can't outperform polynomial approximations.

problem Approximation limits of neural networks with analytic activation functions under coefficient constraints.
method Deterministic analysis using comparison argument and Bernstein-type estimates.
result Networks with analytic activation functions and controlled coefficients cannot outperform classical polynomial approximation rates on non-analytic targets.

The paper proves deep neural networks with analytic activation can approximate any function.

problem Approximating functions with neural networks using analytic activation functions.
method Elementary proofs for real and complex networks, Stone-Weierstrass theorem, Mergelyan's theorem.
result Closure of neural network classes equals space of polynomials for analytic activation.

The paper proves real-analyticity of superintegrable metrics and solves two conjectures.

problem Proving real-analyticity of superintegrable metrics and solving conjectures.
method Analyzing Poisson brackets and constructing new superintegrable systems.
result Proves real-analyticity of superintegrable metrics and solves two conjectures.

We obtain a complete time expansion of the pull-back operator generated by a real analytic flow of real analytic automorphisms acting on analytic tensor sections of a manifold. Our expansion is given in terms of multiple Lie derivatives. Motivated by this expansion, we provide a rather simple and explicit estimate for …

2018-06-21abs ↗pdf ↗

Approximates discounted moments for financial products using polynomial expansions.

problem Approximating discounted moments of stochastic processes for financial applications.
method High-order power series expansion of the infinitesimal generator.
result Error decreases to around 10 to 100 times machine precision for higher orders.

Study resolves polynomial germs, proving no mixed critical points and strict transform properties.

problem Resolving mixed critical points and properties of strict transforms of polynomial germs.
method Toric resolutions and modifications of weighted homogeneous polynomials.
result No mixed critical points and strict transform properties as germs.

The paper generalizes polynomial functions on Lie groups and their properties.

problem Generalizing polynomial functions on Lie groups and understanding their properties.
method Generalizing the notion of polynomial functions and horizontally affine maps on Lie groups.
result S-polynomial functions are equivalent to polynomial functions in the sense of Leibman in connected nilpotent Lie groups.

To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose nnth term is the nnth colored Jones polynomial. The Volume Conjecture for small angles states that the value of the nn-th colored Jones polynomial at $e^{\a/n}$ is a sequence of complex numbers that grows subexponentially, for a fixed s…

2005-03-28abs ↗pdf ↗

Neural networks learn modular arithmetic but not all, extending known solutions to generalize.

problem Neural networks struggle with modular arithmetic, especially for polynomials.
method Developed analytical solutions for MLP networks to learn modular addition and multiplication, then combined these solutions to generalize on arbitrary modular polynomials.
result Neural networks can learn and generalize solutions to modular polynomials, supporting the hypothesis that some polynomials are learnable.

The detrending moving average (DMA) algorithm is one of the best performing methods to quantify the long-term correlations in nonstationary time series. Many long-term correlated time series in real systems contain various trends. We investigate the effects of polynomial trends on the scaling behaviors and the performa…

2015-04-28abs ↗pdf ↗

This paper simplifies conditional Sobol' indices calculation using PCE bases.

problem Computational inefficiency and lack of consistency in evaluating conditional Sobol' indices.
method Analytical extraction of conditional Sobol' indices via basis decomposition of PCE expansions.
result Derives closed-form expressions for conditional Sobol' indices.

This paper presents a new method for solving systems with polynomial stiffness.

problem Finding analytical solutions to nonlinear differential equations with polynomial stiffness is challenging.
method The paper introduces a geometric/algebraic method using generating series and shuffle product.
result The method provides a recursive schematic that can be automated and applied to systems with polynomial stiffness.

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.

We derive analytic series representations for European option prices in polynomial stochastic volatility models. This includes the Jacobi, Heston, Stein-Stein, and Hull-White models, for which we provide numerical case studies. We find that our polynomial option price series expansion performs as efficiently and accura…

2017-11-25abs ↗pdf ↗

Extends machine learning models for analytic boundary conditions in differential equations.

problem Inclusion of data in differential equations using symbolic algorithms.
method Combines computer algebra with Gaussian processes and extends to analytic boundary conditions using Gröbner and Janet bases of Weyl algebras.
result Describes divergence-free flow in domains bounded by analytic functions.

Mathematical problems of digital terrain analysis include interpolation of digital elevation models (DEMs), DEM generalization and denoising, and computation of morphometric variables by calculation of partial derivatives of elevation. Traditionally, these procedures are based on numerical treatments of two-variable di…

2015-07-14abs ↗pdf ↗

Wide networks with polynomial activations have proven asymptotic behavior.

problem Understanding the behavior of neural networks in the large width limit.
method Proving a conjecture for deep networks with polynomial activation functions.
result Tight bounds on the behavior of wide networks during stochastic gradient descent and derivation of their finite-width dynamics.

The Jones polynomial of a knot in 3-space is a Laurent polynomial in qq, with integer coefficients. Many people have pondered why is this so, and what is a proper generalization of the Jones polynomial for knots in other closed 3-manifolds. Our paper centers around this question. After reviewing several existing defin…

2006-01-07abs ↗pdf ↗

Smooth knots with odd Conway polynomial terms have inscribed trefoils.

problem Finding inscribed trefoils for smooth knots with specific polynomial terms.
method Using a perturbation of the double-cover of the orientation class and analyzing planar configurations.
result Smooth knots with odd quadratic terms of the Conway polynomial have inscribed trefoils.

Algorithm finds real-analytic Legendrian representatives for every link type.

problem Finding explicit expressions for Legendrian representatives and Bateman fields.
method Algorithm based on trigonometric polynomials and solving linear equations.
result No compact subset of R^3 can contain an electromagnetic knot indefinitely.

We generalize a theorem of Bismut-Zhang, which extends the Cheeger-Mueller theorem on Ray-Singer torsion and Reidemeister torsion, to the case where the flat vector bundle over a closed manifold carries a nondegenerate symmetric bilinear form. As a consequence, we prove the Burghelea-Haller conjecture which gives an an…

2006-10-19abs ↗pdf ↗

This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of maximal variance by means of curves, instead of straight lines. Co…

2016-01-31abs ↗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

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.

We study complex analytic (possibly singular) projective connections on the plane. We characterize some of them in terms of their families of integral curves. We also give a beginning of classification of second order odes polynomial in the first and second derivatives, and with holomorphic coefficients.

2014-01-10abs ↗pdf ↗

OPAA estimates probability densities using functional analysis.

problem Estimating probability density functions efficiently and accurately.
method OPAA uses a parallelizable algorithm based on functional analysis to estimate probability distributions.
result OPAA provides an efficient method to estimate probability density functions and normalizing weights.

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the Gelfand-Mazur Theorem. We give a related proof that an irreducible real polynom…

2015-02-01abs ↗pdf ↗

The projective hull X^ of a subset X in complex projective space P^n is an analogue of the classical polynomial hull of a set in C^n. If X is contained in an affine chart C^n on P^n, then the affine part of X^ is the set of points x in C^n for which there exists a constant M=M_x so that |p(x)| < M^d sup{|p(y)| : y in X…

2006-11-15abs ↗pdf ↗

Proves solution uniqueness for biomembrane shape prediction.

problem Proving solution uniqueness for the genus one Canham variational problem.
method Combining numeric analytic continuation and singularity analysis to prove non-negativity of a sequence.
result Proves positivity of the sequence, leading to solution uniqueness.

The study optimizes polynomial regression for learning under Gaussian distributions.

problem Agnostic learning of Boolean and real-valued functions under Gaussian distributions.
method LP duality and polynomial degree analysis for L1L^1-regression.
result Optimal SQ lower bounds for various function classes.

Hermite polynomials improve private data generation by reducing feature count.

problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.

Resurgent analysis reveals full partition function for 3-manifold invariants.

problem Analyzing resurgence in 3-manifold invariants for SL(2,C)SL(2, \mathbb{C}).
method Resurgent analysis applied to infinite families of Seifert manifolds and torus knot complements.
result The contribution from abelian flat connections contains information of all non-abelian flat connections, indicating a full partition function.