The Setting
For a finite set of vertices in the planar square lattice, boundary sides separate vertices in the set from their nearest neighbors outside it. The contour question is which closed trails can be found among these sides, how to count their possible locations and directions, and how many crossed primal edges have disjoint endpoints.
Use for the primal lattice, with origin , and label the dual vertex at by . The four directions form the set .✦ Their outward primal steps and dual tail and head offsets are the vectors in (1). (1)
The oriented boundary of a finite set is the set of sides with and .✦ A side crosses the primal edge with endpoints and ; its dual tail and head , and the displacement in direction , are defined by (2). (2)
The positive-ray crossing number , for integer pairs and , is the signed indicator in (3). (3)✦
For an integer , let . For , the cyclic successor of is .✦ An edge-simple closed boundary trail of length in is a sequence of distinct members of with for every ; write for the set of these trails.
Boundary Codes
A boundary code of length is a triple belonging to the family specified in (4), where selects a horizontal anchor coordinate, selects its height, and is a direction word. The code family and the anchor are defined in (4), where is the set of words indexed by . (4)
The padded direction word associated to is the direction word on the nonnegative integer indices that agrees with on and has value thereafter.✦ The decoded dual position for and decoded side for are given by (5). (5)
A boundary code is realizable if there is a finite set for which its decoded sides are distinct members of .✦ For a decoded side , its inner and outer primal endpoints are defined by (6). (6)
Two edges with endpoint pairs and conflict when they share an endpoint.✦ A matching of primal edges is a set of edges with no conflicts between distinct members, using the condition in (7). (7)✦
The Claim
Theorem 1. Let be finite and contain . There exist a length and a trail with the anchoring property (8). (8)✦ For the same , there exist a length , a code , and distinct sides , indexed by , with the decoding identity (9). (9)✦ For every , the cardinality of the code family is given by (10). (10)✦ For every realizable code , there is a set satisfying (11). (11)✦
In the paper, the result reads: there are deterministic families of simple dual square-lattice cycles of length , with , such that the dual edge boundary of every finite containing includes a cycle in , and for each candidate cycle at least of its crossed primal edges can be fixed with pairwise disjoint endpoints.
What Is Checked
The statements concern the oriented boundaries of finite subsets of containing and the code families , with realizability required for the matching assertion.