Limit groups are a powerful tool in the study of free and hyperbolic groups (and even broader classes of groups). I will define limit groups in various ways: algebraic, logical and topological, and draw connections between the different definitions. We will also see how one can equip a limit group with an action on a real tree, and analyze this action using the Rips machine, a generalization of Bass-Serre theory to real trees. As a conclusion, we will obtain that hyperbolic groups whose outer automorphism group is infinite, split non-trivially as graphs of groups.

Abstract:

Quasicrystals have been observed recently in soft condensed mater, providing new insight into the ongoing quest to understand their formation and thermodynamic stability. I shall explain the stability of certain soft-matter quasicrystals, using surprisingly simple classical field theories, by making an analogy to Faraday waves. This will provide a recipe for designing pair potentials that yield crystals with (almost) any given symmetry.

Scrolls play a central role in the construction of varieties; they are ambient spaces for K3 surfaces and Fano 3-folds. In this talk, I will say in two ways what scrolls are and give examples of some embedded varieties in them.

 Let phi be an outer automorphism of a free group. A topological representative of phi is a marked graph G along with a homotopy equivalence f: G → G which induces the outer automorphism phi on the fundamental group of G. For any given outer automorphism, the choice of topological representative is far from unique. Handel and Bestvina showed that sufficiently nice automorphisms admit a special type of topological representative called a train track map, whose dynamics can be well understood. 
In this talk I will outline the definition and motivation for train tracks, and give a sketch of Handel and Bestvina’s algorithm for finding them.
 

Can spatial fungal networks be informative for both ecology and network science?

Filamentous organisms grow as adaptive biological spatial networks. These networks are in a continuous balance of two main forces: exploration of the habitat to acquire scarce resources, and the transport of those resources within the developing network. In addition, the construction of the network has to be kept a low cost while taking into account the risk of damage by predation. Such network optimization is not unique to biological systems, but is relevant to transport networks across many domains. Thus, this collaborative project between FU-Berlin and University of Oxford represents the beginning of a research program that aims at: First, setting up protocols for the use of network analysis to characterize spatial networks formed by both macroscopic and microscopic filamentous organisms (e.g. Fungi), and determining the fitness and ecological consequences of different structure of the networks. Second, extracting biologically-inspired algorithms that lead to optimized network formation in fungi and discuss their utility in other network domains. This information is critical to demonstrate that we have a viable and scalable pipeline for the measurement of such properties as well provide preliminary evidence of the usefulness of studying network properties of fungi.

In the process of studying the zeta-function for one parameter families of Calabi-Yau manifolds we have been led to a manifold, for which the quartic numerator of the zeta-function factorises into two quadrics remarkably often. Among these factorisations, we find persistent factorisations; these are determined by a parameter that satisfies an algebraic equation with coefficients in Q, so independent of any particular prime.  We note that these factorisations are due a splitting of Hodge structure and that these special values of the parameter are rank two attractor points in the sense of IIB supergravity. To our knowledge, these points provide the first explicit examples of non-singular, non-rigid rank two attractor points for Calabi-Yau manifolds of full SU(3) holonomy. Modular groups and modular forms arise in relation to these attractor points in a way that, to a physicist, is unexpected. This is a report on joint work with Xenia de la Ossa, Mohamed Elmi and Duco van Straten.

Given a number field K, it is natural to ask whether it has a finite extension with ideal class number one. This question can be translated into a fundamental question in class field theory, namely the class field tower problem. In this talk, we are going to discuss this problem as well as its solution due to Golod and Shafarevich using methods of group cohomology.
 

Modularity is a function on graphs which is used in algorithms for community detection. For a given graph G, each partition of the vertices has a modularity score, with higher values indicating that the partition better captures community structure in $G$. The (max) modularity $q^\ast(G)$ of the graph $G$ is defined to be the maximum over all vertex partitions of the modularity score, and satisfies $0 \leq q^\ast(G) \leq 1$.

We analyse when community structure of an underlying graph can be determined from an observed subset of the graph. In a natural model where we suppose edges in an underlying graph $G$ appear with some probability in our observed graph $G'$ we describe how high a sampling probability we need to infer the community structure of the underlying graph.

Joint work with Colin McDiarmid.