ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N∗(d,t)N_*(d,t) be the minimal number of elements in a tt-design in the dd-point simplex, and let (ab)\binom{a}{b} denote a binomial coefficient. Simplex-design lower-bound conjecture. The minimal number of elements satisfies

N∗(d,t)≥(d+t2−1t2).N_*(d,t) \geq \binom{d+\frac{t}{2}-1}{\frac{t}{2}}.

This proposed bound generalizes the rank-based lower bound established in the paper for t=4t=4 and is intended to describe the growth of the minimum design size beyond the paper's main focus; it remains open in general.

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.