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

106211317422 · Jun 202019922001200920172026
48 results for finite simplicial graphs

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.

Automorphisms and subdivisions of Helly graphs are studied, leading to explicit models and rational translation lengths.

problem Understanding automorphisms and subdivisions of Helly graphs.
method Simple fine simplicial subdivisions and explicit simplicial models of the injective hull.
result Any automorphism of a Helly graph is either elliptic or hyperbolic, with rational translation lengths.

Graph manifolds are manifolds that decompose along tori into pieces with a tame S1S^1-structure. In this paper, we prove that the simplicial volume of graph manifolds (which is known to be zero) can be approximated by integral simplicial volumes of their finite coverings. This gives a uniform proof of the vanishing of …

2018-07-27abs ↗pdf ↗

For a finite simplicial graph ΓΓ, let A(Γ)A(Γ) denote the right-angled Artin group on ΓΓ. Recently Kim and Koberda introduced the extension graph ΓeΓ^e for ΓΓ, and established the Extension Graph Theorem: for finite simplicial graphs Γ1Γ_1 and Γ2Γ_2 if Γ1Γ_1 embeds into Γ2eΓ_2^e as an induced subgraph then A(Γ1)A(Γ_1) emb…

2017-06-30abs ↗pdf ↗

The paper provides conditions for realizing graphs and polytopes with specified edge lengths.

problem Proving the existence of planar embeddings or polyhedra with specified edge lengths.
method Practical sufficient conditions and software verification for non-self-intersecting perturbations of initial realizations.
result Existence of planar embeddings and polyhedra with specified edge lengths.

Study on finiteness property of right-angled Artin groups actions on extension graphs.

problem Finiteness property of hyperbolic simplicial actions on right-angled Artin groups.
method Analysis of right-angled Artin group actions on extension graphs, using asymptotic translation lengths and syllable lengths.
result Asymptotic translation lengths of elements in right-angled Artin groups are rational and have a common denominator under certain conditions.

We prove a strong form of finite rigidity for pants graphs of spheres. Specifically, for any n4n\geq4, we construct a finite subgraph XnX_n of the pants graph P(S0,n)P(S_{0,n}) of the n-punctured sphere S0,nS_{0,n} with the following property. Any simplicial embedding of XnX_n into any pants graph P(S0,m)P(S_{0,m}) of a punctured …

2013-03-15abs ↗pdf ↗

We prove that every injective simplicial map F(S)F(S)\mathcal{F}(S) \to \mathcal{F}(S') between flip graphs is induced by a subsurface inclusion SSS\to S', except in finitely many cases. This extends a result of Korkmaz--Papadopoulos which asserts that every automorphism of the flip graph of a surface without boundary is ind…

2014-09-24abs ↗pdf ↗

We study the ideal triangulation graph T(S)T(S) of a punctured surface SS of finite type. We show that if SS is not the sphere with at most three punctures or the torus with one puncture, then the natural map from the extended mapping class group of SS into the simplicial automorphism group of T(S)T(S) is an isomorphism…

2009-10-12abs ↗pdf ↗

New homology theory for graphs detects subdivisions and homology manifolds.

problem Defining a dissimilarity metric for graphs.
method Filtration on simplicial homology, using bi-colourings of vertices.
result The überhomology vanishes in lowest degree for subdivisions and coincides with fundamental class for homology manifolds.

Let Sg,nS_{g,n} be an orientable surface of genus gg with nn punctures. We identify a finite rigid subgraph Xg,nX_{g,n} of the pants graph P(Sg,n)\mathcal P (S_{g,n}), that is, a subgraph with the property that any simplicial embedding of Xg,nX_{g,n} into any pants graph P(Sg,n)\mathcal P (S_{g',n'}) is induced by an embedding $S_{g…

2019-07-30abs ↗pdf ↗

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 ↗

Mixes higher-order simplicial complexes for data augmentation.

problem Lack of labeled data for complex systems with multiway interactions.
method Proposes mixup mechanisms for simplicial complexes, including linear and nonlinear mixup, and a convex clustering mixup.
result Synthetic simplicial complexes interpolate between existing data based on homomorphism densities.

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a multicurve Q whose complement is a number of subsurfaces of complexity at most 1. We prov…

2013-06-13abs ↗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 study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs are induced by π1π_1-injective embeddings of the corresponding surfaces. We also p…

2015-10-26abs ↗pdf ↗

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and topology. We show a number of rigidity results, namely showing that, under certa…

2019-02-28abs ↗pdf ↗

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 ↗

This paper classifies planar-Rips complexes and their unit disk graphs up to homotopy.

problem Classifying planar-Rips complexes and their unit disk graphs.
method Simplicial classification, homotopy equivalence, and hereditary properties.
result Classification of planar-Rips complexes and unit disk graphs up to homotopy.

Groups of homotopy equivalences of graphs help realize compact subgroups.

problem Realizing compact subgroups of homotopy equivalences of graphs.
method Introduced a Polish group topology on the group of proper homotopy equivalences and proved the Nielsen Realization theorem.
result Compact subgroups of homotopy equivalences can be realized by simplicial isomorphisms of graphs.

The study shows simplicial volume finiteness for certain manifolds with amenable fundamental groups.

problem Determining the simplicial volume of manifolds with specific properties.
method Analyzing the fundamental group and using amenability properties.
result Simplicial volume is finite for certain manifolds with amenable fundamental groups.

This paper adresses the following problem: Given a closed orientable three-manifold M, are there at most finitely many closed orientable three-manifolds 1-dominated by M? We solve this question for the class of closed orientable graph manifolds. More presisely the main result of this paper asserts that any closed orien…

2005-01-09abs ↗pdf ↗

Study simplicial volume of manifolds from reflection group trick.

problem Characterize manifolds with positive simplicial volume.
method Define a partial order on triangulations and solve explicitly for minimal elements.
result Explicitly solved triangulations of the two-dimensional sphere and performed extensive analysis for three-dimensional case.

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.

Let MM be the interior of a connected, oriented, compact manifold VV of dimension at least 2. If each path component of V\partial V has amenable fundamental group, then we prove that the simplicial volume of MM is equal to the relative simplicial volume of VV and also to the geometric (Lipschitz) simplicial volume…

2012-05-07abs ↗pdf ↗

This paper extends results of Hatcher and Vogtmann's work "Cerf Theory for Graphs" to ribbon graphs. Given an orientable, punctured and basepointed surface Sigma, we prove that the space of ribbon graphs that can be drawn in Sigma is filtered by simplicial complexes. The k-th simplicial complex is (k-1)-dimensional, (k…

2013-02-04abs ↗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 study explores discrete versions of Riemannian geometry structures on manifolds.

problem Understanding the relationship between discrete structures and continuous Riemannian geometry.
method Surveying and analyzing discrete counterparts of Riemannian geometry concepts on graphs and simplicial complexes.
result Recent developments include Cheeger type inequalities for higher-dimensional simplicial complexes and Floer type constructions.