The Setting
The disk identity concerns simple directed cycles in the dual triangulation of a cubic bipartite graph. A matching between black triangles and corners specifies the allowed departures along a cycle; its shore boundary has a sign and a black boundary sum.
A network on a finite vertex set and finite edge set assigns a tail and a head to every edge.✦ The underlying simple graph of a network is the simple graph in which distinct vertices are adjacent whenever an edge of has those endpoints.✦ A simple network is a network with no loops and at most one edge with any given unordered pair of endpoints.✦ An edge is incident to either endpoint;✦ the star is the set of edges incident to .✦ Let be a second network, on a finite vertex set and the same edge set .
For a vertex set , let denote its indicator. The oriented incidence matrix , boundary operator , and gradient have the formulas in (1), for real edge weights and a real vertex potential ; use the corresponding notation for . (1) A cycle cut duality between and is a condition on the pair of networks requiring that both underlying graphs be connected and that their real cycle and cut spaces satisfy (2). (2)✦
A triangle on an edge set in is a cyclic list of three distinct corners and three distinct edges, with edge set , whose successive corners are the endpoints of the corresponding edge.✦ Suppose is simple and cubic, is simple, and each star is the edge set of a triangle in . Write for its corners and for its edges, with taken modulo three. A black class is a bipartite coloring when every edge has one black endpoint and one endpoint outside . Write for its black endpoint: the tail when the tail is black, and the head otherwise.✦
The outgoing edge sign in either network is when is the tail of , and otherwise.✦ A colored triangulation duality between and is a pair of networks with the cycle cut duality, simplicity, cubic degree, coloring and triangles just specified, satisfying the orientation compatibility in (3). (3)✦
Choose a root triangle . The nonroot black triangles are indexed by , and is the set of dual vertices outside the three root corners, as in (4). (4) A triangle system on , indexed by , is a family of ordered triples of distinct corners such that two members sharing two distinct corners have the same index.✦ The black face family on indexed by is the family of corner triples of the triangles for .✦ A triangle transversal of a triangle system indexed by onto is a function on that selects one corner of each triangle, with distinct selected corners and image exactly .✦ A state of the black face family is a triangle transversal onto ; write for the selected vertex of .
Cycle and Shore Notation
A simple cycle in the underlying graph of is an injective cyclic list of vertices, with and adjacent consecutive vertices.✦ Let be the edge joining to , and let be the set of these edges. The oriented cycle flow of is the real edge weight on given by (5), where is the standard edge basis vector with value one at and zero at other edges. (5) For adjacent dual vertices , let be their joining edge. The antisymmetric signed edge weight on ordered pairs of adjacent vertices of and the black boundary sum of the cycle are the real function and real sum defined by (6). (6)
For a shore , the cut consists of edges with exactly one endpoint in .✦ The set of black interior cut edges of a shore is given by (7). (7)✦
The Claim
Theorem 1 (Disk identity). Suppose have a cycle cut duality, are simple, and is cubic with bipartite black class and triangles on its stars. Let restrict to a bijection from onto , selecting a corner of for every . Let be a cycle with and at every index. There are a nonempty shore avoiding and a sign such that (8) holds. (8)✦
For a colored triangulation duality, let be a state and let be a cycle. Suppose there are triangles with and at every index. The conclusions in (8) also hold under these hypotheses. (9)✦
For integers satisfying , , and , the disk count identity is (10). (10)✦
In the paper, the result reads: for a state , choose in each nonouter black triangle an edge directed from to another corner; every simple directed cycle in these edges avoids the roots and has -sum counterclockwise and clockwise.
What Is Checked
The cycle statements concern finite cycle cut dual networks with the specified triangles and corner matchings, and the count statement concerns five integers satisfying its three relations. The black face family of a colored triangulation duality is a triangle system.