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.

169,051 papers · 148 categories

Trend · papers per month

22456789 · Jun 202019922001200920172026
48 results for simplicial topology

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to students familiar with just the fundamentals of algebraic topology.

2008-09-24abs ↗pdf ↗

We analyze oversquashing in topological message-passing using relational structures.

problem Oversquashing in topological message-passing remains understudied.
method A unifying axiomatic framework that bridges graph and topological message-passing.
result Potential to advance topological deep learning.

Proposes a probabilistic framework for stationary topological signals on simplicial complexes.

problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.

This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.

problem Improving topological inference and visualization of large-scale geometric datasets.
method Proposes a method for learning topologically-faithful covers of geometric datasets using optimization.
result Simplicial complexes obtained from learned covers outperform standard methods in terms of size and representation of large-scale topology.

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.

Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets and the topology of the branching set are known for dimension d<=4. On the other hand, Izmestiev and Joswig described how to obtain a simplic…

2007-07-10abs ↗pdf ↗

Detect anomalies in complex networks using topological subspace detectors.

problem Detect anomalies in complex networks defined by simplicial complexes.
method Formulate a hypothesis testing framework using Neyman-Pearson matched topological subspace detectors.
result Effective detection of anomalies in foreign currency exchange networks and other real-world data.

The paper studies geometric embeddings of arc graphs and their rigidity.

problem Investigating rigidity and convexity in geometric simplicial embeddings of arc-type graphs.
method Examining multiarc graphs and their rigidity properties under certain complexity conditions.
result Simplicial maps between certain multiarc graphs only arise in the 'obvious way' under necessary complexity conditions.

In this paper, we study face vectors of simplicial posets that are the face posets of cell decompositions of topological manifolds without boundary. We characterize all possible face vectors of simplicial posets whose geometric realizations are homeomorphic to the product of spheres. As a corollary, we obtain the chara…

2010-10-02abs ↗pdf ↗

Constructs a simplicial cell decomposition of complex projective space for n ≥ 2.

problem Finding a simplicial cell decomposition for complex projective space.
method Starting with a standard crystallisation of the 2-sphere, constructing a simplicial subdivision, and quotienting by the Sym(n) action.
result Explicit construction of a simplicial cell decomposition of complex projective space for n ≥ 2.

The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of simplicial and cubical subdivisions of manifolds and, especially, spheres. We describe…

2000-10-07abs ↗pdf ↗

Solved Cheeger inequalities for simplicial complexes, combining topological and graph theoretic methods.

problem Extend Cheeger inequalities to simplicial complexes and their higher order Laplacians.
method Combining constructions from simplicial topology, signed graphs, Gromov filling radii, and interpolating between 1-Laplacians and 2-Laplacians.
result Developed a general theory for p-Laplacians on simplicial complexes and proved Cheeger-type inequalities.

We consider a finite simplicial complex KK together with its successive barycentric subdivisions Sdd(K),d0,Sd^d(K), d\geq0, and study the expected topology of a random subcomplex in Sdd(K),d0Sd^d(K), d\gg0. We get asymptotic upper and lower bounds for the expected Betti numbers of those subcomplexes, together with the average Morse …

2017-06-07abs ↗pdf ↗

The simplicial volume introduced by Gromov provides a topologically accessible lower bound for the minimal volume. Lafont and Schmidt proved that the simplicial volume of closed, locally symmetric spaces of non-compact type is positive. In this paper, we present a generalization of this result to certain non-compact lo…

2007-06-26abs ↗pdf ↗

Constructs algorithms to recognize and classify 2D surfaces.

problem Recognizing and classifying 2D surfaces in dynamic systems.
method Discrete topological structures and algorithms for simplicial and CW-complexes.
result Determines the topological type of 2-manifolds.

Efficiently sparsifies simplicial complexes using local densities of states.

problem Prohibitive computational requirements for dense simplicial complexes.
method Probabilistic sparsification using local densities of states and kernel-ignoring decomposition.
result Approximates the spectrum of the original SC with a sparser surrogate SC.

The paper shows how to simplify complex optimization problems into simpler ones.

problem Complex multiobjective optimization problems.
method Proving strongly convex problems are simplicial under certain conditions and demonstrating transformations.
result Strongly convex problems can be simplified into simpler ones via generic linear perturbations.

Paper proves Gromov's conjecture on manifolds with certain group properties.

problem Gromov's conjecture on positive scalar curvature and simplicial volume.
method Proves conjecture under a fundamental group decay property.
result Proves Gromov's conjecture for manifolds with a weakened rapid decay property.

New topological restrictions found for spaces with nonnegative Ricci curvature.

problem Understanding topological properties of spaces with nonnegative Ricci curvature.
method Analyzing complete Riemannian manifolds and RCD(0,n) spaces, applying rigidity and vanishing theorems.
result Proved a Betti number rigidity theorem and a vanishing theorem for simplicial volume.

We study the multiscale simplicial flat norm (MSFN) problem, which computes flat norm at various scales of sets defined as oriented subcomplexes of finite simplicial complexes in arbitrary dimensions. We show that the multiscale simplicial flat norm is NP-complete when homology is defined over integers. We cast the mul…

2011-05-25abs ↗pdf ↗

We utilize the obstruction theory of Galewski-Matumoto-Stern to derive equivalent formulations of the Triangulation Conjecture. For example, every closed topological manifold M^n with n > 4 can be simplicially triangulated if and only if the two distinct combinatorial triangulations of RP^5 are simplicially concordant.

2002-12-20abs ↗pdf ↗

In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For expansive systems remarkable properties are observed. Known examples are revisited …

2008-06-27abs ↗pdf ↗

An algorithm preserves topological features in dimensionality reduction.

problem Preserving topological features in dimensionality reduction.
method Simulated annealing for finding a linear projection preserving persistent homology.
result Measures of topological equivalence between filtrations.

We describe the moduli space of extensions in the model category of simplicial presheaves. This article can be seen as a generalization of Blomgren-Chacholski results in the case of simplicial sets. Our description of the moduli space of extensions treat the equivariant and the nonequivariant case in the same setting. …

2012-11-20abs ↗pdf ↗

The paper constructs simplicial maps of any degree on spheres, solving a long-standing problem.

problem Constructing simplicial maps of any degree on spheres.
method Using connected sums and facet orientations, the paper develops a method to construct maps of any prescribed degree.
result The paper answers a question posed by Ryabichev and constructs simplicial maps of degree dd for large dd.

A notion of up and down Grover walks on simplicial complexes are proposed and their properties are investigated. These are abstract Szegedy walks, which is a special kind of unitary operators on a Hilbert space. The operators introduced in the present paper are usual Grover walks on graphs defined by using combinatoria…

2017-06-29abs ↗pdf ↗

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are …

2012-05-28abs ↗pdf ↗

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a number of known results. New results include a combinatorial characterization of c…

2012-08-30abs ↗pdf ↗

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.