Download Wolfram Notebook

A Steiner system is a set of points, and a set of subsets of of size (called blocks), such that any points of are in exactly one of the blocks. The special case and corresponds to a so-called Steiner triple system. For a projective plane, , , , and the blocks are simply lines.

The number of blocks containing a point in an Steiner system is independent of the point. In fact,

where is a binomial coefficient. The total number of blocks is also determined and is given by

For , these numbers also satisfy and by Fisher's block design inequality.

An is a block design with when . The formulas for and require that divide and divide . For fixed , Wilson (1975) proved existence for all sufficiently large satisfying both conditions. At smaller values of , constructions settling cases left open in the Handbook of Combinatorial Designs (Colbourn and Dinitz 2007) include and (Banakh et al. 2026), and (Hetman 2026a), and and (Hetman 2026b). Hetman (2025) constructed and used a recursive construction to obtain .

The permutations of the points preserving the blocks of a Steiner system form the automorphism group of . For example, consider the set of 9 points in the two-dimensional vector space over the field of three elements. The blocks are the 12 lines of the form with , which have three elements each. The system is an because any two points uniquely determine a line.

For this construction in affine geometry, the affine transformations preserving the lines form a subgroup of the automorphism group. For a vector space of dimension over a field of elements, the same construction gives a Steiner system .

Several interesting groups arise as automorphism groups of Steiner systems. The following table lists the Mathieu groups associated with the Witt designs. In the case, has index 2 in the full automorphism group ; the other listed groups are the full automorphism groups. These groups are unique up to isomorphism, and are not only sporadic simple groups, but are also highly transitive.

A Steiner system is block-transitive when its automorphism group has a transitive group action on the blocks. Wang et al. (2026) proved that no with is block-transitive. This establishes the Steiner case of the conjecture of Cameron and Praeger (1993) that no nontrivial block-transitive 6-design exists.

See also

Automorphism Group, Configuration, Mathieu Groups, Simple Group, Steiner Quadruple System, Steiner Triple System, t-Design, Transitive Group

Portions of this entry contributed by Todd Rowland

Explore with Wolfram|Alpha

References

Banakh, T.; Hetman, I.; and Ravsky, A. "Steiner Systems and Exist." 18 May 2026. https://arxiv.org/abs/2511.05191.Cameron, P. J. and Praeger, C. E. "Block-Transitive -Designs, II: Large ." In Finite Geometries and Combinatorics (Ed. F. de Clerck and J. W. P. Hirschfeld). Cambridge, England: Cambridge University Press, pp. 103-120, 1993. https://doi.org/10.1017/CBO9780511526336.012.Colbourn, C. J. and Dinitz, J. H. (Eds.). Handbook of Combinatorial Designs, 2nd ed. Boca Raton, FL: Chapman & Hall/CRC, 2007.Hetman, I. "Existence of , New Unitals of Order and Other Steiner Systems with Block Length ." 24 Nov 2025. https://arxiv.org/abs/2511.20708.Hetman, I. "There Exist Steiner Systems and ." 12 Oct 2026a. https://arxiv.org/abs/2604.04975.Hetman, I. "There Exist Steiner Systems and ." J. Combin. Designs 34, 259-261, 2026b. https://doi.org/10.1002/jcd.70011.Wang, X.; Huang, Z.; and Liu, W. "On the Cameron-Praeger Conjecture for Steiner 6-Designs." 4 Nov 2026. https://arxiv.org/abs/2611.06081v1.Wilson, R. M. "An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures." J. Combin. Theory Ser. A 18, 71-79, 1975. https://doi.org/10.1016/0097-3165(75)90067-9.

Referenced on Wolfram|Alpha

Steiner System

Cite this as:

Weisstein, Eric W., with contributions by Todd Rowland. "Steiner System." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SteinerSystem.html

Subject classifications