The Setting
In the Fortuin-Kasteleyn (FK) random planar map model, the map generating function and the block generating function satisfy the quadratic relation . At the critical radius , the question is whether this relation together with an Abel square-root lower bound on the map series implies that the block offspring random variable of the critical block tree satisfies and .
Block Offspring Weights and Generating Series
A block offspring weight distribution is a sequence of nonnegative real numbers satisfying .✦
For a block offspring weight distribution and , the probability generating function is (1)✦ The Abel mean of a block offspring weight distribution at is the weighted series (2)✦
Inventory Streams and Block Coefficients
An FK parameter choice with probability is a parameter choice for the FK model specified by a real probability . The flexible order parameter of an FK parameter choice with probability is the real number . The inventory radius parameter of an FK parameter choice with probability is the real number .
For two burger types, an inventory order is either a fixed order for one of the two types or the flexible order✦, and a burger-order alphabet letter is either a burger of one of the two types or an inventory order.✦ The letter mass function for an FK parameter choice with probability assigns weight to each of the two burgers, to the flexible order, and to each of the two fixed orders.✦ The letter distribution for an FK parameter choice is the probability distribution on the burger-order alphabet with probabilities given by ✦, and the independent and identically distributed (i.i.d.) inventory stream measure for on sequences of alphabet letters indexed by a set is the infinite product measure of .
An inventory stack evaluation state is a pair consisting of a finite sequence of pending orders and a finite sequence of burger types stored freshest-first.✦ Starting from an evaluation state , the word evaluation of a finite word of alphabet letters processes step by step by consuming the freshest eligible burger for each order, returning when is empty✦; the word reduction of is its word evaluation from empty pending orders and an empty burger stack.✦ An empty-reducing word of alphabet letters is a finite word whose word reduction produces the empty evaluation state with no pending orders and no burgers.✦ For a stream of alphabet letters and an integer , the letter sequence prefix of length is the finite sequence , and the initial word is the word formed from that prefix.✦ The empty-reducing word probability at length for an FK parameter choice is (3) where has law on . Summing over even lengths gives the total empty word probability under , (4)✦
A typed burger-order letter is either a burger or an order carrying one of the two burger types.✦ Given a finite word of typed letters and a freshest-first stack of burger types, typed word stack execution processes letter by letter against , returning the updated stack on success or failing upon an illegal closure.✦ Over a finite alphabet , the set of words of length consists of all sequences of letters in ✦; for the typed letter alphabet, the empty-reducing typed word set consists of those words of length whose typed stack execution from an empty stack succeeds and ends with an empty stack.✦
A non-crossing arch matching on a finite sequence of positions is a finite sequence of ordered pairs from built inductively from the empty matching on the empty sequence by skipping an unmatched position or pairing two positions and nested around non-crossing arch matchings on the interior segment strictly between and and the suffix strictly after .✦ For a finite sequence of ordered pairs in a set , the arch transposition product is the permutation of equal to the identity when is empty and to when prepends to , where swaps and .✦ Given a word map from a finite sequence in to typed letters, a two-stack matching certificate for along is a pair of non-crossing arch matchings on whose concatenated arch endpoints form a permutation of , such that the first matching pairs first-type burgers to first-type orders and the second matching pairs second-type burgers to second-type orders.✦ The stack matching mate permutation of a two-stack matching certificate is the arch transposition product of the concatenated list of its first and second arch matchings.✦
A chord opening endpoint of a permutation of is an index in satisfying . Two chord opening endpoints and of a permutation of satisfy the chord crossing relation if either or . The chord intersection graph of a permutation of is the simple graph on the chord opening endpoints of whose edges join pairs of chord opening endpoints satisfying the chord crossing relation.✦
A connected core word is a finite word of typed letters such that there exist a length , a word map from to typed letters whose values form , and a two-stack matching certificate for along such that has an opening endpoint at from which every opening endpoint is reachable in the chord intersection graph of .✦ The flexible closing count of a finite word of typed letters and an initial stack of burger types is the number of flexible order closures encountered along valid steps of typed stack execution of starting from , stopping upon any illegal closure.✦ For and an integer , the core generating coefficient is (5)✦ where is the set of connected core words in and is the empty stack. The block generating coefficient at and is (6)✦ An FK parameter choice and an integer define the actual FK block mass by (7)✦
The Claim
Theorem 1. Suppose is a sequence of nonnegative real numbers, and and are real sequences converging to with and for all . Then (8)✦
Theorem 2. Let be a block offspring weight distribution, let be a sequence in converging to , and let satisfy for all . Then (9)✦
Theorem 3. Let be a block offspring weight distribution, let be a sequence of nonnegative real numbers, let be a sequence in converging to with for all , and let satisfy for all . Then (10)✦
Theorem 4. For any FK parameter choice , the actual FK block mass satisfies (11)✦
In the paper, the result reads: if and have nonnegative coefficients with constant term and satisfy , if satisfies , and if for some the bound holds for all sufficiently close to , then setting and yields , , and . In normalized coordinates and for with , and with limits taken along sequences converging to , the identities (10) and (11) correspond to those three conclusions of the paper and answer the criticality and finite-variance question for the block offspring distribution.
What Is Checked
The claims (8), (9), (10), and (11) are stated over nonnegative real sequences and block offspring weight distributions satisfying generating-series limits along sequences in or converging to , quadratic gap bounds or quadratic inverse relations with an Abel square-root lower bound, and, for any FK parameter choice with , the actual FK block mass constructed from the i.i.d. inventory stream probability and connected core word coefficients.