Borel Polychromatic Coloring in Grids

• Borel polychromatic coloring is a definable extension of classical polychromatic coloring that requires the coloring map to be Borel on grid graphs.
• It leverages finite hypercube reductions and structured interpolation to achieve a sharp invariant of 2^d − 1 for free Borel Z^d actions.
• The method combines local cube interpolation and Borel toast decompositions to overcome definability obstacles, linking finite combinatorics with infinite descriptive-set frameworks.

Borel polychromatic coloring is the descriptive-set-theoretic analogue of classical polychromatic coloring: one colors the vertices or edges of a combinatorial structure so that every prescribed local configuration contains all available colors, and additionally requires the coloring map to be Borel. In the setting presently developed most explicitly, a free Borel action of $\mathbb{Z}^d$ on a standard Borel space $X$ induces a grid graph on $X$, and a Borel $k$-polychromatic coloring is a Borel map $c:X\to[k]$ such that every unit $d$-dimensional cube $Q\cdot x$ sees all $k$ colors; the associated invariant is the Borel polychromatic number $\chi^p_B(G)$ (Berlow et al., 25 Aug 2025). Classical finite polychromatic theory supplies the underlying combinatorial framework, especially through hypercube embeddings, shape-based reductions, and extremal polychromatic numbers for graphs and hypergraphs (Goldwasser et al., 2016).

1. Formal definitions and ambient structures

In the grid setting, one begins with a standard Borel space $X$ and a free Borel action of $X$0 on $X$1. Writing $X$2, the associated grid graph $X$3 has vertex set $X$4, and $X$5 is adjacent to $X$6 for each generator $X$7. Each orbit is graph-isomorphic to the standard infinite grid $X$8, so the action produces a Borel family of abstract $X$9-dimensional grids (Berlow et al., 25 Aug 2025).

The relevant hyperedges are the unit cubes. If $X$0, then for each $X$1 the translate

$X$2

is a set of $X$3 vertices forming a unit hypercube. A $X$4-labeling is a map $X$5. It is $X$6-polychromatic with respect to the family of unit cubes when every cube $X$7 contains all $X$8 colors. In the Borel version, $X$9 must be Borel, equivalently each color class $k$0 must be Borel. The Borel polychromatic number is

$k$1

A basic feature of the problem is that larger $k$2 are harder rather than easier, since every prescribed configuration must contain every color (Berlow et al., 25 Aug 2025).

This formulation sits inside a broader polychromatic paradigm. In finite graph theory, if $k$3 is a graph and $k$4 is a family of subgraphs of $k$5, an edge-coloring is $k$6-polychromatic if every $k$7 receives all colors used globally; the extremal quantity is the $k$8-polychromatic number of $k$9 (Axenovich et al., 2016). In hypergraph language, a $c:X\to[k]$0-tuple $c:X\to[k]$1-coloring is $c:X\to[k]$2-polychromatic if every hyperedge of size at least $c:X\to[k]$3 contains $c:X\to[k]$4-tuples of all $c:X\to[k]$5 colors (Biniaz et al., 28 Mar 2025). Borel polychromatic coloring is thus a definable version of a general extremal-coloring scheme rather than an isolated grid-specific notion.

2. Finite hypercube theory and its structural reductions

A central finite antecedent is the hypercube theory of edge-polychromatic colorings. For $c:X\to[k]$6, the $c:X\to[k]$7-dimensional hypercube $c:X\to[k]$8 has vertex set $c:X\to[k]$9, with an edge between two vertices if they differ in exactly one coordinate. If $d$0 is a subgraph of some hypercube, a coloring of the edges of $d$1 is $d$2-polychromatic when every embedding of $d$3 in $d$4 contains an edge of every color, and the corresponding extremal invariant is the polychromatic number $d$5 (Goldwasser et al., 2016).

The finite theory has a strong structural reduction. Writing an edge of $d$6 as a $d$7 string, with the star in the flip coordinate, one defines

$d$8

where $d$9 is the flip position. A coloring is called simple if the color of $Q\cdot x$0 depends only on $Q\cdot x$1. Lemma 3 shows that if $Q\cdot x$2 is a subgraph of $Q\cdot x$3 and $Q\cdot x$4, then there exists a simple $Q\cdot x$5-polychromatic $Q\cdot x$6-coloring on $Q\cdot x$7. The proof uses a Ramsey-type argument on $Q\cdot x$8-uniform hypergraphs to pass from arbitrary extremal colorings to a highly structured subsystem (Goldwasser et al., 2016).

This reduction converts a hypercube edge-coloring problem into a two-dimensional grid-coloring problem. In a simple coloring, the color classes are indexed by pairs $Q\cdot x$9, arranged in a grid whose $k$0th row consists of pairs with $k$1. Embeddings of subcubes and punctured subcubes then correspond to shape sequences in this grid. For subcubes $k$2, Fact 6 identifies the shapes explicitly: every embedding yields a sequence of $k$3 parallelogram-shaped regions, all occupying the same $k$4 rows, and conversely every such instance arises from an embedding. Lemma 5 bounds the polychromatic number of a shape sequence by a row-wise occupancy parameter $k$5, producing upper bounds on $k$6 (Goldwasser et al., 2016).

From a Borel or measurable standpoint, this finite reduction is significant because simple colorings are defined by explicit functions of finite coordinate sums. The paper notes that such functions are Borel on spaces like $k$7. This suggests that the finite hypercube machinery isolates precisely the kinds of structured colorings most amenable to a measurable or Borel reinterpretation (Goldwasser et al., 2016).

3. Borel grids and the exact polychromatic number

For the standard combinatorial grid $k$8, the classical polychromatic number with respect to unit cubes is $k$9. The upper bound is immediate because each cube has exactly $\chi^p_B(G)$0 vertices, and equality is realized by the parity coloring

$\chi^p_B(G)$1

which is injective on every translate of $\chi^p_B(G)$2 (Berlow et al., 25 Aug 2025).

The Borel setting changes the extremal value. The main theorem for free Borel $\chi^p_B(G)$3-actions states that every induced grid graph admits a Borel $\chi^p_B(G)$4-polychromatic coloring: $\chi^p_B(G)$5 The result is sharp: any action in which the generators act ergodically does not admit a Borel $\chi^p_B(G)$6-polychromatic coloring. The paper states the exact value as

$\chi^p_B(G)$7

for any free Borel action $\chi^p_B(G)$8 (Berlow et al., 25 Aug 2025).

The comparison with the classical case is the central phenomenon. Classically, periodic mod-$\chi^p_B(G)$9 structure yields all $X$0 colors on every cube. In the Borel theory, that maximal pattern can fail even though every orbit is individually isomorphic to $X$1. The obstruction is therefore not graph-theoretic at the orbit level but definability-theoretic at the level of the global Borel action. A plausible implication is that Borel polychromaticity is governed simultaneously by local cube combinatorics and by global orbit-equivalence constraints.

4. Proof architecture: interpolation, repetitive templates, and toast

The existence proof for Borel $X$2-polychromatic colorings uses two ingredients. The first is a local cube interpolation lemma. If $X$3 is a set of $X$4 colors and $X$5 are surjective labelings, then there is a sequence of surjective labelings from $X$6 to $X$7 such that each consecutive pair differs on at most one vertex of the cube. The key point is that one can move between arbitrary surjective cube colorings without ever losing surjectivity (Berlow et al., 25 Aug 2025).

The second ingredient is a Borel toast decomposition. For Borel graphs induced by Borel actions of $X$8, Gao–Jackson–Krohne–Seward supply a Borel toast decomposition: a Borel family of finite pieces covering $X$9, nested in a well-founded manner, with controlled graph-metric separation between incomparable pieces. In an $X$00-toast, distinct pieces are either nested or $X$01-apart. This gives an inductive scaffold on which one can define a Borel coloring piece by piece (Berlow et al., 25 Aug 2025).

The construction uses repetitive colorings as local templates. A labeling $X$02 is repetitive if for each generator $X$03,

$X$04

Equivalently, the coloring has period $X$05 in each coordinate and factors through $X$06 along each orbit. On a finite toast piece $X$07, one chooses a Borel root $X$08, defines the coordinate-parity map $X$09, and composes it with a fixed surjective labeling $X$10 to obtain a repetitive $X$11-polychromatic template on the cubes contained in $X$12 (Berlow et al., 25 Aug 2025).

To make the induction work globally, the proof fixes

$X$13

takes an $X$14-toast, and partially orders the toast pieces by inclusion. Minimal pieces are colored directly by the repetitive template. For a general piece $X$15 with internal pieces $X$16, the coloring is first set equal to the template on the exterior region

$X$17

and then extended across the annular gaps

$X$18

The interpolation lemma is what makes those extensions possible while preserving surjectivity on every relevant cube (Berlow et al., 25 Aug 2025).

5. Definability constraints and the wider Borel coloring landscape

Borel polychromatic coloring belongs to the broader theory of definable graph colorings, in which the existence of a coloring depends not only on finite combinatorics but also on descriptive-set-theoretic complexity. The grid result already exhibits this phenomenon in a sharp form: the classical optimum $X$19 drops to $X$20 under a Borel requirement, and the paper identifies ergodicity of the generators as a sharp obstruction to recovering the missing color (Berlow et al., 25 Aug 2025).

Adjacent results in Borel coloring theory show that such definability effects can be structurally severe. For Borel directed graphs, the set of graphs admitting a Borel $X$21-dicoloring is $X$22-complete, equivalently the set of graphs with Borel dichromatic number at least $X$23 is $X$24-complete. As a consequence, no countable family of Borel directed graphs can serve as a basis for this class under Borel homomorphism (Matos-Wiederhold, 6 Apr 2026).

A related line of work studies Baire-class and Borel countable colorings of analytic digraphs. The $X$25-dichotomy of Kechris–Solecki–Todorčević characterizes analytic relations admitting a Borel-measurable countable coloring, and versions of the dichotomy for $X$26-measurable or Baire-class $X$27 colorings are established for $X$28 (Lecomte et al., 2011). These results do not concern polychromaticity directly, but they show that definable coloring problems often admit canonical obstructions and sharp complexity thresholds. This suggests that Borel polychromatic coloring should be viewed as part of a larger descriptive combinatorics program rather than merely as an infinite analogue of a finite extremal problem.

6. Related finite theories, extensions, and open directions

The finite literature shows that polychromatic constraints arise far beyond cube vertices. In hypergraphs, a $X$29-tuple $X$30-coloring assigns colors to $X$31-subsets, and $X$32-polychromaticity requires every hyperedge of size at least $X$33 to contain tuples of all $X$34 colors. General bounds include

$X$35

and in the bichromatic case

$X$36

For geometric range spaces, the paper proves $X$37 for pairs in disk hypergraphs in $X$38, and $X$39 for shrinkable hypergraphs of VC-dimension at most $X$40 (Biniaz et al., 28 Mar 2025).

Complete-graph polychromatic theory provides another benchmark. For $X$41, the edge-polychromatic number with respect to all $X$42-factors is exactly $X$43, while for all $X$44-factors and all Hamiltonian cycles the corresponding polychromatic numbers are asymptotically $X$45 and are determined up to an additive constant in the cited work (Axenovich et al., 2016). These results show that logarithmic, exponential, and cube-sized regimes can all arise naturally, depending on the family of constrained configurations.

Within the explicitly Borel theory, the grid paper concludes with open directions “for extending the theory beyond cube tilings” and “for exploring the dependence of Borel polychromatic numbers on the underlying action” (Berlow et al., 25 Aug 2025). In view of the finite hypercube reduction to simple colorings and shape sequences, and the tuple-coloring theory for hypergraphs, a plausible next step is a Borel theory for more general Schreier hypergraphs or measurable tuple-colorings. The existing results indicate that any such extension is likely to depend on both the local combinatorics of the constrained configuration and the global descriptive structure of the ambient Borel action.