It is known that every continuum X is a weakly confluent image of a continuum Y which is hereditarily indecomposable and of covering dimension one.  We use the ultracoproduct construction to gain information about the number of composants of Y.  For example, in ZFC, we can ensure that this number is arbitrarily large.  And if we assume the GCH, we can arrange for Y to have as many composants at it has points.

Abstract:   Let $f$ be a continuous surjection from the compact metric space $X$ to itself. 

We say that the dynamical system $(X,f)$ has shadowing if for every $\epsilon>0$ there is a $\delta>0$ such that every $\delta$-pseudo orbit is $\epsilon$-shadowed.  Here a sequence $(x_n)$ is a $\delta$-pseudo orbit provided the distance from $f(x_n)$ to $x_{n+1}$ is less than $\delta$ and $(x_n)$ is $\epsilon$-shadowed if there is a point $z$ such that the distance from $x_n$ to $f^n(z)$ is less than $\epsilon$.  

If $f$ is a homeomorphism, $(X,f)$ is said to be expansive if there is some $c>0$, such that if the distance from $f^n(x)$ and $f^n(y)$ is less than $c$ for all $n\in \mathbb Z$, then $x=y$.

In his proof that a homeomorphism that is expansive and has shadowing is stable, Walters shows that in an expansive system with shadowing, a pseudo orbit is shadowed by exactly one point.  It turns out that the converse is also true: if the system has unique shadowing (in the above sense), then it is expansive.

In this talk, which is joint work with Joel Mitchell and Joe Thomas, we explore this notion of unique shadowing.

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

In this talk I will illustrate how solutions of nonlinear nonlocal Fokker-Planck equations in a bounded domain with no-flux boundary conditions can be approximated by Cauchy problems with increasingly strong confining potentials defined outside such domain. Two different approaches are analysed, making crucial use of uniform estimates for energy and entropy functionals respectively. In both cases we prove that the problem in a bounded domain can be seen as a limit problem in the whole space involving a suitably chosen sequence of large confining potentials.
This is joint work with Maria Bruna and José Antonio Carrillo.
 

The InFoMM CDT presents The Reddick Lecture Dr. Nira Chamberlain (Holland & Barrett) Modelling the Competition Friday, 15 February 2019 17:00- 18:00 Mathematical Institute, L1 Followed by a drinks reception

It can be argued that any market would not survive without competition. It is everywhere; you can't run away from it. Competition can cause a business to either thrive, survive or die. So one might ask, why is there a need to mathematically model the competition? Two quotes may help to answer this: "Business is a game played for fantastic stakes, and you're in competition with experts. If you want to win, you have to learn to be a master of the game" Anon. “You can't look at the competition and say you're going to do it better. You have to look at the competition and say you're going to do it differently." Steve Jobs In this talk, I wish to demonstrate how mathematical modelling can be used to "master the game" and "do things differently". I will be focusing on three real life examples: Bidding to provide service support for a complex communication asset - dynamic travelling repairman Increasing market share in the Energy Sector - Markov Chain Retail's shop Location Location Location Location - Agent Based Simulation