A Steiner system, named after Jakob Steiner, is a type of block design: an n-element set together with a collection of k-element subsets, called blocks, chosen so that every t-element subset of the underlying set is contained in exactly one block, written S(t, k, n). Classically the definition also required k to equal t plus 1, with the t=2 case called a Steiner triple system and the t=3 case a Steiner quadruple system, though the modern generalized definition no longer strictly follows that naming pattern. Whether nontrivial Steiner systems exist for t of 6 or more was a long-standing open problem, resolved by Peter Keevash in 2014 with a proof that is non-constructive, so as of a few years later no actual Steiner system was known to be constructible for large values of t.
Facts
Connections
Attributed To
Source Wikipedia: Steiner system
In Branch
Source Wikipedia: Steiner system
Is Kind Of Object
Sources
1. Wikipedia: Steiner system
History section
Unaware of Kirkman's work, Jakob Steiner (1853) reintroduced triple systems, and as this work was more widely known, the systems were named in his honor.
Lead section
In combinatorial mathematics, a Steiner system (named after Jakob Steiner) is a type of block design, specifically a t-design with λ = 1 and t = 2 or (recently) t ≥ 2.
In Branch: Combinatorics, Lead paragraph
In combinatorial mathematics, a Steiner system (named after Jakob Steiner) is a type of block design, specifically a t-design with λ = 1 and t = 2 or (recently) t ≥ 2.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.