English
Related papers

Related papers: Bounding Helly numbers via Betti numbers

200 papers

B\'ar\'any, Katchalski and Pach proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $\mathbb{R}^d$ is of volume one, then the intersection of some subfamily of at most $2d$ members is…

Metric Geometry · Mathematics 2015-03-26 Marton Naszodi

We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend…

Metric Geometry · Mathematics 2015-08-11 J. A. De Loera , R. N. La Haye , D. Oliveros , E. Roldán-Pensado

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

Algebraic Geometry · Mathematics 2022-04-05 Saugata Basu , Daniel Perrucci

We prove that $\beta_p(I(G)) = \beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=\pd(I(G))$ and $r:=\reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibi's conjecture is true for the Betti numbers in the last columm…

Commutative Algebra · Mathematics 2018-06-07 Do Trong Hoang

A simplicial graph is said to be (coarsely) Helly if any collection of pairwise intersecting balls has non-empty (coarse) intersection. (Coarsely) Helly groups are groups acting geometrically on (coarsely) Helly graphs. Our main result is…

Group Theory · Mathematics 2024-05-14 Damian Osajda , Motiejus Valiunas

Building on recent work of Mattheus and Verstra\"ete, we establish a general connection between Ramsey numbers of the form $r(F,t)$ for $F$ a fixed graph and a variant of the Zarankiewicz problem asking for the maximum number of 1s in an…

Combinatorics · Mathematics 2024-04-25 David Conlon , Sam Mattheus , Dhruv Mubayi , Jacques Verstraëte

We prove a fractional Helly theorem for $k$-flats intersecting fat convex sets. A family $\mathcal{F}$ of sets is said to be $\rho$-fat if every set in the family contains a ball and is contained in a ball such that the ratio of the radii…

Combinatorics · Mathematics 2024-12-09 Attila Jung , Dömötör Pálvölgyi

We are interested in the maximal values of the Betti numbers b_i({\mathbb R}X_m^n) for fixed i,m,n; where {\mathbb R}X_m^n is the real part of a real nonsingular hypersurface of degree m in the complex projective space {\mathbb C}P^n, and…

Algebraic Geometry · Mathematics 2007-05-23 Frédéric Bihan

Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty intersection. This is a classical and widely studied class of graphs. In this article we focus on groups acting geometrically on Helly graphs --…

Group Theory · Mathematics 2025-01-08 Jérémie Chalopin , Victor Chepoi , Anthony Genevois , Hiroshi Hirai , Damian Osajda

Let X be a simplicial complex on the vertex set V. The rational Leray number L(X) of X is the minimal d such that the rational reduced homology of any induced subcomplex of X vanishes in dimensions d and above. Let \pi be a simplicial map…

Combinatorics · Mathematics 2014-02-26 Gil Kalai , Roy Meshulam

Qualitatively, a no-dimensional Helly-type theorem says that if every small subfamily of convex sets has a common point in a bounded region, then suitable neighborhoods of all the sets in the whole family have a common point. Quantitative…

Functional Analysis · Mathematics 2026-03-27 Grigory Ivanov

Let $n\geq\nu$, let $T$ be an $n$-vertex tree with bipartition class sizes $t_1\geq t_2$, and let $S$ be a $\nu$-vertex tree with bipartition class sizes $\tau_1\geq\tau_2$. Using four natural constructions, we show that the Ramsey number…

Combinatorics · Mathematics 2025-11-20 Jun Yan

We define the Helly number of a polyomino $P$ as the smallest number $h$ such that the $h$-Helly property holds for the family of symmetric and translated copies of $P$ on the integer grid. We prove the following: (i) the only polyominoes…

Computational Geometry · Computer Science 2017-08-22 Jean Cardinal , Hiro Ito , Matias Korman , Stefan Langerman

Let $\Delta=\Delta_1\times\ldots\times \Delta_d\subseteq\mathbb{R}^n$, where $\mathbb{R}^n=\mathbb{R}^{n_1}\times\cdots\times\mathbb{R}^{n_d}$ with each $\Delta_i\subseteq\mathbb{R}^{n_i}$ a non-degenerate simplex of $n_i$ points. We prove…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar

In 2008, Halman showed that for any finite set $P\subset \mathbb R^d$ and any finite family $\mathcal{B}$ of axis-parallel boxes in $\mathbb{R}^d$, if the intersection of $P$ and any subfamily $\mathcal{B}' \subseteq\mathcal{B}$ of size at…

Combinatorics · Mathematics 2025-09-17 Rahul Gangopadhyay , Alexander Polyanskii , Wei Rao

Let $G$ be a simple graph on $n$ vertices. Let $H$ be either the complete graph $K_m$ or the complete bipartite graph $K_{r,s}$ on a subset of the vertices in $G$. We show that $G$ contains $H$ as a subgraph if and only if…

Commutative Algebra · Mathematics 2015-10-16 Huy Tai Ha , Duc Ho

Let $t$ be a non-negative integer and $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ be a set-pair family satisfying $|A_i \cap B_i|\leq t$ for $1\leq i \leq m$. $\mbox{$\cal P$}$ is called strong Bollob\'as $t$-system, if $|A_i\cap…

Combinatorics · Mathematics 2024-06-11 Gábor Hegedüs

We prove estimates for the Betti numbers of constructible sheaves in characteristic p>0 depending only on their rank, stratification and wild ramification. In particular, given a smooth proper variety of dimension n over an algebraically…

Algebraic Geometry · Mathematics 2025-02-18 Haoyu Hu , Jean-Baptiste Teyssier

Path homology is a topological invariant for directed graphs, which is sensitive to their asymmetry and can discern between digraphs which are indistinguishable to the directed flag complex. In Erd\"os-R\'enyi directed random graphs, the…

Algebraic Topology · Mathematics 2024-11-08 Thomas Chaplin

For a fixed set of positive integers $R$, we say $\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. An $R$-graph $\mathcal{H}$ is \emph{covering} if every vertex pair of $\mathcal{H}$…

Combinatorics · Mathematics 2019-01-29 Linyuan Lu , Zhiyu Wang