Abstract: n-homological algebra was initiated by Iyama
via his notion of n-cluster tilting subcategories.
It was turned into an abstract theory by the definition
of n-abelian categories (Jasso) and (n+2)-angulated categories
(Geiss-Keller-Oppermann).
The talk explains some elementary aspects of these notions.
We also consider the special case of an n-representation finite algebra.
Such an algebra gives rise to an n-abelian
category which can be "derived" to an (n+2)-angulated category.
This case is particularly nice because it is
analogous to the classic relationship between
the module category and the derived category of a
hereditary algebra of finite representation type.
 

  
The Cartan model computes the equivariant cohomology of a smooth manifold X with 
differentiable action of a compact Lie group G, from the invariant functions on 
the Lie algebra with values in differential forms and a deformation of the de Rham 
differential. Before extracting invariants, the Cartan differential does not square 
to zero. Unrecognised was the fact that the full complex is a curved algebra, 
computing the quotient by G of the algebra of differential forms on X. This 
generates, for example, a gauged version of string topology. Another instance of 
the construction, applied to deformation quantisation of symplectic manifolds, 
gives the BRST construction of the symplectic quotient. Finally, the theory for a 
X point with an additional quadratic curving computes the representation category 
of the compact group G.

Recent results showed that the low energy expansion of closed superstring amplitudes can be expressed in terms of

single-valued multiple elliptic polylogarithms. I will explain how these functions may be defined as iterated integrals on the torus and

sketch how they arise from Feynman integrals.

Ramsey classes may be viewed as the top of the line of Ramsey properties. Classical and not so classical examples of Ramsey classes of finite structures were recently extended by many new examples which make the characterisation of Ramsey classes  realistic (and in many cases known). Particularly I will cover recent  joint work with J. Hubicka.
 

The size Ramsey number r'(H) of a graph H is the smallest number of edges in a graph G which is Ramsey with respect to H, that is, such that any 2-colouring of the edges of G contains a monochromatic copy of H. A famous result of Beck states that the size Ramsey number of the path with n vertices is at most bn for some fixed constant b > 0. An extension of this result to graphs of maximum degree ∆ was recently given by Kohayakawa, Rödl, Schacht and Szemerédi, who showed that there is a constant b > 0 depending only on ∆ such that if H is a graph with n vertices and maximum degree ∆ then r'(H) < bn^{2 - 1/∆} (log n)^{1/∆}. On the other hand, the only known lower-bound on the size Ramsey numbers of bounded-degree graphs is of order n (log n)^c for some constant c > 0, due to Rödl and Szemerédi.

Together with David Conlon, we make a small step towards improving the upper bound. In particular, we show that if H is a ∆-bounded-degree triangle-free graph then r'(H) < s(∆) n^{2 - 1/(∆ - 1/2)} polylog n. In this talk we discuss why 1/∆ is the natural "barrier" in the exponent and how we go around it, why we need the triangle-free condition and what are the limits of our approach.