Previous Conferences & Workshops

Apr
28
2011

Joint IAS/Princeton University Number Theory Seminar

Serre's Conjectures on the Number of Rational Points of Bounded Height
Per Salberger
4:30pm|S-101

We give a survey of recent results on conjectures of Heath-Brown and Serre on the asymptotic density of rational points of bounded height. The main tool in the proofs is a new global determinant method inspired by the local real and p-adic...

Apr
28
2011

Galois Representations and Automorphic Forms Seminar

On the Comparison of Trace Formulas
Jim Arthur
2:15pm|S-101

We shall recall the spectral terms from the trace formula for G and its stabilaization, as well as corresponding terms from the twisted trace formula for GL(N). We shall then discuss aspects of the proof of the theorems stated in the first talk that...

Apr
28
2011

Galois Representations and Automorphic Forms Seminar

Classification of Representations
Jim Arthur
1:00pm|S-101

Suppose that G is a connected, quasisplit, orthogonal or symplectic group over a field F of characteristic 0. We shall describe a classification of the irreducible representations of G(F) if F is local, and the automorphic representations of G in...

Apr
26
2011

Computer Science/Discrete Mathematics Seminar II

Quadratic Goldreich-Levin Theorems
10:30am|S-101

Decompositions in theorems in classical Fourier analysis which decompose a function into large Fourier coefficients and a part that is pseudorandom with respect to (has small correlation with) linear functions. The Goldreich-Levin theorem [GL89] can...

Apr
25
2011

Computer Science/Discrete Mathematics Seminar I

Learning and Testing k-Model Distributions
Rocco Servidio
11:15am|S-101

A k-modal probability distribution over the domain {1,...,N} is one whose histogram has at most k "peaks" and "valleys". Such distributions are a natural generalization of the well-studied class of monotone increasing (or monotone decreasing)...

Apr
22
2011

Pseudorandomness in Mathematics and Computer Science Mini-Workshop

Monotone expanders - constructions and applications
4:00pm|Simonyi Hall 101

A Monotone Expander is an expander graph which can be decomposed into a union of a constant number of monotone matchings, under some fixed ordering of the vertices. A matching is monotone if every two edges (u,v) and (u',v') in it satisfy u u' -->...