A graph homomorphism is a mapping of vertices which takes edges to edges. The endomorphisms of a graph (homomorphisms to itself) form a submonoid of he full transformation monoid on the vertex set. In the other direction, there is a construction of a graph from a transformation monoid, which will be described in the talk. Composing these maps gives closure operators on graphs and on monoids which have some interesting properties. There are also connections with finite automata and permutation groups.
I will explain what quasinormal modes are and how to obtain asymptotic formulae for the quasinormal frequencies of static, spherically symmetric black hole spacetimes in d dimensions in the limit of very large imaginary part.
Electronic structure calculations are commonly used to understand and predict the electronic, magnetic and optic properties of molecular systems and materials. They are also at the basis of ab initio molecular dynamics, the most reliable technique to investigate the atomic scale behavior of materials undergoing chemical reactions (oxidation, crack propagation, ...).
In the first part of my talk, I will briefly review the foundations of the density functional theory for electronic structure calculations. In the second part, I will present some recent achievements in the field, as well as open problems. I will focus in particular on the mathematical modelling of defects in crystalline materials.
Aside from a few tangential problems, this seminar will include a proof of Ostrowski's Theorem. This states than any norm over the rationals is equivalent to either the Euclidean norm or the $p$-adic norm, for some prime $p$.
Given a foliation of a compact manifold, leaves of which are equipped with a Riemannian metric, one can consider the associated "leafwise"
Brownian motion, and study its asymptotic properties (such as asymptotic distribution, behaviour of holonomy maps, etc.).
Lucy Garnet studied such measures, introducing the notion of a harmonic measure -- stationary measure of this process; the name "harmonic" comes from the fact that a measure is stationary if and only if with respect to it integral of every leafwise Laplacian of a smooth function equals zero (so, the measure is "harmonic" in the sense of distributions).
It turns out that for a transversally conformal foliation, unless it possesses a transversally invariant measure (which is a rather rare case), the associated random dynamics can be described rather precisely. Namely, for every minimal set in the foliation there exists a unique harmonic measure supported on it -- and this gives all the possible ergodic harmonic measures (in particular, there is a finite number of them, and they are always supported on the minimal sets).
Also, the holonomy maps turn out to be (with probability one) exponentially contracting -- so, the Lyapunov exponent of the dynamics is negative. Finally, for any initial point almost every path tends to one of the minimal sets and is asymptotically distributed with respect to the corresponding harmonic measure -- and the functions defining the probabilities of tending to different sets form a base in the space of continuous leafwise harmonic functions.
An interesting effect that is a corollary of this consideration is that for transversally conformal foliations the number of the ergodic harmonic measures does not depend on the choice of Riemannian metric on the leaves. This fails for non-transversally conformal foliations:
there is an example, recently constructed in a joint with S.Petite (following B.Deroin's technique).
There is a well-known relationship between the theory of formal group schemes and stable homotopy theory, with Ravenel's chromatic filtration and the nilpotence theorem of Hopkins, Devinatz and Smith playing a central role. It is also familiar that one can sometimes get a more geometric understanding of homotopical phenomena by examining how they interact with group actions. In this talk we will explore this interaction from the chromatic point of view.
Stochastic geometry gradually becomes a necessary theoretical tool to model and analyse modern telecommunication systems, very much the same way the queuing theory revolutionised studying the circuit switched telephony in the last century. The reason for this is that the spatial structure of most contemporary networks plays crucial role in their functioning and thus it has to be properly accounted for when doing their performance evaluation, optimisation or deciding the best evolution scenarios. The talk will present some stochastic geometry models and tools currently used in studying modern telecommunications. We outline specifics of wired, wireless fixed and ad-hoc systems and show how the stochastic geometry modelling helps in their analysis and optimisation.
Let T be a (one-sorted first order) geometric theory (so T
has infinite models, T eliminates "there exist infinitely many" and
algebraic closure gives a pregeometry). I shall present some results
about T_P, the theory of lovely pairs of models of T as defined by
Berenstein and Vassiliev following earlier work of Ben-Yaacov, Pillay
and Vassiliev, of van den Dries and of Poizat. I shall present
results concerning superrosiness, the independence property and
imaginaries. As far as the independence property is concerned, I
shall discuss the relationship with recent work of Gunaydin and
Hieronymi and of Berenstein, Dolich and Onshuus. I shall also discuss
an application to Belegradek and Zilber's theory of the real field
with a subgroup of the unit circle. As far as imaginaries are
concerned, I shall discuss an application of one of the general
results to imaginaries in pairs of algebraically closed fields,
adding to Pillay's work on that subject.
The harmonic map heat flow is a model for nematic liquid crystals and also has origins in geometry. We will introduce the model and discuss some of its mathematical properties. In particular, we will focus on the possibility that singularities may develop.
The rate at which singularities develop is investigated in settings with certain symmetries. We use the method of matched asymptotic expansions and identify different scenarios for singularity formation. More specifically, we distinguish between singularities that develop in finite time and those that need infinite time to form.
Finally, we discuss which results can be proven rigorously, as well as some open problems, and we address stability issues (ongoing work with JF Williams).
We discuss numerical methods for the solution of the palindromic eigenvalue problem Ax=λ ATx, where A is a complex matrix. Such eigenvalue problems occur, for example, in the vibration analysis of rail tracks.
The structure of palindromic eigenvalue problems leads to a symmetry in the spectrum: all eigenvalues occur in reciprocal pairs. The need for preservation of this symmetry in finite precision arithmetic requires the use of structure-preserving numerical methods. In this talk, we explain how such methods can be derived.
In this paper we employ the quantile formulation to solve the SP/A portfolio choice model in continuous time. We show that the original version of the SP/A model proposed by Lopes is ill-posed in the continuous-time setting. We then generalise the SP/A model to one where a utility function is included, while the probability weighting
(distortion) function is still present. The feasibility and well-posedness of the model are addressed and an explicit solution is derived. Finally, we study how the aspiration level and the probability weighting function affect the optimal solution
I will briefly discuss the construction of the moduli spaces of (semi)stable bundles on a given curve. The main aim of the talk will be to describe various features of the geometry and topology of these moduli spaces, with emphasis on methods as much as on results. Topics may include irreducibility, cohomology, Verlinde numbers, Torelli theorems.
The subgroup growth of finitely generated groups was seen last term, in a lecture of Dan Segal. This time, we see representation growth, and how it is similar to, and different from, subgroup growth.
Khovanov homology is an invariant of knots in $S^3$. In its original form,
it is a "homological version of the Jones polynomial"; Khovanov and
Rozansky have generalized it to other knot polynomials, including the
HOMFLY polynomial.
In the second talk, I'll discuss how Khovanov homology and its generalizations lead to a relation between the HOMFLY polynomial and the topology of flag varieties.
The conjecture was made by Pemantle that a forest chosen uniformly at random from all forests in any finite graph G has the edge-negative association property. We use enumerative methods to show that this conjecture is true for n large enough when G is a complete graph on n vertices and derive related results for random trees.
Khovanov homology is an invariant of knots in $S^3$. In its original form,
it is a "homological version of the Jones polynomial"; Khovanov and
Rozansky have generalized it to other knot polynomials, including the
HOMFLY polynomial.
The first talk will be an introduction to Khovanov homology and its generalizations.
We prove the existence of a smooth minimizer of the Willmore energy in the class of conformal immersions of a given closed Riemann surface
into $R^n$, $n = 3, 4$, if there is one conformal immersion with Willmore energy smaller than a certain bound $W_{n,p}$ depending on codimension and genus $p$ of the Riemann surface. For tori in codimension $1$, we know $W_{3,1} = 8\pi$ . Joint work with Enrst Kuwert.
Seminar also with N. El Karoui and Y. Jiao
Dynamic modelling of default time for one single credit has been largely studied in the literature. For the pricing and hedging purpose, it is important to describe the price dynamics of credit derivative products. To this end, one needs to characterize martingales in the various filtrations and calculate conditional expectations by taking into account of default information, often modelized by a filtration $\bf{ D}$ generated by the jump process related to the default time $\tau$.
A general principle is to work with some reference filtration $\bf F$ which is often generated by some given processes. The calculations are then achieved by a formal passage between the enlarged filtration and the reference one on the set $\{\tau>t\}$ and the models are developed on the filtration $\bf F$.
In this paper, we are interested in what happens after a default occurs, i.e., on the set $\{\tau\leq t\}$. The motivation is to study the impact of a default event on the market, which will be important in a multi-credits setting. To this end, we adopt a new approach which is based on the knowledge of conditional survival probabilities. Inspired by the enlargement of filtration theory, we assume that the conditional law of $\tau$ admits a density.
We also present how our computations can be used in a multi-default setting.
In 1993 in his paper "A new strongly minimal set" Hrushovski produced a family of counter examples to a conjecture by Zilber. Each one of these counter examples carry a pregeometry. We answer a question by Hrushovski about comparing these pregeometries and their localization to finite sets. We first analyse the pregeometries arising from different variations of the construction before the collapse. Then we compare the pregeometries of the family of new strongly minimal structures obtained after the collapse.
Friction-driven vibration occurs in a number of contexts, from the violin string to brake squeal and machine tool vibration. A review of some key phenomena and approaches will be given, then the talk will focus on a particular aspect, the "twitchiness" of squeal and its relatives. It is notoriously difficult to get repeatable measurements of brake squeal, and this has been regarded as a problem for model testing and validation. But this twitchiness is better regarded as an essential feature of the phenomenon, to be addressed by any model with pretensions to predictive power. Recent work examining sensitivity of friction-excited vibration in a system with a single-point frictional contact will be described. This involves theoretical prediction of nominal instabilities and their sensitivity to parameter uncertainty, compared with the results of a large-scale experimental test in which several thousand squeal initiations were caught and analysed in a laboratory system. Mention will also be made of a new test rig, which attempts to fill a gap in knowledge of frictional material properties by measuring a parameter which occurs naturally in any linearised stability analysis, but which has never previously been measured.
The aim of this talk is to render the power of (short-step) interior-point methods for linear programming (and by extension, convex programming) intuitively understandable to those who have a basic training in numerical methods for dynamical systems solving. The connection between the two areas is made by interpreting line-search methods in a forward Euler framework, and by analysing the algorithmic complexity in terms of the stiffness of the vector field of search directions. Our analysis cannot replicate the best complexity bounds, but due to its weak assumptions it also applies to inexactly computed search directions and has explanatory power for a wide class of algorithms.
Co-Author: Coralia Cartis, Edinburgh University School of Mathematics.
It is well-known that Euclidean domains are PIDs; examples proving that the inclusion is strict are not commonly known. Here is one.