Related papers: Maximum Betti numbers of \v{C}ech complexes
A polyhedron in a three-dimensional hyperbolic space is said to be generalized if finite, ideal and truncated vertices are admitted. In virtue of Belletti's theorem (2021) the exact upper bound for volumes of generalized hyperbolic…
We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…
We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…
We prove an analogue of the Approximation Theorem of L^2-Betti numbers by Betti numbers for arbitrary coefficient fields and virtually torsionfree amenable groups. The limit of Betti numbers is identified as the dimension of some module…
In their paper proving the Hirsch bound for flag normal simplicial complexes (Math. Oper.~Res.~2014) Adiprasito and Benedetti define the notion of~\emph{combinatorial segment}. The study of the maximal length of these objects provides the…
We construct a family of examples of complete $(2+n)-$dimensional ($n\ge 2$) open manifolds with positive Ricci curvature, sectional curvature bounded from below and infinite Betti numbers $b_2,b_n$, moreover its volume growth can be…
Here we prove some special cases of the following conjecture: that the sum of the Betti numbers of a 1-connected elliptic space is greater than the total rank of its homotopy groups. Our main tool is Sullivan's minimal model.
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…
A convex polygon $A$ is related to a convex $m$-gon $K= \bigcap_{i=1}^m k_i^+$, where $k_1^+,..., k_m^+$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^+,...,a_l$, each of which is a…
We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…
We prove an upper bound on the rank of the abelianised revised fundamental group (called "revised first Betti number") of a compact $RCD^{*}(K,N)$ space, in the same spirit of the celebrated Gromov-Gallot upper bound on the first Betti…
We analyze the asymptotic extremal growth rate of the Betti numbers of clique complexes of graphs on n vertices not containing a fixed forbidden induced subgraph H. In particular, we prove a theorem of the alternative: for any H the growth…
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.
For a simplicial complex $\Delta$, the graded Betti number $\beta_{i,j}(k[\Delta])$ of the Stanley-Reisner ring $k[\Delta]$ over a field $k$ has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if $\Delta$ is the…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We give lower bounds on the maximal injectivity radius for a closed orientable hyperbolic 3-manifold M with first Betti number 2, under some additional topological hypotheses. A corollary of the main result is that if M has first Betti…