Past Events

Coding theory has been associated mainly with maintaining reliability in communication and storage systems. Yet work published already in the 1950s by Von Neumann, Moore, and Shannon also considered the use of error handling techniques to maintain...

The classification of phases of matter is a topic of much current interest. While descriptions of quantum mechanical systems often use discrete lattice models, one can typically approximate by continuous field theories. There is a well-developed...

One version of the Polycirculant Conjecture is that every finite vertex-transitive digraph admits a non-trivial semiregular automorphism. I will give an overview of the status of this conjecture, as well as describe some recent progress with Michael...

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

The relationship between mapping class groups of surfaces and low-dimensional topology has long been a fruitful one. From Thurston's characterization of geometric structures on mapping tori in terms of the Nielsen-Thurston type of the mapping class...

The optimal transportation problem, which originated in the work of Gaspard Monge in 1781, provides a fundamental and quantitave way to measure the distance between probability distributions. It has led to many successful applications in PDEs...

Motivated by problems in Bayesian nonparametrics and probabilistic programming discussed in Staton et al. (2018), we present a new kind of partial exchangeability for random arrays which we call DAG-exchangeability. In our setting, a given random...

The translation of proteins is a key part of the central dogma of biology that underlies life. Thus, unraveling the dynamics of translation and understanding how this process is regulated across scales, systems and species, is fundamental. In light...

Solvers for the Boolean satisfiability problem have been increasingly used to solve hard problems from many fields and now routinely solve problems with millions of variables. Combinatorial problems are a natural target, as SAT solvers contain...

We explore graphs of high cop number. We give new lower bounds for cop number of graphs of high girth. We also present a new class of undirected graphs with cop number $(1-o(1)) \sqrt{n/2}$ and a class of directed graphs with cop number $(1-o(1))...