The Setting
A disk boundary has positions at which bands attach, separated by coefficient labels in a group . The disk successor and the band pairing determine the boundary circuits of the resulting assembly.
Let be a finite set of word positions, a finite set, and a permutation of . Write for the coefficients and for the exponents at the positions, and put and . The sets and are two tagged copies of ; their elements are written and .
Let be a finite set of positions, let be permutations of , and let assign traversal exponents. For a permutation of , the set of cycles is the quotient in (1), where two positions belong to the same cycle when one is an integer iterate of the other: (1)✦ The class count of an equivalence relation on is the number of equivalence classes given in (2): (2)✦ The cycle count of a permutation of is the number of its cycles, given in (3): (3)✦
For a finite set of disks and a function , the oriented vertex successor on is the map from to itself given by (4): (4)✦
The Claim
Definition 1. The word disk slot set associated to and is the set in (5): (5)✦ The oriented disk successor of the word disk slot set is the permutation of given in (6): (6)✦ The inverse coefficient label function is defined by (7): (7)✦ The signed traversal exponent is the function in (8): (8)✦
Definition 2. The component relation of permutations and of is the smallest equivalence relation on containing the cycle relations of and , as in (9): (9)✦ A pair of permutations of is planar when the Euler equality (10) holds: (10)✦ Here permutation products act from right to left, so the boundary permutation is .
Definition 3. A disk atlas for in consists of an injective map and a polarity function on a finite set of disks, satisfying (11), with as in (4): (11)✦
Theorem 1. Let be a finite set and let have sum zero. Put , and write for two tagged copies of . There is a bijection pairing the positive and negative disks as specified in (12): (12)✦
In the paper, the result reads: for any group , an infinite cyclic group with generator , and a cyclic word in their free product, with , , and identity coefficients allowed, positive disks read and negative disks read , every slot is used once by an oriented band joining opposite traversal signs, and, with the disk successor, the band pairing, and the geometric corner labels, boundary circles are cycles of with boundary word , while a connected planar assembly has disks of each kind and boundary circles.
What Is Checked
The definitions are stated over arbitrary coefficient groups and permutations of finite sets, and the balance assertion is stated for a finite set of disks whose polarities lie in and have sum zero.