Related papers: Helly Numbers of Polyominoes

We obtain three Helly-type results. First, we establish a Quantitative Colorful Helly-type theorem with the optimal Helly number \(2d\) concerning the diameter of the intersection of a family of convex bodies. Second, we prove a…

The Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected…

Given a set $S \subseteq \mathbb{R}^2$, define the \emph{Helly number of $S$}, denoted by $H(S)$, as the smallest positive integer $N$, if it exists, for which the following statement is true: for any finite family $\mathcal{F}$ of convex…

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.

We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers $b$ and $d$ there exists an integer $h(b,d)$ such that the following…

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…

We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…

We prove existence of Helly numbers for crystals and for cut-and-project sets with convex windows. Also we show that for a two-dimensional crystal consisting of $k$ copies of a single lattice the Helly number does not exceed $k+6$.

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…

Let P be a simple thin polyomino, roughly speaking a polyomino that has no holes and does not contain a square tetromino as a subpolyomino. In this paper, we determine the reduced Hilbert series $h(t)/(1-t)^d$ of K[P] by proving that $h(t)$…

We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this number by $g(h)$ and say that a polyomino is crystallized if…

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

Grid polyominoes form a class of thin polyominoes with one or more holes arranged in a grid-like pattern in the plane. In this paper, we prove that the rook polynomial of grid polyominoes coincides with the h-polynomial of their…

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

A separated $d$-interval is defined as a disjoint union of $d$ convex sets from the real line $\mathbb R$. In this paper, we establish a series of Helly-type theorems for convexity spaces derived from separated $d$-intervals. Our results…

A convex lattice set in $\mathbb{Z}^d$ is the intersection of a convex set in $\mathbb{R}^d$ and the integer lattice $\mathbb{Z}^d$. A well-known theorem of Doignon states that the Helly number of $d$-dimensional convex lattice sets equals…

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 provide a new quantitative version of Helly's theorem: there exists an absolute constant $\alpha >1$ with the following property: if $\{P_i: i\in I\}$ is a finite family of convex bodies in ${\mathbb R}^n$ with ${\rm int}\left…

What is the maximum number of holes that a polyomino with $n$ tiles can enclose? Call this number $f(n)$. We show that if $n_k = \left( 2^{2k+1} + 3 \cdot 2^{k+1}+4 \right) / 3$ and $h_k = \left( 2^{2k}-1 \right) /3$, then $f(n_k) = h_k$…