Javascript must be enabled to continue!
The fractional Helly number for separable convexity spaces
View through CrossRef
Abstract
A
convex lattice set
in
$$\mathbb {Z}^d$$
Z
d
is the intersection of a convex set in
$$\mathbb {R}^d$$
R
d
with the integer lattice
$$\mathbb {Z}^d$$
Z
d
. A classical theorem of Doignon states that the
Helly number
of
d
-dimensional convex lattice sets equals
$$2^d$$
2
d
, exponentially larger than the Helly number
$$d+1$$
d
+
1
of ordinary convex sets in
$$\mathbb {R}^d$$
R
d
. By contrast, a remarkable theorem of Bárány and Matoušek states that the
fractional Helly number
of convex lattice sets drops back down to
$$d+1$$
d
+
1
, matching the classical fractional Helly theorem of Katchalski and Liu. In this paper we generalize the Bárány–Matoušek theorem to abstract convexity spaces (in the sense of van de Vel) that satisfy a suitable separation axiom. Our main result implies the following: if a separable convexity space has Radon number at most
r
, then its fractional Helly number is at most
$$2^{r}$$
2
r
. This bound is nearly tight, as illustrated by the case of
box convexity
in
$$\mathbb {R}^d$$
R
d
, whose Radon number is
$$\Theta (\log d)$$
Θ
(
log
d
)
and fractional Helly number equals
$$d+1$$
d
+
1
.
Title: The fractional Helly number for separable convexity spaces
Description:
Abstract
A
convex lattice set
in
$$\mathbb {Z}^d$$
Z
d
is the intersection of a convex set in
$$\mathbb {R}^d$$
R
d
with the integer lattice
$$\mathbb {Z}^d$$
Z
d
.
A classical theorem of Doignon states that the
Helly number
of
d
-dimensional convex lattice sets equals
$$2^d$$
2
d
, exponentially larger than the Helly number
$$d+1$$
d
+
1
of ordinary convex sets in
$$\mathbb {R}^d$$
R
d
.
By contrast, a remarkable theorem of Bárány and Matoušek states that the
fractional Helly number
of convex lattice sets drops back down to
$$d+1$$
d
+
1
, matching the classical fractional Helly theorem of Katchalski and Liu.
In this paper we generalize the Bárány–Matoušek theorem to abstract convexity spaces (in the sense of van de Vel) that satisfy a suitable separation axiom.
Our main result implies the following: if a separable convexity space has Radon number at most
r
, then its fractional Helly number is at most
$$2^{r}$$
2
r
.
This bound is nearly tight, as illustrated by the case of
box convexity
in
$$\mathbb {R}^d$$
R
d
, whose Radon number is
$$\Theta (\log d)$$
Θ
(
log
d
)
and fractional Helly number equals
$$d+1$$
d
+
1
.
Related Results
Helly groups, coarsely Helly groups, and relative hyperbolicity
Helly groups, coarsely Helly groups, and relative hyperbolicity
A simplicial graph is said to be (
coarsely
)
Helly
if any collection of pairwise intersecting balls...
A Touch of Space Weather - Outreach project for visually impaired students
A Touch of Space Weather - Outreach project for visually impaired students
<p><em><span data-preserver-spaces="true">'A Touch of Space Weather' is a project that brings space weather science into...
Solving Undamped and Damped Fractional Oscillators via Integral Rohit Transform
Solving Undamped and Damped Fractional Oscillators via Integral Rohit Transform
Background: The dynamics of fractional oscillators are generally described by fractional differential equations, which include the fractional derivative of the Caputo or Riemann-Li...
Sobre grafos clique críticos
Sobre grafos clique críticos
Se llama completo de un grafo a un conjunto de vértices adyacentes entre si; si un completo es maximal con respecto a la inclusión, se dice que es un clique del grafo. Los cliques ...
Helly meets Garside and Artin
Helly meets Garside and Artin
AbstractA graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin...
Automorphisms and subdivisions of Helly graphs
Automorphisms and subdivisions of Helly graphs
In this paper, we study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the...
On Mixed Fractional Lifting Oscillation Spaces
On Mixed Fractional Lifting Oscillation Spaces
We introduce hyperbolic oscillation spaces and mixed fractional lifting oscillation spaces expressed in terms of hyperbolic wavelet leaders of multivariate signals on Rd, with d≥2....
Convexity (probably) makes languages efficient
Convexity (probably) makes languages efficient
Both functional and lexical categories in natural languages are believed to be shaped by domain-general pressures for efficient information transmission and simplicity of represent...

