webnotice

Yash Singh, University of Waterloo

Buildings of reductive groups.

We study an algebraic construction of the spherical building of the reductive group due to Halpern-Leistner and a connection between this construction and the classification of toric vector bundles by Kiaveh-Manon.

MC 5403

Tommaso Pacini, University of Torino

Kahler techniques beyond Kahler geometry: the case of pluripotential theory

Classical pluripotential theory was introduced into complex analysis in the 1940's, as an analogue of the theory of convex functions. In the early 2000's, Harvey and Lawson showed that both pluripotential theory and many of its analytic applications make sense in a much broader setting.

Starting with the work of Calabi in the 1950's, however, it has become clear that pluripotential theory is central also to Kahler geometry. In particular, it is closely related to the cohomology of Kahler manifolds via Hodge theory and the ddbar lemma, and it provides one of the main ingredients in proving the existence of canonical metrics.

Work in progress, joint with A. Raffero, shows how parts of this "second life" of pluripotential theory extend to other geometries, hinting towards new research directions in the field of calibrated geometry and manifolds with special holonomy.

The goal of this talk will be to present a non-technical overview of some of these topics, aimed at non-specialists.

MC 5501

Jules Ribolzi, University of Waterloo

Meromorphic groups

We continue the proof that definable groups in CCM are meromorphic.

MC 5479

Aareyan manzoor, University of Waterloo

1 bounded entropy, strong convergence and peterson thom conjecture

I will introduce 1 bounded entropy and show connections to strong convergence. We will discuss how this was used to resolve the peterson thom conjecture, which says that every amenable and diffuse subalgebra of free group factors are contained in a unique maximal amenable subalgebra.

MC 5479

Leigh Foster, University of Waterloo

Proving the count of boxed plane partitions (box stackings) via the RSK algorithm

The study of lozenge tilings and of the dimer model is a well-established area of research, going back to the 1960's and still subject to active research at present. We will start the learning seminar on this topic with a series of three meetings giving an introduction to the dimer model in its single-dimer version, and considered on a finite hexagonal grid.

This week, we will present a proof of Percy MacMahon's generating functions plane partitions. We will use (a modified version of) the RSK algorithm, also known as the Robinson–Schensted–Knuth correspondence. This gives a count of dimer covers on the hexagonal grid, lozenge tilings of the triangular lattice, and plane partitions, as well as other combinatorial objects.

No prior knowledge of RSK, plane partitions, or much combinatorics is required, and participation is encouraged! Come and learn and ask your questions.

MC 5403

Chi Hoi Yip, Georgia Institute of Technology

Inverse sieve problems

Many problems in number theory boil down to bounding the size of a set contained in a certain set of residue classes mod p for various sets of primes p; and then sieve methods are the primary tools for doing so. Motivated by the inverse Goldbach problem, Green–Harper, Helfgott–Venkatesh, Shao, and Walsh have explored the inverse sieve problem: if we let S \subseteq N be a maximal set of integers in this interval where the residue classes mod p occupied by S have some particular pattern for many primesp, what can one say about the structure of the set S beyond just its size? In this talk, I will give a gentle introduction to inverse sieve problems, and present some progress we made when S mod p has rich additive structure for many primes p. In particular, in this setting, we provide several improvements on the larger sieve bound for |S|, parallel to the work of Green--Harper and Shao for improvements on the large sieve. Joint work with Ernie Croot and Junzhe Mao.

MC 5479 or Join on Zoom

Paul Cusson , University of Waterloo

Spectral curves of Euclidean SU(N)-monopoles

Monopoles over Euclidean R^3 with gauge group SU(N), originally analytic objects, can be studied using the algebro-geometric properties of their spectral curves. We will discuss known results about these curves and how they depend on the asymptotics of the monopole's Higgs field. We will then go over some elementary results that restrict the possible degrees of the spectral curves when we impose symmetries on these monopoles from finite subgroups of SO(3)
MC 5403

Diego Bejarano, York University

Definability and Scott rank in separable metric structures

In [2], Ben Yaacov et. al. extended the basic ideas of Scott analysis to metric structures in infinitary continuous logic. These include back-and-forth relations, Scott sentences, and the Lopez-Escobar theorem to name a few. In this talk, I will talk on my work connecting the ideas of Scott analysis to the definability of automorphism orbits and a notion of isolation for types within separable metric structures. Our results are a continuous analogue of the more robust Scott rank developed by Montalbán in [3] for countable structures in discrete infinitary logic. However, there are some differences arising from the subtleties behind the notion of definability in continuous logic.

[1] Diego Bejarano, Definability and Scott rank in separable metric structures, https://arxiv.org/abs/2411.01017,

[2] Itaï Ben Yaacov, Michal Doucha, Andre Nies, and Todor Tsankov, Metric Scott analysis, Advances in Mathematics, vol. 318 (2017), pp.46–87.

[3] Antonio Montalbán, A robuster Scott rank, Proceedings of the American Mathematical Society, vol.143 (2015), no.12, pp.5427–5436.

MC 5417

Nikita Lvov

Random Walks arising in Random Matrix Theory

The cokernel of a large p-adic random matrix M is a random abelian p-group. Friedman and Washington showed that its distribution asymptotically tends to the well-known Cohen-Lenstra distribution. We study an irreducible Markov chain on the category of finite abelian p-groups, whose stationary measure is the Cohen-Lenstra distribution. This Markov chain arises when one studies the cokernels of corners of M. We show two surprising facts about this Markov chain. Firstly, it is reversible. Hence, one may regard it as a random walk on finite abelian p-groups. The proof of reversibility also explains the appearance of the Cohen-Lenstra distribution in the context of random matrices. Secondly, we can explicitly determine the spectrum of the infinite transition matrix associated to this Markov chain. Finally, we show how these results generalize to random matrices over general pro-finite local rings.

MC 5403

Beining Mu, University of Waterloo

Algorithmic randomness and Turing degrees 4

In this seminar we will talk about the Hyperimmune-Free Basis Theorem and its application to understanding the distribution of 1-random Turing degrees. In addition, we will also cover Demuth's Theorem and its applications.

MC 5403