Skip to main content
3 of 6
deleted 33 characters in body
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Partition complexity measure of the boolean cube?

Given $n$ points $p_1,\dots,p_n$ in $\{0,1\}^d$ my goal is to find $m$ pairwise disjoint index sets $\mathcal I_1,\dots,\mathcal I_m$ that are subsets of $\{1,\dots,n\}$ whose union is $\{1,\dots,n\}$ on the condition:

number of facets in convex hull of points in each index set is $O(n)$ (the polytope $\mathcal P_k$ with vertex points indexed by with $p_i$ where $i\in\mathcal I_k$ can be defined by intersection of $O(n)$ half spaces at every $k\in\{1,\dots,m\}$).

  1. My problem is what is the worst case $m$ do I need?

  2. Does $m=polylog(d)$ hold if $d=polylog(n)$ holds?

Turbo
  • 13.9k
  • 1
  • 27
  • 76