Lower bound for the size of simplex t-designs
Statement
Let be the minimal number of elements in a -design in the -point simplex, and let denote a binomial coefficient. Simplex-design lower-bound conjecture. The minimal number of elements satisfies
This proposed bound generalizes the rank-based lower bound established in the paper for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.