{"id":{"repo_id":"unt","oai_identifier":"info:ark/67531/metadc849680"},"canonical_url":"https://search.ndltd.org/etd/unt/info:ark/67531/metadc849680","repository":{"repo_id":"unt","name":"University of North Texas","base_url":"https://digital.library.unt.edu/oai/"},"display":{"title":"Continuous Combinatorics of a Lattice Graph in the Cantor Space","abstract":"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.","abstract_html":"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 &quot;tiles&quot;, such that for any property P (such as &quot;two-coloring&quot;) 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&#x27; exists on one of the graphs in the collection. We present the theorem, and give several applications.","abstract_has_math":false,"creators":["Krohne, Edward"],"institution":"University of North Texas","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Gao, Su, 1968-","Jackson, Steve, 1957-","Conley, Charles H., 1964-"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-05","date_published":"2016-05","updated_at":"2026-11-19T08:54:28Z","subjects":["descriptive set theory","combinatorics","graph theory","chromatic number","mathematics","Combinatorial analysis.","Graph theory.","Lattice theory."],"languages":["English"],"rights":["Public","Krohne, Edward","Copyright","Copyright is held by the author, unless otherwise noted. All rights Reserved."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["local-cont-no: submission_148","https://digital.library.unt.edu/ark:/67531/metadc849680/","ark: ark:/67531/metadc849680"],"render_values":[{"text":"local-cont-no: submission_148","href":null,"code":true},{"text":"https://digital.library.unt.edu/ark:/67531/metadc849680/","href":"https://digital.library.unt.edu/ark:/67531/metadc849680/","code":true},{"text":"ark: ark:/67531/metadc849680","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.12794/metadc849680","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.12794/metadc849680","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digital.library.unt.edu/oai/?verb=GetRecord&metadataPrefix=oai_dc&identifier=info%3Aark%2F67531%2Fmetadc849680","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Gao, Su, 1968-","Jackson, Steve, 1957-","Conley, Charles H., 1964-"]},{"key":"dc:creator","label":"Author","values":["Krohne, Edward"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-05"]},{"key":"dc:publisher","label":"Institution","values":["University of North Texas"]},{"key":"dc:type","label":"Dc Type","values":["Thesis or Dissertation"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["descriptive set theory","combinatorics","graph theory","chromatic number","mathematics","Combinatorial analysis.","Graph theory.","Lattice theory."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["Public","Krohne, Edward","Copyright","Copyright is held by the author, unless otherwise noted. All rights Reserved."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["local-cont-no: submission_148","doi: 10.12794/metadc849680","https://digital.library.unt.edu/ark:/67531/metadc849680/","ark: ark:/67531/metadc849680"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["vi, 85 pages : illustrations","Text"]},{"key":"dc:title","label":"Title","values":["Continuous Combinatorics of a Lattice Graph in the Cantor Space"]}]}],"canonical_facts":{"dc:contributor":["Gao, Su, 1968-","Jackson, Steve, 1957-","Conley, Charles H., 1964-"],"dc:creator":["Krohne, Edward"],"dc:date":["2016-05"],"dc:description":["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."],"dc:format":["vi, 85 pages : illustrations","Text"],"dc:identifier":["local-cont-no: submission_148","doi: 10.12794/metadc849680","https://digital.library.unt.edu/ark:/67531/metadc849680/","ark: ark:/67531/metadc849680"],"dc:language":["English"],"dc:publisher":["University of North Texas"],"dc:rights":["Public","Krohne, Edward","Copyright","Copyright is held by the author, unless otherwise noted. All rights Reserved."],"dc:subject":["descriptive set theory","combinatorics","graph theory","chromatic number","mathematics","Combinatorial analysis.","Graph theory.","Lattice theory."],"dc:title":["Continuous Combinatorics of a Lattice Graph in the Cantor Space"],"dc:type":["Thesis or Dissertation"]},"updated_at":"2026-11-19T08:54:28Z"}