Previous Conferences & Workshops

In this talk I will discuss the construction of blowing up solutions to the Yamabe Problem in high dimensions. I will show how one can use the methods of S. Brendle to produce smooth counterexamples to the Weyl Vanishing Conjecture also.

The topic of this short talk is based on the following natural question: Given a polynomial f (for example, f is the Determinant of a matrix), what is the best way to compute this polynomial? We will start by the very basic definitions: what does it...

One natural strategy for proving a time lower bound for a problem is proof-by-contradiction: assume that there is a great algorithm for the problem, and apply this algorithm as a subroutine to solve other problems until the algorithms get so great...