Speaker: Dr. Anton Bernshteyn, Georgia Institute of Technology

Title: “Distributed computing and descriptive combinatorics”

Abstract: The topic of this talk is a recently discovered connection between two seemingly very disparate fields: distributed computing and descriptive combinatorics. Distributed computing is the area of computer science concerned with problems that can be solved efficiently by a (finite) decentralized network of processors. Descriptive combinatorics, on the other hand, studies combinatorial problems on infinite graphs under additional topological or measure-theoretic regularity constraints and is largely motivated by questions in set theory, ergodic theory, and topological dynamics. It turns out that these two areas are intimately related to each other, and there are formal ways of translating results from one context to the other one. I will survey what is known about this connection and outline some open problems.

The Discrete Math Seminar (DMS) is intended for Kennesaw State faculty working in the various areas of algebra, number theory, and discrete mathematics to get together to discuss their current work or related questions. Seminars often involve advanced mathematical knowledge. However, the seminars are open to anyone who is interested in attending.