The Setting
In the burger-order inventory representation of Fortuin-Kasteleyn planar maps with Potts parameter , infinite streams of burger and order letters are factored into independent word blocks called left pieces and right pieces. A boundary between consecutive pieces is a left cut when forward prefixes leave no unmatched orders, and a right cut when backward prefixes leave no unmatched burgers; the questions are whether shortened left pieces have finite mean length and whether left and right cuts occur with positive probability and positive density.
Alphabet, Reduction, and Stream Laws
An inventory order is either a fixed order of boolean type or the flexible order .✦ The burger-order alphabet is the finite set consisting of the burger letters for and the order letters for .✦ A word is a finite sequence of letters from , with length and reversal .
An inventory stack evaluation state consists of a list of pending orders in and a freshest-first list of boolean burger types in .✦ The word evaluation of a word at an evaluation state is the evaluation state that equals on the empty word , and on a letter followed by a suffix recursively evaluates after updating by the single-step transition on , in which each order consumes the freshest eligible burger.✦ The word reduction of is the evaluation state starting from empty pending order and burger stacks.✦
A fixed word is a word in in which the flexible order does not appear.✦ For , the letter net type count is the function given by (1), (1)✦ and the word net type count of is the integer summed over the letters of .✦
The letter increment is the function assigning to every burger letter and to every order letter .✦ For a sequence and , the letter increment sum of up to is the sum .✦
The model parameter is a real number .✦ For , the letter mass function is the function given by (2), (2)✦ and the letter probability distribution on is the probability distribution obtained by normalizing .✦
For any index set and , the independent and identically distributed (i.i.d.) inventory stream measure on is the infinite product measure with marginal at every coordinate.✦ Given a probability measure on a measurable space , the two-sided i.i.d. sequence law on is the infinite product measure with marginal at every integer coordinate.✦ The natural pieces law of a probability measure on is the infinite product measure on with marginal at every index .✦
Stopping Times and Piece Constructions
Given a space and an integer-valued process , the first hitting time of zero at is the least such that , or if no such exists.✦
For a sequence of nonnegative integer defect counts on , the defect walk at step and is the sum ✦, and the defect walk survival event at step is the subset .✦ The defect stopping index is the first step at which , or if for all .✦
For a one-sided sequence and , the revealed word of length is the reversed prefix (with )✦, and the shifted letter stream at shift is the sequence defined by for .✦ Given a map and , the stopped word at is the word , where if and if .✦
For and step , the survivor indicator is if and otherwise✦, and the first backward survivor time of is .✦ The survivor order count of is the integer equal to if , and to if .✦ Writing when and when , the first survivor type of is the freshest element of or if that burger stack is empty✦, and the first survivor data of is the pair formed by the survivor order count and first survivor type.✦
The first survivor tail of is the shifted stream , where if and if .✦ For and , the parsing step survivor data at step is the pair ✦, the parsing step defect count at step is ✦, and with the defect sequence , the left parsing step count of is the defect stopping index .✦
The short piece prefix of at step is defined recursively by , while concatenates the reduced word of the stopped word of with .✦ The short left piece word of is the word ✦, and for the shortened left piece law on is the pushforward of under .✦
For an initial level , a stream , and step , the downward inventory path is ✦, and the first downward hitting time from is .✦ The reversed right piece word of is the stopped word .✦ For , the reversed right piece law on is the pushforward of under ✦, and the right piece law on is the pushforward of under word reversal .✦
Piece Prefixes, Cuts, and Remainder Scans
For a sequence of words , the concatenated piece prefix at index is defined recursively by and the concatenation .✦ The left-cut event is the set of sequences such that for every ✦, and the right-cut event is the set of sequences such that for every .✦
The letter scan of a sequence of words is the letter sequence whose -th entry () is the -th letter of if , and the flexible order otherwise.✦ For , the right scan law on is the pushforward of under ✦, and the right remainder law on is the pushforward of under the one-step shift .✦
On a two-sided word sequence , the concatenated interval word starting at and spanning pieces is .✦ A sequence has a left cut at if for every ✦, and has a right cut at if for every .✦ For , the left-cut density is the probability under that a two-sided sequence has a left cut at ✦, and the right-cut density is the probability under that has a right cut at .✦
The Claim
Theorem 1. Let . For the shortened left piece law , word length satisfies (3) and the left-cut event satisfies (4): (3)✦ and (4)✦ For the right piece constructions, the right remainder law satisfies (5) and the reversed right piece law satisfies (6): (5)✦ and (6)✦ Moreover, the left-cut and right-cut densities satisfy (7) and (8): (7)✦ and (8)✦ More generally, let be a probability measure on such that -almost every word is a fixed word and is -integrable. Suppose further that for every , the net type count is -integrable with , while . Then the natural pieces law of satisfies (9): (9)✦
In the paper, the result reads: each fixed boundary has positive probability of being a left cut () and positive probability of being a right cut () in the respective piece laws, and consequently both cut sets have positive limiting densities in both index directions. Here and are the piece laws, with governing the right remainder and allowing general fixed-order laws, while the coordinate-zero probabilities and under and represent the limiting cut densities.
What Is Checked
For , the claims are stated over the piece and remainder laws , , and together with the cut events and , and over the cut densities and under and . The general left-cut statement is stated over any probability measure on concentrated almost surely on fixed words, for which word length is integrable and each has integrable net type count with mean and positive single-burger mass .