Previous Conferences & Workshops

Mar
16
2010

Computer Science/Discrete Mathematics Seminar II

Pseudorandom Generators for Regular Branching Programs
10:30am|West Bldg. Lecture Hall

We shall discuss new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is (either 0 or) 2. For every width d and length n, the pseudorandom...

Mar
15
2010

Members’ Seminar

No Members Seminar this week, in lieu of the Workshop on Analytic Number Theory
2:00pm
Mar
15
2010

Computer Science/Discrete Mathematics Seminar I

Extremal Problems for Convex Lattice Polytopes
Imre Barany
11:15am|West Bldg. Lecture Hall

In this survey I will present several extremal problems, and some solutions, concerning convex lattice polytopes. A typical example is to determine the smallest area that a convex lattice polygon can have if it has exactly n vertices.

Mar
15
2010

Workshop on Analytic Number Theory

12:00am
Simonyi Hall Seminar Room

The program had an emphasis on analytic aspects, and particular topics that were covered included the distribution of prime numbers, sieves, L functions, special sequences as well as additive and combinatorial methods...

Mar
11
2010

Joint IAS/Princeton University Number Theory Seminar

The Average Rank of Elliptic Curves
4:30pm|Fine Hall -- 214

A rational elliptic curve may be viewed as the set of solutions to an equation of the form $y^2=x^3+Ax+B$, where $A$ and $B$ are rational numbers. It is known that the rational points on this curve possess a natural abelian group structure, and the...

Mar
11
2010

Analytic and Geometric Number Theory Seminar

Distribution of extreme values of L-functions in the strip 1/2 < Re(s) < 1
2:00pm|S-101

In this talk I will construct a class of probabilistic random Euler products to model the behavior of L-functions in the strip 1/2 Re(s) 1. We then deduce results on the distribution of extreme values of several families of L-functions, including...

Mar
10
2010

Analytic and Geometric Number Theory Mini-Course

The Parameterization of Algebraic Structures, and Applications II
2:00pm|S-101

We describe how various fundamental algebraic structures (involving, for example, number fields, class groups, and algebraic curves) can be parameterized via the orbits of appropriate group representations. By developing techniques to count such...

Mar
09
2010

Computer Science/Discrete Mathematics Seminar II

Algorithms vs. Hardness
Nisheeth Vishnoi
10:30am|S-101

This talk will be concerned with how well can we approximate NP-hard problems. One of the most successful algorithmic strategies, from an upper bound perspective, is to write a polynomial time computable relaxation for an NP-hard problem and present...