Related papers: No-dimensional Tverberg Partitions Revisited

We develop a class of mixed-integer formulations for disjunctive constraints intermediate to the big-M and convex hull formulations in terms of relaxation strength. The main idea is to capture the best of both the big-M and convex hull…

Let $f_r(d,s_1,\ldots,s_r)$ denote the least integer $n$ such that every $n$-point set $P\subseteq\mathbb{R}^d$ admits a partition $P=P_1\cup\cdots\cup P_r$ with the property that for any choice of $s_i$-convex sets $C_i\supseteq P_i$…

By using representation theory, we reduce the size of the set of possible values for the dimension of the convex hull of all feasible points polytope of an orthogonal array (OA) defining integer linear program (ILP). Our results address the…

Let $\mu$ be an Ahlfors-David probability measure on $\mathbb{R}^q$ with support $K$. For every $n\geq 1$, let $C_n(\mu)$ denote the collection of all the $n$-optimal sets for $\mu$ with respect to the geometric mean error. We prove that,…

Let $1 \leq m < s \leq n$ and let $A \subseteq \mathbb{R}^n$ be a Borel set of with $s$-dimensional Hausdorff measure $\mathcal{H}^s(A) > 0$. The classical Marstrand slicing theorem states that, for almost every $m$-dimensional subspace $V…

We prove a Tverberg-type theorem using the probabilistic method. Given $\varepsilon >0$, we find the smallest number of partitions of a set $X$ in $R^d$ into $r$ parts needed in order to induce at least one Tverberg partition on every…

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…

For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so…

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…

Let $P$ be a set of $n$ points in the plane. We consider the problem of partitioning $P$ into two subsets $P_1$ and $P_2$ such that the sum of the perimeters of $\text{CH}(P_1)$ and $\text{CH}(P_2)$ is minimized, where $\text{CH}(P_i)$…

For $n\in \mathbb{N}$, consider a hyperbolic $n$-dimensional simplex $\Delta$, defined by $1+n$ points in the compactified hyperbolic space $\mathbf{H}^n \sqcup \partial \mathbf{H}^n$. For each integer $m\le n$, denote…

The colorful Helly theorem and Tverberg's theorem are fundamental results in discrete geometry. We prove a theorem which interpolates between the two. In particular, we show the following for any integers $d \geq m \geq 1$ and $k$ a prime…

The present manuscript aims to derive an expression for the lower bound of the modulus of the Dirichlet eta function on vertical lines $\Re(s)=\alpha$. The approach employs concepts of two-dimensional principal component analysis built on a…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…

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…

Let $W_N(\beta) = \mathrm{E}_0\left[e^{ \sum_{n=1}^N \beta \omega(n,S_n) - N\beta^2/2}\right]$ be the partition function of a two-dimensional directed polymer in a random environment, where $\omega(i,x), i\in \mathbb{N}, x\in \mathbb{Z}^2$…

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We…

Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach…

We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…

This paper extends some results of [M5] and [M3], in particular, removing assumptions of positive lower density. We give conditions on a general family $P_{\lambda}:\mathbb{R}^{n}\to\mathbb{R}^{m}, \lambda \in \Lambda,$ of orthogonal…