English
Related papers

Related papers: The Helly number of Hamming balls and related prob…

200 papers

A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension we prove several new results on the…

Data Structures and Algorithms · Computer Science 2019-11-12 Feodor F. Dragan , Guillaume Ducoffe

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

Given a point set $S$ in $\mathbb{R}^d$, a family of sets is $S$-intersecting if its members have a point in common in $S$. Recently, Edwards and Sober\'{o}n proved a fractional version of Halman's theorem for axis-parallel boxes, showing…

Combinatorics · Mathematics 2025-03-18 Taehyun Eom , Minki Kim , Eon Lee

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

Combinatorics · Mathematics 2023-01-19 Csaba Biró , Jenő Lehel , Géza Tóth

Let $\mbox{$\cal F$}\subseteq 2^{[n]}$ be a fixed family of subsets. Let $D(\mbox{$\cal F$})$ stand for the following set of Hamming distances: $$ D(\mbox{$\cal F$}):=\{d_H(F,G):~ F, G\in \mbox{$\cal F$},\ F\neq G\}. $$ $\mbox{$\cal F$}$ is…

Combinatorics · Mathematics 2023-05-02 Gábor Hegedüs

We prove Helly-type theorems for line transversals to disjoint unit balls in $\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the balls, any…

Computational Geometry · Computer Science 2007-05-23 Otfried Cheong , Xavier Goaoc , Andreas Holmsen , Sylvain Petitjean

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

Metric Geometry · Mathematics 2007-05-23 Ciprian Borcea , Xavier Goaoc , Sylvain Petitjean

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states…

Combinatorics · Mathematics 2026-04-09 Sean English , Sam Spiro

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

Combinatorics · Mathematics 2018-12-17 Hao Huang , Oleksiy Klurman , Cosmin Pohoata

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

Combinatorics · Mathematics 2025-10-14 Nataly Brukhim , Ariel Bruner , Orit E. Raz

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

Dynamical Systems · Mathematics 2018-04-13 Krzysztof Burdzy , Mauricio Duarte

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Logic · Mathematics 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…

Combinatorics · Mathematics 2025-04-24 Srinivas Arun , Travis Dillon

Helly's theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global intersection patterns. A classical result of Eckhoff in 1988 provided an optimal fractional Helly…

Combinatorics · Mathematics 2024-02-09 Debsoumya Chakraborti , Jaehoon Kim , Jinha Kim , Minki Kim , Hong Liu

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

Metric Geometry · Mathematics 2020-08-05 Lee-Ad Gottlieb , Aryeh Kontorovich

Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…

Classical Analysis and ODEs · Mathematics 2025-07-22 Julian Weigt

We prove the analogue of Helly's theorem for systolic complexes. Namely, we show that 7-systolic complexes have Helly dimension less or equal to 1, whereas 6-systolic complexes have Helly dimension bounded from the above by 2.

Group Theory · Mathematics 2016-03-27 Krzysztof Święcicki

For a given ring (domain) in $\overline{\mathbb{R}}^n$ we discuss whether its boundary components can be separated by an annular ring with modulus nearly equal to that of the given ring. In particular, we show that, for all $n\ge 3\,,$ the…

Complex Variables · Mathematics 2020-06-03 Anatoly Golberg , Toshiyuki Sugawa , Matti Vuorinen

We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$,…

Metric Geometry · Mathematics 2014-07-09 Luis Montejano

We prove a no-dimensional Helly theorem for affine spaces and convex sets using the unboundedness framework of Aronov, Goodman, and Pollack (Computational Geometry, 2002). This generalizes the fundamental result of Adiprasito, B\'ar\'any,…

Combinatorics · Mathematics 2025-12-01 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi