English
Related papers

Related papers: Maximum Betti numbers of \v{C}ech complexes

200 papers

Upper bounds on the topological Betti numbers of Vietoris-Rips complexes are established, and examples of such complexes with high Betti numbers are given.

Combinatorics · Mathematics 2009-10-02 Michael Goff

This note proves that only a linear number of holes in a \v{C}ech complex of $n$ points in $\mathbb{R}^d$ can persist over an interval of constant length. Specifically, for any fixed dimension $p < d$ and fixed $\varepsilon > 0$, the number…

Combinatorics · Mathematics 2026-02-24 Herbert Edelsbrunner , Matthew Kahle , Shu Kanazawa

This paper gives a sharp upper bound for the Betti numbers of a finitely generated multigraded $R$-module, where $R=\Bbbk [x_{1},...,x_{m}]$ is the polynomial ring over a field $\Bbbk$ in $m$ variables. The bound is given in terms of the…

Commutative Algebra · Mathematics 2007-05-23 Amanda Beecher

Suppose X is any finite complex with vanishing L^2 Betti number. We prove upper bounds on the Betti numbers for regular coverings of X, sublinear in the order of covering. The bounds are sensitive to the Novikov-Shubin invariants of X, and…

Geometric Topology · Mathematics 2007-05-23 Bryan Clair , Kevin Whyte

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of…

Metric Geometry · Mathematics 2016-02-18 Karim Adiprasito , Eran Nevo , José Alejandro Samper

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle , Günter M. Ziegler

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

Combinatorics · Mathematics 2016-10-10 Gabor Hegedüs

We prove upper bounds on the sum of Betti numbers of tropical prevarieties in dense and sparse settings. In the dense setting the bound is in terms of the volume of Minkowski sum of Newton polytopes of defining tropical polynomials, or,…

Algebraic Geometry · Mathematics 2018-03-13 Dima Grigoriev , Nicolai Vorobjov

Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…

Computational Geometry · Computer Science 2021-06-15 Saeed Asaeedi , Farzad Didehvar , Ali Mohades

We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…

Computational Geometry · Computer Science 2022-07-27 Mohammad Ali Abam , Ali Mohammad Lavasani , Denis Pankratov

Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…

Combinatorics · Mathematics 2017-03-17 Amir Abu-Fraiha , Roy Meshulam

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We show that for any degree $d$ hypersurface $Y \subset X$ in a possibly singular projective variety $X \subset \mathbf{P}^N$, the total Betti number of $Y$ is bounded by $3\text{deg}(X)\cdot d^n + C\cdot d^{n-1}$ for some explicit constant…

Algebraic Geometry · Mathematics 2026-01-29 Xuanyu Pan , Dingxin Zhang , Xiping Zhang

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

Computational Geometry · Computer Science 2024-12-18 Hernán González-Aguilar , David Orden , Pablo Pérez-Lantero , David Rappaport , Carlos Seara , Javier Tejel , Jorge Urrutia

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Metric Geometry · Mathematics 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

Commutative Algebra · Mathematics 2019-10-29 Adam Boocher , Derrick Wigglesworth

We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…

Commutative Algebra · Mathematics 2016-01-14 Janko Boehm , Stavros Argyrios Papadakis

We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…

Combinatorics · Mathematics 2026-05-12 Katarina Krivokuća
‹ Prev 1 2 3 10 Next ›