Selected Topics and Applications
Steiner Triple Systems as Algebras
Steiner triple systems recast as algebras, so that combinatorial questions about them become questions about varieties and congruences.
Learning objectives
- Define a Steiner triple system and its associated algebra
- State the existence conditions on the order
- Explain what the algebraic reformulation makes available
The combinatorial object
A set S together with a collection of three-element subsets, called triples or blocks, such that every pair of distinct elements of S lies in exactly one triple.
A Steiner triple system on n points exists if and only if n ≡ 1 or 3 (mod 6), or n ≤ 1.
| Order <em>n</em> | Number of triples | Systems up to isomorphism |
|---|---|---|
| 3 | 1 | 1 |
| 7 | 7 | 1 — the Fano plane |
| 9 | 12 | 1 — the affine plane of order 3 |
| 13 | 26 | 2 |
| 15 | 35 | 80 |
The unique system on 7 points is the Fano plane, the smallest projective plane. It appears throughout combinatorics, coding theory and the theory of the octonions.
The algebraic recasting
Given a Steiner triple system on S, define a binary operation by a · a = a, and for a ≠ b, a · b = the third point of the unique triple containing a and b.
The algebras arising this way are exactly the algebras ⟨S, ·⟩ of type ⟨2⟩ satisfying:
- x · x ≈ x — idempotence
- x · y ≈ y · x — commutativity
- x · (x · y) ≈ y — the Steiner law
Because the characterisation is by identities, Steiner triple systems form a variety once recast as algebras. Every tool of Chapter II becomes available: free objects, subdirect representation, congruence lattices, and Birkhoff's theorem.
What the recasting buys
Subsystems become subalgebras
A subsystem of a Steiner triple system is exactly a subuniverse of the associated algebra, so subsystem structure is described by Sub(A).
Quotients become available
Congruences give quotient systems, a construction with no obvious purely combinatorial definition.
Products give constructions
The direct product of two Steiner triple systems is again one, giving a systematic way to build larger systems from smaller.
Free systems exist
The free Steiner triple system on a set of generators exists and can be studied.
This is the pattern the source calls “applied universal algebra”: identify the algebraic content of a combinatorial structure, then import the general machinery wholesale.
The order-3 subsystem structure
The Steiner law makes every triple a subalgebra: if {a, b, c} is a triple then the set is closed under the operation, since any product of two of them is the third.
So the triples are exactly the three-element subuniverses, and the combinatorial data of the system is recoverable from Sub(A). The algebra and the system carry the same information.
The algebras satisfying these three identities are also called squags — a contraction of “Steiner quasigroups”. They are treated alongside sloops on the next page.
Frequently asked questions
Is the associated algebra a quasigroup?
Yes. Idempotence plus the Steiner law give unique solvability of a · x = b, so the multiplication table is a Latin square and the algebra is a commutative idempotent quasigroup.
Do Steiner triple systems have interesting congruences?
Yes, though many systems are simple. The congruence structure is what makes the algebraic view productive — it introduces a notion of quotient that combinatorics alone does not naturally supply.
Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section III.1, book pages 111-113.
This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.