Previous Conferences & Workshops

Nov
23
2021

Seminar in Analysis and Geometry

On Arnold's formula for the second variation of energy on orbits of 2d vorticities
Vladimír Sverák
2:00pm|Simonyi Hall 101 and Remote Access

We consider variational principles related to V. I. Arnold's stability criteria for steady-state solutions of the two-dimensional incompressible Euler equation. Our goal is to investigate under which conditions the quadratic forms defined by the...

Nov
23
2021

Computer Science/Discrete Mathematics Seminar II

Exact algorithms for graph coloring
Or Zamir
10:30am|Simonyi Hall 101 and Remote Access

As solutions can be efficiently verified, any NP-complete problem can be solved by exhaustive search. Unfortunately, even for small instances the running time for exhaustive search becomes very high. 

On the bright side, for many NP-complete...

Nov
22
2021

Joint IAS/Princeton University Symplectic Geometry Seminar

Legendrian Torus and Cable Links
Lisa Traynor
4:00pm|Fine Hall 314, Princeton University

Legendrian torus knots were classified by Etnyre and Honda. I will explain the classification of Legendrian torus links. In particular, I will describe restrictions on the Legendrian torus knots that can be realized as the components of a Legendrian...

Nov
22
2021

Members' Colloquium

Mathematical foundations for human-level intelligence (Part 1): Cooperative communication as belief transport
Patrick Shafto
2:00pm|Simonyi Hall 101 and Remote Access

Human learning outstrips modern machine learning and AI in at least three abilities: rapid robust learning, in effectively open worlds, in near-real time with very little energy. Mathematical formalization of signature human abilities has the...

Nov
22
2021

Computer Science/Discrete Mathematics Seminar I

On Approximability of CSPs on Satisfiable Instances
Subhash Khot
11:15am|Simonyi Hall 101 and Remote Access

Constraint Satisfaction Problems (CSPs) are among the most well-studied problems in Computer Science, 3SAT being a prominent example.

Let $\Sigma$ be an alphabet and $P:\Sigma^k \rightarrow \{0,1\}$ be a fixed predicate. The assignments in $P^{-1}...