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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for finite complexes

We combine aspects of the notions of finite decomposition complexity and asymptotic property C into a notion that we call finite APC-decomposition complexity. Any space with finite decomposition complexity has finite APC-decomposition complexity and any space with asymptotic property C has finite APC-decomposition comp…

2017-09-04abs ↗pdf ↗

Finite vector bundles over complex manifolds are trivializable via finite covers.

problem Understanding when holomorphic vector bundles over compact complex manifolds are trivializable.
method Introducing finite bundles and using finite étale covers to trivialize holomorphic vector bundles.
result Holomorphic vector bundles over compact complex manifolds are finite if and only if they admit a flat holomorphic connection with finite monodromy.

The simplest condition characterizing quasi-finite CW complexes KK is the implication XτhK    β(X)τKXτ_h K\implies β(X)τK for all paracompact spaces XX. Here are the main results of the paper: Theorem: If {Ks}sS\{K_s\}_{s\in S} is a family of pointed quasi-finite complexes, then their wedge sSKs\bigvee\limits_{s\in S}K_s is quasi-fini…

2006-08-30abs ↗pdf ↗

We introduce the notion of regular finite decomposition complexity of a metric family. This generalizes Gromov's finite asymptotic dimension and is motivated by the concept of finite decomposition complexity (FDC) due to Guentner, Tessera and Yu. Regular finite decomposition complexity implies FDC and has all the perma…

2016-08-16abs ↗pdf ↗

For any compact, connected, orientable, finite-type surface with marked points other than the sphere with three marked points, we construct a finite rigid set of its arc complex: a finite simplicial subcomplex of its arc complex such that any locally injective map of this set into the arc complex of another surface wit…

2019-09-19abs ↗pdf ↗

A countable CW complex KK is quasi-finite (as defined by A.Karasev) if for every finite subcomplex MM of KK there is a finite subcomplex e(M)e(M) such that any map f:AMf:A\to M, where AA is closed in a separable metric space XX satisfying XτKXτK, has an extension g:Xe(M)g:X\to e(M). Levin's results imply that none of the Ei…

2005-09-24abs ↗pdf ↗

Finite simplicial complexes dominate certain manifolds with a bounded number of simplices.

problem Understanding the finite domination of manifolds by simplicial complexes.
method Proving that a manifold can be dominated by the nn-skeleton of a finite simplicial complex with a bounded number of simplices.
result The total number of simplices in the nn-skeleton is bounded above by a constant depending only on nn and the embolic volume of the manifold.

In this note we introduce the concept of a quasi-finite complex. Next, we show that for a given countable and locally finite CW complex L the following conditions are equivalent: (i) L is quasi-finite. (ii) There exists a [L]-invertible mapping of a metrizable compactum X with e-dim X = [L] onto the Hilbert cube. Final…

2003-12-12abs ↗pdf ↗

Finite simply connected 2-complexes with nonpositive planar curvature are collapsible.

problem Understanding the collapsibility of 2-complexes with specific curvature properties.
method Analyzing the fundamental groups and sectional curvatures of 2-complexes.
result Finite simply connected 2-complexes with nonpositive planar curvature are collapsible.

The paper sets sample complexity bounds for identifying LTI systems from a finite set.

problem Identifying an LTI system from a finite set of possible systems using trajectory data.
method Maximum likelihood estimator and information theory tools.
result Upper and lower bounds for sample complexity are derived, independent of stability assumption.

Finite stature proven for cube complexes with cyclonormal edges.

problem Understanding the structure of cube complexes with specific edge properties.
method Analyzing the fundamental groups of edge and vertex spaces, showing cyclonormality and virtual specialness.
result The fundamental group of a cube complex has finite stature with respect to vertex groups.

We give an exposition of Delzant's ideas extending the notion of Scott complexity of finitely generated groups to surjective homomorphisms of finitely presented groups to finitely generated groups.

2004-01-23abs ↗pdf ↗

Study complex hyperbolic lattices and their subgroups, proving new finiteness properties.

problem Characterize subgroups of complex hyperbolic lattices.
method Analyzing homomorphisms and using arithmetic lattice properties.
result Deep subgroups of complex hyperbolic lattices admit homomorphisms to Z with specific kernel types.

We prove a Tits alternative theorem for groups acting on CAT(0) cubical complexes. Namely, suppose that GG is a group for which there is a bound on the orders of its finite subgroups. We prove that if GG acts properly on a finite-dimensional CAT(0) cubical complex, then either GG contains a free subgroup of rank 2 o…

2004-05-02abs ↗pdf ↗

Rust library solves complex equations on abstract simplicial complexes.

problem Solving partial differential equations on abstract simplicial complexes.
method Finite Element Exterior Calculus, intrinsic Riemannian metric, first-order Whitney basis functions.
result Verification through convergence studies on elliptic Hodge-Laplace eigenvalue and source problems.

The paper constructs discrete Hessian and divdiv complexes on triangulations and proves their cohomology isomorphic to continuous versions.

problem Discrete construction of Hessian and divdiv complexes on triangulations.
method Construction of discrete Hessian and divdiv complexes using finite elements and Dirac measures on triangulations.
result The cohomology of the constructed complexes is isomorphic to the continuous de Rham cohomology.

We prove that every finite connected simplicial complex has the homology of the classifying space for some CAT(0)\mathrm{CAT}(0) cubical duality group. More specifically, for any finite simplicial complex XX, we construct a locally CAT(0)\mathrm{CAT}(0) cubical complex TXT_{X} and an acyclic map tX:TXXt_{X} : T_{X} \to X such tha…

2012-02-09abs ↗pdf ↗

We prove that curve complexes of surfaces are finitely rigid: for every orientable surface S of finite topological type, we identify a finite subcomplex X of the curve complex C(S) such that every locally injective simplicial map from X into C(S) is the restriction of an element of Aut(C(S)), unique up to the (finite) …

2012-06-14abs ↗pdf ↗

Study shows infinite manifold types for every group.

problem Finding manifold types for every finite group.
method Proved existence of infinitely many compact complex hyperbolic 2-manifolds.
result For every finite group, there are infinitely many isomorphism classes of compact complex hyperbolic 2-manifolds with automorphism group isomorphic to the group.

We present a new approach to simple homotopy theory of polyhedra using finite topological spaces. We define the concept of collapse of a finite space and prove that this new notion corresponds exactly to the concept of a simplicial collapse. More precisely, we show that a collapse of finite spaces induces a simplicial …

2006-11-06abs ↗pdf ↗

Graph conditions ensure matching arc complexes are connected and hyperbolic.

problem Conditions for connectedness and hyperbolicity of matching arc complexes.
method Conditions on finite simplicial graphs guaranteeing connectedness and hyperbolicity of matching arc complexes.
result Conditions on finite simplicial graphs ensure connectedness and hyperbolicity of matching arc complexes.

The paper studies extremal Kaehler metrics induced by complex space forms, proving properties in both finite and infinite dimensions.

problem Analyzing extremal Kaehler metrics induced by complex space forms in finite and infinite dimensions.
method Proving properties of extremal Kaehler metrics under specific conditions in both finite and infinite dimensional settings.
result Extremal Kaehler metrics induced by infinite dimensional elliptic complex space forms have constant non-positive holomorphic sectional curvature under stability conditions.

Solves classical problem with Kähler-Einstein metrics in complex projective spaces.

problem Classical problem of non-isometric bidimensional Kähler-Einstein submanifolds.
method Listed complete non-isometric bidimensional rotation invariant Kähler-Einstein submanifolds.
result Solves the classical problem in the specified case.

The aim of this paper is to provide some new tools to aid the study of decomposition complexity, a notion introduced by Guentner, Tessera and Yu. In this paper, three equivalent definitions for decomposition complexity are established. We prove that metric spaces with finite hyperbolic dimension have finite (weak) deco…

2015-09-22abs ↗pdf ↗

New findings show modern neural networks have finite sample complexity in o-minimal structures.

problem Understanding the learnability of modern neural networks in a broad context.
method Analyzing feedforward neural networks definable in o-minimal structures.
result Modern neural networks, including MLPs, CNNs, GNNs, and transformers, have finite sample complexity in the agnostic PAC setting.