Wed, 29 Oct 2014
14:00
L2

The Structure of Counterexamples to Vaught's Conjecture

Robin Knight
(Oxford)
Abstract

Counterexamples to Vaught's Conjecture regarding the number of countable
models of a theory in a logical language, may felicitously be studied by investigating a tree
of types of different arities and belonging to different languages. This
tree emerges from a category of topological spaces, and may be studied as such, without
reference to the original logic. The tree has an intuitive character of absoluteness
and of self-similarity. We present theorems expressing these ideas, some old and some new.

Tue, 02 Dec 2014

14:30 - 15:30
L3

Phase transitions in bootstrap percolation

Michal Przykucki
(University of Oxford)
Abstract
We prove that there exist natural generalizations of the classical bootstrap percolation model on $\mathbb{Z}^2$ that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Joint work with Paul Balister, Béla Bollobás and Paul Smith.
Tue, 11 Nov 2014

14:30 - 15:30
L6

Matroid bases polytope decomposition

Jorge Ramirez-Alfonsin
(Université Montpellier 2)
Abstract
Let $P(M)$ be the matroid base polytope of a matroid $M$. A decomposition of $P(M)$ is a subdivision of the form $P(M)=\cup_{i=1}^t P(M_i)$ where each $P(M_i)$ is also a matroid base polytope for some matroid $M_i$, and for each $1\le i\neq j\le t$ the intersection $P(M_i)\cap P(M_j)$ is a face of both $P(M_i)$ and $P(M_j)$. In this talk, we shall discuss some results on hyperplane splits, that is, polytope decomposition when $t=2$. We present sufficient conditions for $M$ so $P(M)$ has a hyperplane split and a characterization when $P(M_i\oplus M_j)$ has a hyperplane split, where $M_i\oplus M_j$ denotes the direct sum of $M_i$ and $M_j$. We also show that $P(M)$ has not a hyperplane split if $M$ is binary. Finally, we present some recent results concerning the existence of decompositions with $t\ge 3$.
Tue, 21 Oct 2014

14:30 - 15:30
L6

Spanning Trees in Random Graphs

Richard Montgomery
(University of Cambridge)
Abstract
Given a tree $T$ with $n$ vertices, how large does $p$ need to be for it to be likely that a copy of $T$ appears in the binomial random graph $G(n,p)$? I will discuss this question, including recent work confirming a conjecture which gives a good answer to this question for trees with bounded maximum degree.
Mon, 01 Dec 2014

17:00 - 18:00
L6

Functions of bounded variation on metric measure spaces

Panu Lahti
(Aalto University)
Abstract

Functions of bounded variation, abbreviated as BV functions, are defined in the Euclidean setting as very weakly differentiable functions that form a more general class than Sobolev functions. They have applications e.g. as solutions to minimization problems due to the good lower semicontinuity and compactness properties of the class. During the past decade, a theory of BV functions has been developed in general metric measure spaces, which are only assumed to be sets endowed with a metric and a measure. Usually a so-called doubling property of the measure and a Poincaré inequality are also assumed. The motivation for studying analysis in such a general setting is to gain an understanding of the essential features and assumptions used in various specific settings, such as Riemannian manifolds, Carnot-Carathéodory spaces, graphs, etc. In order to generalize BV functions to metric spaces, an equivalent definition of the class not involving partial derivatives is needed, and several other characterizations have been proved, while others remain key open problems of the theory.

 

Panu is visting Oxford until March 2015 and can be found in S2.48

Subscribe to