English

Continuous Combinatorics of Abelian Group Actions

Logic 2023-04-06 v2 Combinatorics Group Theory

Abstract

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized hyper-aperiodic elements, which produce compact subflows with useful properties. For example, we show that there is no continuous 33-coloring of the Cayley graph on F(2Z2)F(2^{\mathbb{Z}^2}), the free part of the shift action of Z2\mathbb{Z}^2 on 2Z22^{\mathbb{Z}^2}. With earlier work of the authors this computes the continuous chromatic number of F(2Z2)F(2^{\mathbb{Z}^2}) to be exactly 44. Combined with marker arguments for the positive directions, our methods allow us to analyze continuous homomorphisms into graphs, and more generally equivariant maps into subshifts of finite type. We present a general construction of a finite set of "tiles" for 2Zn2^{\mathbb{Z}^n} (there are 1212 for n=2n=2) such that questions about the existence of continuous homomorphisms into various structures reduce to finitary combinatorial questions about the tiles. This tile analysis is used to deduce a number of results about F(2Zn)F(2^{\mathbb{Z}^n}).

Keywords

Cite

@article{arxiv.1803.03872,
  title  = {Continuous Combinatorics of Abelian Group Actions},
  author = {Su Gao and Steve Jackson and Edward Krohne and Brandon Seward},
  journal= {arXiv preprint arXiv:1803.03872},
  year   = {2023}
}

Comments

126 pages, 47 figures

R2 v1 2026-06-23T00:48:40.020Z