Difference between revisions of "Quasirandomness"

Quasirandomness is a central concept in extremal combinatorics, and is likely to play an important role in any combinatorial proof of the density Hales-Jewett theorem. This will be particularly true if that proof is based on the density increment method or on some kind of generalization of Szemerédi's regularity lemma.

In general, one has some kind of parameter associated with a set, which in our case will be the number of combinatorial lines it contains, and one would like a deterministic definition of the word "quasirandom" with the following key property.

• Every quasirandom set $\mathcal{A}$ has roughly the same value of the given parameter as a random set of the same density.

Needless to say, this is not the only desirable property of the definition, since otherwise we could just define $\mathcal{A}$ to be quasirandom if it has roughly the same value of the given parameter as a random set of the same density. The second key property is this.

• Every set $\mathcal{A}$ that fails to be quasirandom has some other property that we can exploit.

These two properties are already discussed in some detail in the article on the density increment method: this article concentrates more on examples of quasirandomness in other contexts, and possible definitions of quasirandomness connected with the density Hales-Jewett theorem.

Examples of quasirandomness definitions

Bipartite graphs

Let X and Y be two finite sets and let $f:X\times Y\rightarrow [-1,1].$ Then f is defined to be c-quasirandom if $\mathbb{E}_{x,x'\in X}\mathbb{E}_{y,y'\in Y}f(x,y)f(x,y')f(x',y)f(x',y')\leq c.$

Since the left-hand side is equal to $\mathbb{E}_{x,x'\in X}(\mathbb{E}_{y\in Y}f(x,y)f(x',y))^2,$ it is always non-negative, and the condition that it should be small implies that $\mathbb{E}_{y\in Y}f(x,y)f(x',y)$ is small for almost every pair $x,x'.$

If G is a bipartite graph with vertex sets X and Y and $\delta$ is the density of G, then we can define $f(x,y)$ to be $1-\delta$ if xy is an edge of G and $-\delta$ otherwise. We call f the balanced function of G, and we say that G is c-quasirandom if its balanced function is c-quasirandom.

It can be shown that if H is any fixed graph and G is a large quasirandom graph, then the number of copies of H in G is approximately what it would be in a random graph of the same density as G.

Subsets of finite Abelian groups

If A is a subset of a finite Abelian group G and A has density $\delta,$ then we define the balanced function f of A by setting $f(x)=1-\delta$ when x\in A and $f(x)=-\delta$ otherwise. Then A is c-quasirandom if and only if f is c-quasirandom, and f is defined to be c-quasirandom if $\mathbb{E}_{x,a,b\in G}f(x)f(x+a)f(x+b)f(x+a+b)\leq c.$ Again, we can prove positivity by observing that the left-hand side is a sum of squares. In this case, it is $\mathbb{E}_{a\in G}(\mathbb{E}_{x\in G}f(x)f(x+a))^2.$

If G has odd order, then it can be shown that a quasirandom set A contains approximately the same number of triples $(x,x+d,x+2d)$ as a random subset A of the same density. However, it is decidedly not the case that A must contain approximately the same number of arithmetic progressions of higher length (regardless of torsion assumptions on G). For that one must use "higher uniformity".

Subsets of grids

A function f from [n]^2 to [-1,1] is c-quasirandom if the "sum over rectangles" is at most c. The sum over rectangles is \mathbb{E}_{x,y,a,b}f(x,y)f(x+a,y)f(x,y+b)f(x+a,y+b). Again, it is easy to show that this sum is non-negative by expressing it as a sum of squares. And again, one defines a subset A\subset[n]^2 to be c-quasirandom if it has a balanced function that is c-quasirandom.

If A is a c-quasirandom set of density $\delta$ and c is sufficiently small, then A contains roughly the same number of corners as a random subset of $[n]$ of density $\delta.$

A possible definition of quasirandom subsets of $[3]^n$

(To be continued.)