Misplaced Pages

Steiner system

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Block design in combinatorial mathematics
The Fano plane is a Steiner triple system S(2,3,7). The blocks are the 7 lines, each containing 3 points. Every pair of points belongs to a unique line.

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 or (recently) 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 new. The classical definition of Steiner systems also required that k = t + 1. An S(2,3,n) was (and still is) called a Steiner triple (or triad) system, while an S(3,4,n) is called a Steiner quadruple system, and so on. With the generalization of the definition, this naming system is no longer strictly adhered to.

Long-standing problems in design theory were whether there exist any nontrivial Steiner systems (nontrivial meaning t < k < n) with t ≥ 6; also whether infinitely many have t = 4 or 5. Both existences were proved by Peter Keevash in 2014. His proof is non-constructive and, as of 2019, no actual Steiner systems are known for large values of t.

Types of Steiner systems

A finite projective plane of order q, with the lines as blocks, is an S(2, q + 1, q + q + 1), since it has q + q + 1 points, each line passes through q + 1 points, and each pair of distinct points lies on exactly one line.

A finite affine plane of order q, with the lines as blocks, is an S(2, q, q). An affine plane of order q can be obtained from a projective plane of the same order by removing one block and all of the points in that block from the projective plane. Choosing different blocks to remove in this way can lead to non-isomorphic affine planes.

An S(3,4,n) is called a Steiner quadruple system. A necessary and sufficient condition for the existence of an S(3,4,n) is that n ≡ {\displaystyle \equiv } 2 or 4 (mod 6). The abbreviation SQS(n) is often used for these systems. Up to isomorphism, SQS(8) and SQS(10) are unique, there are 4 SQS(14)s and 1,054,163 SQS(16)s.

An S(4,5,n) is called a Steiner quintuple system. A necessary condition for the existence of such a system is that n ≡ {\displaystyle \equiv } 3 or 5 (mod 6) which comes from considerations that apply to all the classical Steiner systems. An additional necessary condition is that n ≢ {\displaystyle \not \equiv } 4 (mod 5), which comes from the fact that the number of blocks must be an integer. Sufficient conditions are not known. There is a unique Steiner quintuple system of order 11, but none of order 15 or order 17. Systems are known for orders 23, 35, 47, 71, 83, 107, 131, 167 and 243. The smallest order for which the existence is not known (as of 2011) is 21.

Steiner triple systems

An S(2,3,n) is called a Steiner triple system, and its blocks are called triples. It is common to see the abbreviation STS(n) for a Steiner triple system of order n. The total number of pairs is n(n-1)/2, of which three appear in a triple, and so the total number of triples is n(n−1)/6. This shows that n must be of the form 6k+1 or 6k + 3 for some k. The fact that this condition on n is sufficient for the existence of an S(2,3,n) was proved by Raj Chandra Bose and T. Skolem. The projective plane of order 2 (the Fano plane) is an STS(7) and the affine plane of order 3 is an STS(9). Up to isomorphism, the STS(7) and STS(9) are unique, there are two STS(13)s, 80 STS(15)s, and 11,084,874,829 STS(19)s.

We can define a multiplication on the set S using the Steiner triple system by setting aa = a for all a in S, and ab = c if {a,b,c} is a triple. This makes S an idempotent, commutative quasigroup. It has the additional property that ab = c implies bc = a and ca = b. Conversely, any (finite) quasigroup with these properties arises from a Steiner triple system. Commutative idempotent quasigroups satisfying this additional property are called Steiner quasigroups.

Resolvable Steiner systems

Some of the S(2,3,n) systems can have their triples partitioned into (n-1)/2 sets each having (n/3) pairwise disjoint triples. This is called resolvable and such systems are called Kirkman triple systems after Thomas Kirkman, who studied such resolvable systems before Steiner. Dale Mesner, Earl Kramer, and others investigated collections of Steiner triple systems that are mutually disjoint (i.e., no two Steiner systems in such a collection share a common triplet). It is known (Bays 1917, Kramer & Mesner 1974) that seven different S(2,3,9) systems can be generated to together cover all 84 triplets on a 9-set; it was also known by them that there are 15360 different ways to find such 7-sets of solutions, which reduce to two non-isomorphic solutions under relabeling, with multiplicities 6720 and 8640 respectively.

The corresponding question for finding thirteen different disjoint S(2,3,15) systems was asked by James Sylvester in 1860 as an extension of the Kirkman's schoolgirl problem, namely whether Kirkman's schoolgirls could march for an entire term of 13 weeks with no triplet of girls being repeated over the whole term. The question was solved by RHF Denniston in 1974, who constructed Week 1 as follows: 

Day 1 ABJ CEM FKL HIN DGO
Day 2 ACH DEI FGM JLN BKO
Day 3 ADL BHM GIK CFN EJO
Day 4 AEG BIL CJK DMN FHO
Day 5 AFI BCD GHJ EKN LMO
Day 6 AKM DFJ EHL BGN CIO
Day 7 BEF CGL DHK IJM ANO

for girls labeled A to O, and constructed each subsequent week's solution from its immediate predecessor by changing A to B, B to C, ... L to M and M back to A, all while leaving N and O unchanged. The Week 13 solution, upon undergoing that relabeling, returns to the Week 1 solution. Denniston reported in his paper that the search he employed took 7 hours on an Elliott 4130 computer at the University of Leicester, and he immediately ended the search on finding the solution above, not looking to establish uniqueness. The number of non-isomorphic solutions to Sylvester's problem remains unknown as of 2021.

Properties

It is clear from the definition of S(t, k, n) that 1 < t < k < n {\displaystyle 1<t<k<n} . (Equalities, while technically possible, lead to trivial systems.)

If S(t, k, n) exists, then taking all blocks containing a specific element and discarding that element gives a derived system S(t−1, k−1, n−1). Therefore, the existence of S(t−1, k−1, n−1) is a necessary condition for the existence of S(t, k, n).

The number of t-element subsets in S is ( n t ) {\displaystyle {\tbinom {n}{t}}} , while the number of t-element subsets in each block is ( k t ) {\displaystyle {\tbinom {k}{t}}} . Since every t-element subset is contained in exactly one block, we have ( n t ) = b ( k t ) {\displaystyle {\tbinom {n}{t}}=b{\tbinom {k}{t}}} , or

b = ( n t ) ( k t ) = n ( n − 1 ) ⋯ ( n − t + 1 ) k ( k − 1 ) ⋯ ( k − t + 1 ) , {\displaystyle b={\frac {\tbinom {n}{t}}{\tbinom {k}{t}}}={\frac {n(n-1)\cdots (n-t+1)}{k(k-1)\cdots (k-t+1)}},}

where b is the number of blocks. Similar reasoning about t-element subsets containing a particular element gives us ( n − 1 t − 1 ) = r ( k − 1 t − 1 ) {\displaystyle {\tbinom {n-1}{t-1}}=r{\tbinom {k-1}{t-1}}} , or

r = ( n − 1 t − 1 ) ( k − 1 t − 1 ) {\displaystyle r={\frac {\tbinom {n-1}{t-1}}{\tbinom {k-1}{t-1}}}} = ( n − t + 1 ) ⋯ ( n − 2 ) ( n − 1 ) ( k − t + 1 ) ⋯ ( k − 2 ) ( k − 1 ) , {\displaystyle {\frac {(n-t+1)\cdots (n-2)(n-1)}{(k-t+1)\cdots (k-2)(k-1)}},}

where r is the number of blocks containing any given element. From these definitions follows the equation b k = r n {\displaystyle bk=rn} . It is a necessary condition for the existence of S(t, k, n) that b and r are integers. As with any block design, Fisher's inequality b ≥ n {\displaystyle b\geq n} is true in Steiner systems.

Given the parameters of a Steiner system S(t, k, n) and a subset of size t ′ ≤ t {\displaystyle t'\leq t} , contained in at least one block, one can compute the number of blocks intersecting that subset in a fixed number of elements by constructing a Pascal triangle. In particular, the number of blocks intersecting a fixed block in any number of elements is independent of the chosen block.

The number of blocks that contain any i-element set of points is:

λ i = ( n − i t − i ) / ( k − i t − i )  for  i = 0 , 1 , … , t , {\displaystyle \lambda _{i}=\left.{\binom {n-i}{t-i}}\right/{\binom {k-i}{t-i}}{\text{ for }}i=0,1,\ldots ,t,}

It can be shown that if there is a Steiner system S(2, k, n), where k is a prime power greater than 1, then n ≡ {\displaystyle \equiv } 1 or k (mod k(k−1)). In particular, a Steiner triple system S(2, 3, n) must have n = 6m + 1 or 6m + 3. And as we have already mentioned, this is the only restriction on Steiner triple systems, that is, for each natural number m, systems S(2, 3, 6m + 1) and S(2, 3, 6m + 3) exist.

History

Steiner triple systems were defined for the first time by Wesley S. B. Woolhouse in 1844 in the Prize question #1733 of Lady's and Gentlemen's Diary. The posed problem was solved by Thomas Kirkman (1847). In 1850 Kirkman posed a variation of the problem known as Kirkman's schoolgirl problem, which asks for triple systems having an additional property (resolvability). Unaware of Kirkman's work, Jakob Steiner (1853) reintroduced triple systems, and as this work was more widely known, the systems were named in his honor.

In 1910 Geoffrey Thomas Bennett gave a graphical representation for Steiner triple systems.

Mathieu groups

Several examples of Steiner systems are closely related to group theory. In particular, the finite simple groups called Mathieu groups arise as automorphism groups of Steiner systems:

The Steiner system S(5, 6, 12)

There is a unique S(5,6,12) Steiner system; its automorphism group is the Mathieu group M12, and in that context it is denoted by W12.

Projective line construction

This construction is due to Carmichael (1937).

Add a new element, call it ∞, to the 11 elements of the finite field F11 (that is, the integers mod 11). This set, S, of 12 elements can be formally identified with the points of the projective line over F11. Call the following specific subset of size 6,

{ ∞ , 1 , 3 , 4 , 5 , 9 } , {\displaystyle \{\infty ,1,3,4,5,9\},}

a "block" (it contains ∞ together with the 5 nonzero squares in F11). From this block, we obtain the other blocks of the S(5,6,12) system by repeatedly applying the linear fractional transformations:

z ′ = f ( z ) = a z + b c z + d , {\displaystyle z'=f(z)={\frac {az+b}{cz+d}},}

where a,b,c,d are in F11 and ad − bc = 1. With the usual conventions of defining f (−d/c) = ∞ and f (∞) = a/c, these functions map the set S onto itself. In geometric language, they are projectivities of the projective line. They form a group under composition which is the projective special linear group PSL(2,11) of order 660. There are exactly five elements of this group that leave the starting block fixed setwise, namely those such that b=c=0 and ad=1 so that f(z) = a z. So there will be 660/5 = 132 images of that block. As a consequence of the multiply transitive property of this group acting on this set, any subset of five elements of S will appear in exactly one of these 132 images of size six.

Kitten construction

An alternative construction of W12 is obtained by use of the 'kitten' of R.T. Curtis, which was intended as a "hand calculator" to write down blocks one at a time. The kitten method is based on completing patterns in a 3x3 grid of numbers, which represent an affine geometry on the vector space F3xF3, an S(2,3,9) system.

Construction from K6 graph factorization

The relations between the graph factors of the complete graph K6 generate an S(5,6,12). A K6 graph has 6 vertices, 15 edges, 15 perfect matchings, and 6 different 1-factorizations (ways to partition the edges into disjoint perfect matchings). The set of vertices (labeled 123456) and the set of factorizations (labeled ABCDEF) provide one block each. Every pair of factorizations has exactly one perfect matching in common. Suppose factorizations A and B have the common matching with edges 12, 34 and 56. Add three new blocks AB3456, 12AB56, and 1234AB, replacing each edge in the common matching with the factorization labels in turn. Similarly add three more blocks 12CDEF, 34CDEF, and 56CDEF, replacing the factorization labels by the corresponding edge labels of the common matching. Do this for all 15 pairs of factorizations to add 90 new blocks. Finally, take the full set of ( 12 6 ) = 924 {\displaystyle {\tbinom {12}{6}}=924} combinations of 6 objects out of 12, and discard any combination that has 5 or more objects in common with any of the 92 blocks generated so far. Exactly 40 blocks remain, resulting in 2 + 90 + 40 = 132 blocks of the S(5,6,12). This method works because there is an outer automorphism on the symmetric group S6, which maps the vertices to factorizations and the edges to partitions. Permuting the vertices causes the factorizations to permute differently, in accordance with the outer automorphism.

The Steiner system S(5, 8, 24)

The Steiner system S(5, 8, 24), also known as the Witt design or Witt geometry, was first described by Carmichael (1931) and rediscovered by Witt (1938). This system is connected with many of the sporadic simple groups and with the exceptional 24-dimensional lattice known as the Leech lattice. The automorphism group of S(5, 8, 24) is the Mathieu group M24, and in that context the design is denoted W24 ("W" for "Witt")

Direct lexicographic generation

All 8-element subsets of a 24-element set are generated in lexicographic order, and any such subset which differs from some subset already found in fewer than four positions is discarded.

The list of octads for the elements 01, 02, 03, ..., 22, 23, 24 is then:

01 02 03 04 05 06 07 08
01 02 03 04 09 10 11 12
01 02 03 04 13 14 15 16
.
. (next 753 octads omitted)
.
13 14 15 16 17 18 19 20
13 14 15 16 21 22 23 24
17 18 19 20 21 22 23 24

Each single element occurs 253 times somewhere in some octad. Each pair occurs 77 times. Each triple occurs 21 times. Each quadruple (tetrad) occurs 5 times. Each quintuple (pentad) occurs once. Not every hexad, heptad or octad occurs.

Construction from the binary Golay code

The 4096 codewords of the 24-bit binary Golay code are generated, and the 759 codewords with a Hamming weight of 8 correspond to the S(5,8,24) system.

The Golay code can be constructed by many methods, such as generating all 24-bit binary strings in lexicographic order and discarding those that differ from some earlier one in fewer than 8 positions. The result looks like this: 

    000000000000000000000000
    000000000000000011111111
    000000000000111100001111
    .
    . (next 4090 24-bit strings omitted)
    .
    111111111111000011110000
    111111111111111100000000
    111111111111111111111111

The codewords form a group under the XOR operation.

Projective line construction

This construction is due to Carmichael (1931).

Add a new element, call it ∞, to the 23 elements of the finite field F23 (that is, the integers mod 23). This set, S, of 24 elements can be formally identified with the points of the projective line over F23. Call the following specific subset of size 8,

{ ∞ , 0 , 1 , 3 , 12 , 15 , 21 , 22 } , {\displaystyle \{\infty ,0,1,3,12,15,21,22\},}

a "block". (We can take any octad of the extended binary Golay code, seen as a quadratic residue code.) From this block, we obtain the other blocks of the S(5,8,24) system by repeatedly applying the linear fractional transformations:

z ′ = f ( z ) = a z + b c z + d , {\displaystyle z'=f(z)={\frac {az+b}{cz+d}},}

where a,b,c,d are in F23 and ad − bc = 1. With the usual conventions of defining f (−d/c) = ∞ and f (∞) = a/c, these functions map the set S onto itself. In geometric language, they are projectivities of the projective line. They form a group under composition which is the projective special linear group PSL(2,23) of order 6072. There are exactly 8 elements of this group that leave the initial block fixed setwise. So there will be 6072/8 = 759 images of that block. These form the octads of S(5,8,24).

Construction from the Miracle Octad Generator

The Miracle Octad Generator (MOG) is a tool to generate octads, such as those containing specified subsets. It consists of a 4x6 array with certain weights assigned to the rows. In particular, an 8-subset should obey three rules in order to be an octad of S(5,8,24). First, each of the 6 columns should have the same parity, that is, they should all have an odd number of cells or they should all have an even number of cells. Second, the top row should have the same parity as each of the columns. Third, the rows are respectively multiplied by the weights 0, 1, 2, and 3 over the finite field of order 4, and column sums are calculated for the 6 columns, with multiplication and addition using the finite field arithmetic definitions. The resulting column sums should form a valid hexacodeword of the form (a, b, c, a + b + c, 3a + 2b + c, 2a + 3b + c) where a, b, c are also from the finite field of order 4. If the column sums' parities don't match the row sum parity, or each other, or if there do not exist a, b, c such that the column sums form a valid hexacodeword, then that subset of 8 is not an octad of S(5,8,24).

The MOG is based on creating a bijection (Conwell 1910, "The three-space PG(3,2) and its group") between the 35 ways to partition an 8-set into two different 4-sets, and the 35 lines of the Fano 3-space PG(3,2). It is also geometrically related (Cullinane, "Symmetry Invariance in a Diamond Ring", Notices of the AMS, pp A193-194, Feb 1979) to the 35 different ways to partition a 4x4 array into 4 different groups of 4 cells each, such that if the 4x4 array represents a four-dimensional finite affine space, then the groups form a set of parallel subspaces.

See also

Notes

  1. This property is equivalent to saying that (xy)y = x for all x and y in the idempotent commutative quasigroup.

References

  1. "Encyclopaedia of Design Theory: t-Designs". Designtheory.org. 2004-10-04. Retrieved 2012-08-17.
  2. Keevash, Peter (2014). "The existence of designs". arXiv:1401.3665 .
  3. Erica Kleirrach (2015-06-09). "A Design Dilemma Solved, Minus Designs". Quanta Magazine. Retrieved 2015-06-27.
  4. Kalai, Gil. "Designs exist!" (PDF). Séminaire Bourbaki.
  5. Colbourn & Dinitz 2007, pg.106
  6. Östergard & Pottonen 2008
  7. Bose, R. C. (1939). "On the Construction of Balanced Incomplete Block Designs". Annals of Eugenics. 9 (4): 353–399. doi:10.1111/j.1469-1809.1939.tb02219.x.
  8. T. Skolem. Some remarks on the triple systems of Steiner. Math. Scand. 6 (1958), 273–280.
  9. Colbourn & Dinitz 2007, pg.60
  10. Colbourn & Dinitz 2007, pg. 497, definition 28.12
  11. Denniston, R. H. F. (September 1974). "Denniston's paper, open access". Discrete Mathematics. 9 (3): 229–233. doi:10.1016/0012-365X(74)90004-1.
  12. Assmus & Key 1992, p. 8.
  13. Lindner & Rodger 1997, pg.3
  14. Baker, H. F. (November 13, 1943). "Obituary. Dr. G. T. Bennett, F.R.S.". Nature. 152 (3863): 558–559. doi:10.1038/152558a0.
  15. Bennett, G. T. (1911). "The Double Six" (PDF). Proceedings of the London Mathematical Society. 2 (1): 336–351.
  16. Bennett, G. T. (1912). "The System of Lines of a Cubic Surface" (PDF). Proceedings of the London Mathematical Society. 2 (1): 479–484.
  17. Carmichael 1956, p. 431
  18. Beth, Jungnickel & Lenz 1986, p. 196
  19. Curtis 1984
  20. "EAGTS textbook".
  21. Carmichael 1931

References

External links

Incidence structures
Representation
Fields
Configurations
Theorems
Applications
Categories: