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

121242363484 · Jun 202019922001200920172026
48 results for chain complexes

In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…

2006-08-18abs ↗pdf ↗

Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain com…

2009-07-03abs ↗pdf ↗

We give a new proof of the Morse Homology Theorem by constructing a chain complex associated to a Morse-Bott-Smale function that reduces to the Morse-Smale-Witten chain complex when the function is Morse-Smale and to the chain complex of smooth singular NN-cube chains when the function is constant. We show that the ho…

2006-12-12abs ↗pdf ↗

Estimates covariance matrices using Markov chain Monte Carlo with improved sample complexity.

problem Complexity of covariance matrix estimation for Gibbs distributions.
method Uses Markov chain Monte Carlo with conditions on the chain's spectral gap and Poincaré inequality.
result Achieves similar sample complexity as i.i.d. samples with better query complexity.

Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.

problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.

Link Floer homology is split into snake complexes and local systems.

problem Classifying link Floer complexes over specific rings.
method Classifying isomorphism and chain homotopy equivalence classes of free chain complexes over a specific ring, then applying these results to link Floer complexes.
result Link Floer complexes split uniquely into snake complexes and local systems.

Let MM be a closed connected manifold, ff be a Morse map from MM to a circle, vv be a gradient-like vector field satisfying the transversality condition. The Novikov construction associates to these data a chain complex C=C(f,v)C_*=C_*(f,v). There is a chain homotopy equivalence between CC_* and completed simplicial cha…

2001-04-28abs ↗pdf ↗

We exhibit an efficient procedure for testing, based on a single long state sequence, whether an unknown Markov chain is identical to or ε\varepsilon-far from a given reference chain. We obtain nearly matching (up to logarithmic factors) upper and lower sample complexity bounds for our notion of distance, which is bas…

2019-01-31abs ↗pdf ↗

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

A method for learning with autoregressive chain-of-thoughts.

problem Learning prompt-to-answer mappings from sequence-to-next-token generators.
method Iterating a fixed, time-invariant generator for multiple steps to generate a chain-of-thought, then taking the final token as the answer.
result Universal representability and computationally tractable chain-of-thought learning for a simple base class.

Let f:MRf:M \rightarrow \mathbb{R} be a Morse-Bott function on a finite dimensional closed smooth manifold MM. Choosing an appropriate Riemannian metric on MM and Morse-Smale functions fj:CjRf_j:C_j \rightarrow \mathbb{R} on the critical submanifolds CjC_j, one can construct a Morse chain complex whose boundary operator is…

2011-10-20abs ↗pdf ↗

We analyze a functor from cyclic operads to chain complexes first considered by Getzler and Kapranov and also Markl. This functor is a generalization of the graph homology considered by Kontsevich, which was defined for the three operads Comm, Assoc, and Lie. More specifically we show that these chain complexes have a …

2002-08-12abs ↗pdf ↗

The paper presents a chain complex for 3-manifold covers, including surface bundles and surgeries.

problem Calculating linking forms and Dijkgraaf-Witten invariants for specific 3-manifold covers.
method Presentation of cellular chain complexes for universal covers of 3-manifolds in a specified class.
result Established a formula for linking forms and developed procedures for Dijkgraaf-Witten invariants.

This thesis is divided into three parts. In the first part, we give an introduction to J. Harrison's theory of differential chains. In the second part, we apply these tools to generalize the Cauchy theorems in complex analysis. Instead of requiring a piecewise smooth path over which to integrate, we can now do so over …

2010-12-26abs ↗pdf ↗

The study provides bounds for geodesic diameter in Euclidean space.

problem Finding bounds for geodesic diameter in Euclidean space.
method Develops a geometric approach using locally rectifiable chains and complete normed commutative group bundles.
result Provides a new method for calculating geodesic diameter bounds.

The uniform boundary condition in a normed chain complex asks for a uniform linear bound on fillings of null-homologous cycles. For the 1\ell^1-norm on the singular chain complex, Matsumoto and Morita established a characterisation of the uniform boundary condition in terms of bounded cohomology. In particular, spaces…

2017-03-03abs ↗pdf ↗

Deep neural networks optimize inventory decisions in complex supply chains.

problem Optimizing inventory decisions in stochastic multi-echelon supply chains.
method Pairwise modeling and DNN agents for order-up-to levels.
result The method performs better than alternate methods in general supply chain networks.

Study reveals hidden accidental parabolics in complex hyperbolic geometry.

problem Understanding hidden parabolics in complex hyperbolic geometry.
method New technique to show ideal boundary of Ford domain is an infinite-genus handlebody.
result 3-manifold at infinity of Δ4,,;Δ_{4,\infty,\infty;\infty} is the complement of chain link 8148^4_1.

We define an algebraic group comprising symmetric chain complexes which captures the first two stages of the Cochran-Orr-Teichner solvable filtration of the knot concordance group in a single invariant. To achieve this we impose additional structure on each chain complex which puts extra control on the fundamental grou…

2012-03-20abs ↗pdf ↗

We define an algebraic group comprising symmetric chain complexes which captures the first two stages of the Cochran-Orr-Teichner solvable filtration of the knot concordance group in a single obstruction. To achieve this we impose additional structure on each chain complex which puts extra control on the fundamental gr…

2011-09-04abs ↗pdf ↗

We introduce a refinement of the Ozsvath-Szabo complex associated to a balanced sutured manifold (X,τ)(X,τ) by Juhasz. An algebra AτA_τ is associated to the boundary of a sutured manifold and a filtration of its generators by H2(X,X;Z)H^2(X,\partial X;\Z) is defined. For a fixed Spin^c structure ss over the manifold XX', which…

2011-12-15abs ↗pdf ↗

In this paper we prove that, in the category of chain complexes, partial algebras can be functorially replaced by quasi-isomorphic algebras. In particular, partial algebras contain all of the important homological and homotopical information that genuine algebras do. Applying this result to McClure's partial algebra in…

2004-10-18abs ↗pdf ↗

FluxLayer solves cross-chain liquidity fragmentation for better MEV capture.

problem Cross-chain fragmented liquidity and MEV optimization.
method Three-layer framework integrating settlement, intent, and leverage mechanisms.
result FluxLayer enhances cross-chain MEV by capturing more arbitrage opportunities.

We consider the closed orbit structure of generic gradient flows of Morse closed 1-forms. The torsion of a chain homotopy equivalence between the Novikov complex and the completed simplicial chain complex of the universal cover detects the eta function of the flow. We extend this result to arbitrary Morse closed 1-form…

2000-09-06abs ↗pdf ↗