Past

I will review the idea that entanglement must ultimately be understood in terms of modes, rather than in terms of particles. The most striking instance of mode entanglement is a single particle entangled state, which I will discuss both in the case of bosons as well as in the case of fermions. I then proceed to show that the Aharonov-Bohm effect can be understood by using a single electron entangled state. Finally, I will argue that this demonstrates beyond doubt that the Aharonov-Bohm effect is non non-local, contrary to what is frequently claimed in the literature.

The advent of social media and the resulting ability to instantaneously communicate ideas and messages to connections worldwide is one of the great consequences arising from the telecommunications revolution over the last century. Individuals do not, however, communicate only upon a single platform; instead there exists a plethora of options available to users, many of whom are active on a number of such media. While each platform offers some unique selling point to attract users, e.g., keeping up to date with friends through messaging and statuses (Facebook), photo sharing (Instagram), seeing information from friends, celebrities and numerous other outlets (Twitter) or keeping track of the career paths of friends and past colleagues (Linkedin), the platforms are all based upon the fundamental mechanisms of connecting with other users and transmitting information to them as a result of this link.

In this talk a model for the spreading of online information or “memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys. Rev. X., 2016] in two ways. First, even for a monoplex (single-layer) network, the model is defined for any specific network defined by its adjacency matrix, instead of being restricted to an ensemble of random networks. Second, a multiplex version of the model is introduced to capture the behavior of users who post information from one social media platform to another. In both cases the branching process analysis demonstrates that the dynamical system is, in the limit of low innovation, poised near a critical point, which is known to lead to heavy-tailed distributions of meme popularity similar to those observed in empirical data.

[1] J. P. Gleeson et al. “Effects of network structure, competition and memory time on social spreading phenomena”. Physical Review X 6.2 (2016), p. 021019.

[2] J. D. O’Brien et al. "Spreading of memes on multiplex networks." New Journal of Physics 21.2 (2019): 025001.

For measuring families of curves, or, more generally, of measures, $M_p$-modulus is traditionally used. More recent studies use so-called plans on measures. In their fundamental paper Ambrosio, Di Marino and Savare proved that these two approaches are in some sense equivalent within $1<p<\infty$. We consider the limiting case $p=1$ and show that the $AM$-modulus can be obtained alternatively by the plan approach. On the way, we demonstrate unexpected behavior of the $AM$-modulus in comparison with usual capacities.

This is a joint work with Vendula Honzlov\'a Exnerov\'a, Ond\v{r}ej F.K. Kalenda and Olli Martio. Partially supported by the grant GA\,\v{C}R P201/18-07996S of the Czech Science Foundation.

X.S. Lin defined an invariant of knots in S^3 by counting represenations 
of the knot group into SU(2) with fixed meridinal holonomy. Lin's 
invariant was subsequently shown to coincide with the Levine-Tristam 
signature. I'll define an analogous total Lin invariant which counts 
repesentations into both SU(2) and SL_2(R). Unlike the SU(2) version, this 
invariant does not (as far as I know) coincide with other known 
invariants. I'll describe some applications to left-orderability of Dehn 
fillings and branched covers, as well as a curious connection with the 
Alexander polynomial. This is joint work with Nathan Dunfield.

We observe a noisy version of a large rank-one matrix. Depending on the strength of the noise, can we recover non-trivial information on the matrix? This problem, interesting on its own, will be motivated by its link with a "spin glass" model, which is a model of statistical mechanics where a large number of variables interact with one another, with random interactions that can be positive or negative. The resolution of the initial question will involve a Hamilton-Jacobi equation

I will discuss new results for the gradient field models with uniformly convex potential (also known as the Ginzburg-Landau field). A connection between the scaling limits of the field and elliptic homogenization was introduced by Naddaf and Spencer in 1997. We quantify the existing central limit theorems in light of recent advances in quantitative homogenization; and positively settle a conjecture of Funaki and Spohn about the surface tension. Joint work with Scott Armstrong. 

I will describe joint work with Bruno Premoselli which gives a new existence theorem for negatively curved Einstein 4-manifolds, which are obtained by smoothing the singularities of hyperbolic cone metrics. Let (M_k) be a sequence of compact 4-manifolds and let g_k be a hyperbolic cone metric on M_k with cone angle \alpha (independent of k) along a smooth surface S_k. We make the following assumptions:

1. The injectivity radius i(k) of M_k tends to infinity (where in defining injectivity radius we ignore those geodesics which hit the cone singularity)

2. The normal injectivity radius of S_k is at least i(k)/2.

3. The area of the singular locii satisfy A(S_k)\leq C \exp(5 i(k)/2) for some C independent of k.

When these assumptions hold, we prove that for all large k, M_k carries a smooth Einstein metric of negative curvature. The proof involves a gluing theorem and a parameter dependent implicit function theorem (where k is the parameter). As I will explain, negative curvature plays an essential role in the proof. (For those who may be aware of our arxiv preprint, https://arxiv.org/abs/1802.00608 [arxiv.org], the work
I will describe has a new feature, namely we now treat all cone angles, and not just those which are greater than 2\pi. This gives lots more examples of Einstein 4-manifolds.)

How do you create a self-sustaining, flourishing academic community in a developing country? What kind of challenges need to be overcome to ensure that quality education becomes available? What can we do to help make it happen? In this talk, we will describe our experience visiting the University of Yangon in Myanmar. During the visit, we delivered a course to the academic staff, and discussed future collaborations between Oxford and Yangon, as well as further directions for Mathematical education in Myanmar, all the while marvelling at the wonders of the Burmese culture.

I'll talk about smooth solutions of Euler equations with compactly supported velocities, and applications to other equations.

In this talk I want to outline the proofs our of main results, i.e. the localisation theorem and the identification of the homotopy type of Grothendieck-Witt theory in terms of K- and L-theory.
Finally, as a small application I want to present a refinement and extension of certain maps relating certain Madsen-Tillmann spectra and orthogonal/symplectic algebraic K-theory spectra of the integers.

All original material is joint work with B.Calmès, E.Dotto, Y.Harpaz, M.Land, K.Moi, D.Nardin, T.Nikolaus and W.Steimle.
 

I will start by briefly reviewing the Tate construction and in particular, the Tate diagonal. Using these I will then illustrate Lurie’s notion of Poincaré categories by considering Poincaré structures on module categories over a ring (spectrum) in detail. In particular, I will describe the somewhat subtle genuine Poincaré structure on the category of perfect complexes of an ordinary ring, which conjecturally links the classical notion of the Grothendieck-Witt spectrum to our derived version. Finally, I will compute its associated L-groups.

I will explain how Lurie‘s approach to L-theory via Poincaré categories can be extended to yield cobordism categories of Poincaré objects à la Ranicki. These categories can be delooped by an iterated Q-construction and the resulting spectrum is a derived version of Grothendieck-Witt-theory.  Its homotopy type can be described in terms of K- and L-theory as conjectured by Hesselholt-Madsen. Furthermore, it has a clean universal property analogous to that of K-theory, localisation sequences in much greater generality than classical Grothendieck-Witt theory, gives a cycle description of Weiss-Williams‘ LA-theory and allows for maps from the geometric cobordism category, refining and unifying various known invariants.

All original material is joint work with B.Calmès, E.Dotto, Y.Harpaz, M.Land, K.Moi, D.Nardin, T.Nikolaus and W.Steimle.

The large-scale features of groups and spaces are recorded by asymptotic invariants. Examples of asymptotic invariants are the asymptotic cone and, for hyperbolic groups, the Gromov boundary.
In his study of asymptotic cones of connected Lie groups, Yves Cornulier introduced a class of maps called sublinearly biLipschitz equivalences. Like the more traditionnal quasiisometries, sublinearly biLipschitz equivalences are biLipschitz on the large-scale, but unlike quasiisometries, they are generally not coarse. Sublinearly biLipschitz equivalences still induce biLipschitz homeomorphisms between asymptotic cones. In this talk, I will focus on Gromov-hyperbolic groups and show how the Gromov boundary can be used to produce invariants distinguishing them up to sublinearly biLipschitz equivalences when the asymptotic cones do not. I will especially give applications to the large-scale sublinear geometry of hyperbolic Lie groups.
 

Jacob Bernoulli is known for his studies of the curves, infinitesimal math- ematics and statistics. However, before being a professor in mathematics, he taught experimental physics at the University of Basel. This explains his high interest in solving physical problems with newly developed Leibnizian calculus. In his scientific notebook, Meditationes, there are more than thirty notes about various mechanical problems for solving of which Bernoulli has applied Leibnizian calculus and has advanced this method along the way. A discussion with a craftsman brought Bernoulli’s attention to the problem of the strength of a beam early in his career and occupied his mind until his death. The craftsman’s narration based on his experience highlighted the flaws in Galilean-Leibnizian theory of the strength of a beam. This was the starting point of Bernoulli’s quest to mathematically find the profile of a bent beam (the Elastica Problem) and the physical laws governing it. He started a challenge to encourage other mathematicians of the time to study the problem, providing a hint hidden in an anagram. Although he published his solution of the Elastica Problem in 1694, that was not the end of the quest for him. Studying his unpublished notes in Meditationes reveals that over the last decade of his life, Bernoulli has reconsidered the problem. In my project, I demonstrate that he has found remarkable concepts such as mean tensile stress, and the notion of local stress-strain relation, etc.

In my talk I will discuss modular properties of false theta functions. Due to a wrong sign factor these are not directly seen to be modular, however there are ways to repair this. I will report about this in my talk.

Energy transfers from small-scale turbulence and waves to large-scale flows are ubiquituous in oceans, atmospheres, planetary cores and stars.

Therefore, turbulence and waves have a direct effect on the large-scale organization of geophysical and astrophysical fluids and can affect their long-term dynamics.

In this talk I will discuss recent direct numerical simulation (DNS) results of two upscale energy transfer mechanisms that emerge from the dynamics of a fluid that is self-organized in a turbulent layer next to a stably-stratified one. This self-organization in an adjacent "two-layer" turbulent-stratified system is ubiquituous in nature and is representative of e.g. Earth's troposphere-stratosphere system, the oceans' surface mixed layer-thermocline system, and stars' convective-radiative interiors. The first set of DNS results will demonstrate how turbulent motions can generate internal waves, which then force a slowly-reversing large-scale flow, akin to Earth's Quasi-Biennial Oscillation (QBO). The second set of DNS results will show how the stratified layer regulates the emergence of large-scale vortices (LSV) in the turbulent layer under rapid rotation in the regime known as geostrophic turbulence. I will demonstrate why it is important to resolve both the turbulence and the waves, as otherwise the natural variability of the QBO is lost and LSV cannot form. I will discuss future works and highlight how the results may guide the implementation of upscale energy transfers in global earth system models.

The mechanisms underlying the initiation and perpetuation of cardiac arrhythmias are inherently multi-scale: whereas arrhythmias are intrinsically tissue-level phenomena, they have a significant dependence cellular electrophysiological factors. Spontaneous sub-cellular calcium release events (SCRE), such as calcium waves, are a exemplars of the multi-scale nature of cardiac arrhythmias: stochastic dynamics at the nanometre-scale can influence tissue excitation  patterns at the centimetre scale, as triggered action potentials may elicit focal excitations. This latter mechanism has been long proposed to underlie, in particular, the initiation of rapid arrhythmias such as tachycardia and fibrillation, yet systematic analysis of this mechanism has yet to be fully explored. Moreover, potential bi-directional coupling has been seldom explored even in concept.

A major challenge of dissecting the role and importance of SCRE in cardiac arrhythmias is that of simultaneously exploring sub-cellular and tissue function experimentally. Computational modelling provides a potential approach to perform such analysis, but requires new techniques to be employed to practically simulate sub-cellular stochastic events in tissue-scale models comprising thousands or millions of coupled cells.

This presentation will outline the novel techniques developed to achieve this aim, and explore preliminary studies investigating the mechanisms and importance of SCRE in tissue-scale arrhythmia: How do independent, small-scale sub-cellular events overcome electrotonic load and manifest as a focal excitation? How can SCRE focal (and non-focal) dynamics lead to re-entrant excitation? How does long-term re-entrant excitation interact with SCRE to perpetuate and degenerate arrhythmia?

A defining feature of robotics today is the use of learning and autonomy in the inner loop of systems that are actually being deployed in the real world, e.g., in autonomous driving or medical robotics. While it is clear that useful autonomous systems must learn to cope with a dynamic environment, requiring architectures that address the richness of the worlds in which such robots must operate, it is also equally clear that ensuring the safety of such systems is the single biggest obstacle preventing scaling up of these solutions. I will discuss an approach to system design that aims at addressing this problem by incorporating programmatic structure in the network architectures being used for policy learning. I will discuss results from two projects in this direction.

Firstly, I will present the perceptor gradients algorithm – a novel approach to learning symbolic representations based on the idea of decomposing an agent’s policy into i) a perceptor network extracting symbols from raw observation data and ii) a task encoding program which maps the input symbols to output actions. We show that the proposed algorithm is able to learn representations that can be directly fed into a Linear-Quadratic Regulator (LQR) or a general purpose A* planner. Our experimental results confirm that the perceptor gradients algorithm is able to efficiently learn transferable symbolic representations as well as generate new observations according to a semantically meaningful specification.

Next, I will describe work on learning from demonstration where the task representation is that of hybrid control systems, with emphasis on extracting models that are explicitly verifi able and easily interpreted by robot operators. Through an architecture that goes from the sensorimotor level involving fitting a sequence of controllers using sequential importance sampling under a generative switching proportional controller task model, to higher level modules that are able to induce a program for a visuomotor reaching task involving loops and conditionals from a single demonstration, we show how a robot can learn tasks such as tower building in a manner that is interpretable and eventually verifiable.

References:

1. S.V. Penkov, S. Ramamoorthy, Learning programmatically structured representations with preceptor gradients, In Proc. International Conference on Learning Representations (ICLR), 2019. http://rad.inf.ed.ac.uk/data/publications/2019/penkov2019learning.pdf

2. M. Burke, S.V. Penkov, S. Ramamoorthy, From explanation to synthesis: Compositional program induction for learning from demonstration, https://arxiv.org/abs/1902.10657
 

The well known (and notoriously hard) P vs NP problem asks whether every Boolean function with polynomial-size proofs is also computable in
polynomial time.

The standard approach to the P vs NP problem is via circuit complexity. For progressively richer classes of Boolean circuits (networks of AND, OR and NOT
logic gates), one wishes to show super-polynomial lower bounds on the sizes of circuits (as a function of the size of the input) computing some Boolean
function known to be in NP, such as the Satisfiability problem.

However, there is a more logic-oriented approach initiated by Cook and Reckhow, going through proof complexity rather than circuit complexity. For
progressively richer proof systems, one wishes to show super-polynomial lower bounds on the sizes of proofs (as a function of the size of the tautology) of
some sequence of propositional tautologies.

I will give a brief overview on known results along these two directions, and on their limitations. Somewhat surprisingly, similar techniques have been found
to be useful for these seemingly different approaches. I will say something about known connections between the approaches, and pose the question of
whether there are deeper connections.

Finally, I will discuss how the perspective of proof complexity can be used to formalize the difficulty of proving lower bounds on the sizes of computations
(or of proofs).