The Setting
In the inventory model for Fortuin-Kasteleyn (FK) random planar maps with parameter (corresponding to Potts parameter via and ), words of burgers and orders evolve by cancelling matched letters on a stack. The question is whether seam intervals formed either by two independent letter streams stopped at opposite net levels determined by an integer or by joining independent sequences of shortened left and right pieces reduce to the empty state with a positive probability uniform in , and what deterministic conditions on left and right trajectories force complete cancellation across a seam.
Inventory Words and Hitting Times
Throughout, denotes the nonnegative integers, and denotes the empty word or empty list. Let be the set of two Boolean burger types. The inventory order set consists of a fixed order for each and one flexible order ✦, and the burger-order alphabet consists of a burger letter for each and an order letter for each . Write for the set of finite words over , juxtaposition for word concatenation, for the reversal of , and for the length of any list . The letter increment assigns to every burger letter and to every order letter .✦
An inventory stack evaluation state consists of a list of pending orders in and a list of burger types in stored freshest-first.✦ For a state , the evaluation of a word is defined recursively by and for , where is the single-step transition on in which an order consumes the freshest eligible burger.✦ The word reduction of is the evaluation state starting from empty pending orders and an empty burger stack✦, and reduces to the empty state if .
An FK model parameter is a real probability in .✦ The letter mass function is given by (1): (1)✦ The letter distribution on is the probability distribution determined by the nonnegative weights .✦ For an index set , the independent and identically distributed (i.i.d.) inventory stream measure on is the product measure with marginal at every coordinate .✦
For a letter stream and , the letter increment sum of at step is (with ). Given an initial level , step , and , the upward inventory path and the downward inventory path are defined by (2): (2) For 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. Writing for and , the first upward hitting time of from level is , and the first downward hitting time of from level is .
Given and , the revealed word is the reversal of the first entries of (with ).✦ For a map and , the stopped word of at is .✦ For a level and a pair , the raw seam word is defined by (3): (3)
Piece Laws and Seam Events
For a stream , the reversed right piece word of is .✦ The reversed right piece law on is the pushforward of under , and the right piece law on is the pushforward of under word reversal .✦
For and , the shifted letter stream has entries for .✦ At step for , the survivor indicator equals if the burger stack of is empty and otherwise✦, and the first backward survivor time of is . For , the unmatched order count is if and otherwise equals the length of the pending order list of ✦, while the first survivor type is the freshest element of the burger stack of , or if that stack is empty.✦ The first survivor data of is the pair ✦, and the first survivor tail of is the shifted letter stream .
Given a step index and , the parsing step survivor data is the pair , where denotes the -fold iterate of .✦ For and , the parsing step defect count is the first coordinate of the parsing step survivor data at step and .✦
Let be a sequence of nonnegative integer defect counts on a space . For and , the defect walk of at step and is , and the defect walk survival event of at step is . For a sequence of defect counts on , a point , and a step , the defect stopping predicate is the condition that either or for every .✦ The defect stopping index of at is the least satisfying the defect stopping predicate.✦
For a stream , the left parsing step count of is .✦ Given and , the short piece prefix is defined recursively by , while concatenates the normal word of the word reduction of the -th raw chunk of with .✦ The short left piece word of is , and the shortened left piece law on is the pushforward of under .✦
Given a sequence of words, the concatenated piece prefix is defined recursively by and for .✦ For any probability measure on , the natural pieces law on is the product measure with marginal at every index .✦ At a piece count , the piece seam event is defined by (4): (4)
Cuts and Good Trajectories
For a bi-infinite sequence of words, a starting index , and a piece count , the concatenated interval word is .✦ A bi-infinite sequence has a left cut at if for every , the pending order list of is empty✦, and a bi-infinite sequence has a right cut at if for every , the burger stack of is empty.✦
Given a bi-infinite sequence , , and , the reduced interval burgers and reduced interval orders are respectively the burger stack and the pending order list of . For any list and depth , the bottom of stack is the suffix obtained by dropping the first entries of .✦ With , , , and , the bottom burger count is the number of occurrences of in ✦, and the terminal order count is the number of occurrences of in .✦
Given and , a bi-infinite sequence is a good left trajectory for and if has a left cut at and satisfies for all with and every .✦ A bi-infinite sequence is a good right trajectory for and if has a right cut at and satisfies for all with and every .✦ For , a bi-infinite sequence has a flexible order prefix of length if is the single-letter word consisting of for every with .✦
The Claim
Theorem 1. Let . There exists such that for every integer , the bound (5) holds: (5)✦ There exists such that for every , the bound (6) holds: (6)✦ Let be bi-infinite word sequences, let be real, and let satisfy and . Suppose that is a good left trajectory for and , that is a good right trajectory for and with a flexible order prefix of length , and that for every the sums of letter increments over the letters of and equal and , respectively. Then the concatenated seam interval satisfies (7): (7)✦
In the paper, the result reads: there exists , depending only on , such that for every integer the seam interval formed by the backwards hit of and the forwards hit of reduces to the empty word with probability at least . In (5), the backwards hit of and forwards hit of are represented on two independent one-sided letter streams via and , while (6) and (7) state the independent-piece and deterministic trajectory formulations.
What Is Checked
Claims (5) and (6) are stated for every FK model parameter over the product measure on stream pairs for all integers and over the product measure on piece-sequence pairs for all , respectively. Claim (7) is stated over arbitrary bi-infinite word sequences , real , and integers with and under the hypotheses that is a good left trajectory for and , that is a good right trajectory for and with a flexible order prefix of length , and that each piece has increment sum while each has increment sum . For every sequence of nonnegative integer defect counts on a space and every point , there exists a step index satisfying the defect stopping predicate for and .✦