Steiner system
Builds on Block designFinite set
Definition
Let be positive integers with . A Steiner system is a pair where is a finite set with elements. The family is a set of -element subsets of , called blocks. The condition is that each -element subset of is contained in exactly one block.
Remarks
Equivalently, a Steiner system is a - block design. Counting -sets gives the number of blocks: . Example: on the points of the grid , the lines of the affine plane form an . Two distinct points lie on exactly one line, namely . Non-example: there is no . In an , the blocks through a point split the other points into pairs, so must be even, and is odd. An is a Steiner triple system; for , one exists if and only if or . A finite projective plane of order is an .
Reading path
To understand this page from the ground up, read these 22 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Family of sets definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Injective function definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Finite set definition
- Block design definition
- Steiner system definition
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | QHPW53E7YA |
|---|---|
| URI | m2://QHPW53E7YA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05B05, 51E10 |
| Defines | Steiner system |
| Uses | Block design, Finite set |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.