Return to search

Continuous Combinatorics of a Lattice Graph in the Cantor Space

We present a novel theorem of Borel Combinatorics that sheds light on the types of continuous functions that can be defined on the Cantor space. We specifically consider the part X=F(2ᴳ) from the Cantor space, where the group G is the additive group of integer pairs ℤ². That is, X is the set of aperiodic {0,1} labelings of the two-dimensional infinite lattice graph. We give X the Bernoulli shift action, and this action induces a graph on X in which each connected component is again a two-dimensional lattice graph. It is folklore that no continuous (indeed, Borel) function provides a two-coloring of the graph on X, despite the fact that any finite subgraph of X is bipartite. Our main result offers a much more complete analysis of continuous functions on this space. We construct a countable collection of finite graphs, each consisting of twelve "tiles", such that for any property P (such as "two-coloring") that is locally recognizable in the proper sense, a continuous function with property P exists on X if and only if a function with a corresponding property P' exists on one of the graphs in the collection. We present the theorem, and give several applications.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc849680
Date05 1900
CreatorsKrohne, Edward
ContributorsGao, Su, 1968-, Jackson, Steve, 1957-, Conley, Charles H., 1964-
PublisherUniversity of North Texas
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
Formatvi, 85 pages : illustrations, Text
RightsPublic, Krohne, Edward, Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved.

Page generated in 0.0021 seconds