ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite point set in cmathbbRdcmathbb{R}^d. A simplicial half-net is a family of simplices determined by points of SS such that every halfspace containing at least half the points of SS contains one of these simplices. Simplicial half-net conjecture. Every point set S⊂RdS\subset\mathbb{R}^d has a simplicial half-net. The conjecture would extend the lower-bound method based on simplicial half-nets from the planar setting to dimension dd, potentially removing the restriction k<⌊n/(d+1)⌋k<\lfloor n/(d+1)\rfloor from the lower bound for the number of (≤k)(\leq k)-facets.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.