The Setting
The local data for contraction are residues attached to permutation words. A selected cycle of words specifies the pairs of residues on which square conditions are imposed. The numerical parameters are fixed by (1): (1)
For a block set and a nonnegative integer , a permutation word of height on is a function assigning to each block a permutation of .✦ The permutation tuple vertices form the set in (2), with the fixed block set : (2)
The cyclic shift sends each position below to the next, returning the last position to zero.✦ For a nonnegative integer , the cyclic tuple vertex assigns the same power of this shift to every block, as in (3): (3)✦
Let be a finite index set and a family of natural moduli. For a natural modulus , the local quadratic modulus is the integer defined in (4); write for its residue ring. (4)✦
The set of strict local squares is defined by (5). At an odd prime, these are the nonzero squares. (5)✦
The combined small modulus is the product of the local quadratic moduli.✦ With , the small-residue projection is the canonical reduction homomorphism specified in (6): (6)
A strict quadratic residue pair is an ordered pair whose difference has a strict local square projection at every index, as in (7): (7)✦
The Definition
Definition 1. A good small-residue assignment is a function belonging to the set in (8): (8)✦ When , the good small-residue probability is the probability of under the uniform law on all assignments, defined by (9): (9)✦
What Is Checked
The residue conditions are stated over the fixed permutation tuple vertices and the residue rings associated with a finite family of natural moduli; the probability uses the uniform law on the finite assignment space when .
Each local quadratic modulus divides the combined modulus, as stated in (10): (10)✦