# Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

Dec
02
2022

### Probability Seminar

Modular Transformation of Conformal Blocks via Liouville CFT
Yi Sun
11:15am|Simonyi 101 and Remote Access

Conformal blocks are objects of fundamental importance in the bootstrap approach for exact solvability of 2D conformal field theory (CFT).  In this talk, we will present novel probabilistic expressions for them using the Gaussian free field in lieu...

Dec
02
2022

### Special Year Informal Seminar

S-arithmetic Diophantine approximation
Shreyasi Datta
1:30pm|Simonyi 101

Diophantine approximation deals with quantitative and qualitative aspects of approximating numbers by rationals. A major breakthrough by Kleinbock and Margulis in 1998 was to study Diophantine approximations for manifolds using homogeneous dynamics...

Dec
05
2022

### Computer Science/Discrete Mathematics Seminar I

Optimal Weak to Strong Learning
Kasper Green Larsen
11:15am|Simonyi 101 and Remote Access

The classic algorithm AdaBoost allows to convert a weak learner, that is an algorithm that produces a hypothesis which is slightly better than chance, into a strong learner, achieving arbitrarily high accuracy when given enough training data. We...

Dec
05
2022

### Members' Colloquium

The Other Galois Representation of an Elliptic Curve
2:00pm|Simonyi Hall 101 and Remote Access - see Zoom link below

Let $E$ be an elliptic curve defined over $\Q$.  The $\bar\Q$-points of $E$ form an abelian group on which the Galois group $G_{\Q} = \Gal(\bar\Q/\Q)$ acts.  The usual Galois representation associated to $E$ captures the action of $G_{\Q}$ on the...

Dec
06
2022

### Computer Science/Discrete Mathematics Seminar II

Online List Labeling: Breaking the log$^2$ n Barrier
Nicole Wein
10:30am|Simonyi Hall 101 and Remote Access

The online list labeling problem is a basic primitive in data structures. The goal is to store a dynamically-changing set of n items in an array of m slots, while keeping the elements in sorted order. To do so, some items may need to be moved over...