Past

I will associate, to every pair of smooth transversal

Lagrangian spheres in a symplectic manifold having vanishing first Chern

class, its Floer cohomology groups. Hamiltonian isotopic spheres give

rise to isomorphic groups. In order to define these Floer cohomology

groups, I will make a key use of symplectic field theory.

Radial basis function (RBF) methods have been successfully used to approximate functions in multidimensional complex domains and are increasingly being used in the numerical solution of partial differential equations. These methods are often called meshfree numerical schemes since, in some cases, they are implemented without an underlying grid or mesh.

The focus of this talk is on the class of RBFs that allow exponential convergence for smooth problems. We will explore the dependence of accuracy and stability on node locations of RBF interpolants. Because Gaussian RBFs with equally spaced centers are related to polynomials through a change of variable, a number of precise conclusions about convergence rates based on the smoothness of the target function will be presented. Collocation methods for PDEs will also be considered.

Category theory is used to study structures in various branches of

mathematics, and higher-dimensional category theory is being developed to

study higher-dimensional versions of those structures. Examples include

higher homotopy theory, higher stacks and gerbes, extended TQFTs,

concurrency, type theory, and higher-dimensional representation theory. In

this talk we will present two general methods for "categorifying" things,

that is, for adding extra dimensions: enrichment and internalisation. We

will show how these have been applied to the definition and study of

2-vector spaces, with 2-representation theory in mind. This talk will be

introductory; in particular it should not be necessary to be familiar with

any category theory other than the basic idea of categories and functors.

Phylogenetics is the reconstruction and analysis of 'evolutionary'

trees and graphs in biology (and related areas of classification, such as linguistics). Discrete mathematics plays an important role in the underlying theory. We will describe some of the ways in which concepts from combinatorics (e.g. poset theory, greedoids, cyclic permutations, Menger's theorem, closure operators, chordal graphs) play a central role. As well as providing an overview, we also describe some recent and new results, and outline some open problems.

We provide a realization of Cherednik's double affine Hecke

algebras (for GL_n) as a convolution algebra of functions on moduli spaces

of coherent sheaves on an elliptic curve. As an application we give a

geometric construction of Macdonald polynomials as (traces of) certain

natural perverse sheaves on these moduli spaces. We will discuss the

possible extensions to higher (or lower !) genus curves and the relation

to the Hitchin nilpotent variety. This is (partly) based on joint work

with I. Burban and E. Vasserot.

In this talk I will look at a definition of the energy-momentum for the dynamical horizon of a black hole. The talk will begin by examining the role of a special class of observers at null infinity determined by Bramson's concept of frame alignment. It is shown how this is given in terms of asymptotically constant spinor fields and how this framework may be used together with the Nester-Witten two form to give a definition of the Bondi mass at null infinity.

After reviewing Ashtekar's concept of an isolated horizon we will look at the propagation of spinor fields and show how to introduce spinor fields for the horizon which play the role of the asymptotically constant spinor fields at null infinity, giving a concept of alignment of frames on the horizon. It turns out that the equations satisfied by these spinor fields give precisely the Dougan-Mason holomorphic condition on the cross sections of the horizon, together with a simple propagation equation along the generators. When combined with the Nester-Witten 2-form these equations give a quasi-local definition of the mass and momentum of the black hole, as well as a formula for the flux across the horizon. These ideas are then generalised to the case of a dynamical horizon and the results compared to those obtained by Ashtekar as well as to the known answers for a number of exact solutions.

In the Examination Schools

Reflected Brownian motion (RBM) in a two-dimensional wedge is a well-known stochastic process. With an appropriate drift, it is positive recurrent and has a stationary distribution, and the invariant measure is absolutely continuous with respect to Lebesgue measure. I will give necessary and sufficient conditions for the stationary density to be written as a finite sum of exponentials with linear exponents. Such densities are a natural generalisation of the stationary density of one-dimensional RBM. Using geometric ideas reminiscent of the reflection principle, I will give an explicit formula for the density in such cases, which can be written as a determinant. Joint work with Ton Dieker.

The symmetries of a dynamical system have a big effect on its typical behaviour. The most obvious effect is pattern formation - the dynamics itself may be symmetric, though often the symmetry of the system is 'broken', and the state has less symmetry than the system. The resulting phenomena are fairly well understood for steady and time-periodic states, and quite a bit can be said for chaotic dynamics. More recently, the concept of 'symmetry' has been generalised to address applications to physical and biological networks. One consequence is a new approach to patterns of synchrony and phase relations. The lecture will describe some of the high points of the emerging theories, including applications to evolution, locomotion, human balance and fluid dynamics.

Adaptive discretizations and iterative multilevel solvers are nowadays well established techniques for the numerical solution of PDEs.

The development of efficient multilevel techniques in the context of PDE-constrained optimization methods is an active research area that offers the potential of reducing the computational costs of the optimization process to an equivalent of only a few PDE solves.

We present a general class of inexact adaptive multilevel SQP-methods for PDE-constrained optimization problems. The algorithm starts with a coarse discretization of the underlying optimization problem and provides

1. implementable criteria for an adaptive refinement strategy of the current discretization based on local error estimators and

2. implementable accuracy requirements for iterative solvers of the PDE and adjoint PDE on the current grid

such that global convergence to the solution of the infinite-dimensional problem is ensured.

We illustrate how the adaptive refinement strategy of the multilevel SQP-method can be implemented by using existing reliable a posteriori error estimators for the state and the adjoint equation. Moreover, we discuss the efficient handling of control constraints and describe how efficent multilevel preconditioners can be constructed for the solution of the arising linear systems.

Numerical results are presented that illustrate the potential of the approach.

This is joint work with Jan Carsten Ziems.

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.