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

116231347462 · Jun 202019922001200920172026
48 results for contractible complexes

The paper explores coalescent contractions in contractible spaces, providing criteria and examples.

problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.

Let XX be a contractible 22-complex which is a union of two contractible subcomplexes YY and Z.Z. Is the intersection YZY\cap Z contractible as well? In this note, we prove that the inclusion-induced map π1(YZ)π1(Z)π_{1}(Y\cap Z)\rightarrow π_{1}(Z) is injective if YY is π1π_{1}-injective subcomplex in a locally CAT(0) 2-co…

2018-10-16abs ↗pdf ↗

Analyzes complex structure deformations using cohomology contraction methods.

problem Deforming complex structures and identifying obstructions.
method Refined power series method for (p,q)(p,q)-forms and complex structures, using Frölicher spectral sequence.
result All obstruction classes lie in the kernel of contraction maps under natural vanishing conditions.

The study shows that certain complex geometries are hyperbolic and contractible but fail to be CAT(0).

problem The failure of certain complex geometries to be CAT(0) despite being hyperbolic and contractible.
method The study uses combinatorial methods to demonstrate the failure of these geometries to satisfy a combinatorial isoperimetric inequality.
result The study proves that these geometries, while hyperbolic and contractible, do not satisfy a combinatorial isoperimetric inequality.

Kakimizu complex of a knot is a flag simplicial complex whose vertices correspond to minimal genus Seifert surfaces and edges to disjoint pairs of such surfaces. We discuss a general setting in which one can define a similar complex. We prove that this complex is contractible, which was conjectured by Kakimizu. More ge…

2010-04-23abs ↗pdf ↗

We show that if a Heegaard splitting is obtained by gluing a splitting of Hempel distance at least 4 and the genus-1 splitting of S2×S1S^2 \times S^1, then the Goeritz group of the splitting is finitely generated. To show this, we first provide a sufficient condition for a full subcomplex of the arc complex for a compact …

2014-03-30abs ↗pdf ↗

Quantum channels' contraction under privacy constraints studied.

problem Understanding the privacy constraints on quantum channel contractions.
method Established upper bounds on contraction coefficients for specific divergences under QLDP constraints.
result Upper bounds and full characterization of contraction coefficients for specific quantum distances.

We show that strongly contracting geodesics in Outer space project to parameterized quasigeodesics in the free factor complex. This result provides a converse to a theorem of Bestvina--Feighn, and is used to give conditions for when a subgroup of Out(F)\mathrm{Out}(\mathbb{F}) has a quasi-isometric orbit map into the free …

2015-02-13abs ↗pdf ↗

New Q-learning method achieves optimal sample complexity for average-reward problems.

problem Challenges in achieving optimal sample complexity for average-reward Q-learning.
method Synchronous and asynchronous Q-learning with a new contraction principle.
result Optimal O~(ε2)\widetilde{O}(\varepsilon^{-2}) sample complexity guarantees.

Survey and generalization of implosion and contraction in symplectic and hyperkähler geometry.

problem Exploring implosion and contraction in symplectic and hyperkähler geometry.
method Survey and extension of implosion construction to general reductive groups, interpretation in Moore-Tachikawa category, generalization of contraction construction.
result Generalization of implosion and contraction concepts to hyperkähler and complex symplectic situations.

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

problem Statistical foundation for Bayesian Kolmogorov-Arnold networks in anisotropic Besov spaces.
method Sparse Bayesian KANs with spike-and-slab priors, hyperprior on model size, and approximation complexity bounds.
result Posterior contraction rates depend on intrinsic anisotropic smoothness and effective dimension of the compositional structure.

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

The paper explores local-correlation models for pricing complex financial contracts.

problem Calibrating synthetic quanto forward contracts and composite options.
method Design on-line calibration procedures for local and stochastic volatility models.
result Calibration performance of local-correlation models compared to simpler approximations.

Predicts short-term futures contract direction using neural networks and order flow data.

problem Challenges in predicting short-term directional movement of futures contracts.
method Engineering features from technical analysis, order flow, and order-book data; training a Tabnet neural network.
result Achieved an accuracy of 0.601 in predicting directional change on the Silver Futures Contract.

We prove that closed symplectic four-manifolds do not admit any smooth free circle actions with contractible orbits, without assuming that the actions preserve the symplectic forms. In higher dimensions such actions by symplectomorphisms do exist, and we give explicit examples based on a construction of Fernandez, Gray…

2004-10-09abs ↗pdf ↗

Given an nn-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the nn-gon (viewed as a disc with nn marked points on the boundary) with an arbitrary oriented surface with a number of la…

2017-01-06abs ↗pdf ↗

Paper classifies rational 3-tangles using normal forms and minimal coordinates.

problem Classifying rational 3-tangles up to isotopy.
method Defined normal form and normal coordinate, investigated minimal coordinates, constructed contractible simplicial complex.
result Simplicial complex of normal forms is contractible, leading to classification of rational 3-tangles.

The paper proves scalar curvature decay for uniformly contractible manifolds with finite asymptotic dimension.

problem Proving decay of scalar curvature for uniformly contractible manifolds with finite asymptotic dimension.
method Using index pairing between Dirac operators and compactly supported vector bundles with Lipschitz control, and Lipschitz control for topological K-theory of finite dimensional simplicial complexes.
result The scalar curvature decays to zero at a rate depending only on the contractibility radius and the diameter control of the asymptotic dimension.

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a contractible 2-dimensional cell complex) is "hard to embed in R3\mathbb{R}^3", in the …

2014-03-20abs ↗pdf ↗

The contraction inequality for Rademacher averages is extended to Lipschitz functions with vector-valued domains, and it is also shown that in the bounding expression the Rademacher variables can be replaced by arbitrary iid symmetric and sub-gaussian variables. Example applications are given for multi-category learnin…

2016-05-01abs ↗pdf ↗

A new method streamlines digital payment programming using smart contracts.

problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.

Ethereum smart contracts have recently drawn a considerable amount of attention from the media, the financial industry and academia. With the increase in popularity, malicious users found new opportunities to profit by deceiving newcomers. Consequently, attackers started luring other attackers into contracts that seem …

2019-10-03abs ↗pdf ↗

This paper gives a description of the full space of Bridgeland stability conditions on the bounded derived category of a contraction algebra associated to a 3-fold flop. The main result is that the stability manifold is the universal cover of a naturally associated hyperplane arrangement, which is known to be simplicia…

2019-07-30abs ↗pdf ↗

Improved generalization bounds for CNNs using Rademacher complexity.

problem Establishing non-vacuous generalization bounds for deep learning models.
method Rademacher complexity framework with novel contraction lemmas for high-dimensional mappings.
result Enhanced generalization bounds for a broader class of activation functions.

Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens and generalizes a result by Crowley. Further consequences of our work are: (1) …

2011-07-28abs ↗pdf ↗

We introduce general scattering transforms as mathematical models of deep neural networks with l2 pooling. Scattering networks iteratively apply complex valued unitary operators, and the pooling is performed by a complex modulus. An expected scattering defines a contractive representation of a high-dimensional probabil…

2013-06-24abs ↗pdf ↗

Study develops a smart contract framework for efficient and fair resource allocation.

problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.