The Setting
Consider finite Fortuin-Kasteleyn (FK) planar maps with Potts parameter , where is the map generating function for the coefficient sequence and is the block generating function. How does a nontrivial rooted planar map decompose into a single rooted block with rooted maps inserted at its corners, and what relation between and follows from that decomposition?
Inventory Words and Generating Series
An FK model parameter is a real probability parameter in .✦ The set of boolean burger types is . The set of inventory orders consists of the flexible order and the fixed orders carrying a type in .✦ The finite alphabet of burger-order letters consists of the burger tokens of each type in and the order tokens carrying an element of .✦
For an FK model parameter , the letter mass function is the function assigning mass to each burger token, to the flexible order token, and to each fixed order token.✦ The letter distribution on is the probability mass function with point masses for .✦ For any index set , the independent and identically distributed (i.i.d.) inventory stream measure on is the product measure of copies of .✦ Given an infinite sequence and an integer , the letter sequence prefix is the finite sequence indexed by ✦, and the letter stream initial word is the corresponding list of length over .✦
An inventory stack evaluation state is a pair of a list of pending orders in and a stack of boolean burger types in stored freshest-first.✦ The evaluation of a word over on a state is the state that equals when is empty, and on a word starting with letter followed by suffix recursively evaluates on the state obtained from by the single-step transition on , in which an order consumes the freshest eligible burger.✦ The word reduction of a word over is the state .✦ An empty-reducing word over is a word over that satisfies .✦
At length and FK model parameter , the empty-reducing word probability is the probability under that the initial word of a stream satisfies the empty-reducing word condition.✦ For an FK model parameter and a real number , the inventory generating series is (1)✦
The finite typed alphabet of typed burger-order letters consists of the burger tokens and the order tokens carrying an explicit type in .✦ Given a finite word over and a boolean stack , typed word stack execution evaluates against and returns either a resulting boolean stack or failure upon an illegal closure: on the empty word it returns , and on a leading letter followed by suffix it applies the single-step typed transition to and and recursively executes on the updated stack, failing if that step fails.✦ The set of stack-emptying typed words consists of all finite words over whose typed word stack execution from succeeds and returns .✦ The set of nonempty typed words is the subset of consisting of all words in of positive length.✦ For any finite alphabet and integer , the set of words of length is the finite set of all length- lists with entries in .✦ For an integer , the set of empty-reducing typed words of length is the subset of consisting of all words in whose typed word stack execution from succeeds and returns .✦
The flexible closing count of a finite word over against a boolean stack is zero when is empty; when starts with letter followed by suffix , it equals zero if the single-step typed transition on and fails, and otherwise equals plus when that transition is a flexible order closure and when it is not, where is the updated stack.✦ For parameters in a commutative monoid , the inventory word monomial weight of a finite word over is (2)✦ where denotes the length of . For extended nonnegative real parameters , the word generating series is (3)✦
Matchings, Connected Cores, and Corner Insertion
Given a set and a finite list of elements of , a non-crossing arch matching on is a list of ordered pairs in that arises from the empty matching on by finitely many steps of either prepending an unmatched element to a list without changing a matching on , or taking non-crossing arch matchings on a list and on a list and forming followed by and on the list formed by , , , and .✦ The endpoints of paired arches for a list of pairs in form the list obtained by listing and in order for each pair in .✦ The arch transposition product of a list of pairs in is the permutation of defined recursively as the identity on and as when consists of followed by , where is the transposition swapping and .✦ Given a map and a list in , a two-stack matching certificate for along is a pair of two non-crossing arch matchings and on whose concatenated list of paired endpoints is a permutation of , such that every pair matches a burger token of type with an order token of type and every pair matches a burger token of type with an order token of type .✦ The stack matching mate permutation on of a two-stack matching certificate is the arch transposition product applied to the concatenation of and .✦
For an integer and a permutation of , the set of chord opening endpoints is . For a permutation of , two chord opening endpoints satisfy the chord crossing relation if either or .✦ The chord intersection graph of a permutation of is the simple graph on vertex set whose edges are the pairs satisfying the chord crossing relation.✦ A connected core word over is a finite word over such that there exist an integer , a map whose list of values equals , and a two-stack matching certificate for along such that and every vertex in is reachable from in .✦ The set of connected typed cores consists of all finite words over satisfying the connected core word condition.✦
A finite list pairing letters with finite words over is a valid corner list if is a connected core word and for each the typed word stack execution of from succeeds and returns .✦ The set of valid corner words consists of all finite lists pairing letters in with finite words over that satisfy the valid corner condition.✦ For any finite list pairing letters with finite words over , the literal corner insertion is the concatenated word .✦ The corner insertion map is the map sending each valid corner word to .✦
Given a real parameter and an integer , the core generating polynomial coefficient is (4)✦ The block generating polynomial coefficient for and an integer is (5)✦ For an FK model parameter , the flexible order parameter is the real number ✦, and the inventory radius parameter is the real number .✦
The Claim
Theorem 1. The corner substitution bijection is bijective✦ and defines the corner substitution bijection (6)✦ For any two finite lists and pairing letters in with finite words over that satisfy the valid corner condition, (7)✦ For any extended nonnegative real parameters , (8)✦ For any FK model parameter and any real , the core series is summable and satisfies (9)✦ and the block series is summable and satisfies (10)✦
In the paper, the result reads: every nontrivial rooted planar map is uniquely obtained from a rooted block by inserting a rooted map, possibly trivial, in each of its corners, with each nonempty insert attached at the origin of its root dart; moreover, is multiplicative when two maps are joined at one vertex, and consequently .
Here stack-emptying typed words, connected typed cores, and valid corner lists correspond to maps, blocks, and corners, and the generating-function relation is stated at the rescaled argument for .
What Is Checked
The corner substitution bijection (6) and injectivity statement (7) are stated over finite lists satisfying the valid corner condition, valid corner words , nonempty typed words , literal corner insertion , and the corner insertion map . In (8), the identity ranges over extended nonnegative real parameters , nonempty typed words , connected typed cores , flexible closing counts, inventory word monomial weights, and the word generating series . An FK model parameter , a real number , the flexible order parameter , the inventory radius parameter , the core and block generating polynomial coefficients, and the inventory generating series underlie (9) and (10).
For these constructions, the letter mass function takes nonnegative values summing to to define the letter distribution on , the chord crossing relation is symmetric and loopless so that is a simple graph, and the literal corner insertion of any valid corner word is nonempty and stack-emptying.