The Setting
Fix a Potts parameter , and weight each rooted planar map by its Fortuin-Kasteleyn (FK) loop partition function. How fast does the edge-weighted generating series of these map partition coefficients, evaluated at its inventory radius for , grow as approaches from below?
These notes cover the definitions of rooted FK maps and the burger-order inventory model, together with the partial-sum and Abel lower bounds.
Rooted Planar Maps and FK Coefficients
For each nonnegative integer , the dart set of a map with edges is , indexing its directed edges.✦ For a permutation of , the orbit of a dart under is the equivalence class of darts belonging to the cycle of containing .✦ Given two permutations and of and a subset of the orbits of , the spanning graph determined by , , and is the simple graph on the orbits of in which two distinct orbits and of are adjacent whenever some dart with joins and , meaning either and , or and .✦
A pair of permutations of satisfies the planar map conditions if is an involution without fixed points ( and for all ), the spanning graph determined by , , and all orbits of is connected, and the number of orbits of plus the number of orbits of equals (the genus-zero condition).✦ A labelled planar map with edges is a pair of permutations of satisfying the planar map conditions.✦ An isomorphism of rooted maps between two labelled planar maps and with edges is a permutation of satisfying as well as and for every .✦ A rooted planar map with edges is an equivalence class of labelled planar maps with edges under the equivalence relation generated by isomorphisms of rooted maps, and the set of such rooted planar maps is .✦
For a rooted planar map , the dart reversal involution and vertex rotation permutation are the first and second permutations on of a representative labelled map, respectively pairing opposite directed edges and cyclically ordering the darts around each vertex. The set of edges of a rooted planar map is the set of orbits of , each orbit being an edge of .✦ Given an involution on and a subset of the orbits of , the partial dart reversal is the permutation of that sends each dart with to and fixes every dart with .✦
For a permutation of , the number of orbits of is denoted by , and for a rooted planar map and a real parameter , the loop polynomial is the real number (1)✦ For a real parameter , the rooted FK map coefficients are the sequence of real numbers defined by and, for every nonnegative integer , (2)✦
The Burger Inventory Model
An FK model parameter is a real probability in .✦ Given a Potts parameter , the associated FK model parameter is (3)✦ The inventory radius for is , with given by (3).✦
An inventory order is either a fixed order specifying one of two Boolean burger types or a flexible order.✦ A letter of the burger-order alphabet is either a burger token of one of the two Boolean types or an order token carrying an inventory order.✦ An inventory stack evaluation state consists of a sequence of pending orders and a stack of unused burgers stored freshest-first.✦ The evaluation of a word of letters in from an initial evaluation state returns when the word is empty, and on a word starting with letter followed by suffix updates by a single-step transition on (in which an order consumes the freshest eligible burger) and recursively evaluates .✦ The word reduction of a word is the evaluation state obtained by evaluating starting with empty order and burger lists.✦ A word of letters in is empty-reducing if its word reduction yields the empty evaluation state, with neither pending orders nor remaining burgers.✦
For an FK model parameter , the single-letter probability distribution on is the probability distribution that assigns mass to each of the two burger letters, to the flexible order letter, and to each of the two fixed order letters.✦ On for any index set , the independent and identically distributed (i.i.d.) inventory stream measure is the product measure of copies of .✦ Given an infinite stream and a nonnegative integer , the prefix defines an initial word of length , and for an FK model parameter the empty-reducing word probability is (4)✦
Partial-sum and Abel Lower Bounds
At any FK model parameter , the empty-reducing word probabilities (4) satisfy a quadratic partial-sum lower bound: there exist and a positive integer such that, for every nonnegative integer , (5)✦ For each FK model parameter , there exist and a positive integer such that, for every nonnegative integer , (6)✦
Let be a sequence of nonnegative real numbers, let , and let be a nonnegative integer such that for every nonnegative integer . Then there exists such that, whenever and converges, (7)✦ When the coefficients are the even-length empty-reducing probabilities for an FK model parameter , there exists such that, for all real , (8)✦
The Claim
Theorem 1. Let be a Potts parameter, the corresponding rooted FK map coefficients, and the inventory radius. Then there exists such that, for every real , (9)✦
In the paper, the result reads: there is such that, for all real sufficiently close to , . The bound (9) replaces the qualitative proximity condition on with the explicit range and begins the sum at .
What Is Checked
The inequality (9) is stated over any Potts parameter , the rooted FK map coefficients (2) defined from rooted planar maps via the loop polynomial (1), and the inventory radius determined by (3). The inventory bounds (5), (6), and (8) are stated over any FK model parameter and the empty-reducing word probabilities (4) under the i.i.d. inventory stream measure, while (7) is stated over any nonnegative real sequence satisfying a quadratic partial-sum lower bound.
For these constructions, the library also proves that for any nonnegative integer , any involution on , and any subset of the orbits of , the partial dart reversal is an involution.✦