The Covering Number C(12,6,4)
Statement
A - covering is a family of -subsets of a -set meeting every -subset at least times, and is the least number of blocks. The recorded bounds for were . No - covering with blocks exists, so .
Context
closes a one-block gap in the covering tables; the analogous next case is not reachable by this method
An open value in the covering design tables, the kind of documented specific gap that design theorists track but that has no audience beyond them.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The disclosure lists exploratory analysis, computational search, supporting code, manuscript drafting and revision, and proofreading, without separating which step came from where, so the lowest tier applies.
closes a one-block gap in the covering tables; the analogous next case is not reachable by this method
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.