L6

Witten-Reshetikhin-Turaev quantum invariants of links and 3 dimensional manifolds are obtained from quantum sl(2). There exist different versions of quantum sl(2) leading to other families of invariants. We will briefly overview the original construction and then discuss two variants. First one, so called unrolled quantum sl(2), allows construction of invariants of 3-manifolds involving C* flat connections. In simplest case it recovers Reidemeister torsion. The second one is the non restricted version at a root of unity. It enables construction of invariants of links equipped with a gauge class of SL(2,C) flat connection. This is based respectively on joined work with Costantino, Geer, Patureau and Geer, Patureau, Reshetikhin.

Given two metric spaces $X$ and $Y$, it is natural to ask how faithfully, from the point of view of the metric, one can embed $X$ into $Y$. One way of making this precise is asking whether there exists a coarse embedding of $X$ into $Y$. Positive results are plentiful and diverse, from Assouad's embedding theorem for doubling metric spaces to the elementary fact that any finitely generated subgroup of a finitely generated group is coarsely embedded with respect to word metrics. Moreover, the consequences of admitting a coarse embedding into a sufficiently nice space can be very strong. By contrast, there are few invariants which provide obstructions to coarse embeddings, leaving many seemingly elementary geometric questions open.
I will present new families of invariants which resolve some of these questions. Highlights of the talk include a new algebraic dichotomy for connected unimodular Lie groups, and a method of calculating a lower bound on the conformal dimension of a compact Ahlfors-regular metric space.
 

The mapping class group of a surface is associated to its Teichmüller space. In turn, its boundary consists of projective measured laminations. Similarly, the group of outer automorphisms of a free group is associated to its Outer space. Now the boundary contains equivalence classes of arationaltrees as a subset. There exist distinct projective measured laminations that have the same underlying geodesic lamination, which is also minimal and filling. Such geodesic laminations are called `non-uniquely ergodic'. I will talk briefly about laminations on surfaces and then present a construction of non-uniquely ergodic phenomenon for arational trees. This is joint work with Mladen Bestvina and Jing Tao.

We will first construct pairs of homotopic 2-spheres smoothly embedded in a 4-manifold that are smoothly equivalent (via an ambient diffeomorphism preserving homology) but not even topologically isotopic. Indeed, these examples show that Gabai's recent "4D Lightbulb Theorem" does not hold without the 2-torsion hypothesis. We will proceed to discuss two distinct ways of obstructing such an isotopy, as well as related invariants which can be used to obstruct an isotopy between pairs of properly embedded disks (rather than spheres) in a 4-manifold.

The square peg problem asks whether every Jordan curve in the
plane contains the vertices of a square. Inspired by Hugelmeyer's approach
for smooth curves, we give a topological proof for "locally 1-Lipschitz"
curves using 4-dimensional topology.

The study of random matrix moments of moments has connections to number theory, combinatorics, and log-correlated fields. Our results give the leading order of these functions for integer moment parameters by exploiting connections with Gelfand-Tsetlin patterns and counts of lattice points in convex sets. This is joint work with Jon Keating and Theo Assiotis.

The genus of a knot in a 3-manifold is defined to be the minimum genus of a compact, orientable surface bounding that knot, if such a surface exists. We consider the computational complexity of determining knot genus. Such problems have been studied by several mathematicians; among them are the works of Hass--Lagarias--Pippenger, Agol--Hass--Thurston, Agol and Lackenby. For a fixed 3-manifold the knot genus problem asks, given a knot K and an integer g, whether the genus of K is equal to g. In joint work with Lackenby, we prove that for any fixed, compact, orientable 3-manifold, the knot genus problem lies inNP, answering a question of Agol--Hass--Thurston from 2002. Previously this was known for rational homology 3-spheres by the work of Lackenby.

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.

In this talk, we consider the random version of some classical extremal problems in the context of long cycles. This type of problems can also be seen as random analogues of the Turán number of long cycles, established by Woodall in 1972.

For a graph $G$ on $n$ vertices and a graph $H$, denote by $\text{ex}(G,H)$ the maximal number of edges in an $H$-free subgraph of $G$. We consider a random graph $G\sim G(n,p)$ where $p>C/n$, and determine the asymptotic value of $\text{ex}(G,C_t)$, for every $A\log(n)< t< (1- \varepsilon)n$. The behaviour of $\text{ex}(G,C_t)$ can depend substantially on the parity of $t$. In particular, our results match the classical result of Woodall, and demonstrate the transference principle in the context of long cycles.

Using similar techniques, we also prove a robustness-type result, showing the likely existence of cycles of prescribed lengths in a random subgraph of a graph with a nearly optimal density (a nearly ''Woodall graph"). If time permits, we will present some connections to size-Ramsey numbers of long cycles.

Based on joint works with Michael Krivelevich and Adva Mond.