Computable vs Descriptive Combinatorics of Local Problems on Trees

arXiv2208.06689MaRDI QIDQ6407787FDOQ6407787

Authors: Felix Weilacher 

Publication date: 13 August 2022

Abstract: We study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on $Delta$-regular trees, $Deltainomega$. We show that such a problem admits a computable solution on every highly computable $Delta$-regular forest if and only if it admits a Baire measurable solution on every Borel $Delta$-regular forest. We also show that if such a problem admits a computable solution on every computable maximum degree $Delta$ forest then it admits a continuous solution on every maximum degree $Delta$ Borel graph with appropriate topological hypotheses, though the converse does not hold.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

This page was built for publication: Computable vs Descriptive Combinatorics of Local Problems on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407787)