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

Trend · papers per month

20416181 · Jun 202019922001200920172026
48 results for trigonometric polynomials

The classical Tait-Kneser theorem states that the osculating circles of a smooth plane curve, free from curvature extrema, are pairwise disjoint. We prove a number of analogs of this theorem, e.g., for ovals of osculating cubics, osculating polynomials and trigonometric polynomials; in each case, we will obtain a non-d…

2006-02-14abs ↗pdf ↗

Study Fourier estimator for spot volatility with unbounded coefficients and jumps.

problem Estimating spot volatility with unbounded coefficients and jumps in price process.
method Fourier estimator for spot volatility, convergence analysis for unbounded coefficients and jumps.
result Convergence of trigonometric polynomial to volatility's path, almost sure convergence of reconstructed volatility.

The paper shows the computation of the noncommutative generalization of the A-polynomial of the trefoil knot. The classical A-polynomial was introduced by Cooper, Culler, Gillet, Long and Shalen, and was generalized to the context of Kauffman bracket skein modules by the author in joint work with Frohman and Lofaro. A …

2000-04-25abs ↗pdf ↗

Thickenings of a metric space capture local geometric properties of the space. Here we exhibit applications of lower bounding the topology of thickenings of the circle and more generally the sphere. We explain interconnections with the geometry of circle actions on Euclidean space, the structure of zeros of trigonometr…

2019-07-14abs ↗pdf ↗

Quantum neural networks approximate periodic functions more efficiently.

problem Approximating periodic functions with quantum neural networks.
method Using Jackson's inequality to construct a QNN that approximates a trigonometric polynomial of the function.
result Quantum neural networks can achieve better approximation results with fewer parameters for smoother functions.

Given a knot K in an Euclidean space E and a finite dimensional space V of smooth functions on K, we express the expected number of critical points of a random function in V in terms of an integral-geometric invariant of K and V. When V consists of the restrictions to K of homogeneous polynomials of degree d on E, this…

2010-06-07abs ↗pdf ↗

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.

For a real valued periodic smooth function u on R, n0n\ge 0, one defines the osculating polynomial φsφ_s (of order 2n+1) at a point sRs\in R to be the unique trigonometric polynomial of degree n, whose value and first 2n derivatives at s coincide with those of u at s. We will say that a point s is a clean maximal flex …

2001-06-12abs ↗pdf ↗

Deep Gaussian Processes are reinterpreted as deep trigonometric networks for tractable inference.

problem Challenging inference in DGPs due to intractable marginalization in latent function space.
method Viewing DGPs as deep trigonometric networks with Bochner's theorem, and using the wide limit with a bottleneck to translate DGPs into deep trigonometric networks.
result The weight space view yields the same effective covariance functions as obtained in function space, and varying prior distributions over network parameters is equivalent to employing different kernels.

Deformed σ-models linked to Ricci flow and Toda theories.

problem Understanding the relationship between deformed σ-models and geometric flows.
method Exploring trigonometric deformations of CP^n-1 models and their duals, linking to Ricci flow and Toda field theories.
result Trigonometric deformations of CP^n-1 models solve the Ricci flow equation and relate to Toda field theories.

Sigma models linked to Gross-Neveu models via quiver varieties.

problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.

This paper is focused on geometric aspects of two particular types of finite-variable reductions in the dispersionless Toda hierarchy. The reductions are formulated in terms of "Landau-Ginzburg potentials" that play the role of reduced Lax functions. One of them is a generalization of Dubrovin and Zhang's trigonometric…

2012-06-06abs ↗pdf ↗

We prove a Chern-Lashof type formula computing the expected number of critical points of smooth function on a smooth manifold MM randomly chosen from a finite dimensional subspace VC(M)V\subset C^\infty(M) equipped with a Gaussian probability measure. We then use this formula this formula to find the asymptotics of the e…

2010-08-30abs ↗pdf ↗

Study geodesics on Grushin spaces, proving upper bounds on conjugate times.

problem Classify geodesics on higher-dimensional Grushin spaces.
method Solve Hamilton's equations using calculus of generalized trigonometric functions, analyze symmetries, and use density arguments.
result Prove a conjectured cut time provides an upper bound on conjugate times.

In this paper we investigate the construction of state models for link invariants using representations of the braid group obtained from various gauge choices for a solution of the trigonometric Yang-Baxter equation. Our results show that it is possible to obtain invariants of regular isotopy (as defined by Kauffman) w…

2000-04-27abs ↗pdf ↗

Study shows overparameterization helps in generalizing from smooth interpolants.

problem Understanding generalization in overparameterized linear models.
method Analysis of random Fourier series model with weighted trigonometric interpolation.
result Weighted trigonometric interpolation leads to lower generalization error in overparameterized scenarios.

Study finds the minimum number of finite Gaussian mixtures for best approximation.

problem Finding the minimum number of finite Gaussian mixtures for best approximation.
method Local moment matching for upper bound and spectral analysis for lower bound.
result Corrects a previous lower bound in the case of Gaussian mixing distributions.

Fox's trapezoidal conjecture for four-strand Turk's head knots is proven.

problem Proving log-concavity of the coefficient sequence of Dn(z)D_n(z) for four-strand Turk's head knots.
method Four-block smoothing theorem for products of reciprocal quartics.
result The coefficient sequence of Dn(z)D_n(z) is log-concave.

We study random knots, which we define as a triple of random periodic functions (where a random function is a random trigonometric series, \[f(θ) = \sum_{k=1}^\infty a_k \cos (k θ) +b_k (\sin k θ),\] with ak,bka_k, b_k are independent gaussian random variables with mean 00 and variance σ(k)2σ(k)^2 - our results will depend …

2016-07-18abs ↗pdf ↗

Researchers prove continuity of knot invariant under modular transformations.

problem Continuity of the figure-eight knot's colored Jones polynomial under modular transformations.
method Analyzing the figure-eight knot's colored Jones polynomial and using trigonometric products.
result Continuity of the quotient function for all irrationals.

This research optimizes Andrews plots for better visual clarity in high-dimensional data.

problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.

Improved Gaussian Process regression using TQFF over RFF and Gaussian QFF.

problem Limited performance of Quadrature Fourier Features (QFF) in approximating highly oscillatory functions.
method Developed Trigonometric Quadrature Fourier Features (TQFF) using a novel non-Gaussian quadrature rule.
result TQFF provides better approximation accuracy and fewer features compared to RFF and Gaussian QFF.

We develop a transitional geometry, that is, a family of geometries of constant curvatures which makes a continuous connec-tion between the hyperbolic, Euclidean and spherical geometries. In this transitional setting, several geometric entities like points, lines, dis-tances, triangles, angles, area, curvature, etc. as…

2014-11-21abs ↗pdf ↗

This is the introduction I wrote for the multi-authored book "From Riemann to differential geometry and relativity", edited by L. Ji, A. Papadopoulos and S. Yamada (Berlin, Springer verlag, 2017). The book consists of twenty chapters, written by various authors. This introduction, besides giving the information on the …

2017-09-01abs ↗pdf ↗

A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions sin\sin and cos\cos. Apparently, this method may be very useful for explicit description of solutions of optimal control problems with two-dimensional control. Using this method a series of sub-Fin…

2018-07-21abs ↗pdf ↗

An innovative extension of Geometric Brownian Motion model is developed by incorporating a weighting factor and a stochastic function modelled as a mixture of power and trigonometric functions. Simulations based on this Modified Brownian Motion Model with optimal weighting factors selected by goodness of fit tests, sub…

2015-07-08abs ↗pdf ↗

New method recovers radar and communication signals from overlaid data.

problem Recover radar and communication signals from overlaid data with unknown parameters.
method Propose minimizing the sum of multivariate atomic norms (SoMAN) for multi-antenna receiver.
result Minimum number of samples and antennas required for perfect recovery is logarithmically dependent on the maximum of radar targets and communications paths.

We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main novelty of these results is a Banach space setting instead of a Hilbert space setti…

2013-03-27abs ↗pdf ↗

Recently, the explicit volume formulae for hyperbolic cone-manifolds, whose underlying space is the 3-sphere and the singular set is the knot 414_1 and the links 5125^2_1 and 6226^2_2, have been obtained by the second named author and his collaborators. In this paper we explicitly find the hyperbolic volume for cone-mani…

2003-07-14abs ↗pdf ↗

It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse approximation with respect to the trigonometric system, (3) sparse approximation with …

2015-11-05abs ↗pdf ↗

The notion of a generalized harmonic inverse mean curvature surface in the Euclidean four-space is introduced. A backward Bäcklund transform of a generalized harmonic inverse mean curvature surface is defined. A Darboux transform of a generalized harmonic inverse mean curvature surface is constructed by a backward Bäck…

2012-11-20abs ↗pdf ↗