Combinatorial design
Builds on Finite setBlock design
Definition
Let be positive integers with . Let be a finite set, whose elements are called points. Let be a finite family of subsets of , called blocks, with repetitions allowed. The pair is a - design if:
- .
- Every block has exactly points.
- Every subset of with points is contained in exactly blocks.
A combinatorial design in the usual sense is a -design of this kind. More broadly, the term covers any finite set with a family of subsets that satisfies a prescribed balance condition of this sort.
Remarks
A - design is a balanced incomplete block design, and a - design is a Steiner system . Counting gives the number of blocks: .
Example: with blocks , , , , , , is a - design, the Fano plane. The blocks are the translates of modulo , whose pairwise differences cover each nonzero residue exactly once, so every pair of points lies in exactly one block.
Non-example: with blocks and is not a - design, because the pair lies in no block.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Block design concept
- Finite set concept
- Combinatorial design definition
Further reading
About this page
| Tag | CQ4C1WKMF6 |
|---|---|
| URI | m2://CQ4C1WKMF6 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05B05, 05B30 |
| Defines | Combinatorial design |
| Uses | Finite set, Block design |
| 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.
What links here
No page links to this page yet.