The Setting
Random planar maps weighted by Fortuin-Kasteleyn loop percolation are encoded through an exploration walk and an associated inventory process. A rooted planar map with edges is represented by a rotation system on the set of darts , quotiented by root-preserving dart relabelling. The dart reversal involution is fixed-point free, and its orbits form the edge set . The vertex rotation permutation cyclically orders darts around each vertex. The map conditions require that the spanning graph on all edges is connected and that the Euler characteristic satisfies , where is the number of vertex orbits and is the number of face orbits of . For a subset of active edges , the partial reversal involution reverses darts on edges in and fixes all other darts. The orbits of are the alternating boundary loops of the percolation configuration . For a rooted planar map with edges and a loop weight , the loop polynomial is the sum over active edge subsets of , where is the number of alternating boundary loops: (1)✦
The partition function of rooted planar maps and the drift parameters of the peeling exploration are determined by the Potts parameter, with the partition function of maps with edges obtained by summing the loop polynomial over the finite set of rooted planar maps with edges. For a Potts parameter , the map coefficients satisfy and the relation given in (2): (2)✦ The peeling exploration corresponds to an inventory random walk whose drift is controlled by a parameter . The inventory parameter is constrained to the interval (3)✦ For a given Potts parameter with loop weight , the parameter is defined by (4)✦ The associated inventory radius , which determines the disc of convergence for the percolation generating function, is given by (5)✦
The exploration process tracks two burger types and orders produced during map decomposition. An order specifies either a fixed burger type from or a flexible order that accepts either burger type. The set of orders is (6)✦ where and are the fixed orders and is the flexible order. The inventory alphabet is the five-letter set consisting of the two burger types and the three orders : (7)✦
At each step of the peeling exploration, the state of unmatched items is recorded by an evaluation pair. The set of evaluation states consists of pairs of a list of unfilled orders and a list of surviving burgers : (8)✦ The burger list is maintained freshest-first, while the order list is maintained oldest-first. When a letter arrives, an incoming order consumes the freshest matching burger in , or is appended at the end of if no matching burger is available; an incoming burger is always pushed onto the burger stack and never fills a pending order. Word evaluation runs this transition along a finite word .✦ The reduction of a finite word is the evaluation state produced by evaluating starting from the empty state .✦
The letters of the exploration walk are independent and identically distributed under a stream law. For a parameter , the letter distribution on is the probability distribution that assigns mass to each burger type and , mass to each fixed order and , and mass to the flexible order . The stream law is the product measure on the sequence space : (9)✦
The Definition
Definition 1. A finite word over the inventory alphabet is empty-reducing if its reduction leaves both the order list and the burger list empty: (10)✦
In the paper, the result reads: with parameters , , and , the alphabet contains two burger letters , two fixed order letters , and one flexible order , with probabilities , , and , an order consumes the freshest eligible burger, the reduction of a finite word is its list of unfilled orders followed by its list of surviving burgers, and a word is empty-reducing if both lists are empty.
What Is Checked
The definition of empty-reducing words is stated over the five-letter inventory alphabet, the evaluation state of unmatched orders and surviving burgers, freshest-first word reduction, the parameters and for , the stream law of independent letters, and the rooted planar map partition function weighted by the loop polynomial. For those constructions, the parameter satisfies for every , the letter masses define a probability distribution summing to , and the partial edge reversal on darts is an involution.