论文标题
描述性组合学，可计算组合学和ASI算法
Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms
论文作者
论文摘要
我们介绍了我们称为“ ASI算法”的新型本地算法类型，并使用它们来演示描述性和可计算组合学之间的链接。这使我们能够从两个字段中统一参数，有时还可以从一个字段到另一个字段的端口参数。例如，我们概括了Kierstead的可计算组合作用，并使用它在Viping定理的Baire可测量类似物的一种颜色内。我们还改善了Kierstead在此过程中的跨流影结果。
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.
