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.
A Steiner system with parameters t, k, n, written S(t,k,n), is an n-element set S together with a set of k-element subsets of S (called blocks) with the property that each t-element subset of S is contained in exactly one block. In an alternate notation for block designs, an S(t,k,n) would be a t-(n,k,1) design.
This definition is relatively modern, generalizing the classical definition of Steiner systems which in addition required that k = t + 1. An S(2,3,n) was (and still is) called a Steiner triple system, while an S(3,4,n) was called a Steiner quadruple system, and so on. With the generalization of the definition, this naming system is no longer strictly adhered to.
As of 2012, an outstanding problem in design theory is if any nontrivial Steiner systems have t ≥ 6. It is also unknown if infinitely many have t = 5.
Read more about Steiner System: Properties, History, Mathieu Groups, The Steiner System S(5, 6, 12), The Steiner System S(5, 8, 24)
Famous quotes containing the words steiner and/or system:
“It is not the literal past that rules us, save, possibly, in a biological sense. It is images of the past.... Each new historical era mirrors itself in the picture and active mythology of its past or of a past borrowed from other cultures. It tests its sense of identity, of regress or new achievement against that past.”
—George Steiner (b. 1929)
“Nothing is so well calculated to produce a death-like torpor in the country as an extended system of taxation and a great national debt.”
—William Cobbett (1762–1835)