Previous Conferences & Workshops

Nov
27
2018

Symplectic Dynamics Working Group

Holomorphic curves and celestial mechanics
Umberto Hryniewicz
1:30pm|Simonyi Hall Classroom 114

In this survey talk I will describe developments in the study of the planar circular restricted 3-body problem that were made possible through the use of pseudo holomorphic curves, following the theory developed by Hofer, Wysocki and Zehnder.

Nov
27
2018

Variational Methods in Geometry Seminar

Homotopical effects of k-dilation
1:00pm|Simonyi Hall 101

Back in the 70s, Gromov started to study the relationship between the Lipschitz constant of a map (also called the dilation) and its topology. The Lipschitz constant describes the local geometric features of the map, and the problem is to understand...

Nov
27
2018

Computer Science/Discrete Mathematics Seminar II

Monotone Circuit Lower Bounds from Resolution
10:30am|Simonyi Hall 101

For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we show that a gadget-composed version of F is hard to refute in any proof system whose lines are computed by efficient communication protocols---or...

Nov
26
2018

Symplectic Dynamics/Geometry Seminar

Some developments in the Legendrian GRID invariants
C.-M. Michael Wong
3:30pm|Princeton University, Fine Hall 224

For Legendrian and transverse links in the 3-sphere, Ozsvath, Szabo, and Thurston defined combinatorial invariants that reside in grid homology. Known as the GRID invariants, they are effective in distinguishing some transverse knots that have the...

Nov
26
2018

Members’ Seminar

Effective Sato-Tate under GRH
Alina Bucur
2:00pm|Simonyi Hall 101

Based on the Lagarias-Odlyzko effectivization of the Chebotarev density theorem, Kumar Murty gave an effective version of the Sato-Tate conjecture for an elliptic curve conditional on the analytic continuation and the Riemann hypothesis for all the...

Nov
26
2018

Theoretical Machine Learning Seminar

A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors
Nikunj Saunshi
12:15pm|Princeton University, CS 302

Motivations like domain adaptation, transfer learning, and feature learning have fueled interest in inducing embeddings for rare or unseen words, n-grams, synsets, and other textual features. This paper introduces a la carte embedding, a simple and...

Nov
26
2018

Computer Science/Discrete Mathematics Seminar I

Classical Verification of Quantum Computations
Urmila Mahadev
11:15am|Simonyi Hall 101

We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which allows a classical string to serve as a commitment to a...

Nov
26
2018

Computer Science/Discrete Mathematics Seminar I

Classical Verification of Quantum Computations
Urmila Mahadev
11:15am|Simonyi Hall 101

We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which allows a classical string to serve as a commitment to a...