L6

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.

Given a graph $G$, we can form a hypergraph $H$ whose edges correspond to the triangles in $G$. If $G$ is the standard Erdős-Rényi random graph with independent edges, then $H$ is random, but its edges are not independent, because of overlapping triangles. This is (presumably!) a major complication when proving results about triangles in random graphs.  However, it turns out that, for many purposes, we can treat the triangles as independent, in a one-sided sense (and losing something in the density): we can find an independent random hypergraph within the set of triangles. I will present two proofs, one of which generalizes to larger complete (and some non-complete) subgraphs.

We count monic quartic polynomials with prescribed Galois group, by box height. Among other things, we obtain the order of magnitude for  quartics, and show that non-quartics are dominated by reducibles. Tools include the geometry of numbers, diophantine approximation, the invariant theory of binary forms, and the determinant method. Joint with Rainer Dietmann.

A famous theorem due to Erdős and Kac states that the number of prime divisors of an integer N behaves like a normal distribution. In this talk we consider analogues of this result in the setting of arithmetic geometry, and obtain probability distributions for questions related to local solubility of algebraic varieties. This is joint work with Efthymios Sofos.

l-adic cohomology was built to provide an etale cohomology with coefficients in a field of characteristic 0. This, via the Grothendieck trace formula, gives  a cohomological interpretation of L-functions - a fundamental tool in Deligne's theory of weights developed in Weil II. Instead of l-adic coefficients one can consider coefficients in ultra products of finite fields. I will state the fundamental theorem of Weil II for curves in this setting and explain briefly what are the difficulties to overcome to adjust Deligne's proof. I will then discuss how this ultra product variant of Weil II allows to extend to arbitrary coefficients  previous results of Gabber and Hui, Tamagawa and myself for constant $\mathbb{Z}_\ell$-coefficients.  For instance,  it implies that, in an $E$-rational compatible system of smooth $\overline{\mathbb{Q}}_\ell$-sheaves all what is true for $\overline{\mathbb{Q}}_\ell$-coefficients (semi simplicity, irreducibility, invariant dimensions etc) is true for $\overline{\mathbb{F}}_\ell$-coefficients provided $\ell$ is large enough or that the $\overline{\mathbb{Z}}_\ell$-models are unique with torsion-free cohomology provided $\ell$ is large enough.

This talk concerns a twenty-thousand-year old mistake: The natural numbers record only the result of counting and not the process of counting. As algebra is rooted in the natural numbers, the higher algebra of Joyal and Lurie is rooted in a more basic notion of number which also records the process of counting. Long advocated by Waldhausen, the arithmetic of these more basic numbers should eliminate denominators. Notable manifestations of this vision include the Bökstedt-Hsiang-Madsen topological cyclic homology, which receives a denominator-free Chern character, and the related Bhatt-Morrow-Scholze integral p-adic Hodge theory, which makes it possible to exploit torsion cohomology classes in arithmetic geometry. Moreover, for schemes smooth and proper over a finite field, the analogue of de Rham cohomology in this setting naturally gives rise to a cohomological interpretation of the Hasse-Weil zeta function by regularized determinants as envisioned by Deninger.