The Setting
A directed graph can prescribe strict-square constraints on a family of independent uniform field elements: the difference along each directed edge must be a nonzero square. An oriented graph is a graph with vertex set and edge set , with no loops and with at most one directed edge on each unordered pair of distinct vertices. Let be finite and write .
For a field , the nonzero square indicator is the function in (1). (1)✦ For an odd prime , write and let be the error parameter in (2). (2)
Bounded Kernels
Let be a finite nonempty set. A bounded kernel is a function with for all . For , the bilinear discrepancy condition on is (3), required for every pair of real functions with for all ; here denotes the uniform probability average. (3) An average over chooses the coordinates independently and uniformly in ; an empty edge product has value .
The Claim
Theorem 1. Let be a finite oriented graph with edges. Let be a finite nonempty set, and let be a bounded kernel satisfying (3) for some . Then (4)✦ For an odd prime , the nonzero square indicator satisfies (5)✦
In the paper, the result reads: for an odd prime and a finite directed graph without loops and with at most one edge on each unordered pair, independent uniform satisfy , including the empty graph.
What Is Checked
The count in (4) is stated over finite oriented graphs and bounded real kernels on finite nonempty sets subject to (3); the count in (5) is stated over odd prime fields with the nonzero square indicator (1) and the error parameter (2).