The Setting
In the exploration of random planar maps decorated by Fortuin-Kasteleyn percolation, the boundary of the explored region carries interfaces between percolation clusters. The inventory method records boundary conditions using an alphabet whose letters represent available interface endpoints, termed burgers, and requests to match them, termed orders. When an exploration step reveals new letters, earlier unmatched burgers remain as an older supply available to subsequent orders.
An inventory order is an order request that is either a fixed order of type or the flexible order capable of matching either burger type.✦ A letter of the inventory alphabet is an element of that is either a burger token of type or an inventory order . An inventory evaluation state is a pair consisting of a finite list of pending orders in and a finite stack of burgers in stored freshest-first with freshest burger , with order component and burger component .✦
The evaluation of a finite word on an evaluation state is the evaluation state obtained by sequentially processing the letters of : each incoming burger is placed at the top of the burger stack, and each incoming order consumes the freshest eligible burger from the stack or is appended to the list of pending orders if no eligible burger is available.✦ The reduction of a finite word is the evaluation state obtained by evaluating against empty order and burger stacks, as in (1): (1)✦
The order evaluation of a list of orders against a burger stack is the evaluation state obtained by feeding the orders to with empty initial orders, as in (2): (2)✦ The normal word of an evaluation state is the word in formed by the pending orders followed by the burgers reversed to run from oldest to freshest, as in (3): (3)
The Claim
Theorem 1. Let and be finite words over the inventory alphabet , let be a burger stack, and let be an evaluation state. With and , when acts on an older burger supply with empty initial orders, the resulting state satisfies (4): (4)✦ Evaluating the normal word of the reduction of on matches the action of via (5): (5)✦ If the burger stack of has freshest burger , then the freshest surviving burger of the prepended word satisfies (6): (6)✦
In the paper, the result reads: feed a finite word an arbitrary older list of burgers; every match between two letters of the word is the same as when the word is read from an empty supply, the orders unfilled in the latter evaluation act on the older list in their original chronology, the surviving burgers of the word remain above the surviving older burgers, in particular finite words may be replaced by their reductions when concatenating them, and once a suffix has a surviving burger, its freshest survivor is unchanged by prepending further letters.
What Is Checked
The three identities are stated over finite words of inventory letters, burger stacks, and inventory evaluation states.