Documentation

Complexity.Foundations.Combinatorics.Expander.AffineTower

A zig-zag tower with an arithmetic base #

Tensor two affine-plane graphs, then zig-zag twice with the same affine-plane graph. This gives a graph on |K|⁸ vertices of degree |K|², with spectral expansion at most 3r + 2r², where r = sqrt (1 / |K|). For |K| ≥ 256 the bound is at most 1 / 5, as the existing zig-zag tower requires. All rotations are computed by field arithmetic and graph combinators, without search or a nonconstructive choice of a base graph. A concrete field is ZMod 257.

This is the affine-plane base construction of Reingold, Vadhan and Wigderson, Section 5.1, adapted to the simpler tower of their Section 1.2. It supplies particular vertex counts; AffineFamily contracts this tower to arbitrary sizes. Complete rotation tables have uniform polynomial-time certificates in Computability/Machines/Turing/MultiTape/Complexity/PolyTime/RotationMap/Tower. Practically small degree and time polynomial in the bit length of a vertex name remain separate targets.

Main definitions #

Main results #

References #

@[reducible, inline]

The eight coordinates of the arithmetic base, grouped as the graph products produce them.

Instances For

    Tensor two affine planes and zig-zag twice, giving degree |K|² on |K|⁸ vertices.

    Instances For

      Regroup the base's coordinates into pairs of pairs of its edge labels.

      Instances For

        The ordinary zig-zag tower with an arithmetic base instead of a chosen expander.

        Instances For

          The base's expansion is at most 3r + 2r², where r = sqrt (1 / |K|).

          A field with at least 256 elements gives a valid base for the existing zig-zag tower.

          The (n + 1)-st arithmetic tower graph has |K|^(8(n + 1)) vertices.

          Every graph of the arithmetic tower has spectral expansion at most 2 / 5.