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

12.5%25.0%37.5%50.0% · Jan 199419922001200920172026
48 results for intersection indices

Upper bounds for Steklov eigenvalues derived from intersection indices.

problem Finding upper bounds for Steklov eigenvalues of submanifolds in Euclidean space.
method Using intersection indices of submanifolds and their boundaries.
result Explicit upper bounds involving intersection index, volume, and dimensional constants.

The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of intersection points, which "are preserved under deformation" and whose total number is cal…

2011-11-22abs ↗pdf ↗

This paper introduces an intersection theory problem for maps into a smooth manifold equipped with a stratification. We investigate the problem in the special case when the target is the unitary group and the domain is a circle. The first main result is an index theorem that equates a global intersection index with a f…

2015-05-10abs ↗pdf ↗

Gradient-like flows on certain manifolds restrict saddle Morse indices to 1 or n-1.

problem Restricting Morse indices of saddles in gradient-like flows.
method Analyzing invariant manifolds and their intersections for gradient-like flows.
result Morse indices of saddles are either 1 or n-1, no other indices possible.

The paper proves conditions for the existence of holomorphic discs in Kähler manifolds.

problem Existence of holomorphic discs for higher AA_\infty operations.
method Showing existence of minimal discs with specific properties implies existence of holomorphic discs.
result Minimal discs in Kähler manifolds with certain boundary conditions are holomorphic.

The paper constructs homotopically non-trivial spheres in complexified spaces.

problem Embedding spheres in complexified spaces defined by hyperplane arrangements.
method Introducing locally consistent systems of half-spaces, embedding a sphere, and computing twisted intersection numbers.
result The constructed sphere is homotopically non-trivial if the half-space system is globally consistent.

CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.

problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.

Differential Cohomotopy theory predicts brane interactions via chord diagrams.

problem Quantization of brane charges and moduli spaces.
method Differential refinement of Cohomotopy theory, configuration spaces, chord diagrams.
result Higher observables on brane moduli spaces are given by weight systems on chord diagrams.

This paper tackles efficient cooperative control for large-scale traffic signals using tensor-based deep learning.

problem Efficient training and control for large-scale multi-intersection traffic signals.
method Tensor representation, multi-task learning, imitation learning, proximal policy optimization.
result The proposed model achieves better performance compared to existing methods.

The paper improves bounds on geodesic lengths and their simplicity on hyperbolic surfaces.

problem Estimating the distribution of geodesic lengths on hyperbolic surfaces.
method Analyzing the moduli space of hyperbolic surfaces with the Weil-Petersson metric.
result Most geodesics of certain lengths are simple and non-separating, confirming a conjecture.

The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.

problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying kk-equivalent curves, analyzing intersections with other curves.
result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.

Abstract perspective on quadratic programming for optimal portfolio allocation.

problem Optimal allocation problems in long portfolio theory.
method Using maximum principles and distinguished boundaries in reproducing kernel Hilbert spaces.
result Support of an optimal distribution lies in a variety intersecting a distinguished boundary.

3-manifold triangulation can be reconstructed from its intersection matrix.

problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.

The paper finds diffeomorphic complex intersections with distinct Hodge numbers.

problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.

In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…

2016-01-17abs ↗pdf ↗

We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…

2016-09-20abs ↗pdf ↗

Conditions for curves on a torus with specific pairwise intersections.

problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…

2003-07-10abs ↗pdf ↗

James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold MM is a subcomplex of C(M)C(M)C_*(M)\otimes C_*(M) that is quasi-isomorphic to C(M)C(M)C_*(M)\otimes C_*(M) and, more generally, that the intersection pairing endows C(M)C_*(M) with the structure of a partially-defined commutati…

2008-08-12abs ↗pdf ↗

The paper extends intersection theory for b-divisors, proving monotonicity and volume inequalities.

problem Intersection theory for b-divisors and monotonicity of intersection products.
method Developed general intersection theory of nef b-divisors, defined restricted volume, proved monotonicity.
result Proved quantitative monotonicity of intersection product and new volume inequalities.

Study intersection polynomials of long virtual knots with supporting genera.

problem Characterize long virtual knots using geometric invariants.
method Define and analyze 11- and 22-supporting genera, and use them to filter long virtual knots.
result Provide complete realizability criteria for all twelve intersection polynomials.

Study the intersection of positive closed currents using tangent currents and King's residue formula.

problem Investigate the intersection of positive closed currents in complex manifolds.
method Employ tangent currents and King's residue formula to establish a natural condition for intersection.
result Derive an integral representation of the intersection of positive closed currents.

The paper tackles intersectional fairness in machine learning, proposing methods to assess and mitigate bias.

problem Achieving optimal predictive performance is not enough; fairness with respect to multiple sensitive attributes is crucial.
method The paper introduces a comprehensive framework for auditing and achieving intersectional fairness in classification problems, including metrics, estimation methods, and post-processing techniques.
result The proposed methods can robustly estimate and mitigate intersectional bias in classification models without compromising predictive performance.

Unified quantum invariants via intersections of embedded Lagrangians.

problem Unified quantum invariants for Uq(sl(2))U_q(sl(2)).
method State sum of Lagrangian intersections in configuration spaces.
result Recovery of coloured Jones and Alexander polynomials.

Positivity of intersections in 4-manifolds leads to taming symplectic structures.

problem Taming symplectic structures in almost complex 4-manifolds.
method Proof of positivity of intersections of pseudoholomorphic curves.
result Positivity of intersections is stable and leads to taming symplectic structures.

The paper explores intersectional fairness in machine learning, proving bounds on it.

problem Intersectional fairness in machine learning, especially when multiple protected attributes are involved.
method Statistical analysis and bounds on intersectional fairness, leveraging marginal fairness.
result Theoretical bounds on intersectional fairness can be computed from marginal fairness and other statistical quantities.