The Setting
Consider the Fortuin-Kasteleyn (FK) model on random planar maps with Potts parameter , where and . Through the inventory encoding, a decorated planar map corresponds to a bi-infinite burger-order stream governed by .
Splitting the stream at the origin across a positive height creates backward left and forward right excursions that concatenate into a seam word. Given one-sided independent and identically distributed (i.i.d.) streams, what are the laws of the raw and shortened left pieces and of the right pieces, and how does the probability that the seam word reduces to an empty inventory express itself over independent sequences of those pieces?
Inventory Streams and Word Reduction
The set of Boolean burger types is , and an inventory order is either a fixed order for some or the flexible order .✦ A burger-order alphabet letter is either a burger token for or an order token for .✦ Given , the letter mass function is defined for each by (1)✦ For , the letter distribution on is the probability mass function assigning probability from (1) to each .✦ Given an index set and , the i.i.d. inventory stream measure on is the product probability measure with marginal ; when , write .✦
For any set , write for the set of finite words over , with empty word . An inventory stack evaluation state consists of a list of pending orders and a list of Boolean burger types stored freshest-first.✦ Given an evaluation state and a letter , the single-step inventory transition is the evaluation state updating by , where an order consumes the freshest eligible burger. The evaluation of a word from is defined recursively by and for and .✦ The word reduction of is the evaluation state starting from empty pending orders and an empty burger stack✦, and a word is empty-reducing if .
Hitting Times and Piece Constructions
The letter increment is the map assigning to each burger letter () and to each order letter ().✦ For and , the letter increment sum is (2)✦ with . Given a space , an integer-valued process , and a point , the first hitting time of zero is the least such that , or if no such exists.✦
For and , the upward inventory path and downward inventory path are defined using (2) by (3) At height , the first upward hitting time of is for in (3).✦ The first downward hitting time of is .
For a word , write for its reversal, with . For and , the revealed word of length is , with .✦ For a map and , the truncation of at is when and when , and the stopped word of at is .✦ The reversed right piece word of is , and for the reversed right piece law on is the pushforward measure .✦
For any probability measure on , the natural pieces law on is the infinite product probability measure with common marginal .✦ Given a word sequence and , the concatenated piece prefix is defined recursively by and .✦ For , the piece seam event is the set of pairs such that is empty-reducing.✦
Backward Survivor Parsing
At step of , the survivor indicator equals if the burger stack of is empty and otherwise.✦ The first backward survivor time of is .✦ The survivor order count of a stream is if , and otherwise equals the number of pending orders in .✦ Define the first survivor type of to be the freshest Boolean burger type in the burger stack of , or if that stack is empty.✦ The first survivor data of a stream is the pair .✦
For and , the shifted letter stream has entries for .✦ The first survivor tail of is the shifted stream .✦ At parsing step of , the parsing step survivor data is , where is the -fold iterate of .✦ The parsing step defect count at step of is the first coordinate of .✦
Given a space , a process , a step , and , the defect walk is (4)✦ with . The defect walk survival event at step for is defined via (4) by .✦ For and , the defect stopping index is if for all , and otherwise is the least with .✦
Writing for the process , the left parsing step count of is .✦ Given the -th raw chunk word of and the normal word of an evaluation state , the short piece prefix is defined recursively for by and .✦ The short left piece word of is .✦
The Claim
Definition 1. Given , the raw left piece law on is the pushforward measure of under , (5)✦ The right piece law on associated with is the pushforward of under word reversal , (6)✦ For , the shortened left piece law on is the law of under , (7)✦ Given and , the raw seam word is (8)✦
Theorem 1. Let and let be an integer. The product measures satisfy (9)✦
What Is Checked
The piece laws (5), (6), and (7) along with the raw seam word (8) and the factorization identity (9) are stated over an FK parameter , the i.i.d. stream measure on , the hitting times and with stopped words and reversed right piece law , the short left piece word from backward survivor parsing and the defect stopping index , as well as the empty-reducing piece seam event under the product of natural pieces laws for .