The Setting
A three-cell average of a function on perfect matching columns fixes the numbers of matching edges of each color type. The smoothing estimates concern the part of that function orthogonal to products of a bounded number of edge incidences.
Write for the integers from to and for the two-element set . For the smoothing estimates, the vertex set is , with vertices and colors .✦ A matching involution on a finite vertex set is a fixed-point-free involutive permutation of ; write for the set of matching involutions on .✦ Write for the group of permutations of . For , , and vertices , relabeling by and the edge incidence coordinate are given by (1). (1)
The histogram of a coloring is the vector of its three cell sizes.✦ Colorings with prescribed histogram form the set in (2). (2)
The unordered color pair type of colors is the pair of these colors in increasing order.✦ The matching color table of a matching involution and a coloring is the vector of unoriented edge counts in the order , as in (3); diagonal endpoint counts are twice the corresponding internal-edge counts.✦ The distinct color pairs are , in that order.✦ (3)✦
A coloring of is identified with its ordered color pairs for .✦ The reference table of a coloring of is the vector counting its prescribed color pairs✦, and reference table compatibility is the relation in (4) between a matching involution and a coloring . (4)
For a finite relation and , the fiber is the set of elements of related to . For a real function on and a normalizing factor , the incidence matrix of , normalized incidence average , and fiber average are given by (5); a zero denominator gives value zero. The matching average , for a coloring of , a table , and a real function on , is the fiber average over the set of matching involutions on .✦ (5)
The table energy of a real matching function at a table and histogram is the mean squared matching average over the colorings with histogram , as defined in (6). (6)✦
The real matching functions on form the Euclidean space .✦ For a nonnegative integer , the matching polynomial space is the edge-product span in (7), including the empty product .✦ The orthogonal polynomial projection on is the orthogonal projection onto .✦ (7)
The Claim
Theorem 1. For every , there are integers and such that, whenever , is a coloring with positive histogram, meaning that every color cell is nonempty, , and is a real matching function, the uniform permutation estimate (8) holds with : (8)✦
For every , there also are integers and such that, whenever , the reference coloring has positive histogram , and , the uniform table estimate (9) holds: (9)✦
Let be a finite set, a coloring, a degree, and a matching function. There is a real polynomial of total degree at most satisfying (10) for every table realized by a matching under : (10)✦
For every finite vertex set , coloring , table , and real matching function , the permutation energy identity is (11): (11)✦
In the paper, the result reads: for every real there are integers and such that, for every even , positive integers summing to , and nonnegative integers for which , , and are nonnegative and even, the operator of uniform averaging over matchings with these intercell counts, viewed on uniform ordered partitions of these sizes, with denoting the identity operator on real matching functions, satisfies uniformly in the sizes and counts, and, for each fixed partition and matching function , one polynomial of total degree at most in gives all values of .
What Is Checked
The smoothing estimates range over natural and sufficiently large , with all three color cells nonempty on . The energy identity allows every finite vertex set and table; the polynomial statement uses paired vertices and realized tables.