Past

The infamous Ramanujan tau-function is the starting point for many mysterious conjectures and difficult open problems within the realm of modular forms. In this talk, I will discuss some of our recent results pertaining to odd values of the Ramanujan tau-function. We use a combination of tools which include the Primitive Divisor Theorem of Bilu, Hanrot and Voutier, bounds for solutions to Thue–Mahler equations due to Bugeaud and Gyory, and the modular approach via Galois representations of Frey-Hellegouarch elliptic curves. This is joint work with Mike Bennett (UBC), Adela Gherga (Warwick) and Samir Siksek (Warwick).

In 2008 Pila and Zannier used a Theorem coming from Logic, proven by Pila and Wilkie, to give a new proof of the Manin-Mumford Conjecture, creating a new, powerful way to prove Theorems in Diophantine Geometry. The Pila-Wilkie Theorem gives an upper bound on the number of rational points on analytic varieties which are not algebraic; this bound usually contradicts a Galois-theoretic bound obtained by arithmetic considerations. We show how this technique can be applied to the following problem of Lang: given an irreducible polynomial f(x,y) in C[x,y], if for infinitely many pairs of roots of unity (a,b) we have f(a,b)=0, then f(x,y) is either of the form x^my^n-c or x^m-cy^n for c a root of unity.

Let $A$ be an $n$ by $n$ matrix or a bounded linear operator on a complex Hilbert space $(H, \langle \cdot , \cdot \rangle , \| \cdot \|)$. A closed set $\Omega \subset \mathbb{C}$ is a $K$-spectral set for $A$ if the spectrum of $A$ is contained in $\Omega$ and if, for all rational functions $f$ bounded in $\Omega$, the following inequality holds:
\[\| f(A) \| \leq K \| f \|_{\Omega} ,\]
where $\| \cdot \|$ on the left denotes the norm in $H$ and $\| \cdot \|_{\Omega}$ on the right denotes the $\infty$-norm on $\Omega$. A simple way to obtain a $K$ value for a given set $\Omega$ is to use the Cauchy integral formula and replace the norm of the integral by the integral of the resolvent norm:
\[f(A) = \frac{1}{2 \pi i} \int_{\partial \Omega} ( \zeta I - A )^{-1}
f( \zeta )\,d \zeta \Rightarrow
\| f(A) \| \leq \frac{1}{2 \pi} \left( \int_{\partial \Omega}
\| ( \zeta I - A )^{-1} \|~| d \zeta | \right) \| f \|_{\Omega} .\]
Thus one can always take
\[K = \frac{1}{2 \pi} \int_{\partial \Omega} \| ( \zeta I - A )^{-1} \| | d \zeta | .\]
In M. Crouzeix and A. Greenbaum, Spectral sets: numerical range and beyond, SIAM J. Matrix Anal. Appl., 40 (2019), pp. 1087-1101, different bounds on $K$ were derived.  I will show how these compare to that from the Cauchy integral formula for a variety of applications.  In case $A$ is a matrix and $\Omega$ is simply connected, we can numerically compute what we believe to be the optimal value for $K$ (and, at least, is a lower bound on $K$).  I will show how these values compare with the proven bounds as well.

(joint with  Michel Crouzeix and Natalie Wellen)
 

---

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

Junior Strings is a seminar series where DPhil students present topics of common interest that do not necessarily overlap with their own research area. This is primarily aimed at PhD students and post-docs but everyone is welcome

Connectivity and percolation are two well studied phenomena in random graphs. 

In this talk we will discuss higher-dimensional analogues of connectivity and percolation that occur in random simplicial complexes.

Simplicial complexes are a natural generalization of graphs that consist of vertices, edges, triangles, tetrahedra, and higher dimensional simplexes.

We will mainly focus on random geometric complexes. These complexes are generated by taking the vertices to be a random point process, and adding simplexes according to their geometric configuration.

Our generalized notions of connectivity and percolation use the language of homology - an algebraic-topological structure representing cycles of different dimensions.

In this talk we will discuss recent results analyzing phase transitions related to these topological phenomena. 

Previous joint work with Caroline Terry had identified model-theoretic stability as a sufficient condition for the existence of strong arithmetic regularity decompositions in finite abelian groups, pioneered by Ben Green around 2003. 
Higher-order arithmetic regularity decompositions, based on Tim Gowers’s groundbreaking work on Szemerédi’s theorem in the late 90s, are an essential part of today's arithmetic combinatorics toolkit.
In this talk, I will describe recent joint work with Caroline Terry in which we define a natural higher-order generalisation of stability and prove that it implies the existence of particularly efficient higher-order arithmetic regularity decompositions in the setting of finite elementary abelian groups. If time permits, I will briefly outline some analogous results we obtain in the context of hypergraph regularity decompositions.

We will record some surprising and lesser-known properties of free groups, and use these to give a model theoretic analysis of free group automorphisms and orbits under Aut(F). This will result in a neat geometric description of (a logic-flavoured analogue of) algebraic closures in a free group. An almost immediate corollary will be that elementary subgroups of a free group are free factors.

I will assume no familiarity with first-order logic and model theory - the beginning of the talk will be devoted to familiarize everyone with the few required notions.

Aimed: An introduction to the nonlinear theory of hyperbolic PDEs, as well as its close connections with the other areas of mathematics and wide range of applications in the sciences.

In this talk, I will explain how to obtain the space of local operators of a 4d N=2 gauge theory using the category of line operators in the Kapustin twist (holomorphic topological twist). This category is given a precise definition by Cautis-Williams, as the category of equivariant coherent sheaves on the space of Braverman-Finkelberg-Nakajima. We compute the derived endomorphism of the monoidal unit in this category, and show that it coincides with the vacuum module of the Poisson vertex algebra of Oh-Yagi and Butson. The Euler character of this space reproduces the Schur index. I will also explain how to obtain the space of local operators at the junction of minimal Wilson-t’Hooft line operators. Its Euler character can be compared to the index formula of Cordova-Gaiotto-Shao. This is based on arXiv: 2112.12164.

In the late 1980s, Berger and Coburn showed that the Hankel operator $H_f$ on the Segal-Bargmann space of Gaussian square-integrable entire functions is compact if and only if $H_{\bar f}$ is compact using C*-algebra and Hilbert space techniques. I will briefly discuss this and three other proofs, and then consider the question of whether an analogous phenomenon holds for Schatten class Hankel operators. 

I will present a collection of moment computations over the unitary, symplectic and special orthogonal matrix ensembles that I've done throughout my thesis. I will focus on the methods used, the motivation from number theory, the relationship to Painlev\'e equations, and directions for future work.

Measures of discrete curvature are a recent addition to the toolkit of network analysts and data scientists. At the basis lies the idea that networks and other discrete objects exhibit distinct geometric properties that resemble those of smooth objects like surfaces and manifolds, and that we can thus find inspiration in the tools of differential geometry to study these discrete objects. In this talk, I will introduce how this has lead to the development of notions of discrete curvature, and what they are good for. Furthermore, I will discuss our latest results on a new notion of curvature on graphs, based on the effective resistance. These new "resistance curvatures" are related to other well-known notions of discrete curvature (Ollivier, Forman, combinatorial curvature), we find evidence for convergence to continuous curvature in the case of Euclidean random graphs and there is a naturally associated discrete Ricci flow.

A preprint on this work is available on arXiv: https://arxiv.org/abs/2201.06385

The placenta is the essential organ of maternal-fetal interactions, where nutrient, oxygen, and waste exchange occur. In recent studies, differences in the morphology of the placental chorionic surface vascular network (PCSVN) have been associated with developmental disorders such as autism. This suggests that the PCSVN could potentially serve as a biomarker for the early diagnosis and treatment of autism. Studying PCSVN features in large cohorts requires a reliable and automated mechanism to extract the vascular networks. In this talk, we present a method for PCSVN extraction. Our algorithm builds upon a directional multiscale mathematical framework based on a combination of shearlets and Laplacian eigenmaps and can isolate vessels with high success in high-contrast images such as those produced in CT scans. 

I’ll review a new, simpler explanation for the large-scale properties of the
cosmos, presented with L. Boyle in our recent preprint arXiv:2201.07279. The
basic ingredients are elementary and well-known, namely Einstein’s theory of
gravity and Hawking’s method of computing gravitational entropy. The new
twist is provided by the boundary conditions we proposed for big bang-type
singularities, allowing conformal zeros but imposing CPT symmetry and

analyticity at the bang. These boundary conditions, which have significant
overlap with Penrose’s Weyl curvature hypothesis, allow gravitational
instantons for universes with Lambda, massless radiation and space
curvature, of either sign, from which we are able to infer a gravitational
entropy. We find the gravitational entropy can exceed the de Sitter entropy
and that, to the extent that it does, the most probable large-scale geometry
for the universe is flat, homogeneous and isotropic. I will briefly
summarise our earlier work showing how the gauge-fermion Lagrangian of the
standard model may be reconciled with Weyl symmetry and a small cosmological
constant, at leading order, provided there are precisely three generations
of fermions. The same mechanism generates scale-invariant primordial
perturbations. The cosmic dark matter consists of a right-handed neutrino.
In summary, we have taken significant steps towards a new, highly principled
and testable theory of cosmology.

The soap bubble theorem says that a closed, embedded surface of the Euclidean space with constant mean curvature must be a round sphere. Especially in real-life problems it is of importance whether and to what extent this phenomenon is stable, i.e. when a surface with almost constant mean curvature is close to a sphere. This problem has been receiving lots of attention until today, with satisfactory recent solutions due to Magnanini/Poggesi and Ciraolo/Vezzoni.
The purpose of this talk is to discuss further problems of this type and to provide two approaches to their solutions. The first one is a new general approach based on stability of the so-called "Nabelpunktsatz". The second one is of variational nature and employs the theory of curvature flows. 

Minimal Lagrangian maps play an important role in Teichmüller theory, with important existence and uniqueness results for hyperbolic surfaces obtained by Labourie, Schoen, Bonsante-Schlenker, Toulisse and others. In positive curvature, it is thus natural to ask whether one can find minimal Lagrangian diffeomorphisms between two spherical surfaces with cone points. In this talk we will show that the answer is negative, unless the two surfaces are isometric. As an application, we obtain a generalization of Liebmann’s theorem for branched immersions of constant curvature in Euclidean space. This is joint work with Christian El Emam.

Let $\Gamma$ be a finite subgroup of $SL(2, \mathbb{C})$. We can attach several different moduli spaces to the action of $\Gamma$ on $\mathbb{C}^2$, and we show how Nakajima's quiver varieties provide constructions of them. The definition of such a quiver variety depends on a stability parameter, and we are especially interested in what happens when this parameter moves into a specific ray in its associated wall-and-chamber structure. Some of the resulting quiver varieties can be understood as moduli spaces of certain framed sheaves on an appropriate stacky compactification of the Kleinian singularity $\mathbb{C}^2/\Gamma$. As a special case, this includes the punctual Hilbert schemes of $\mathbb{C}^2/\Gamma$.

Much of this is joint work with A. Craw, Á. Gyenge, and B. Szendrői.

Blind deconvolution problems are ubiquitous in many areas of imaging and technology and have been the object of study for several decades. Recently, motivated by the theory of compressed sensing, a new viewpoint has been introduced, motivated by applications in wireless application, where a signal is transmitted through an unknown channel. Namely, the idea is to randomly embed the signal into a higher dimensional space before transmission. Due to the resulting redundancy, one can hope to recover both the signal and the channel parameters. In this talk we analyze convex approaches based on lifting as they have first been studied by Ahmed et al. (2014). We show that one encounters a fundamentally different geometric behavior as compared to generic bilinear measurements. Namely, for very small levels of deterministic noise, the error bounds based on common paradigms no longer scale linearly in the noise level, but one encounters dimensional constants or a sublinear scaling. For larger - arguably more realistic - noise levels, in contrast, the scaling is again near-linear.

This is joint work with Yulia Kostina (TUM) and Dominik Stöger (KU Eichstätt-Ingolstadt).

Great progress has been made recently in exploiting categorical/topological/higher symmetries in quantum field theory. I will explain how the same structure is realised directly in the lattice models of statistical mechanics, generalizing Kramers-Wannier duality to a wide class of models. In particular, I will give an overview of my work with Aasen and Mong on using fusion categories to find and analyse lattice topological defects in two and 1+1 dimensions.  These defects possess a variety of remarkable properties. Not only is the partition function is independent of deformations of their path, but they can branch and fuse in a topologically invariant fashion.  The universal behaviour under Dehn twists gives exact results for scaling dimensions, while gluing a topological defect to a boundary allows universal ratios of the boundary g-factor to be computed exactly on the lattice.  I also will describe how terminating defect lines allows the construction of fractional-spin conserved currents, giving a linear method for Baxterization, I.e. constructing integrable models from a braided tensor category.

We will consider line defects in d-dimensional CFTs. The ambient CFT places nontrivial constraints on renormalization group flows on such line defects. We will see that the flow on line defects is consequently irreversible and furthermore a canonical decreasing entropy function exists. This construction generalizes the g theorem to line defects in arbitrary dimensions. We will demonstrate this generalization in some concrete examples, including a flow between Wilson loops in 4 dimensions, and an O(3) bosonic theory coupled to an impurity in the large spin representation of the bulk global symmetry.

Topological data analysis is starting to establish itself as a powerful and effective framework in machine learning , supporting the analysis of neural networks, but also driving the development of novel algorithms that incorporate topological characteristics. As a problem class, graph representation learning is of particular interest here, since graphs are inherently amenable to a topological description in terms of their connected components and cycles. This talk will provide
an overview of how to address graph learning tasks using machine learning techniques, with a specific focus on how to make such techniques 'topology-aware.' We will discuss how to learn filtrations for graphs and how to incorporate topological information into modern graph neural networks, resulting in provably more expressive algorithms. This talk aims to be accessible to an audience of TDA enthusiasts; prior knowledge of machine learning is helpful but not required.

My seminar will discuss various data-science issues related to
neurogenomics. First, I will focus on classic disorders of the brain,
which affect nearly a fifth of the world's population. Robust
phenotype-genotype associations have been established for several
psychiatric diseases (e.g., schizophrenia, bipolar disorder). However,
understanding their molecular causes is still a challenge. To address
this, the PsychENCODE consortium generated thousands of transcriptome
(bulk and single-cell) datasets from 1,866 individuals. Using these
data, we have developed interpretable machine learning approaches for
deciphering functional genomic elements and linkages in the brain and
psychiatric disorders. Specifically, we developed a deep-learning
model embedding the physical regulatory network to predict phenotype
from genotype. Our model uses a conditional Deep Boltzmann Machine
architecture and introduces lateral connectivity at the visible layer
to embed the biological structure learned from the regulatory network
and QTL linkages. Our model improves disease prediction (6X compared
to additive polygenic risk scores), highlights key genes for
disorders, and imputes missing transcriptome information from genotype
data alone. Next, I will look at the "data exhaust" from this activity
- that is, how one can find other things from the genomic analyses
than what is necessarily intended. I will focus on genomic privacy,
which is a main stumbling block in tackling problems in large-scale
neurogenomics. In particular, I will look at how the quantifications
of expression levels can reveal something about the subjects studied
and how one can take steps to sanitize the data and protect patient
anonymity. Finally, another stumbling block in neurogenomics is more
accurately and precisely phenotyping the individuals. I will discuss
some preliminary work we've done in digital phenotyping.

The Bruhat-Tits building is a mysterious combinatorial gadget that encodes key information about the structure and representation theory of a p-adic group. In this talk we will talk about apartments, buildings, and all the furnishings therein to hopefully demystify this beautiful subject.