Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms
From MaRDI portal
Publication:6402328
arXiv2206.08426MaRDI QIDQ6402328FDOQ6402328
Authors: Long Qian, Felix Weilacher 
Publication date: 16 June 2022
Abstract: We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to port arguments from one field to the other. As an example, we generalize a computable combinatorics result of Kierstead and use it to get within one color of the Baire measurable analogue of Vizing's Theorem. We also improve Kierstead's result for multigraphs along the way.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)
This page was built for publication: Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402328)
