Daniel Ahlberg: Analysis of Boolean functions
Time: Fri 2018-10-19 10.00
Location: Room 306, House 6, Kräftriket, Department of Mathematics, Stockholm University
Participating: Daniel Ahlberg, SU
Abstract: Boolean functions, which for a string of zeros and ones output either zero or one, are fundamental objects in theoretical computer science. Moreover, they are also frequently occurring in combinatorics and discrete probability theory. A typical example in this context is the encoding of a certain graph property. In this lecture we shall review a few key concept from the study of Boolean functions, and describe some of the many fascinating phenomena they present.