Previous Conferences & Workshops

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...

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.

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...

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...

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...

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...

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...