King's College London

We study a multi-agent setting in which brokers transact with an informed trader. Through a sequential Stackelberg-type game, brokers manage trading costs and adverse selection with an informed trader. In particular, supplying liquidity to the informed traders allows the brokers to speculate based on the flow information. They simultaneously attempt to minimize inventory risk and trading costs with the lit market based on the informed order flow, also known as the internalization-externalization strategy. We solve in closed form for the trading strategy that the informed trader uses with each broker and propose a system of equations which classify the equilibrium strategies of the brokers. By solving these equations numerically we may study the resulting strategies in equilibrium. Finally, we formulate a competitive game between brokers in order to determine the liquidity prices subject to precommitment supplied to the informed trader and provide a numerical example in which the resulting equilibrium is not Pareto efficient.

At most how many edge-disjoint Hamilton cycles does a given directed graph contain? It is easy to see that one cannot pack more than the minimum in-degree or the minimum out-degree of the digraph. We show that in the random directed graph $D(n,p)$ one can pack precisely this many edge-disjoint Hamilton cycles, with high probability, given that $p$ is at least the Hamiltonicity threshold, up to a polylog factor.

Based on a joint work with Asaf Ferber.

A classical approach to studying the topology of a manifold is through the analysis of its submanifolds. The realm of 3-manifolds is particularly rich and diverse, and we aim to explore the complexity of surfaces within a given 3-manifold. After reviewing the fundamental definitions of the Thurston norm, we will present a constructive method for computing it on Seifert fibered manifolds and extend this approach to graph manifolds. Finally, we will outline which norms can be realized as the Thurston norm of some graph manifold and examine their key properties.

We show how to explicitly compute equations for everywhere locally soluble 3-coverings of Jacobians of genus 2 curves with a rational Weierstrass point, using the notion of visibility introduced by Cremona and Mazur.  These 3-coverings are abelian surface torsors, embedded in the projective space $\mathbb{P}^8$ as degree 18 surfaces. They have points over every $p$-adic completion of $\mathbb{Q}$, but no rational points, and so are counterexamples to the Hasse principle and represent non-trivial elements of the Tate-Shafarevich group.  Joint work in progress with Tom Fisher.

The Gelfand--Kirillov dimension is a classical invariant that measures the size of smooth representations of p-adic groups. It acquired particular relevance in the mod p Langlands program because of the work of  Breuil--Herzig--Hu--Morra--Schraen, who computed it for the mod p cohomology of GL_2 over totally real fields, and used it to prove several structural properties of the cohomology. In this talk, we will present a simplified proof of this result, which has the added benefit of working unchanged for nonsplit inner forms of GL_2. This is joint work with Bao V. Le Hung.

Ramification theory serves the dual purpose of a diagnostic tool and treatment by helping us locate, measure, and treat the anomalous behavior of mathematical objects. In the classical setup, the degree of a finite Galois extension of "nice" fields splits up neatly into the product of two well-understood numbers (ramification index and inertia degree) that encode how the base field changes. In the general case, however, a third factor called the defect (or ramification deficiency) can pop up. The defect is a mysterious phenomenon and the main obstruction to several long-standing open problems, such as obtaining resolution of singularities. The primary reason is, roughly speaking, that the classical strategy of "objects become nicer after finitely many adjustments" fails when the defect is non-trivial. I will discuss my previous and ongoing work in ramification theory that allows us to understand and treat the defect.

I will report on work with Andrew Graham in which we prove new results towards the Bloch--Kato conjecture for automorphic forms on $\mathrm{GSp}_4 \times \mathrm{GL}_2$.

The classical lower-tail problem for triangles in random graphs asks the following: given $\eta\in[0,1)$, what is the probability that $G(n,p)$ contains at most $\eta$ times the expected number of triangles?  When $p=o(n^{-1/2})$ or $p = \omega(n^{-1/2})$ the asymptotics of the logarithm of this probability are known via Janson's inequality in the former case and regularity or container methods in the latter case.

We prove for the first time asymptotic formulas for the logarithm of the lower tail probability when $p=c n^{-1/2}$ for $c$ constant.  Our results apply for all $c$ when $\eta \ge 1/2$ and for $c$  small enough when $\eta < 1/2$.  For the special case $\eta=0$ of triangle-freeness, our results prove that a phase transition occurs as $c$ varies (in the sense of a non-analyticity of the rate function), while for $\eta \ge 1/2$ we prove that no phase transition occurs.

Our method involves ingredients from algorithms and statistical physics including rapid mixing of Markov chains and the cluster expansion.  We complement our asymptotic formulas with efficient algorithms to approximately sample from $G(n,p)$ conditioned on the lower tail event.

Joint work with Will Perkins, Aditya Potukuchi and Michael Simkin.