Path Discrepancy in Lattice Checkerboards

• Path discrepancy is the absolute difference in the length of a curve lying in positive versus negative colored tiles in a checkerboard lattice tiling.
• The square-root law establishes that any two-coloring forces long line segments to have a discrepancy at least proportional to the square root of their length.
• Spectral analysis and lattice tiling identities are crucial for extending discrepancy bounds from square cells to any bounded measurable fundamental domain.

Path discrepancy, in geometric discrepancy theory, denotes the discrepancy induced on a measurable curve by a checkerboard-type coloring of the plane: it is the absolute value of the signed length of the curve lying in positively colored tiles minus the length lying in negatively colored tiles. In the general lattice-checkerboard setting, the plane is tiled by lattice translates of an arbitrary bounded, Lebesgue measurable fundamental domain $Q$, not necessarily squares, and the principal result is a square-root law: every two-coloring of such a tiling forces arbitrarily long line segments whose discrepancy is at least a constant multiple of the square root of their length (Kolountzakis, 2016).

1. General lattice-checkerboard formulation

Let $T \subseteq \mathbb{R}^2$ be a lattice, and let $Q$ be a bounded, Lebesgue measurable fundamental domain of $T$. The plane is partitioned as

$\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$

A checkerboard coloring is specified by assigning to each tile $t+Q$ a color $z_t \in \{-1,+1\}$. The associated coloring function is

$f(x) = \sum_{t \in T} z_t \chi_Q(x-t),$

where $\chi_Q$ is the indicator function of $Q$.

For any measurable curve $T \subseteq \mathbb{R}^2$0, and especially for a line segment, the discrepancy is

$T \subseteq \mathbb{R}^2$1

Equivalently, this is the signed length of $T \subseteq \mathbb{R}^2$2 passing through positive tiles minus that through negative tiles. The formulation generalizes the square checkerboard by allowing $T \subseteq \mathbb{R}^2$3 to be any bounded measurable tile for the lattice rather than a square (Kolountzakis, 2016).

This setup preserves the lattice structure while discarding the geometric specialness of the square. The resulting notion of path discrepancy is therefore not tied to axis-aligned unit cells: the same formalism applies whenever a bounded fundamental domain tiles the plane by lattice translations.

2. Main lower bounds for line segments

The central estimate is first stated for finite superpositions of translated tiles with arbitrary complex weights. If $T \subseteq \mathbb{R}^2$4 is finite and

$T \subseteq \mathbb{R}^2$5

then there exists a straight line $T \subseteq \mathbb{R}^2$6 such that

$T \subseteq \mathbb{R}^2$7

where $T \subseteq \mathbb{R}^2$8 depends only on the lattice $T \subseteq \mathbb{R}^2$9 and the shape $Q$0 (Kolountzakis, 2016).

In the two-coloring case $Q$1, this yields the checkerboard corollary: $Q$2 where $Q$3 is the length of $Q$4, and $Q$5 depends only on $Q$6 and $Q$7.

The theorem asserts a lower bound that is insensitive to the specific geometry of the fundamental domain, provided only that it is a bounded measurable lattice tile. In particular, the square-root growth of discrepancy is not a peculiarity of square cells. It is a robust feature of lattice checkerboards generated from arbitrary bounded fundamental domains.

3. Quantitative form of the square-root law

A more explicit asymptotic statement is obtained by restricting attention to colorings supported inside large squares of side $Q$8. In that setting, the maximum path discrepancy for line segments crossing the square is at least $Q$9 (Kolountzakis, 2016).

This is the quantitative form of the square-root law. It implies that as one examines larger and larger scales, there are always line segments whose imbalance between positive and negative portions grows at least like the square root of the segment length. The lower bound is therefore scale-sensitive but sublinear: it rules out uniformly small discrepancy on all long segments, while not asserting linear growth.

The dependence of the constant only on the lattice and the tile shape is essential. It shows that the phenomenon is geometric and structural rather than dependent on a particular coloring pattern. The coloring may be arbitrary, but the ambient tiling imposes a nontrivial lower bound on the discrepancy of some long line segment.

4. Fourier analysis, tiling, and spectral structure

Earlier square-checkerboard arguments relied strongly on the explicit zeros and decay of the Fourier transform of the square indicator function. For general $T$0, that structure is unavailable, so the proof uses a different mechanism based on tiling and spectral properties (Kolountzakis, 2016).

The Fourier transform of the coloring function factors as

$T$1

The crucial substitute for square-specific Fourier decay is the spectral identity associated with lattice tilings. If $T$2 tiles $T$3 by translations of $T$4, then the exponentials $T$5, where $T$6 is the dual lattice, form an orthonormal basis for $T$7, and

$T$8

This identity gives global $T$9-control over $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$0 without requiring pointwise information such as zero sets or decay rates. Parseval’s identity and the tiling spectral identity are then used to relate line integrals of $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$1 to $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$2-mass in frequency space. The proof therefore shifts from explicit shape-dependent Fourier analysis to a structural use of the fact that $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$3 is a bounded measurable fundamental domain of a lattice.

5. Scope, significance, and limits of the result

The significance of the general theorem is that it removes any restriction that the fundamental domain be square. The method applies to any bounded measurable tile for the lattice, allowing shapes that are drastically different from squares, including hexagons and L-shapes (Kolountzakis, 2016).

This broadens checkerboard discrepancy from a special geometric model to a lattice-tiling phenomenon. The result shows that the square-root lower bound is stable under replacement of the square by an arbitrary bounded fundamental domain, provided the lattice tiling structure is retained.

A common misconception is to treat the square-root law as a universal property of all planar colorings. The result does not say that. It is formulated for checkerboard-type colorings arising from lattice tilings. The data also record that for certain pathological, non-checkerboard colorings, the lower bound can be avoided. Conversely, within the generalized checkerboard class, the square-root lower bound is described as tight up to constants, with randomized colorings achieving at most $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$4 for line segments of length $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$5 (Kolountzakis, 2016).

The theorem is therefore both robust and specific: robust with respect to the shape of the tile, specific with respect to the class of colorings under consideration.

6. Terminological variants in other research areas

The expression “path discrepancy” is not uniform across the literature. In multiparameter persistent homology, it denotes a generalization of matching distance in which one replaces straight-line slices in parameter space by monotone paths; the resulting path distance is

$\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$6

with the supremum taken over admissible monotone paths $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$7 (Sun et al., 31 Jul 2025).

In deployed path-aware networking, “path discrepancy” refers instead to asymmetric path availability between endpoints: the set of paths from $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$8 to $\mathbb{R}^2 = \bigcup_{t \in T} (t + Q).$9 may differ from the set from $t+Q$0 to $t+Q$1, as observed in SCIONLab (Herschbach et al., 4 Sep 2025). In another geometric usage, “discrepancy” between parametrized planar curves is defined as the minimum deformation energy of an admissible curve in $t+Q$2 mapping one curve to the other (Holm et al., 2013).

These usages are conceptually distinct. The geometric discrepancy-theoretic notion studied for lattice checkerboards concerns signed length imbalance along curves in a two-colored tiling of the plane. The shared terminology reflects the general idea of measuring divergence along a path, but the underlying objects, metrics, and proof techniques are entirely different across these settings.