The Setting
Square-difference constraints on addressed lists are combined with a Boltzmann weight on vertex labels. An unmarked cut reflects a permutation tuple through a block outside the active set.
The height , block cutoff , list base and interaction parameter have the values in (1): (1) Put and , so there are blocks.✦ A permutation word on a block set is a function from to the permutation group .✦ The tuple vertex set is ; write .✦
For an active set , an inactive-block address is a function assigning a permutation to each block outside .✦ The address space , list index set and addressed list entry set are defined by (2): (2) The inactive-block projection is restriction to .✦
The cyclic shift sends each position to the next, modulo .✦ For a finite block set , a group , a shift and a threshold , threshold shift adjacency of addresses is the relation (3): (3)✦ Let be the list constraint edges, prescribing square differences between addressed list values.
Weights and Square Constraints
An ordered position pair is a pair with .✦ For a word and a block , the position transposition is the word obtained by right-composing its permutation at block with and leaving the other blocks fixed.✦ The transposition interaction is the real matrix in (4), with counting sums over blocks and pairs: (4)✦
For a real matrix on a finite set , a label set and labelings , the label coincidence pairing , index energy and index Boltzmann weight are defined by (5); the tuple weight is , using (4): (5) The sums in (5) are counting sums. The Boltzmann weight bound and unmarked reflection constant are the constants in (6): (6)
The strict square indicator for a prime takes the value on nonzero squares in and elsewhere.✦ For a finite directed edge set , the graph square-constraint indicator on is given by (7); the tuple validity indicator is : (7)
For list values and labels , the sampled configuration is .✦ The tuple component functional on real observables is defined by (8), where every expectation is a uniform probability average: (8)✦
The Cut and Its Moment
Fix and distinct symbols . The positive cut predicate at holds for a word when its inverse permutation places before .✦ The positive cut half and block transposition reflection are defined by (9); the reflection left-composes at : (9) The reflection half decomposition is the map from two copies of to that sends a vertex in the first copy to and a vertex in the second copy to .
For a real function , the tuple reflection quadratic form uses the component functional (8) as in (10): (10)✦
Assume . A positive half address is an address in satisfying the cut predicate in (9); their set is denoted by .✦ The positive half list entry set is the Cartesian product defined by .✦ The positive half projection is the restriction of .✦ The list reflection half decomposition leaves the first copy unchanged and reflects the address in the second copy, retaining the list index.
The unmarked half graph is the graph pullback of along : an ordered pair is an edge exactly when .✦ The positive half internal edge set of consists of the edges with both endpoints in the first copy of , viewed as pairs in .✦ The unmarked second moment is defined by (11), using the graph validity indicator (7): (11)✦
The Claim
Theorem 1. Let be an odd prime, , and distinct. Let . For , the unmarked cut satisfies (12)✦ For , the terminal cut satisfies (13)✦
In the paper, the result reads: with mark cutoff and weight bound , writing for the label at in the labeling , for , and real , let impose only constraints internal to plus addresses and put ; then with , while when .
What Is Checked
The claims (12) and (13) concern odd prime fields and real functions on permutation cut halves, with an inactive reflection block and distinct reflected symbols. The vertex and list reflection half decompositions are bijections from two copies of their respective positive halves onto the full vertex and list sets.