English
Related papers

Related papers: Helly-type theorems for the diameter

200 papers

Tverberg's theorem states that for any $k \ge 2$ and any set $P \subset \mathbb{R}^d$ of at least $(d + 1)(k - 1) + 1$ points in $d$ dimensions, we can partition $P$ into $k$ subsets whose convex hulls have a non-empty intersection. The…

Computational Geometry · Computer Science 2023-07-06 Aruni Choudhary , Wolfgang Mulzer

We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families. We prove a conclusive version of Frankl's theorem on…

Combinatorics · Mathematics 2018-10-03 Andrey Kupavskii

The matching number of a family of subsets of an $n$-element set is the maximum number of pairwise disjoint sets. The families with matching number $1$ are called intersecting. The famous Erd\H os-Ko-Rado theorem determines the size of the…

Combinatorics · Mathematics 2019-05-21 Andrey Kupavskii

What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…

Probability · Mathematics 2011-04-05 Sourav Chatterjee , S. R. S. Varadhan

We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…

Metric Geometry · Mathematics 2025-06-30 Marek Lassak

A Helly circular-arc model M = (C,A) is a circle C together with a Helly family \A of arcs of C. If no arc is contained in any other, then M is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly…

Discrete Mathematics · Computer Science 2015-03-19 Min Chih Lin , Francisco J. Soulignac , Jayme L. Szwarcfiter

We study a certain Helly-type question by Konrad Swanepoel. Assume that $X$ is a set of points such that every $k$-subset of $X$ is in centrally symmetric convex position, is it true that $X$ must also be in centrally symmetric convex…

Metric Geometry · Mathematics 2021-04-20 Alexey Garber , Edgardo Roldán-Pensado

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

Combinatorics · Mathematics 2015-05-28 Karen Meagher , Alison Purdy

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…

Combinatorics · Mathematics 2020-05-28 Sherry Sarkar , Pablo Soberón

Selection lemmas are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection lemma type results typically…

Computational Geometry · Computer Science 2014-01-03 Pradeesha Ashok , Ninad Rajgopal , Sathish Govindarajan

We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…

Functional Analysis · Mathematics 2014-02-26 A. Koldobsky , G. Paouris , M. Zymonopoulou

We prove a colorful extension of a Helly-type theorem by Danzer and Gr\"{u}nbaum (Combinatorica, 1982) concerning two-piercing families of axis-parallel boxes in $\mathbb{R}^d$. We also show that our result is tight by constructing extremal…

Computational Geometry · Computer Science 2025-12-17 Sourav Chakraborty , Arijit Ghosh , Soumi Nandi

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Combinatorics · Mathematics 2020-11-30 Pablo Soberón , Yaqian Tang

An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…

Dynamical Systems · Mathematics 2025-06-11 Michael Björklund , Alexander Fish

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

Algebraic Geometry · Mathematics 2024-10-01 Samuel Lidz , Zachary Lihn , Adam Melrod

We prove a Cayley-Bacharach-type theorem for points in projective space $\mathbb{P}^n$ that lie on a complete intersection of $n$ hypersurfaces. This is made possible by new bounds on the growth of the Hilbert function of almost complete…

Algebraic Geometry · Mathematics 2021-09-17 Giulio Caviglia , Alessandro De Stefani

We consider the multiparameter random simplicial complex on a vertex set $\{ 1,\dots,n \}$, which is parameterized by multiple connectivity probabilities. Our key results concern the topology of this complex of dimensions higher than the…

Probability · Mathematics 2023-09-14 Takashi Owada , Gennady Samorodnitsky

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang