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

9172634 · Sep 202519922001200920172026
48 results for 2-factor homology

The paper refines 2-factor homology to a stable homotopy type for planar trivalent graphs with perfect matchings.

problem Developing a stable homotopy type for planar trivalent graphs with perfect matchings.
method Defining a cover functor from the 2-factor flow category to the cube flow category, realizing the 2-factor spectrum, and showing it's an invariant.
result The stable homotopy type of the 2-factor spectrum is an invariant of planar trivalent graphs with perfect matchings.

Paper proposes an analytical pricing model for puttable bonds with credit risk.

problem Analytical pricing of puttable bonds with credit risk.
method Developed a 2-factor structural PDE model and derived analytical pricing formula under specific conditions.
result Derived analytical pricing formula for puttable bonds with credit risk.

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one, implies that the perfect matching is even and therefore the graph is 4-face color…

2018-10-16abs ↗pdf ↗

Improved private learning of halfspaces with reduced sample complexity.

problem Private learning of halfspaces with reduced sample complexity.
method Iterative algorithm for solving linear feasibility problem, improving state-of-the-art results.
result Sample complexity reduced to d2.52logGd^{2.5} \cdot 2^{\log^*|G|}, improving d2d^2 factor.

This work shows how penalising bias terms in norm regularisation leads to sparse solutions.

problem Understanding the relation between parameter norm regularization and the sparsity of neural network solutions.
method Analyzes one hidden ReLU layer networks with unidimensional data, showing the norm required for function representation and the importance of the bias term's norm.
result Penalising the bias terms in regularisation leads to sparse solutions, enforcing the uniqueness and sparsity of the minimal norm interpolator.

We study in this paper the rational homotopy type of the space of symplectic embeddings of the standard ball B4(c)R4B^4(c) \subset \R^4 into 4-dimensional rational symplectic manifolds. We compute the rational homotopy groups of that space when the 4-manifold has the form Mλ=(S2×S2,μω0ω0)M_λ= (S^2 \times S^2, μω_0 \oplus ω_0) where ω0ω_0

2002-07-11abs ↗pdf ↗

Paper finds instantons for Kapustin-Witten equations on a specific manifold.

problem Existence of solutions to Kapustin-Witten equations on (0,)imesR2imesR(0,\infty) imes \mathbb{R}^2 imes \mathbb{R}.
method Explains existence of solutions interpolating between two model solutions.
result Interpolation solutions exist with specific label constraints.

CPPO learns policies from partial offline data in MDPs with structural assumptions.

problem Offline Reinforcement Learning with partial coverage assumption.
method Constrained Pessimistic Policy Optimization (CPPO) using a function class and model class constraint.
result CPPO achieves PAC guarantee with partial coverage, learning competitive policies.

We present three families of exact, cohomogeneity-one Einstein metrics in (2n+2)(2n+2) dimensions, which are generalizations of the Stenzel construction of Ricci-flat metrics to those with a positive cosmological constant. The first family of solutions are Fubini-Study metrics on the complex projective spaces CPn+1CP^{n+1}, w…

2015-07-27abs ↗pdf ↗

Study impacts of feeding cost risk on aquaculture valuation and decision making.

problem Impact of stochastic feeding costs on aquaculture valuation and decision making.
method Using Schwartz-2-factor model and deep neural networks to infer decision boundary.
result Accounting for stochastic feeding costs leads to superior performance in decision rules.

Extends Khovanov homology spectral sequence using Heegaard Floer homology.

problem Relating Khovanov homology and Heegaard Floer homology of branched double covers.
method Involutive Heegaard Floer homology, bordered Floer homology, surgery exact triangle.
result Establishes spectral sequence connecting Khovanov homology and Heegaard Floer homology.

The paper constructs new rational homology 3-spheres bounding rational homology 4-balls.

problem Constructing rational homology 3-spheres that bound rational homology 4-balls.
method Exploring plumbed 3-manifolds and using rational homology circles.
result Infinite families of rational homology 3-spheres that bound rational homology 4-balls.

Study ribbon homology concordances using link Floer homology.

problem Understanding ribbon homology concordances and their effects on link Floer homology.
method Combining results from Daemi, Lidman, Vela-Vick, Wong, and Zemke, using link Floer homology and torsion submodules.
result Ribbon homology concordances induce split injections on HFL\mathcal{HFL}^-.

The paper examines lattice homology invariants of Seifert homology spheres.

problem Understanding homology cobordism invariants for Seifert fibered integral homology 3-spheres.
method Utilizes lattice homology and Heegaard Floer homology to study invariants.
result Reproves and extends the invariance of Seifert homology spheres' dd-invariants and maximal monotone subroots.

Paper studies spectral invariants and monopole Floer homology for rational homology three-spheres.

problem Tackles the existence of positive scalar curvature metrics on ribbon homology cobordisms.
method Defines an R-filtration on the equivariant complex of monopole Floer homology via Chern-Simons-Dirac functional, leading to a spectral invariant.
result Shows that the spectral invariant provides an obstruction to the existence of positive scalar curvature metrics on ribbon homology cobordisms.

We compare the homology groups HnIC(X)H_n ^{IC}(X) of the chain complex of integral currents with compact support of a metric space XX with the singular Lipschitz homology HnL(X)H^L_n (X) and with ordinary singular homology. If XX satisfies certain cone inequalities all these homology theories coincide. On the other hand, for…

2009-02-23abs ↗pdf ↗

In~\cite{rotvandervorst} a homology theory --Morse-Conley-Floer homology-- for isolated invariant sets of arbitrary flows on finite dimensional manifolds is developed. In this paper we investigate functoriality and duality of this homology theory. As a preliminary we investigate functoriality in Morse homology. Functor…

2014-09-16abs ↗pdf ↗

Maps from rational homology solid tori yield rank inequalities in Heegaard Floer homology.

problem Rank inequalities in Heegaard Floer homology.
method Using Hanselman-Rasmussen-Watson's bordered Floer homology, we extend their proof to rational homology solid tori.
result We provide rank inequalities for Heegaard Floer homology.

The paper extends a knot invariant to graphs and connects it to homology cylinders.

problem Understanding the structure of homology cobordism groups.
method Using tangle Floer homology, the authors define a new invariant for embedded graphs and prove a concatenation formula.
result The new invariant induces a homomorphism on the homology cobordism group of homology cylinders.

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a (2,n)(2,n)-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connectio…

2005-09-14abs ↗pdf ↗

New findings connect shaped and unshaped neural networks using differential equations.

problem Understanding the behavior of neural networks with different activation scaling methods.
method Deriving differential equation-based asymptotic characterizations for shaped and unshaped neural networks.
result Two types of unshaped networks converge to the same infinite-depth-and-width limit at initialization.