Previous Conferences & Workshops

In this talk we discuss the recent area of topological data analysis (TDA) from a probabilistic perspective. The talk falls under two parts. The first part of the talk considers a classic object in topology and geometry, a (Whitney) stratified space...

The Resolution proof system is among the most basic and popular for proving propositional tautologies, and underlies many of the automated theorem proving systems in use today. I'll start by defining the Resolution system, and its place in the proof...

A classical theorem of Dirichlet establishes the existence of infinitely many primes in arithmetic progressions, so long as there are no local obstructions. In 2006 Green and Tao set up a program for proving a vast generalization of this theorem...

Milman's ellipsoids play an important role in modern convex geometry. Here we show that their proofs of existence can be turned into efficient algorithms, and these in turn lead to improved deterministic algorithms for volume estimation of convex...

We present a Hamiltonian framework for higher-dimensional vortex filaments (or membranes) and vortex sheets as singular 2-forms with support of codimensions 2 and 1, respectively, i.e. singular elements of the dual to the Lie algebra of divergence...

There are indications that in the 80s Guillemin posed a question: If billiard maps are conjugate, can we say that domains are the same up to isometry? On one side, we show that conjugacy of different domains can't be C^1 near the boundary. In...

The P vs. NP problem has sometimes been unofficially paraphrased as asking whether it is possible to improve on exhaustive search for such problems as Satisfiability, Clique, Graph Coloring, etc. However, known algorithms for each of these problems...

This talk will review some theorems and conjectures about phase transitions of interacting spin systems in statistical mechanics. A phase transition may be thought of as a change in a typical spin configuration from ordered state at low temperature...