It is known that many real-world networks exhibit geometric properties.  Brain networks, social networks, and wireless communication networks are a few examples.  Storage and transmission of the information contained in the topologies and structures of these networks are important tasks, which, given their scale, is often nontrivial.  Although some (but not much) work has been done to characterize and develop compression limits and algorithms for nonspatial graphs, little is known for the spatial case.  In this talk, we will discuss an information theoretic formalism for studying compression limits for a fairly broad class of random geometric graphs.  We will then discuss entropy bounds for these graphs and, time permitting, local (pairwise) connection rules that yield maximum entropy properties in the induced graph distribution.

The goal of topological data analysis is to apply tools form algebraic topology to reveal geometric structures hidden within high dimensional data. Mapper is among its most widely and successfully applied tools providing, a framework for the geometric analysis of point cloud data. Given a number of input parameters, the Mapper algorithm constructs a graph, giving rise to a visual representation of the structure of the data.  The Mapper graph is a topological representation, where the placement of individual vertices and edges is not important, while geometric features such as loops and flares are revealed.

However, Mappers method is rather ad hoc, and would therefore benefit from a formal approach governing how to make the necessary choices. In this talk I will present joint work with Francisco Belchì, Jacek Brodzki, and Mahesan Niranjan. We study how sensitive to perturbations of the data the graph returned by the Mapper algorithm is given a particular tuning of parameters and how this depend on the choice of those parameters. Treating Mapper as a clustering generalisation, we develop a notion of instability of Mapper and study how it is affected by the choices. In particular, we obtain concrete reasons for high values of Mapper instability and experimentally demonstrate how Mapper instability can be used to determine good Mapper outputs.

Our approach tackles directly the inherent instability of the choice of clustering procedure and requires very few assumption on the specifics of the data or chosen Mapper construction, making it applicable to any Mapper-type algorithm.

In this talk, linear algebra for persistence modules will be introduced, together with a generalization of persistent homology. This theory permits us to handle the Mayer-Vietoris spectral sequence for persistence modules, and solve any extension problems that might arise. The result of this approach is a distributive algorithm for computing persistent homology. That is, one can break down the underlying data into different covering subsets, compute the persistent homology for each cover, and join everything together. This approach has the added advantage that one can recover extra geometrical information related to the barcodes. This addresses the common complaint that persistent homology barcodes are 'too blind' to the geometry of the data.

In this talk I will explain a category theoretic perspective on geometry.  Starting with a category of local objects (of and algebraic nature), and a (Grothendieck) 
topology on it, one can define global objects such as schemes and stacks. Examples of this  approach are algebraic, analytic, differential geometries and also more exotic geometries  such as analytic and differential geometry over the integers and analytic geometry over  the field with one element. In this approach the notion of a point is not primary but is  derived from the local to global structure. The Zariski and Huber spectra are recovered  in this way, and we also get new spectra which might be of interest in model theory.

Feynman integrals govern the perturbative expansion in quantum field theories. As periods, these integrals generate representations of a motivic Galois group. I will explain this idea and illustrate the 'coaction principle', a mechanism that constrains which periods can appear at any loop order.
 

In this talk, I will describe new mathematical structures in the low-energy  expansion of one-loop string amplitudes. The insertion of external states on the open- and closed-string worldsheets requires integration over punctures on a cylinder boundary and a torus, respectively. Suitable bases of such integrals will be shown to obey simple first-order differential equations in the modular parameter of the surface. These differential equations will be exploited  to perform the integrals order by order in the inverse string tension, similar to modern strategies for dimensionally regulated Feynman integrals. Our method manifests the appearance of iterated integrals over holomorphic  Eisenstein series in the low-energy expansion. Moreover, infinite families of Laplace equations can be generated for the modular forms in closed-string  low-energy expansions.
 

In 1941, Chabauty gave a way to compute the set of rational points on specific curves. In 2004, Minhyong Kim showed how to extend Chabauty's method to a bigger class of curves using anabelian methods. In the talk, I will explain Chabauty's method and give an outline of how Kim extended those methods.

We construct a cellular decomposition of the
Axelrod-Singer-Fulton-MacPherson compactification of the configuration
spaces in the plane, that is compatible with the operad composition.
Cells are indexed by trees with bi-coloured edges, and vertices are labelled by 
cells of the cacti operad. This answers positively a conjecture stated in 
2000 by Kontsevich and Soibelman.

Stevenhagen conjectured that the density of d such that the negative Pell equation x^2-dy^2=-1 is solvable over the integers is 58.1% (to the nearest tenth of a percent), in the set of positive squarefree integers having no prime factors congruent to 3 modulo 4. In joint work with Peter Koymans, Djordjo Milovic, and Carlo Pagano, we use a recent breakthrough of Smith to prove that the infimum of this density is at least 53.8%, improving previous results of Fouvry and Klüners, by studying the distribution of the 8-rank of narrow class groups of quadratic number fields.