Previous Conferences & Workshops

Sep
27
2005

Computer Science/Discrete Mathematics Seminar II

Property Tau and the Product Replacement Algorithm
Alex Lubotzky
10:30am|S-101

The product replacement algorithm is a commonly used algorithm to generate a random element in a finite group. While its performance is quite outstanding, its theretical understanding is quite poor. We will present a joint work with Igor Pak (JAMS...

Sep
26
2005

Computer Science/Discrete Mathematics Seminar I

Expanders, L-functions, and the Elliptic Curve Discrete Logarithm Problem
Stephen D. Miller
11:15am|S-101

I will talk about a family of graphs which originally arose in cryptography, in studying the difficulty of the discrete logarithm problem on elliptic curves. These graphs can be shown to be expanders, assuming the generalized Riemann hypothesis (GRH...

Sep
23
2005

Arithmetic Homogeneous Spaces

Periods of Automorphic Forms Over a Compact Unitary Group
Omer Offen
11:00am|S101

We use the recent developments of Jacquet in order to obtain an explicit expression for a compact unitary period of certain automorphic form on GL(n) in terms of special values of L-functions. Jacquet obtains a characterization of the image of...

Sep
12
2005

Computer Science/Discrete Mathematics Seminar I

Locally Decodable Codes with 2 Queries and Polynomial Identity Testing for Depth 3 Circuits
Zeev Dvir
11:15am|S-101

In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of the codeword. Polynomial Identity Testing (PIT) is one of the...

Sep
01
2005

Lie Groups, Representations and Discrete Mathematics

12:00am

In recent years new and important connections have emerged between discrete subgroups of Lie groups, automorphic forms and arithmetic on the one hand, and questions in discrete mathematics, combinatorics, and graph theory on the other. One of the...