The Setting
In a triangle complex, a van Kampen diagram for a word in its oriented edges is a finite planar complex of triangles whose boundary reads the word. The library defines such fillings, and their closed analogue, triangle spheres, as combinatorial maps of genus zero whose darts, the half-edges of the diagram, are labelled by oriented edges.
A combinatorial map records a diagram by its darts, two to an edge, one for each direction. A fixed-point-free involution of the set of darts swaps the two darts of each edge, and a face permutation sends a dart to the next dart along the boundary of its face. The edges are the orbits of , the faces the orbits of , and the vertices the orbits of the product , where . A connected map has genus zero exactly when its numbers , , of vertices, edges and faces satisfy Euler’s formula .
Cycles and Components
The cycles of a permutation of a set are the classes of the equivalence relation on under which is equivalent to when for some integer .✦ The components of two permutations and of are the classes of the equivalence relation generated by lying in a common cycle of and lying in a common cycle of ; they are the orbits of the group .✦
The number of cycles of , a fixed point counting as a cycle of length one, and the number of components of and are (1)
The Definition
Definition 1. Let be a set with a map of to itself, the reversal, let be a map to a set , the coloring, and let be a ternary relation on , the face relation.
Two permutations and of a finite set form a planar map when (2)✦
A boundary of a permutation of a set is a finite sequence , possibly empty, of pairwise distinct elements of that moves cyclically along itself: (3)✦
A diagram is a finite set of darts with two permutations and of that form a planar map and a labelling such that, for every dart , (4)
A triangle filling of a word in is a diagram with a boundary of whose labels spell , such that every dart off that lies in a component of and containing a dart of lies on a face of three darts whose labels, in order, are in the face relation: (5)✦
A word in is fillable when (6)✦
A triangle sphere is a diagram , possibly with several components, in which every dart lies on a face of three darts whose labels, in order, are in the face relation: for every dart , (7)✦
In the paper, the definition reads: a filling is a finite connected complex of edges and triangles embedded in the plane, every bounded face of which is a triangle, with its exterior walk counted with multiplicity.
What Is Checked
These definitions are stated over a set of labels with a reversal , a coloring and a face relation , and over the number of cycles of a permutation and the number of components of two permutations of a finite set.