The Setting
The finite field configurations considered here are indexed by permutation words and sampled from lists subject to nonzero square constraints. For a nonnegative integer , write . A permutation word on a block set with alphabet is a choice of a permutation for every , belonging to the space in (1). (1)✦ Permutations are composed as functions. For , the permutation exchanges and ; when , it is the identity.
An ordered position pair in is an element of the set in (2). (2)✦ For , and , the position transposition is the word defined by (3). (3)✦
For a finite block set , a group , an element and an integer , threshold shift adjacency is the relation on in (4). (4)✦
Transposition Weights
For finite , a marked set and a real parameter , the transposition interaction is the real matrix on defined by (5); its sums are counting sums and denotes the indicator of a condition . (5)✦
Let be finite, let be a label set, and let be a real matrix indexed by . The label coincidence pairing of label assignments is the real function defined by (6). (6)✦ The index energy and Boltzmann weight on label assignments are the real functions defined by (7) and (8), respectively. (7)✦ (8)✦
For a field , the nonzero square indicator is the real function on defined by (9). (9)✦
The Definition
Definition 1. The fixed alphabet size and threshold are given by (10) and (11), respectively. (10)✦ (11)✦ The number of blocks is in (12), and the block set is . (12)✦ The tuple vertex space is the fixed permutation word space in (13). (13)✦ Let be the cyclic shift .✦ For each integer , the constant cyclic vertex is defined by (14). (14)✦
For a block set , , and , the symbol reflection is the word in (15). (15)✦ The positive cut condition holds when precedes in the permutation , for , and , as in (16). (16)✦ For a block set , a block and symbols , the positive cut half is the subset of defined by (17). (17)✦
For a marked set , the fixed list parameter and interaction parameter are the constants in (18). (18) An inactive-block address is a tuple of permutations of indexed by ✦; the address space and the restriction map are given by (19). (19) The list index set is the finite interval in (20). (20)✦ An addressed list entry is a pair consisting of an address and an index , as in (21). (21)✦ Let be the specified finite set of list constraint edges.
Let be prime. The square-constraint indicator on list assignments is the real function defined by (22). (22)✦ For a label assignment , the sampled configuration is given by (23). (23)✦ The interaction gives label assignments the tuple Boltzmann weight in (24). (24)✦
The marked-list component is the functional on real functions in (25), with both averages taken with respect to uniform probability. (25)✦ For and , take the positive cut half and write . The cut quadratic form on real functions is in (26). (26)✦
The fixed weight bound constant is defined by (27). (27)✦
What Is Checked
The component functionals and cut forms are defined over every prime field , for arbitrary marked sets and real test functions on the corresponding configuration spaces.