Filling pair on a closed genus-two surface Created 2026-09-28 Updated 2026-11-05
A concrete filling set of curves consisting of two simple closed curves can be built from four unit squares. Label the squares . Glue the right side of square to the left side of square and its top side to the bottom side of square by translations, whereThis gives a connected oriented square-tiled surface. The horizontal midlines form one simple closed curve , because has one cycle of a permutation of length four; the vertical midlines form one simple closed curve , because has one cycle of a permutation of length four. They meet once at each square center.
The corner identifications have two classes, corresponding to the cycles of a permutation ofwith fixed. Thus the square CW complex has , , , and Euler characteristic . The classification of compact surfaces gives genus two. The complement of consists of the two open discs around these vertex classes, so the pair fills.
Orient both curves in their positive coordinate directions. All four crossings have the same local sign, giving algebraic intersection number of curves on an oriented surface . Therefore , and the displayed representatives attain equality. In particular both curves are nonseparating; a separating curve could not have this nonzero signed pairing.
In a finite unital ring , some positive multiple of is zero, because two of the finitely many successive multiples coincide. If , the permutation has every cycle of a permutation of length exactly : returning to after steps means , whose least positive solution is . These disjoint cycles partition the finite set , so divides its cardinality. The zero ring has cardinality and characteristic both one.
Pólya enumeration theorem Created 2026-10-20 Updated 2026-11-05
Let a finite group act on a finite set , with the number of length- cycles of a permutation induced by . Its cycle index isFor colours with weight variables , the generating function counting group action orbits of colourings by their colour multiplicities isA colouring fixed by is constant on every cycle of a permutation. A length- cycle of a permutation therefore contributes . Multiplication over the cycles of a permutation and the weighted Burnside lemma prove the formula.[ref]
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen by George Pólya. ChapterI, §16, printed page163
For four positions under rotations, the cyclic group has cycle index . With two colours, substitution givesThus there are six necklaces, with two having exactly two positions of each colour: adjacent equal colours or alternating colours. Setting every gives the unweighted count; dividing the number of labelled colourings by would fail because some colourings have larger stabilizers.