Previous Conferences & Workshops

Oct
09
2019

Mathematical Conversations

Finite fields and the Ax-Grothendieck theorem
6:00pm|Dilworth Room

The Ax-Grothendieck theorem from the 1960s says that an injective polynomial $f : \mathbb C^n \to \mathbb C^n$ is also surjective. It is one of the first examples of the powerful technique in algebraic geometry of using finite fields to prove...

Oct
09
2019

Theoretical Machine Learning Seminar

Designing Fast and Robust Learning Algorithms
12:00pm|Dilworth Room

Most people interact with machine learning systems on a daily basis. Such interactions often happen in strategic environments where people have incentives to manipulate the learning algorithms. As machine learning plays a more prominent role in our...

Oct
08
2019

Theoretical Machine Learning Seminar

Unsupervised Ensemble Learning
12:00pm|White-Levy

In various applications, one is given the advice or predictions of several classifiers of unknown reliability, over multiple questions or queries. This scenario is different from standard supervised learning where classifier accuracy can be assessed...

Oct
07
2019

Analysis Seminar

Weak solutions of the Navier-Stokes equations may be smooth for a.e. time
5:00pm|Simonyi Hall 101

In a recent result, Buckmaster and Vicol proved non-uniqueness of weak solutions to the Navier-Stokes equations which have bounded kinetic energy and integrable vorticity. We discuss the existence of such solutions, which in addition are regular...

Oct
07
2019

Symplectic Dynamics/Geometry Seminar

Bourgeois contact structures: tightness, fillability and applications.
Agustin Moreno
3:30pm|Simonyi Hall 101

Starting from a contact manifold and a supporting open book decomposition, an explicit construction by Bourgeois provides a contact structure in the product of the original manifold with the two-torus. In this talk, we will discuss recent results...

Oct
07
2019

Members’ Seminar

Logarithmic concavity of Schur polynomials
2:00pm|Simonyi Hall 101

Schur polynomials are the characters of finite-dimensional irreducible representations of the general linear group. We will discuss both continuous and discrete concavity property of Schur polynomials. There will be one theorem and eight conjectures...

Oct
07
2019

Computer Science/Discrete Mathematics Seminar I

An improved sunflower bound.
Jiapeng Zhang
11:00am|Simonyi Hall 101

A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all. Erdos and Rado in 1960 proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$, with at least...