The study of the representations theoretic properties of the group of diffeormorphisms of locally compact non compact Riemmanian manifolds which equal to the identity outside a compact set is is linked to a natural quasi invariant action of the group which moves all points of a Poisson point process according to the diffeomorphism (Gelfand-Graev-Vershik and Goldin et al.). Neretin noticed that the local diffeomorphism group is a subgroup of a larger group which he called GMS and that GMS also acts in a similar manner on the Poisson point process.

A major difficulty in finding polynomial patterns in primes is the need to understand their distribution properties at short scales. We describe how for some polynomial configurations one can overcome this problem by concatenating short scale behavior in "many directions" to long scale behavior for which tools from additive combinatorics are available.

The Crossing Lemma of Ajtai, Chvátal, Newborn, Szemerédi (1982) and Leighton (1983 )states that if a graph of n vertices and e>4n edges is drawn in the plane, then the number of crossings between its edges must be at least constant times e^3/n^2. This statement, which is asymptotically tight, has found many applications in combinatorial geometry and in additive combinatorics. However, most results that were obtained using the Crossing Lemma do not appear to be optimal, and there is a quest for improved versions of the lemma for graphs satisfying certain special properties.

Additive combinatorics enable one to characterize subsets S of elements in a group such that S+S has small cardinality. We are interested in linear analogues of these results, namely characterizing subspaces S in some algebras (mostly extension fields) such that the linear span of the set S^2 of products st, for s,t in S, has small dimension. We shall present a linear analogue of a theorem of Vosper which says that under the right conditions, a sufficiently small dimension for S^2 implies that S has a basis of elements in geometric progression.

Consider the following questions: 1. How does the volume of the set f(x_1,...,x_d) < epsilon behaves when epsilon goes to 0? 2. How does the number of solutions of the equation f(x_1,...,x_d) = 0 (mod n) behaves when n goes to infinity. I will present these and other questions which looks as if they are taken from different areas of mathematics. I'll explain the relation between those questions. Then I'll explain how this relation is used in order to show the following theorem answering a question of Larsen and Lubotzky:

The goal of the talk is to survey the emerging field of integrable probability, whose goal is to identify and analyze exactly solvable probabilistic models. The models and results are often easy to describe, yet difficult to find, and they carry essential information about broad universality classes of stochastic processes.

Abstract: Given two permutations A and B which "almost" commute, are they "close" to permutations A' and B' which really commute? This can be seen as a question about a property the equation XY=YX. Studying analogous problems for more general equations (or sets of equations) leads to the notion of "locally testable groups" (aka "stable groups").

G.D.Birkhoff introduced a mathematical billiard inside of a convex domain as the motion of a massless particle with elastic reflection at the boundary. A theorem of Poncelet says that the billiard inside an ellipse is integrable, in the sense that the neighborhood of the boundary is foliated by smooth closed curves and each billiard orbit near the boundary is tangent to one and only one such curve (in this particular case, a confocal ellipse). A famous conjecture by Birkhoff claims that ellipses are the only domains with this

Title: Proving conformal invariance using discrete holomorphicity Abstract: