Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics
We study connections between distributed local algorithms, finitary factors of iid processes,
and descriptive combinatorics in the context of regular trees. We extend the Borel …
and descriptive combinatorics in the context of regular trees. We extend the Borel …
FIID homomorphisms and entropy inequalities
arxiv:2407.10006v2 [math.CO] 29 Oct 2024 Page 1 arxiv:2407.10006v2 [math.CO] 29 Oct
2024 FIID HOMOMORPHISMS AND ENTROPY INEQUALITIES ENDRE CSÓKA AND …
2024 FIID HOMOMORPHISMS AND ENTROPY INEQUALITIES ENDRE CSÓKA AND …
Invitation to Local Algorithms
V Rozhoň - arxiv preprint arxiv:2406.19430, 2024 - arxiv.org
This text provides an introduction to the field of distributed local algorithms--an area at the
intersection of theoretical computer science and discrete mathematics. We collect many …
intersection of theoretical computer science and discrete mathematics. We collect many …
[PDF][PDF] Ramsey, expanders, and Borel chromatic numbers
arxiv:2205.01839v1 [math.LO] 4 May 2022 Page 1 arxiv:2205.01839v1 [math.LO] 4 May 2022
RAMSEY, EXPANDERS, AND BOREL CHROMATIC NUMBERS JAN GREBÍK AND ZOLTÁN …
RAMSEY, EXPANDERS, AND BOREL CHROMATIC NUMBERS JAN GREBÍK AND ZOLTÁN …
Complexity of Finite Borel Asymptotic Dimension
J Grebík, C Higgins - ar** between two graphs that generally preserves the structure is
called a graph homomorphism, which has been a fundamental notion and extensively …
called a graph homomorphism, which has been a fundamental notion and extensively …
Local Complexity: New Results and Bridges to Other Fields
V Rozhon - 2024 - research-collection.ethz.ch
This thesis presents new results for the theory of local complexity in distributed computation
and builds bridges to other areas of theoretical computer science and discrete mathematics …
and builds bridges to other areas of theoretical computer science and discrete mathematics …