Skip to main content
MathOverflow

Return to Question

edited body
Source Link
gradstudent
gradstudent
  • 2.2k
  • 16
  • 28

Assume one is given a polyhedral complex $P$ in $\mathbb{R}^n$. Now consider picking uniformly at random a $D \subseteq \{0,1\}^n$. IfIs there way to upper bound the probability that $D$ (a subset of the Boolean hypercube) is not a subset of any of the cells of $P$? (feel free to assume any parameters of $P$ that you think you need)

Assume one is given a polyhedral complex $P$ in $\mathbb{R}^n$. Now consider picking uniformly at random a $D \subseteq \{0,1\}^n$. If there way to upper bound the probability that $D$ (a subset of the Boolean hypercube) is not a subset of any of the cells of $P$? (feel free to assume any parameters of $P$ that you think you need)

Assume one is given a polyhedral complex $P$ in $\mathbb{R}^n$. Now consider picking uniformly at random a $D \subseteq \{0,1\}^n$. Is there way to upper bound the probability that $D$ (a subset of the Boolean hypercube) is not a subset of any of the cells of $P$? (feel free to assume any parameters of $P$ that you think you need)

Source Link
gradstudent
gradstudent
  • 2.2k
  • 16
  • 28

Sampling in a polyhedral complex

Assume one is given a polyhedral complex $P$ in $\mathbb{R}^n$. Now consider picking uniformly at random a $D \subseteq \{0,1\}^n$. If there way to upper bound the probability that $D$ (a subset of the Boolean hypercube) is not a subset of any of the cells of $P$? (feel free to assume any parameters of $P$ that you think you need)