Members’ Colloquium

The P vs. NP problem was formulated about 50 years ago, and was chosen to be one of the seven Clay millenium problems 25 years ago. In this period our understanding of the depth, breadth and impact of the problem has changed dramatically. I plan to...

The fundamental group π1(X) is an important invariant of a complex algebraic variety X.  Despite its topological nature, it is closely connected to the geometry of many algebraic structures on X.  In this talk I want to discuss two elementary...

Since Hironaka's famous resolution of singularities in characteristics zero in 1964, it took about 40 years of intensive work of many mathematicians to simplify the method, describe it using conceptual tools and establish its functoriality. However...

Riemannian metrics are the simplest generalizations of Euclidean geometry to smooth manifolds. The Ricci curvature of a metric measures, in an averaged sense, how the geometry deviates from being flat. The tensor −2Ric can be viewed as a Laplacian...

One of the primary goals of the mathematical analysis of algorithms is to provide guidance about which algorithm is the “best” for solving a given computational problem. Worst-case analysis summarizes the performance profile of an algorithm by its...

The SAT (Boolean Satisfiability) problem asks whether a given logical formula on n Boolean variables has an assignment of true/false values to its variables that makes the formula true.  The P vs NP question is equivalent to asking whether SAT has a...

I'll give a brief introduction to o-minimality and how it can be used to prove asymptotic estimates for the number of rational points in definable sets. I'll then show how problems from various areas of mathematics can be reformulated as questions...

In 1947 John Von Neumann and Herman Goldstine, while developing the IAS computing machines, wrote a seminal paper on numerical errors in matrix computations. They suggested modeling the "computing noise" (coming from rounding errors, transcendental...

Consider a point mass traveling in a polygon. It travels in a straight line, with constant speed, until it hits a side, at which point it obeys the rules of elastic collision. What can we say about this? When all the angles of the polygon are...

The field of unlikely Intersections presents a robust paradigm for problems in which several subjects intermingle: arithmetic, o-minimality, and hodge theory. The goal of this talk will be to introduce some of those connections. My aim is to...