Previous Conferences & Workshops

Oct
02
2009

Short Talks by Postdoctoral Members

Some Connections Between the (Weak) Regularity Lemma, Complexity Theory and Additive Combinatorics
2:00pm|S-101

I will discuss the relation between: (a) the Weak Regularity Lemma of Frieze and Kannan, a result in graph theory, (b) the "Dense Model Theorem" of Green, Tao and Ziegler, a result in additive combinatorics, that helps transfer results about dense...

Oct
01
2009

Joint IAS/Princeton University Number Theory Seminar

Even Galois Representations and the Fontaine-Mazur Conjecture
Frank Calegari
4:30pm|Fine Hall -- 214

We prove, under mild hypotheses, there are no irreducible two-dimensional ordinary even Galois representations of the Galois group of Q with distinct Hodge-Tate weights, in accordance with the Fontaine-Mazur conjecture. We also show how this method...

Sep
30
2009

Short Talks by Postdoctoral Members

Perfect Numbers and Their Friends
4:00pm|S-101

Let s(n) denote the sum of the proper divisors of the natural number n. We call n *perfect* if n = s(n) and *amicable* if n = s(s(n) . We discuss some old problems and recent results related to perfect numbers, amicable numbers, and their...

Sep
30
2009

Short Talks by Postdoctoral Members

Group Representation Patterns in Digital Signal Processing
2:00pm|S-101

In the lecture I will explain how various fundamental structures from group representation theory appear naturally in the context of discrete harmonic analysis and can be applied to solve concrete problems from digital signal processing. We will...

Sep
30
2009

Short Talks by Postdoctoral Members

Probabilistically Checkable Proofs (PCP): What Theoretical Computer Science Discovered About Mathematical Proofs
Hadar Dana Moshkovitz
2:00pm|S-101