Search arXivSearch

arXiv · 2208.02903

Descriptive combinatorics and distributed algorithms

Abstract

This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed algorithms -- a fundamental part of computer science that is becoming increasingly important in the modern era of decentralized computation. In the first part of the article we give a brief introduction to some of the central notions and problems of descriptive combinatorics. The second part is devoted to an overview of some of the results concerning the interactions between descriptive combinatorics and distributed algorithms, as well as a few open problems. The article should be accessible to readers with little to no background in either descriptive set theory or computer science.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Bernshteyn. 2022-08-04. Descriptive combinatorics and distributed algorithms. https://arxiv.org/abs/2208.02903

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Come for the vibe, stay for the math

This article describes our experiences in mathematical outreach over the past decade. We talk about specific activities, but also general principles that we've learned along the way.

math.HO

From foundations to applications: reverse mathematics and philosophy

Reverse mathematics is a branch of mathematical logic dedicated to determining the minimal set existence principles necessary and sufficient to derive ordinary mathematical theorems about concrete structures like the real line. Since the mid-1970s, reverse mathematics has developed a systematic classification of the strength of theorems in areas of mathematics ranging from real and complex analysis to infinitary combinatorics. This essay will place reverse mathematics in its historical and philosophical context, and reveal its relevance to central issues in the philosophy of mathematics, from the foundational programmes of Hilbert and Brouwer to contemporary debates about realism, determinacy, and applicability of mathematics. In doing so, it will discuss the role of computability theory in measuring the strength of set existence principles, as well as related questions about idealisation when these principles are applied in the physical sciences and in philosophy.

math.HO