Related papers: Tight colorful no-dimensional Tverberg theorem

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

A shaped triangulation is a finite triangulation of an oriented pseudo three manifold where each tetrahedron carries dihedral angles of an ideal hyberbolic tetrahedron. To each shaped triangulation, we associate a quantum partition function…

We give a short survey of problems and results on (1) diameter graphs and hypergraphs, and (2) geometric Ramsey theory. We also make some modest contributions to both areas. Extending a well known theorem of Kahn and Kalai which disproved…

We say that a subset $M$ of $\mathbb R^n$ is exponentially Ramsey if there are $\epsilon>0$ and $n_0$ such that $\chi(\mathbb R^n,M)\ge(1+\epsilon)^n$ for any $n>n_0$, where $\chi(\mathbb R^n,M)$ stands for the minimum number of colors in a…

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

In this paper, we prove a version of the Colored Tverberg Theorem with new constraints on the faces, in which we limit the number of faces with each one of the colors.

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…

In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

$\newcommand{\floor}[1]{\left\lfloor {#1} \right\rfloor} \renewcommand{\Re}{\mathbb{R}}$ Tverberg's theorem states that a set of $n$ points in $\Re^d$ can be partitioned into $\floor{n/(d+1)}$ sets with a common intersection. A point in…

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the…

A result of Matou\v{s}ek and R\"odl in 1995 states that for every $\varepsilon>0$ and every triangle $T$ with circumradius $\rho(T)$, there exists a dimension $n=n(\varepsilon,T)$ such that every $2$-coloring of the $n$-dimensional sphere…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

The Euclidean mixed isoperimetric-isodiametric inequality states that the round ball maximizes the volume under constraint on the product between boundary area and radius. The goal of the paper is to investigate such mixed…

Recently it has been shown that the heuristic Rosenfeld functional derives from the virial expansion for particles which overlap in one center. Here, we generalize this approach to any number of intersections. Starting from the virial…

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…

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes,…

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…