Colorful positive bases decomposition and Helly-type results for cones

TL;DR

This paper establishes a new colorful Helly-type theorem for cones in Euclidean space, identifying optimal bounds for the number of sets and solutions, based on a novel Carathéodory-type result for positive bases.

Contribution

It introduces a new colorful Helly-type theorem for cones with optimal bounds, utilizing a novel Carathéodory-type result for positive bases, advancing geometric combinatorics.

Findings

Proves a colorful Helly-type theorem with optimal bounds.

Identifies the Helly number and number of colors as optimal.

Develops a new Carathéodory-type result for positive bases.

Abstract

We prove the following colorful Helly-type result: Fix $k \in [d-1]$. Assume $\mathcal{A}_1, \dots, \mathcal{A}_{d+(d-k)+1}$ are finite sets (colors) of nonzero vectors in $\R^d$. If for every rainbow sub-selection $R$ from these sets of size at most $\max \{d+1, 2(d-k+1)\}$, the system $\langle {a},{x} \rangle \leq 0,\; a \in R$ has at least $k$ linearly independent solutions, then at least one of the systems $\langle {a},{x} \rangle \leq 0,\; a \in \mathcal{A}_i,$ $i \in [d+(d-k)+1]$ has at least $k$ linearly independent solutions. A \emph{rainbow sub-selection} from several sets refers to choosing at most one element from each set (color). The Helly number $\max \{d+1, 2(d-k+1)\}$ and the number of colors $d+(d-k)+1$ are optimal. Our key observation is a certain colorful Carath\'eodory-type result for positive bases.