Related papers: A Quantitative Helly-type Theorem: Containment in …

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…

We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…

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…

In this paper we study generalizations of classical results on intersection patterns of set systems in $\mathbb{R}^d$, such as the fractional Helly theorem or the $(p,q)$-theorem, in the setting of arbitrary triangulable spaces with a…

Research on Helly-type theorems in combinatorial convex geometry has produced volumetric versions of Helly's theorem using witness sets and quantitative extensions of Doignon's theorem. This paper combines these philosophies and presents…

We show that the maximum number of pairwise intersecting positive homothets of a $d$-dimensional centrally symmetric convex body, none of which contains the center of another in its interior, is at most $3^{d+1}$. Also, we improve upper…

Assume that $k \le d$ is a positive integer and $\C$ is a finite collection of convex bodies in $\R^d$. We prove a Helly type theorem: If for every subfamily $\C^*\subset \C$ of size at most $\max \{d+1,2(d-k+1)\}$ the set $\bigcap \C^*$…

Answering a question of F\"uredi and Loeb (1994), we show that the maximum number of pairwise intersecting homothets of a $d$-dimensional centrally symmetric convex body $K$, none of which contains the center of another in its interior, is…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

In this short note we show that Helly's Intersection Theorem holds for convex sets in uniquely geodesic spaces (in particular in CAT(0) spaces) without the assumption that the convex sets are open or closed.

We prove a nearly optimal bound on the number of stable homotopy types occurring in a k-parameter semi-algebraic family of sets in $\R^\ell$, each defined in terms of m quadratic inequalities. Our bound is exponential in k and m, but…

We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \subseteq R^d, where d \in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional…

The 1913 Helly's theorem states that any family ${\cal K}$ of $n\geq d+1$ convex sets in ${\mathbb R}^d$ can be pierced by a single point if and only if any $d+1$ of ${\cal K}$'s elements can. In 2002 Alon, Kalai, Matou\v{s}ek and Meshulam…

A family of homothets of an o-symmetric convex body K in d-dimensional Euclidean space is called a Minkowski arrangement if no homothet contains the center of any other homothet in its interior. We show that any pairwise intersecting…

We show that for any sufficiently rich compact family $\mathcal{H}$ of $C^1$ diffeomorphisms of a closed Riemannanian manifold $M$, the average geometric intersection number over $h \in \mathcal{H}$ between $h(V)$ and $W$, for $V, W$ any…

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$,…

We provide a number of new quantitative versions of Helly's theorem. For example, we show that for every family $\{P_i:i\in I\}$ of closed half-spaces $$P_i=\{x\in {\mathbb R}^n:\langle x,w_i\rangle \leq 1\}$$ in ${\mathbb R}^n$ such that…

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…

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$…

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…