English
Related papers

Related papers: On the Vietoris-Rips Complexes of Integer Lattices

200 papers

We show a new reduction method on a simplicial complex. This reduction works well with relations and Dowker complexes. The idea is to add a dummy vertex $ z $ to the simplicial complex $K$. We add the simplicial cone $ z * L $ to $K$ where…

Combinatorics · Mathematics 2024-01-17 Dominic Desjardins Côté

The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most $k$ that induces a connected subgraph of $G$. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in…

Data Structures and Algorithms · Computer Science 2018-07-06 Matthew Johnson , Giacomo Paesani , Daniel Paulusma

The fine curve complex of a surface is a simplicial complex whose vertices are essential simple closed curves and whose $k$-simplices are collections of $k+1$ disjoint curves. We prove that the fine curve complex is homotopy equivalent to…

Geometric Topology · Mathematics 2026-02-11 Ryan Dickmann , Zachary Himes , Alexander Nolte , Roberta Shapiro

We prove that any arithmetic locally symmetric space is homotopy equivalent to a simplicial complex where the number of simplices is bounded linearly in the volume of the space. This settles a well-known conjecture of Gelander. The main…

Number Theory · Mathematics 2026-02-03 Mikołaj Frączyk , Sebastian Hurtado , Jean Raimbault

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…

Geometric Topology · Mathematics 2014-01-16 Piotr Przytycki , Jennifer Schultens

Let $X$ be a compact K\"ahler manifold. We prove that if $X$ admits a smooth Hermitian metric $\omega$ with quasi-positive second Chern-Ricci curvature $\mathrm{Ric}^{(2)}(\omega)$, then $X$ is projective and rationally connected. In…

Differential Geometry · Mathematics 2020-06-25 Xiaokui Yang

For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…

Combinatorics · Mathematics 2014-09-18 Michal Adamaszek

A Hermitian-symplectic metric is a Hermitian metric whose K\"ahler form is given by the $(1,1)$-part of a closed $2$-form. Streets-Tian Conjecture states that a compact complex manifold admitting a Hermitian-symplectic metric must be…

Differential Geometry · Mathematics 2025-04-07 Yuqin Guo , Fangyang Zheng

Let R be a commutative noetherian ring. We give criteria for a complex of cotorsion flat R-modules to be minimal, in the sense that every self homotopy equivalence is an isomorphism. To do this, we exploit Enochs' description of the…

Commutative Algebra · Mathematics 2019-07-15 Peder Thompson

Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips…

Computational Geometry · Computer Science 2016-04-04 Aruni Choudhary , Michael Kerber , Sharath Raghvendra

Theorem A. Let $M^n$ denote a closed Riemannian manifold with nonpositive sectional curvature and let $\tilde M^n$ be the universal cover of $M^n$ with the lifted metric. Suppose that the universal cover $\tilde M^n$ contains no totally…

Differential Geometry · Mathematics 2009-02-16 Jianguo Cao , Xiaoyang Chen

In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…

Combinatorics · Mathematics 2010-09-23 Matthew Kahle

Let $G$ be a graph and $r \ge 1$. A vertex subset is $r$-independent if every connected component of its induced subgraph has size at most $r$. The family of all such subsets forms a simplicial complex, the $r$-independence complex…

Combinatorics · Mathematics 2026-05-26 Rutuja Sawant

The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth…

Algebraic Topology · Mathematics 2026-05-15 António Leitão

Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…

Functional Analysis · Mathematics 2016-12-23 Roman Vershynin

We show that if $K$ is a nilpotent finite complex, then $\Omega K$ can be built from spheres using fibrations and homotopy (inverse) limits. This is applied to show that if ${\mathrm {map}}_*(X,S^n)$ is weakly contractible for all $n$, then…

Algebraic Topology · Mathematics 2007-05-23 Jeffrey Strom

We study the projective geometry of homogeneous varieties $X= G/P\subset P(V)$, where $G$ is a complex simple Lie group, $P$ is a maximal parabolic subgroup and $V$ is the minimal $G$-module associated to $P$. Our study began with the…

Algebraic Geometry · Mathematics 2007-05-23 Joseph M. Landsberg , Laurent Manivel

The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…

Combinatorics · Mathematics 2025-04-08 Himanshu Chandrakar , Anurag Singh

Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…

Combinatorics · Mathematics 2022-11-23 Benjamin Braun , Robert Davis , Derek Hanely , Morgan Lane , Liam Solus

For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the…

Combinatorics · Mathematics 2026-03-17 Fedor B. Lyudogovskiy