Past

I will discuss how one can construct nice cellular

algebras using the cohomology of Springer fibres associated with two

block nilpotent matrices (and the convolution product). Their

quasi-hereditary covers can be described via categories of highest

weight modules for the Lie algebra sl(n). The combinatorics of torus

fixed points in the Springer fibre describes decomposition

multiplicities for the corresponding highest weight categories. As a

result one gets a natural subcategory of coherent sheaves on a

resolution of the slice to the corresponding nilpotent orbit.

Will discuss several constructions of the Grothendieck group in different contexts together with Wall's solution of the problem of determining homotopy types of finite CW complexes as a motivating application.

I will speak about the Zilber trichotomy for weakly minimal difference varieties, and the definable structure on them.

A difference field is a field with a distinguished automorphism $\sigma$. Solution sets of systems of polynomial difference equations like

$3 x \sigma(x) +4x +\sigma^2(x) +17 =0$ are the quantifier-free definable subsets of difference fields. These \emph{difference varieties} are similar to varieties in algebraic geometry, except uglier, both from an algebraic and from a model-theoretic point of view.

ACFA, the model-companion of the theory of difference fields, is a supersimple theory whose minimal (i.e. U-rank $1$) types satisfy the Zilber's Trichotomy Conjecture that any non-trivial definable structure on the set of realizations of a minimal type $p$ must come from a definable one-based group or from a definable field. Every minimal type $p$ in ACFA contains a (weakly) minimal quantifier-free formula $\phi_p$, and often the difference variety defined by $\phi_p$ determines which case of the Zilber Trichotomy $p$ belongs to.

Abstract: I will talk about developments in my ongoing project to understand algebraic modules for finite groups, in particular for V_4 blocks, and their relation with the Puig finiteness conjecture. I will discuss a new (as in 5th of November) theorem of mine that generalizes results of Alperin and myself.

We give different criteria for transience of branching Markov chains. These conditions enable us to give a classification of branching random walks in random environment (BRWRE) on Cayley graphs in recurrence and transience. This classification is stated explicitly for BRWRE on $\Z^d.$ Furthermore, we emphasize the interplay between branching Markov chains, the spectral radius, and some generating functions.

Apologies - this seminar is CANCELLED

Hypergraph Transversals have been studied in Mathematics for a long time (e.g. by Berge) . Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science, especially in database Theory, Logic, and AI. We give a survey of various applications and review some recent results on the complexity of computing all minimal transversals of a given hypergraph.

Defined in terms of $\zeta(\frac{1}{2} +it)$ are the Riemann-Siegel functions, $\theta(t)$ and $Z(t)$. A zero of $\zeta(s)$ on the critical line corresponds to a sign change in $Z(t)$, since $Z$ is a real function. Points where $\theta(t) = n\pi$ are called Gram points, and the so called Gram's Law states between each Gram point there is a zero of $Z(t)$, and hence of $\zeta(\frac{1}{2} +it)$. This is known to be false in general and work will be presented to attempt to quantify how frequently this fails.

We study randomized (i.e. Monte Carlo) algorithms to compute expectations of Lipschitz functionals w.r.t. measures on infinite-dimensional spaces, e.g., Gaussian measures or distribution of diffusion processes. We determine the order of minimal errors and corresponding almost optimal algorithms for three different sampling regimes: fixed-subspace-sampling, variable-subspace-sampling, and full-space sampling. It turns out that these minimal errors are closely related to quantization numbers and Kolmogorov widths for the underlying measure. For variable-subspace-sampling suitable multi-level Monte Carlo methods, which have recently been introduced by Giles, turn out to be almost optimal.

Joint work with Jakob Creutzig (Darmstadt), Steffen Dereich (Bath), Thomas Müller-Gronbach (Magdeburg)

In ordinary percolation, sites of a lattice are open with a given probability and one investigates the existence of infinite clusters (percolation). In dynamical percolation, the sites randomly flip between the states open and closed and one investigates the existence of "atypical" times at which the percolation structure is different from that of a fixed time.

1. I will quickly present some of the original results for dynamical percolation (joint work with Olle Haggstrom and Yuval Peres) including no exceptional times in critical percolation in high dimensions.

2. I will go into some details concerning a recent result that, for the 2 dimensional triangular lattice, there are exceptional times for critical percolation (joint work with Oded Schramm). This involves an interesting connection with the harmonic analysis of Boolean functions and randomized algorithms and relies on the recent computation of critical exponents by Lawler, Schramm, Smirnov, and Werner.

3. If there is time, I will mention some very recent results of Garban, Pete, and Schramm on the Fourier spectrum of critical percolation.

The Snaer program calculates the posterior mean and variance of variables on some of which we have data (with precisions), on some we have prior information (with precisions), and on some prior indicator ratios (with precisions) are available. The variables must satisfy a number of exact restrictions. The system is both large and sparse. Two aspects of the statistical and computational development are a practical procedure for solving a linear integer system, and a stable linearization routine for ratios. We test our numerical method for solving large sparse linear least-squares estimation problems, and find that it performs well, even when the $n \times k$ design matrix is large ( $nk = O (10^{8})$ ).

There are many triangulated categories that arise in the study

of group cohomology: the derived, stable or homotopy categories, for

example. In this talk I shall describe the relative cohomological

versions and the relationship with ordinary cohomology. I will explain

what we know (and what we would like to know) about these categories, and

how the representation type of certain subgroups makes a fundamental

difference.

Given an algebraic variety $X$ over the finite field ${\bf F}_{q}$, it is known that the zeta function of $X$,

$$ Z(X,T):=\mbox{exp}\left( \sum_{k=1}^{\infty} \frac{#X({\bf F}_{q^{k}})T^{k}}{k} \right) $$

is a rational function of $T$. It is an ongoing topic of research to efficiently compute $Z(X,T)$ given the defining equation of $X$.

I will summarize how we can use Berthelot's rigid cohomology (sparing you the actual construction) to compute $Z(X,T)$, first done for hyperelliptic curves by Kedlaya. I will go on to describe Lauder's deformation algorithm, and the promising fibration algorithm, outlining the present drawbacks.

Glauber dynamics on $\mathbb{Z}^d$ is a dynamic representation of the zero-temperature Ising model, in which the spin (either $+$ or $-$) of each vertex updates, at random times, to the state of the majority of its neighbours. It has long been conjectured that the critical probability $p_c(\mathbb{Z}^d)$ for fixation (every vertex eventually in the same state) is $1/2$, but it was only recently proved (by Fontes, Schonmann and Sidoravicius) that $p_c(\mathbb{Z}^d)

The transportation problem (TP) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [Hitchcock, 1941] and independently by Koopmans in 1947 [Koopmans, 1948], and appears in any standard introductory course on operations research.

The mxn TP has m supply points and n demand points. Each supply Point i holds a quantity r_i, and each demand point j wants a quantity c_j, with the sum of femands equal to the sum of supplies. A solution to the problem can be written as a mxn matrix X with entries decision x_{ij} having value equal to the amount transported from supply point i to demand point j. The objective is to minimize total transportation costs when unit transporation costs between each supply and each demand point are given.

The set of feasible solutions of TP, is called the transportation polytope.

The 1-skeleton (edge graph) of this polytope is defined as the graph with vertices the vertices of the polytope and edges its 1-dimensional faces.

In 1957 W.M. Hirsch stated his famous conjecture cf. [Dantzig, 1963]) saying that any d-dimensional polytope with n facets has diameter at most n-d. So far the best bound for any polytope is O(n^{\log d+1}) [Kalai and Kleitman, 1992]. Any strongly polynomial bound is still lacking. Such bounds have been proved for some special classes of polytopes (for examples, see [Schrijver, 1995]). Among those are some special classes of transportation polytopes [Balinski, 1974],[Bolker, 1972] and the polytope of the dual of TP [Balinski, 1974].

The first strongly polynomial bound on the diameter of the transportation polytope was given by Dyer and Frieze [DyerFrieze, 1994]. Actually, they prove a bound on the diameter of any polytope {x|Ax=b} where A is a totally unimodular matrix. The proof is complicated and indirect, using the probabilistic method. Moreover, the bound is huge O(m^{16}n^3ln(mn))3) assuming m less than or equal to n.

We will give a simple proof that the diameter of the transportation polytope is less than 8(m+n-2). The proof is constructive: it gives an algorithm that describes how to go from any vertex to any other vertex on the transportation polytope in less than 8(m+n-2) steps along the edges.

According to the Hirsch Conjecture the bound on the TP polytope should be

m+n-1. Thus we are within a multiplicative factor 8 of the Hirsch bound.

Recently C. Hurkens refined our analysis and diminished the bound by a factor 2, arriving at 4(m+n-2). I will indicate the way he achieved this as well.

Static vacuum data and their conformal classes play an important role in the discussion of the smoothness of gravitational fields at null infinity. We study the question under which conditions such data admit non-trivial conformal rescalings which lead again to such data. Some of the restrictions implied by this requirement are discussed and it is shown that there exists a 3-parameter family of static vacuum data which are not conformally flat and which admit non-trivial rescalings.

Many biological time series appear nonlinear or chaotic, and from biomechanical principles we can explain these empirical observations. For this reason, methods from nonlinear time series analysis have become important tools to characterise these systems. Nonetheless, a very large proportion of these signals appear to contain significant noise. This randomness cannot be explained within the assumptions of pure deterministic nonlinearity, and, as such, is often treated as a nuisance to be ignored or otherwise mitigated. However, recent work points to this noise component containing valuable information. Random dynamical systems offer a unified framework within which to understand the interplay between deterministic and stochastic dynamical sources. This talk will discuss recent attempts to exploit this synthesis of stochastic and deterministic dynamics in biological signals. It will include a case study from speech science.

I will review the construction of algebraic de Rham cohomology, relative de Rham cohomology, and the Gauss-Manin connection. I will then show how we can find a basis for the cohomology and the matrix for the connection with respect to this basis for certain families of curves sitting in weighted projective spaces.

Joint work with Martin Dyer (Leeds) and Leslie Goldberg (Liverpool).

A spin system may be modelled as a graph, in which edges (bonds) indicate interactions between adjacent vertices (sites). A configuration of the system is an assignment of colours (spins) to the vertices of the graph. The interactions between adjacent spins define a certain distribution, the Boltzmann distribution, on configurations. To sample from this distribution it is usually necessary to simulate one of a number of Markov chains on the space of all configurations. Theoretical analyses of the mixing time of these Markov chains usually assume that spins are updated at single vertices chosen uniformly at random. Actual simulations, in contrast, may make (random) updates according to a deterministic, usually highly structured pattern. We'll explore the relationships between systematic scan and random single-site updates, and also between classical uniqueness conditions from statistical physics and more recent techniques in mixing time analysis.

Both Kazhdan and Haagerup properties turn out to be related to actions

of

groups on median spaces and on spaces with measured walls.

These relationships allows to study the connection between Kazhdan

property (T) and the fixed point property

for affine actions on $L^p$ spaces, on one hand.

On the other hand, they allow to discuss conjugacy classes of subgroups

with property (T) in Mapping Class Groups. The latter result

is due to the existence of a natural structure of measured walls

on the asymptotic cone of a Mapping Class Group.

The talk is on joint work with I. Chatterji and F. Haglund

(first part), and J. Behrstock and M. Sapir (second part).

In the past the theory of rough paths has proven to be an elegant tool for deriving support theorems and large deviation principles. In this talk I will explain how this approach can be used in the analysis of stochastic flows generated by Kunita SDE's. As driving processes I will consider general Banach space valued Wiener processes