The Setting
Take a Fortuin-Kasteleyn (FK) planar map with parameter , encoded as a burger-order inventory word. Removing the submaps inserted at the corners of its rooted block leaves a connected core word, so a nonempty stack-emptying word decomposes into a connected core word together with a stack-emptying subword at each corner, while word counts and block branching are tracked by generating series and offspring probability weights.
Inventory Words and the Stream Measure
Fix two boolean types, labeled (the first type) and (the second type). The set of inventory orders consists of the fixed orders for and the flexible order .✦ The burger-order alphabet is the set , where each letter in is either a burger token () or an order token carrying an inventory order in . An inventory stack evaluation state is a pair consisting of a finite list of pending orders in and a finite list of boolean burger types stored freshest-first.✦
Given a word of letters in and an evaluation state , the word evaluation is the evaluation state returning when is empty, and on a letter followed by a suffix updating by the single-step transition on (in which an order consumes the freshest eligible burger) and continuing on .✦ For a word of letters in , the word reduction is the evaluation state obtained from empty pending orders and an empty burger stack.✦ A word of letters in is empty-reducing if .✦
For a parameter , the letter mass function is the function assigning mass to each burger , mass to the flexible order , and mass to each fixed order . The letter distribution is the probability mass function on induced by .✦ For any index set , the independent and identically distributed (i.i.d.) inventory stream measure on is the product measure of across coordinates; on , write .
For a stream and , the letter stream initial word is the word of length .✦ For length and parameter , the empty-reducing word probability is the probability .
Typed Words and Monomial Weights
The set of typed burger-order letters consists of the burger tokens and the order tokens carrying an explicit boolean type .✦ For a word of typed letters and an initial stack of boolean types, typed word stack execution is the process that evaluates letter by letter from left to right against , returning either the resulting stack or failure upon an illegal closure.✦ The set of stack-emptying typed words consists of all typed words such that typed word stack execution of from the empty stack terminates successfully with the empty stack✦, and the set of nonempty stack-emptying typed words consists of all words in of positive length.✦
For a typed word and an initial stack of boolean types, the flexible closing count is the number of flexible order closures encountered when processing step by step against (stopping at any illegal closure).✦ Given elements and a typed word , the inventory word monomial weight is , where is the length of and is the flexible closing count starting from the empty stack.
Matchings, Core Words and Corner Insertion
Let be a set. A non-crossing arch matching on a finite list of items in with an arch list of ordered pairs in is generated inductively by three rules: the empty list matches the empty arch list; an unmatched leading item may be skipped; and two items enclosing an interior list and followed by an exterior list may be paired as together with non-crossing arch matchings on and on , giving the arch list that places before followed by .✦ For an arch list , the list of endpoints of paired arches is the flattened list .✦ For an arch list on , the arch transposition product is the permutation of that is the identity on the empty list and equals when an arch precedes , where is the transposition swapping and .✦
Given a map and a finite list of positions in , a two-stack matching certificate for along consists of two non-crossing arch matchings and on whose combined endpoints (from followed by ) form a permutation of , such that every arch has and , while every arch has and .✦ The stack matching mate permutation of a two-stack matching certificate is the permutation on obtained by applying to the concatenation of and .✦
For an integer and a permutation on , a chord opening endpoint of is an index satisfying .✦ For an integer and a permutation on , two chord opening endpoints and of satisfy the chord crossing relation if either or . The chord intersection graph is the simple graph on the chord opening endpoints of whose edges are the pairs satisfying the chord crossing relation.✦ The set of connected core words consists of all typed words for which there exist an integer , a map with , and a two-stack matching certificate for along the index list such that is a chord opening endpoint of and every chord opening endpoint of is reachable from in .
The set of valid corner-word lists consists of all finite lists of pairs with and typed words satisfying and each .✦ The corner insertion map is the map sending each valid corner-word list to its literal corner insertion.
The Claim
Definition 1. For , the word generating series is the sum (1) of inventory word monomial weights over all stack-emptying typed words: (1)✦ For an FK model parameter and , the inventory generating series is the series (2) in the even-length empty-reducing word probabilities: (2)✦ The sequence of block offspring probability weights is a sequence of real numbers satisfying (3): (3)✦
Theorem 1. The corner insertion map is a bijection (4) (the corner substitution bijection): (4)✦ The one-link typed word consisting of a burger and an order of the first type is a connected core word (5): (5)✦
What Is Checked
The definitions and theorem are stated over the burger-order alphabet with FK parameter and its i.i.d. stream measure, typed words under stack execution, non-crossing arch matchings and chord intersection graphs, valid corner-word lists, and real sequences. Beyond the claims, the library proves that for the letter masses are nonnegative and sum to one, and that the chord crossing relation is symmetric and irreflexive.