The Setting
A coloring restricts perfect matchings to a prescribed table of color pair counts. The spectral quantity at issue is the trace of the square of the normalized incidence operator for this restriction.
Let be a positive integer and put . The vertex set is , where and ; the color set is . A matching involution on is a permutation satisfying and for every vertex .✦ Write for the set of matching involutions.
The histogram of a coloring records its color cell sizes.✦ The fixed histogram coloring set consists of the colorings with prescribed histogram , as in (1).✦ (1)
For a coloring , the paired vertex coloring is the function of ordered color pairs given in (2). The reconstruction of a paired coloring is the coloring given in (2). (2)✦
The unordered color pair type is the pair of colors arranged in increasing order, indexed by the ordered list .✦ The reference color table of a coloring is the vector indexed by whose entries count the types of the paired vertex colors.✦ The matching color table of a coloring and a matching involution on is the vector indexed by whose entries count matching edges of each type; diagonal endpoint counts are twice the internal-edge counts. (3)
Fix a reference coloring , and write and . Let and . The reference table compatibility relation between and requires the matching color table to equal .✦ The reference table fiber size and this relation are specified in (4). (4)
Incidence Averages
For nonempty finite sets and a relation , the incidence matrix is the matrix with rows indexed by and columns indexed by whose entries are the incidence indicators in (5).✦ For a relation between nonempty finite sets and elements , the common incidence count is the number of elements of incident under to both and , as in (5). (5)
For a relation between nonempty finite sets and a nonzero real normalizing factor , the incidence kernel and normalized incidence operator are real matrices indexed by whose entries are given in (6). (6)
For a real function on and a real factor , the normalized incidence average is defined by (7); for its value is zero. (7)✦ The table operators are and , with .
The normalized table overlap of a permutation of counts colorings compatible with the reference table before and after composition with , with the normalization in (8). (8)
The Claim
Theorem 1. Let , and let the reference coloring have for every color . The table incidence operator satisfies (9). (9)✦ The uniform permutation moment satisfies (10), where is the permutation group of . (10)✦ For any relation between nonempty finite sets, any real , and any , the averaging energy identity is (11), with . (11)✦
In the paper, the result reads: for cells, with and , every admissible table in the appendix setting satisfies .
What Is Checked
The table bounds are stated over matching involutions and colorings with the reference histogram on vertices, with and all three color cells nonempty; the energy identity is stated over arbitrary relations between nonempty finite sets and nonzero real normalizing factors.
The paired vertex coloring and reconstruction maps in (2) are inverse to one another.✦