Work

Separating complexity classes of LCL problems on grids

Year: 2025

Type: preprint

Abstract: We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were not previously known to be distinct and serve as counterexamples to a number of natural conjectures in the field.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2501.17445

Authors: Berlow, Katalin, Bernshteyn, Anton, Lyons, Clark, Weilacher, Felix

Institution: University of California, Berkeley

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: CAREER: Developing a unified theory of descriptive combinatorics and local algorithms, G6671297155, Graduate Research Fellowship Program (GRFP), Postdoctoral Fellowship: MSPRF: Definable Combinatorics in Descriptive Set Theory, Computability Theory, and Beyond, G8751405378

OpenAlex ID: W4406975446

Cites:

Cited by:

Related to: 10