Quasirandom group

The notion of quasirandom groups arises when considering subsets of groups for which no two elements in the subset have a product in the subset; such subsets are termed product-free. László Babai and Vera Sós asked about the existence of a constant ${\displaystyle c}$ for which every finite group ${\displaystyle G}$ with order ${\displaystyle n}$ has a product-free subset with size at least ${\displaystyle cn}$.[1] A well-known result of Paul Erdős about sum-free sets of integers can be used to prove that ${\textstyle c={\frac {1}{3}}}$ suffices for abelian groups, but it turns out that such a constant does not exist for non-abelian groups.[2]

Both non-trivial lower and upper bounds are now known for the size of the largest product-free subset of a group with order ${\displaystyle n}$. A lower bound of ${\textstyle cn^{\frac {11}{14}}}$ can be proved by taking a large subset of a union of sufficiently many cosets,[3] and an upper bound of ${\textstyle cn^{\frac {8}{9}}}$ is given by considering the projective special linear group ${\displaystyle \operatorname {PSL} (2,p)}$ for any prime ${\displaystyle p}$.[4] In the process of proving the upper bound, Timothy Gowers defined the notion of a quasirandom group to encapsulate the product-free condition and proved equivalences involving quasirandomness in graph theory.

Formally, it does not make sense to talk about whether or not a single group is quasirandom. The strict definition of quasirandomness will apply to sequences of groups, but first bipartite graph quasirandomness must be defined. The motivation for considering sequences of groups stems from its connections with graphons, which are defined as limits of graphs in a certain sense.

Fix a real number ${\displaystyle p\in [0,1].}$ A sequence of bipartite graphs ${\displaystyle (G_{n})}$ (here ${\displaystyle n}$ is allowed to skip integers as long as ${\displaystyle n}$ tends to infinity) with ${\displaystyle G_{n}}$ having ${\displaystyle n}$ vertices, vertex parts ${\displaystyle A_{n}}$ and ${\displaystyle B_{n}}$, and ${\displaystyle (p+o(1))|A_{n}||B_{n}|}$ edges is quasirandom if any of the following equivalent conditions hold:

• For every bipartite graph ${\displaystyle H}$ with vertex parts ${\displaystyle A'}$ and ${\displaystyle B'}$, the number of labeled copies of ${\displaystyle H}$ in ${\displaystyle G_{n}}$ with ${\displaystyle A'}$ embedded in ${\displaystyle A}$ and ${\displaystyle B'}$ embedded in ${\displaystyle B}$ is ${\textstyle \left(p^{e(H)}+o(1)\right)|A|^{|A'|}|B|^{|B'|}.}$ Here, the function ${\displaystyle o(1)}$ is allowed to depend on ${\displaystyle H.}$
• The number of closed, labeled walks of length 4 in ${\displaystyle G_{n}}$ starting in ${\displaystyle A_{n}}$ is ${\displaystyle (p^{4}+o(1))|A_{n}|^{2}|B_{n}|^{2}.}$
• The number of edges between ${\displaystyle A'}$ and ${\displaystyle B'}$ is ${\displaystyle p|A'||B'|+n^{2}o(1)}$ for any pair of subsets ${\displaystyle A'\subseteq A_{n}}$ and ${\displaystyle B'\subseteq B_{n}.}$
• ${\displaystyle \sum \limits _{a_{1},a_{2}\in A_{n}}N(a_{1},a_{2})^{2}=(p^{4}+o(1))|A_{n}|^{2}|B_{n}|^{2}}$, where ${\displaystyle N(u,v)}$ denotes the number of common neighbors of ${\displaystyle u}$ and ${\displaystyle v.}$
• ${\displaystyle \sum \limits _{b_{1},b_{2}\in B_{n}}N(b_{1},b_{2})^{2}=(p^{4}+o(1))|A_{n}|^{2}|B_{n}|^{2}.}$
• The largest eigenvalue of ${\displaystyle G_{n}}$'s adjacency matrix is ${\textstyle (p+o(1)){\sqrt {|A||B|}}}$ and all other eigenvalues have magnitude at most ${\textstyle {\sqrt {|A||B|}}o(1).}$

It is a result of Chung–Graham–Wilson that each of the above conditions is equivalent.[5] Such graphs are termed quasirandom because each condition asserts that the quantity being considered is approximately what one would expect if the bipartite graph was generated according to the Erdős–Rényi random graph model; that is, generated by including each possible edge between ${\displaystyle A_{n}}$ and ${\displaystyle B_{n}}$ independently with probability ${\displaystyle p.}$

Though quasirandomness can only be defined for sequences of graphs, a notion of ${\displaystyle c}$-quasirandomness can be defined for a specific graph by allowing an error tolerance in any of the above definitions of graph quasirandomness. To be specific, given any of the equivalent definitions of quasirandomness, the ${\displaystyle o(1)}$ term can be replaced by a small constant ${\displaystyle c>0}$, and any graph satisfying that particular modified condition can be termed ${\displaystyle c}$-quasirandom. It turns out that ${\displaystyle c}$-quasirandomness under any condition is equivalent to ${\displaystyle c^{k}}$-quasirandomness under any other condition for some absolute constant ${\displaystyle k\geq 1.}$

The next step for defining group quasirandomness is the Cayley graph. Bipartite Cayley graphs give a way from translating quasirandomness in the graph-theoretic setting to the group-theoretic setting.

Given a finite group ${\displaystyle \Gamma }$ and a subset ${\displaystyle S\subseteq \Gamma }$, the bipartite Cayley graph ${\displaystyle \operatorname {BiCay} (\Gamma ,S)}$ is the bipartite graph with vertex sets ${\displaystyle A}$ and ${\displaystyle B}$, each labeled by elements of ${\displaystyle G}$, whose edges ${\displaystyle a\sim b}$ are between vertices whose ratio ${\displaystyle ab^{-1}}$ is an element of ${\displaystyle S.}$

With the tools defined above, one can now define group quasirandomness. A sequence of groups ${\displaystyle (\Gamma _{n})}$ with ${\displaystyle |\Gamma _{n}|=n}$ (again, ${\displaystyle n}$ is allowed to skip integers) is quasirandom if for every real number ${\displaystyle p\in [0,1]}$ and choice of subsets ${\displaystyle S_{n}\in \Gamma _{n}}$ with ${\displaystyle |S_{n}|=(p+o(1))|\Gamma _{n}|}$, the sequence of graphs ${\displaystyle \operatorname {BiCay} (\Gamma _{n},S_{n})}$ is quasirandom.[4]

Though quasirandomness can only be defined for sequences of groups, the concept of ${\displaystyle c}$-quasirandomness for specific groups can be extended to groups using the definition of ${\displaystyle c}$-quasirandomness for specific graphs.

As proved by Gowers, group quasirandomness turns out to be equivalent to a number of different conditions.

To be precise, given a sequence of groups ${\displaystyle (\Gamma _{n})}$, the following are equivalent:

• ${\displaystyle (\Gamma _{n})}$ is quasirandom; that is, all sequences of Cayley graphs defined by ${\displaystyle (\Gamma _{n})}$ are quasirandom.
• The dimension of the smallest non-trivial representation of ${\displaystyle \Gamma _{n}}$ is unbounded.
• The size of the largest product-free subset of ${\displaystyle \Gamma _{n}}$ is ${\displaystyle o(|\Gamma _{n}|).}$
• The size of the smallest non-trivial quotient of ${\displaystyle \Gamma _{n}}$ is unbounded.[4]

Cayley graphs generated from pseudorandom groups have strong mixing properties; that is, ${\displaystyle \operatorname {BiCay} (\Gamma _{n},S)}$ is a bipartite ${\displaystyle (n,d,\lambda )}$-graph for some ${\displaystyle \lambda }$ tending to zero as ${\displaystyle n}$ tends to infinity. (Recall that an ${\displaystyle (n,d,\lambda )}$ graph is a graph with ${\displaystyle n}$ vertices, each with degree ${\displaystyle d}$, whose adjacency matrix has a second largest eigenvalue of at most ${\displaystyle \lambda .}$)

In fact, it can be shown that for any ${\displaystyle c}$-quasirandom group ${\displaystyle \Gamma }$, the number of solutions to ${\displaystyle xy=z}$ with ${\displaystyle x\in X}$, ${\displaystyle y\in Y}$, and ${\displaystyle z\in Z}$ is approximately equal to what one might expect if ${\displaystyle S}$ was chosen randomly; that is, approximately equal to ${\displaystyle {\tfrac {|X||Y||Z|}{|\Gamma |}}.}$ This result follows from a direct application of the expander mixing lemma.

There are several notable families of quasirandom groups. In each case, the quasirandomness properties are most easily verified by checking the dimension of its smallest non-trivial representation.

• The projective special linear groups ${\displaystyle \operatorname {PSL} (2,p)}$ for prime ${\displaystyle p}$ form a sequence of quasirandom groups, since a classic result of Frobenius states that its smallest non-trivial representation has dimension at least ${\displaystyle {\tfrac {1}{2}}(p-1).}$ In fact, these groups are the groups with the largest known minimal non-trivial representation, as a function of group order.
• The alternating groups ${\displaystyle (A_{n})}$ are quasirandom, since its smallest non-trivial representation has dimension ${\displaystyle n-1.}$
• Any sequence of non-cyclic simple groups with increasing order is quasirandom, since its smallest non-trivial representation has dimension at least ${\displaystyle {\tfrac {1}{2}}{\sqrt {\log n}}}$, where ${\displaystyle n}$ is the order of the group.[4]