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

Trend · papers per month

17345168 · May 202619922001200920172026
48 results for recursive description

We formulate and discuss two conjectures concerning recursive formulae for Branson's QQ-curvatures. The proposed formulae describe all QQ-curvatures on manifolds of all even dimensions in terms of respective lower order QQ-curvatures and lower order GJMS-operators. They are universal in the dimension of the underlyi…

2008-04-17abs ↗pdf ↗

Using methods of math.DG/0304245 and [I.S.Krasil'shchik and P.H.M.Kersten, Symmetries and recursion operators for classical and supersymmetric differential equations, Kluwer, 2000], we accomplish an extensive study of the N=1 supersymmetric Korteweg-de Vries equation. The results include: a description of local and non…

2003-05-15abs ↗pdf ↗

We propose and discuss recursive formulas for conformally covariant powers P2NP_{2N} of the Laplacian (GJMS-operators). For locally conformally flat metrics, these describe the non-constant part of any GJMS-operator as the sum of a certain linear combination of compositions of lower order GJMS-operators (primary part) a…

2009-05-25abs ↗pdf ↗

We define and study the category of symmetric sl2\mathfrak{sl}_2-webs. This category is a combinatorial description of the category of all finite dimensional quantum sl2\mathfrak{sl}_2-modules. Explicitly, we show that (the additive closure of) the symmetric sl2\mathfrak{sl}_2-spider is (braided monoidally) equivalent to …

2015-01-05abs ↗pdf ↗

In this paper we prove that if MKM_K is the complement of a non-fibered twist knot KK in S3\mathbb S^3, then MKM_K is not commensurable to a fibered knot complement in a Z/2Z\mathbb Z/ 2 \mathbb Z-homology sphere. To prove this result we derive a recursive description of the character variety of twist knots and then pro…

2003-11-05abs ↗pdf ↗

The paper explores generalizations of Mirzakhani's recursion and computes volumes for physical gravity models.

problem Computing volumes for physical gravity models.
method Topological recursion and physical two-dimensional gravity models.
result Derivation of Virasoro constraints and cut-and-join equations for generalized Mirzakhani's recursions.

New approach detects sensitive info in text, outperforming previous methods.

problem Detecting sensitive information in unstructured text documents.
method Developed novel recursive neural network approaches for sensitive info detection, assuming only labeled examples.
result Our approaches significantly outperform previous keyword-based methods on real-world data.

Harer and Zagier proved a recursion to enumerate gluings of a 2d2d-gon that result in an orientable genus gg surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other enumerative problems, so it is natural to pose the following question: how large is t…

2018-12-31abs ↗pdf ↗

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.

This work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.

problem Analyzing the relationship between Seiberg-Witten curves and topological recursion.
method Analytical approach using Seiberg-Witten family of curves.
result A generalized formula relating Seiberg-Witten prepotential to the genus zero part of topological recursion on a Seiberg-Witten curve.

LASER compresses recursive model activations by exploiting their low-dimensional structure.

problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.

Consider the space of `long knots' in R^n, K_{n,1}. This is the space of knots as studied by V. Vassiliev. Based on previous work of the authors, it follows that the rational homology of K_{3,1} is free Gerstenhaber-Poisson algebra. A partial description of a basis is given here. In addition, the mod-p homology of this…

2005-04-10abs ↗pdf ↗

We describe a method for recursively calculating Gromov-Witten invariants of all blowups of the projective plane. This recursive formula is different from the recursive formulas due to Göttsche and Pandharipande in the zero genus case, and Caporaso and Harris in the case of no blowups. We use tropical curves and a recu…

2014-11-20abs ↗pdf ↗

Topological recursion recovers a specific partition function for colored knots.

problem Recovering the extended Ooguri-Vafa partition function for colored HOMFLY-PT polynomials of torus knots.
method Applying topological recursion to the spectral curve of colored HOMFLY-PT polynomials of torus knots.
result Topological recursion reproduces the n-point functions of the extended Ooguri-Vafa partition function.

We derive the Do and Norbury recursion formula for the one-loop mean of an irregular spectral curve from a variant of replica method by Brezín and Hikami. We express this recursion in special times in which all terms W1(g)W_1^{(g)} of the genus expansion of the one-loop mean are polynomials. We find a generalization of th…

2015-12-31abs ↗pdf ↗

This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a s…

2016-05-19abs ↗pdf ↗

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

problem Deriving a recursion relation for hyperbolic string vertices and its implications for string field theory.
method Using systolic volumes and a modified Mirzakhani's recursion, we construct a higher-order vertex determination for hyperbolic string field theory.
result The higher order vertices in hyperbolic string field theory are determined by the cubic vertex iteratively for any background.

Benchmarking recursive collapse claims with a new framework under false-positive control.

problem Evaluating recursive systems for failure patterns and warning claims.
method Developed Loopzero framework for testing recursive failures, specified claim boundaries in Lean, evaluated under FP constraint, and compared with standard detectors.
result No standard detectors or Loopzero's pre-registered quantile detector achieved the required operating point under the false-positive contract.

SRRM improves recursive transport surrogates in the small-discrepancy regime.

problem Insufficient understanding of recursive partitioning methods' statistical behavior and resolution in the small-discrepancy regime.
method Introduced Selective Recursive Rank Matching (SRRM) to improve the resolution of Recursive Rank Matching (RRM).
result SRRM yields a higher-fidelity practical surrogate for the Wasserstein distance at moderate additional computational cost.

Study uses reinforcement learning to optimize portfolios under recursive utility.

problem Improving portfolio allocation using risk-sensitive objectives.
method Approximated certainty equivalent via Monte Carlo, trained actor-critic algorithms (PPO, A2C).
result Recursive-utility agent outperforms discounted baseline in Sharpe ratio, max drawdown, and cumulative return.

The paper studies risk-sensitive MDPs with recursive risk measures.

problem Risk-sensitive decision-making in MDPs with unbounded costs.
method Recursive application of static risk measures, Bellman equation derivation, existence of optimal policies.
result Existence of Markovian optimal policies for infinite planning horizons, contractive model for stationary optimal policy.

New recursive relation found for a specific torus knot.

problem Finding a recursive relation for a specific torus knot.
method Extending colored Jones polynomials to knots in (2p+1,2)(2p+1,2) torus knot complements and examining a particular knot.
result An analogous recursive relation exists for a specific (2p+1,2)(2p+1,2) torus knot.

We propose a general theory for constructing functorial assignments ΣΩΣE(Σ)Σ\longmapsto Ω_Σ \in E(Σ) for a large class of functors EE from a certain category of bordered surfaces to a suitable target category of topological vector spaces. The construction proceeds by successive excisions of homotopy classes of embedded pai…

2017-11-13abs ↗pdf ↗

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

We study topological recursion on the irregular spectral curve xy2xy+1=0xy^2-xy+1=0, which produces a weighted count of dessins d'enfant. This analysis is then applied to topological recursion on the spectral curve xy2=1xy^2=1, which takes the place of the Airy curve x=y2x=y^2 to describe asymptotic behaviour of enumerative proble…

2014-12-29abs ↗pdf ↗

We extend topological recursion to twisted Higgs bundles with singularities.

problem Computing Taylor expansions of period matrices for twisted Higgs bundles.
method We introduce a twisted topological recursion on the spectral curve of a twisted Higgs bundle, encoding singularities and performing the recursion explicitly.
result The g=0g=0 twisted Eynard-Orantin differentials compute the Taylor expansion of the spectral curve's period matrix, independent of the ambient space.

In this paper, we take up the analysis of a principal/agent model with moral hazard introduced in [17], with optimal contracting between competitive investors and an impatient bank monitoring a pool of long-term loans subject to Markovian contagion. We provide here a comprehensive mathematical formulation of the model …

2012-02-09abs ↗pdf ↗

This paper is a computation of the homotopy type of K, the space of long knots in R^3, the same space of knots studied by Vassiliev via singularity theory. Each component of K corresponds to an isotopy class of long knot, and we `enumerate' the components via the companionship trees associated to the knot. The knots wi…

2005-06-25abs ↗pdf ↗

Theoretical study on AI models' resilience to data contamination during recursive training.

problem Data contamination in recursive training of generative AI models.
method General framework with minimal assumptions on real data distribution and flexible generative models.
result Contaminated recursive training converges with a rate equal to the minimum of baseline model's rate and contamination fraction.

Paper studies metric ribbon graphs and provides a recursion for their volumes.

problem Calculating volumes of combinatorial moduli spaces of directed metric ribbon graphs.
method Decomposes directed ribbon graphs into simpler graphs with one vertex, proving a canonical recursion scheme for volumes.
result Explicit recursion for volumes of four-valent metric ribbon graphs provided.