L3

Dualities of various types have been used by different authors to 
describe free and projective objects in a large
  number of classes of algebras. Particularly, natural dualities provide a 
general tool to describe free objects. In
  this talk we present two interesting applications of this fact. 
  We first provide a combinatorial classification of unification problems 
by their unification type for the
varieties of Bounded Distributive Lattices, Kleene algebras, De Morgan 
algebras. Finally we provide axiomatizations forsingle
and multiple conclusion admissible rules for the varieties of Kleene 
algebras, De Morgan algebras, Stone algebras.

If $A$ is a set of $n$ positive integers, how small can the set

$\{ x/(x,y) : x,y \in A \}$ be? Here, as usual, $(x,y)$ denotes the highest common factor of

$x$ and $y$. This elegant question was raised by Granville and Roesler, who

also reformulated it in the following way: given a set $A$ of $n$ points in

the integer grid ${\bf Z}^d$, how small can $(A-A)^+$, the projection of the difference

set of $A$ onto the positive orthant, be?

Freiman and Lev gave an example to show that (in any dimension) the size can

be as small as $n^{2/3}$ (up to a constant factor). Granville and Roesler

proved that in two dimensions this bound is correct, i.e. that the size is

always at least $n^{2/3}$, and they asked if this holds in any dimension.

After some background material, the talk will focus on recent developments.

Joint work with B\'ela Bollob\'as.

The phase transition deals with sudden global changes and is observed in many fundamental random discrete structures arising from statistical physics, mathematics and theoretical computer science, for example, Potts models, random graphs and random $k$-SAT. The phase transition in random graphs refers to the phenomenon that there is a critical edge density, to which adding a small amount results in a drastic change of the size and structure of the largest component. In the Erdős--R\'enyi random graph process, which begins with an empty graph on $n$ vertices and edges are added randomly one at a time to a graph, a phase transition takes place when the number of edges reaches $n/2$ and a giant component emerges. Since this seminal work of Erdős and R\'enyi, various random graph processes have been introduced and studied. In this talk we will discuss new approaches to study the size and structure of components near the critical point of random graph processes: key techniques are the classical ordinary differential equations method, a quasi-linear partial differential equation that tracks key statistics of the process, and singularity analysis.

A number is said to be $y$-smooth if all of its prime factors are

at most $y$. A lot of work has been done to establish the (equi)distribution

of smooth numbers in arithmetic progressions, on various ranges of $x$,$y$

and $q$ (the common difference of the progression). In this talk I will

explain some recent results on this problem. One ingredient is the use of a

majorant principle for trigonometric sums to carefully analyse a certain

contour integral.

 I will first present Priestley style topological dualities for 
several categories of distributive meet-semilattices
and implicative semilattices developed by G. Bezhanishvili and myself. 
Using these dualities I will introduce a topological duality for Hilbert 
algebras, 
the algebras that correspond to the implicative reduct of intuitionistic logic.