Pith. sign in

REVIEW 1 cited by

Continuous Combinatorics of Abelian Group Actions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1803.03872 v2 pith:FMK3JSST submitted 2018-03-11 math.LO math.COmath.GR

classification math.LOmath.COmath.GR
keywords continuousmathbbnumberquestionsabelianactionsconstructionfinite
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $3$-coloring of the Cayley graph on $F(2^{\mathbb{Z}^2})$, the free part of the shift action of $\mathbb{Z}^2$ on $2^{\mathbb{Z}^2}$. With earlier work of the authors this computes the continuous chromatic number of $F(2^{\mathbb{Z}^2})$ to be exactly $4$. 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 $2^{\mathbb{Z}^n}$ (there are $12$ for $n=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(2^{\mathbb{Z}^n})$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Strong marker sets and applications

    math.LO 2025-02 conditional novelty 7.0 of 10

    For every n and d, there is a clopen marker set in F(2^{Z^n}) with orbit points at least d apart and with every point reaching the marker set in both directions along each coordinate axis within a uniform bound D.

Pith tools