Past

  A dimer configuration of a graph is a subset of the edges, such that every vertex is contained in exactly one edge of the subset. We consider dimer configurations of the honeycomb lattice on the cylinder, which are known to be equivalent to configurations of interlaced particles. Assigning a measure to the set of all such configurations, we show that the probability that particles are located in any subset of points on the cylinder can be written as a determinant, i.e. that the process is determinantal. We also examine Markov chains of interlaced particles on the circle, with dynamics equivalent to RSK.  

 

Gradient bounds are a very powerful tool to study heat kernel measures and

regularisation properties for the heat kernel. In the elliptic case, it is easy

to derive them from bounds on the Ricci tensor of the generator. In recent

years, many efforts have been made to extend these bounds to some simple

examples in the hypoelliptic situation. The simplest case is the Heisenberg

group. In this talk, we shall discuss some recent developments (due to H.Q. Li)

on this question, and give some elementary proofs of these bounds.