L6

The bipolar filtration of Cochran, Harvey and Horn initiated the study of deeper structures of the smooth concordance group of the topologically slice knots. We show that the graded quotient of the bipolar filtration has infinite rank at each stage greater than one. To detect nontrivial elements in the quotient, the proof uses higher order amenable Cheeger-Gromov $L^2$ $\rho$-invariants and infinitely many Heegaard Floer correction term $d$-invariants simultaneously. This is joint work with Jae Choon Cha.

Developments in geometry and low dimensional topology have given renewed vigour to the following classical question: to what extent do the finite images of a finitely presented group determine the group? I'll survey what we know about this question in the context of 3-manifolds, and I shall present recent joint work with McReynolds, Reid and Spitler showing that the fundamental groups of certain hyperbolic orbifolds are distingusihed from all other finitely generated groups by their finite quotients.

The cyclic surgery theorem of Culler, Gordon, Luecke, and Shalen implies that any knot in S^3 other than a torus knot has at most two nontrivial cyclic surgeries. In this talk, we investigate the weaker notion of SU(2)-cyclic surgeries on a knot, meaning surgeries whose fundamental groups only admit SU(2) representations with cyclic image. By studying the image of the SU(2) character variety of a knot in the “pillowcase”, we will show that if it has infinitely many SU(2)-cyclic surgeries, then the corresponding slopes (viewed as a subset of RP^1) have a unique limit point, which is a finite, rational number, and that this limit is a boundary slope for the knot. As a corollary, it follows that for any nontrivial knot, the set of SU(2)-cyclic surgery slopes is bounded. This is joint work with Raphael Zentner.

I will talk about the diffeomorphism classification of 4-manifolds up to 
connected sums with the complex projective plane, and how the resulting 
equivalence class of a manifold can be detected by algebraic topological 
invariants of the manifold.  I may also discuss related results when one 
takes connected sums with another favourite 4-manifold, S^2 x S^2, instead.

The Monster Lie algebra m, which admits an action of the Monster finite simple group M, was constructed by Borcherds as part of his program to solve the Conway-Norton conjecture about the representation theory of M. We associate the analog of a Lie group G(m) to the Monster Lie algebra m. We give generators for large free subgroups and we describe relations in G(m).

In this talk I will construct a reduced tensor product of braided fusion categories containing a symmetric fusion category $\mathcal{A}$. This tensor product takes into account the relative braiding with respect to objects of $\mathcal{A}$ in these braided fusion categories. The resulting category is again a braided fusion category containing $\mathcal{A}$. This tensor product is inspired by the tensor product of $G$-equivariant once-extended three-dimensional quantum field theories, for a finite group $G$.
To define this reduced tensor product, we equip the Drinfeld centre $\mathcal{Z}(\mathcal{A})$ of the symmetric fusion category $\mathcal{A}$ with an unusual tensor product, making $\mathcal{Z}(\mathcal{A})$ into a 2-fold monoidal category. Using this 2-fold structure, we introduce a new type of category enriched over the Drinfeld centre to capture the braiding behaviour with respect to $\mathcal{A}$ in the braided fusion categories, and use this encoding to define the reduced tensor product.
 

A class C of graphs has polynomial expansion if there exists a polynomial p such that for every graph G from C and for every integer r, each minor of G obtained by contracting disjoint subgraphs of radius at most r is p(r)-degenerate. Classes with polynomial expansion exhibit interesting structural, combinatorial, and algorithmic properties. In the talk, I will survey these properties and propose further research directions.

Reed conjectured in 1998 that the chromatic number of a graph should be at most the average of the clique number (a trivial lower bound) and maximum degree plus one (a trivial upper bound); in support of this conjecture, Reed proved that the chromatic number is at most some nontrivial convex combination of these two quantities.  King and Reed later showed that a fraction of roughly 1/130000 away from the upper bound holds. Motivated by a paper by Bruhn and Joos, last year Bonamy, Perrett, and I proved that for large enough maximum degree, a fraction of 1/26 away from the upper bound holds. Then using new techniques, Delcourt and I showed that the list-coloring version holds; moreover, we improved the fraction for ordinary coloring to 1/13. Most recently, Kelly and I proved that a 'local' list version holds with a fraction of 1/52 wherein the degrees, list sizes, and clique sizes of vertices are allowed to vary.
 

A subset S of initially infected vertices of a graph G is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of G is the minimum cardinality of a forcing set in G. It was introduced independently as a bound for the minimum rank of a graph, and as a tool in quantum information theory.

The focus of this talk is on the forcing number of the random graph. Furthermore, we will state our bounds on the forcing number of pseudorandom graphs and related problems. The results are joint work with Thomas Kalinowski and Benny Sudakov.

Enumerating families of combinatorial objects with given properties and describing the typical structure of these objects are fundamental problems in extremal combinatorics. In this talk, we will investigate intersecting families of discrete structures in various settings, determining their typical structure as the size of the underlying ground set tends to infinity. Our new approach outlines a general framework for a number of similar problems; in particular, we prove analogous results for hypergraphs, permutations, and vector spaces using the same technique. This is joint work with József Balogh, Shagnik Das, Hong Liu, and Maryam Sharifzadeh.