Previous Conferences & Workshops

Jun
17
2022

Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar

Locality and deformations in relative symplectic cohomology
Yoel Groman
9:15am|Remote Access

Relative symplectic cohomology is a Floer theoretic invariant associated with compact subsets K of a closed or geometrically bounded symplectic manifold M. The motivation for studying it is that it is often possible to reduce the study of global...

Jun
03
2022

Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar

Integer-valued Gromov-Witten type invariants
Guangbo Xu
9:15am|Remote Access

Gromov-Witten invariants for a general target are rational-valued but not necessarily integer-valued. This is due to the contribution of curves with nontrivial automorphism groups. In 1997 Fukaya and Ono proposed a new method in symplectic geometry...

May
27
2022

Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar

Three 20-minute research talks
Daniel Rudolf, Miguel Pereira and Maksim Stokić
9:15am|Remote Access

Daniel Rudolf (Ruhr-Universität Bochum): Viterbo‘s conjecture for Lagrangian products in $\mathbb{R}^4$

We show that Viterbo‘s conjecture (for the EHZ-capacity) for convex Lagrangian products in $\mathbb{R}^4$ holds for all Lagrangian products (any...

May
19
2022

Joint IAS/Princeton University Number Theory Seminar

Branching laws: homological aspects
4:30pm|Simonyi 101 and Remote Access

This lecture will partly survey branching laws for real and p-adic groups which often is related to period integrals of automorphic representations, discuss some of the more recent developments, focusing attention on homological aspects and the...

May
17
2022

Computer Science/Discrete Mathematics Seminar II

Association schemes and codes II: Completeness of the hierarchy of high-order Hamming schemes
10:30am|Simonyi Hall 101 and Remote Access

One of the central problems of coding theory is to determine the trade-off between the amount of information a code can carry (captured by its rate) and its robustness to resist message corruption (captured by its distance). One of the main methods...

May
16
2022

Computer Science/Discrete Mathematics Seminar I

Thresholds
4:00pm|Simonyi 101 and Remote Access

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas.  In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is...

May
16
2022

Members' Colloquium

Thresholds
2:00pm|Simonyi Hall 101 and Remote Access

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas.  In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is...