Math 2.0

Combinatorics Definition

Combinatorial design

Builds on Finite setBlock design

Definition

Let t,v,k,λt, v, k, \lambda be positive integers with t≤k≤vt \le k \le v. Let XX be a finite set, whose elements are called points. Let ℬ\mathcal{B} be a finite family of subsets of XX, called blocks, with repetitions allowed. The pair (X,ℬ)(X, \mathcal{B}) is a tt-(v,k,λ)(v, k, \lambda) design if:

  1. ∣X∣=v\abs{X} = v.
  2. Every block has exactly kk points.
  3. Every subset of XX with tt points is contained in exactly λ\lambda blocks.

A combinatorial design in the usual sense is a tt-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 22-(v,k,λ)(v, k, \lambda) design is a balanced incomplete block design, and a tt-(v,k,1)(v, k, 1) design is a Steiner system S(t,k,v)S(t, k, v). Counting gives the number of blocks: ∣ℬ∣=λ(vt)/(kt)\abs{\mathcal{B}} = \lambda \binom{v}{t} / \binom{k}{t}.

Example: X={1,…,7}X = \set{1, \dots, 7} with blocks {1,2,4}\set{1,2,4}, {2,3,5}\set{2,3,5}, {3,4,6}\set{3,4,6}, {4,5,7}\set{4,5,7}, {5,6,1}\set{5,6,1}, {6,7,2}\set{6,7,2}, {7,1,3}\set{7,1,3} is a 22-(7,3,1)(7, 3, 1) design, the Fano plane. The blocks are the translates of {1,2,4}\set{1, 2, 4} modulo 77, whose pairwise differences ±1,±2,±3\pm 1, \pm 2, \pm 3 cover each nonzero residue exactly once, so every pair of points lies in exactly one block.

Non-example: X={1,2,3,4}X = \set{1, 2, 3, 4} with blocks {1,2}\set{1, 2} and {3,4}\set{3, 4} is not a 22-(4,2,1)(4, 2, 1) design, because the pair {1,3}\set{1, 3} 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Block design concept
  2. Finite set concept
  3. Combinatorial design definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Combinatorial_design
About this page
TagCQ4C1WKMF6
URIm2://CQ4C1WKMF6
Kinddefinition
WritingW0 stub
MSC05B05, 05B30
DefinesCombinatorial design
UsesFinite set, Block design
Changed2 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.