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

137274410547 · Jun 202019922001200920172026
48 results for real 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.

In this paper, we study distribution of the zeros of the Alexander polynomials of knots and links in S^3. We call a knot or link "real stable" (resp. "circular stable") if all the zeros of its Alexander polynomial are real (resp. unit complex). We give a general construction of real stable and circular stable knots and…

2013-07-05abs ↗pdf ↗

A polynomial knot is a smooth embedding κ:nκ: \real \to \real^n whose components are polynomials. The case n=3n = 3 is of particular interest. It is both an object of real algebraic geometry as well as being an open ended topological knot. This paper contains basic results for these knots as well as many examples.

2006-12-28abs ↗pdf ↗

Origami structures are enumerated and shown to be quantum modular.

problem Counting and understanding origami structures with real structures.
method Using combinatorics of zonal polynomials and Schur polynomials, and relating to quantum modular forms and double Hurwitz numbers.
result The generating functions of certain origami structures are quantum modular forms.

This paper studies a specific blow-up algorithm for sop polynomials and their RLCT.

problem Determining the RLCT of sum-of-products polynomials through blow-up.
method Investigates a specific blow-up algorithm for sop polynomials to resolve their singularities.
result It is possible to resolve the singularities of sop polynomials using a specific blow-up algorithm.

The paper analyzes the asymptotic behavior of a knot polynomial for a specific real number.

problem Understanding the asymptotic behavior of a knot polynomial for a real number.
method Examining the asymptotic behavior of the NN-dimensional colored Jones polynomial evaluated at exp(ξ/N)\exp(ξ/N) for a real number ξξ.
result From the asymptotic behavior, the mSL(2;C) m{SL}(2;\mathbb{C}) Chern--Simons invariant and the Reidemeister torsion twisted by the adjoint action can be extracted.

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.

Using the same method we provide negative answers to the following questions: Is it possible to find real equations for complex polynomials in two variables up to topological equivalence (Lee Rudolph) ? Can two topologically equivalent polynomials be connected by a continuous family of topologically equivalent polynomi…

2002-10-21abs ↗pdf ↗

Machine learning identifies boundaries of real solutions in polynomial systems.

problem Locating boundaries in parameter space for real solutions of polynomial systems.
method Supervised machine learning approach using nearest neighbor and deep learning approximations.
result Efficiently approximates the real discriminant locus for multidimensional parameter spaces.

Hilbert's 17th problem asks that whether every nonnegative polynomial can be a sum of squares of rational functions. It has been answered affirmatively by Artin. However, the question as to whether a given nonnegative polynomial is a sum of squares of polynomials is still a central question in real algebraic geometry. …

2018-11-14abs ↗pdf ↗

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 investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both polynomials. We present a number of examples found through our calculations. We pro…

2011-10-21abs ↗pdf ↗

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.

Study introduces a new method for multiple parameter regularization in polynomial functional regression.

problem Handling varying regularization parameters in polynomial functional regression.
method Developed a theoretically grounded algorithm for multiple parameter regularization and model aggregation.
result Promising results from evaluations on synthetic and real-world data.

In this manuscript we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real coefficients and is a continuous function of the chain coordinates. This is used to d…

2020-01-05abs ↗pdf ↗

This paper improves flow models to better handle perturbations in real-world data.

problem Flow models amplify initial errors in perturbed data, leading to poor generalization.
method Utilizes Bernstein-type polynomials to construct Normalizing Flows (NF) for higher robustness.
result Proposed NF framework provides theoretical upper bounds and practical advantages.

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.

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…

2014-11-21abs ↗pdf ↗

We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the nature of optimal upper bounds in real fewnomial theory. We use a powerful recen…

2006-09-18abs ↗pdf ↗

A new method reduces the complexity of tensor products from cubic to quadratic, improving both speed and accuracy.

problem Efficiently computing high-dimensional tensor products for polynomial kernels.
method Complex-to-Real (CtR) modification of sketches using complex random projections.
result Achieves state-of-the-art performance in accuracy and speed.

Study polynomial structures on generalized tangent bundles and their compatibility with operators.

problem Understanding polynomial structures on generalized tangent bundles.
method Analyzing skew-symmetric endomorphisms satisfying polynomial equations and their compatibility with de Rham and Courant-Dorfman operators.
result Conditions equivalent to integrability of generalized almost complex structures.

Study on the growth of colored Jones polynomial for figure-eight knot cables.

problem Asymptotic behavior of colored Jones polynomial for figure-eight knot cables.
method Analyzing the asymptotic growth of the NN-dimensional colored Jones polynomial of a cable of the figure-eight knot.
result The growth rate of the colored Jones polynomial is exponential and related to the Chern-Simons invariant.

Study shows quantum modularity in figure-eight knot's colored Jones polynomial.

problem Asymptotic behavior of colored Jones polynomial of figure-eight knot.
method Analyzing polynomial evaluated at specific points and showing asymptotic equivalence.
result Quantum modularity demonstrated in the figure-eight knot's colored Jones polynomial.

A new method builds sparse polynomial chaos expansions for models with dependent inputs.

problem Quantifying uncertainty in models with dependent inputs.
method Data-driven approach to construct orthonormal polynomials recursively based on input correlations.
result Reduces the number of observations and improves numerical stability and computational efficiency.

Let f be a 1-variable complex polynomial such that f has a singularity at the origin. In the present paper, we show that there exists a deformation of f which has only fold singularities and cusps as singularities of a real polynomial map from the plane to the plane. We then calculate the number of cusps of a deformati…

2018-11-03abs ↗pdf ↗

Geodesics in jet space are constructed from polynomials, with some yielding globally minimizing paths.

problem Characterize geodesics in jet space and identify those that are globally minimizing.
method Sub-Riemannian geometry, Hamilton-Jacobi equations, and analysis of period degenerations.
result Some polynomials yield globally minimizing geodesics, with conjectures on the independence of cut time.