L3

It has long been a challenge to synthesize the complementary insights offered by model theory and category theory. A small fragment of that challenge is to understand ultraproducts categorically. I will show that, granted some general categorical machinery, the notions of ultrafilter and ultraproduct follow inexorably from the notion of finiteness of a set. The machine in question, known as the codensity monad, has existed in an underexploited state for nearly fifty years. To emphasize that it was not constructed specifically for this purpose, I will mention some of its other applications. This talk represents joint work with an anonymous referee. Little knowledge of category theory will be assumed.

              Conventional decoherence (usually called 'Environmental

Decoherence') is supposed to be a result of correlations

established between some quantum system and the environment.

'Intrinsic decoherence' is hypothesized as being an essential

feature of Nature - its existence would entail a breakdown of

quantum mechanics. A specific mechanism of some interest is

'gravitational decoherence', whereby gravity causes intrinsic

decoherence.

I will begin by discussing what is now known about the mechanisms of

environmental decoherence, noting in particular that they can and do

involve decoherence without dissipation (ie., pure phase decoherence).

I will then briefly review the fundamental conflict between Quantum

Mechanics and General Relativity, and several arguments that suggest

how this might be resolved by the existence of some sort of 'gravitational

decoherence'.  I then outline a theory of gravitational decoherence

(the 'GR-Psi' theory) which attempts to give a quantitative discussion of

gravitational decoherence, and which makes predictions for

experiments.

The weak field regime of this theory (relevant to experimental

predictions) is discussed in detail, along with a more speculative

discussion of the strong field regime.

Consider non-negative integers assigned to the vertexes of an oriented graph. To this combinatorial data we associate a so-called quiver representation. We will study the geometry and the algebra of this representation, when the underlying un-oriented graph is of Dynkin type ADE.

A remarkable object we will consider is Kazarian's equivariant cohomology spectral sequence. The edge homomorphism of this spectral sequence defines the so-called quiver polynomials. These polynomials are generalizations of remarkable polynomials in algebraic combinatorics (Giambelli-Thom-Porteous, Schur, Schubert, their double, universal, and quantum versions). Quiver polynomials measure degeneracy loci of maps among vector bundles over a common base space. We will present interpolation, residue, and (conjectured) positivity properties of these polynomials.

The quiver polynomials are also encoded in the Cohomological Hall Algebra (COHA) associated with the oriented graph. This is a non-commutative algebra defined by Kontsevich and Soibelman in relation with Donaldson-Thomas invariants. The above mentioned spectral sequence has a structure identity expressing the fact that the sequence converges to explicit groups. We will show the role of this structure identity in understanding the structure of the COHA. The obtained identities are equivalent to Reineke's quantum dilogarithm identities associated to ADE quivers and certain stability conditions.

Cutting-edge experiments in quantum communications are reaching regimes

where relativistic effects can no longer be neglected. For example, there

are advanced plans to use satellites to implement teleportation and quantum

cryptographic protocols. Relativistic effects can be expected at these

regimes: the Global Positioning System (GPS), which is a system of

satellites that is used for time dissemination and navigation, requires

relativistic corrections to determine time and positions accurately.

Therefore, it is timely to understand what are the effects of gravity and

motion on entanglement and other quantum properties exploited in quantum

information.

In this talk I will show that entanglement can be created or degraded by

gravity and non-uniform motion. While relativistic effects can degrade the

efficiency of teleportation between moving observers, the effects can also

be exploited in quantum information. I will show that the relativistic

motion of a quantum system can be used to perform quantum gates. Our

results, which will inform future space-based experiments, can be

demonstrated in table-top experiments using superconducting circuits.

We prove that quasi-trees of spaces satisfying the axiomatisation given by Bestvina, Bromberg and Fujiwara are quasi-isometric to tree-graded spaces in the sense of Dru\c{t}u and Sapir. We then present a technique for obtaining `good' embeddings of such spaces into $\ell^p$ spaces, and show how results of Bestvina-Bromberg-Fujiwara and Mackay-Sisto allow us to better understand the metric geometry of such groups.

A-infinity algebras arise whenever one has a multiplication which is "associative up to homotopy". There is an important theory of minimal models which involves studying differential graded algebras via A-infinity structures on their homology algebras. However, this only works well over a ground field. Recently Sagave introduced the more general notion of a derived A-infinity algebra in order to extend the theory of minimal models to a general commutative ground ring.

Operads provide a very nice way of saying what A-infinity algebras are - they are described by a kind of free resolution of a strictly associative structure. I will explain the analogous result for derived A_infinity algebras - these are obtained in the same manner from a strictly associative structure with an extra differential.

This is joint work with Muriel Livernet and Constanze Roitzheim.

Consider the complete graph on n vertices with independent and identically distributed edge-weights having some absolutely continuous distribution. The minimum spanning tree (MST) is simply the spanning subtree of smallest weight. It is straightforward to construct the MST using one of several natural algorithms. Kruskal's algorithm builds the tree edge by edge starting from the globally lowest-weight edge and then adding other edges one by one in increasing order of weight, as long as they do not create any cycles. At each step of this process, the algorithm has generated a forest, which becomes connected on the final step. In this talk, I will explain how it is possible to exploit a connection between the forest generated by Kruskal's algorithm and the Erd\"os-R\'enyi random graph in order to prove that $M_n$, the MST of the complete graph, possesses a scaling limit as $n$ tends to infinity. In particular, if we think of $M_n$ as a metric space (using the graph distance), rescale edge-lengths by $n^{-1/3}$, and endow the vertices with the uniform measure, then $M_n$ converges in distribution in the sense of the Gromov-Hausdorff-Prokhorov distance to a certain random measured real tree.

This is joint work with Louigi Addario-Berry (McGill), Nicolas Broutin (INRIA Paris-Rocquencourt) and Grégory Miermont (ENS Lyon).

The ``k-commodity flow problem'' is: we are given k pairs of vertices of a graph, and we ask whether there are k flows in the graph, where the ith flow is between the ith pair of vertices, and has total value one, and for each edge, the sum of the absolute values of the flows along it is at most one. We may also require the flows to be 1/2-integral, or indeed 1/p-integral for some fixed p.

If the problem is feasible (that is, the desired flows exist) then it is still feasible after contracting any edge, so let us say a flow problem is ``critical'' if it is infeasible, but becomes feasible when we contract any edge. In many special cases, all critical instances have only two vertices, but if we ask for integral flows (that is, p = 1, essentially the edge-disjoint paths problem), then there arbitrarily large critical instances, even with k = 2. But it turns out that p = 1 is the only bad case; if p>1 then all critical instances have bounded size (depending on k, but independent of p), and the same is true if there is no integrality requirement at all.

The proof gives rise to a very simple algorithm for the k edge-disjoint paths problem in 4-edge-connected graphs.