Virtual

There have been several proposals of scale-separated AdS vacua in the literature. All known examples arise from the effective field theory of flux compactifications with low supersymmetry, and there are often doubts about their consistency as 10 or 11d backgrounds in string theory. These issues can often be tackled in the bulk theory, or by analysis of the dual CFT via holography. I will review the most common issues, and focus the analysis on the recently constructed family of 3d scale-separated AdS vacua, which is dual to a two-dimensional CFT, emphasizing the discrete symmetry structure of the model in comparison to DGKT. Finally, I will comment on the tantalizing observation of integer operator dimensions in DGKT-like vacua, and comment on possible places to look for consistency issues in these models.

In this talk, we discuss existentially closed measure preserving actions of countable groups.  A classical result of Berenstein and Henson shows that the model companion for this class exists for the group of integers and their analysis readily extends to cover all amenable groups.  Outside of the class of amenable groups, relatively little was known until recently, when Berenstein, Henson, and Ibarlucía proved the existence of the model companion for the case of finitely generated free groups.  Their proof relies on techniques from stability theory and is particular to the case of free groups.  In this talk, we will discuss the existence of model companions for measure preserving actions for the much larger class of universally free groups (also known as fully residually free groups), that is, groups which model the universal theory of the free group.  We also give concrete axioms for the subclass of elementarily free groups, that is, those groups with the same first-order theory as the free group.  Our techniques are ergodic-theoretic and rely on the notion of a definable cocycle.  This talk represents ongoing work with Brandon Seward and Robin Tucker-Drob.

The presence of glaciers and ice sheets leaves a significant imprint
on Earth's surface.  We steadily improve our physical understanding of
the involved processes, from the erosion of kilometer-deep fjords in
crystalline bedrock to the broad ice-marginal deposition of sediments.
This talk will highlight observations of landforms, sedimentary deposits,
laboratory experiments, and models that aim to capture the interplay
between ice and substratum.  I show how the interplay may play a role in
the future evolution of the West Antarctic Ice Sheet in a warming climate.

An $r$-uniform tight cycle of length $k>r$ is a hypergraph with vertices $v_1,\ldots,v_k$ and edges $\{v_i,v_{i+1},…,v_{i+r-1}\}$ (for all $i$), with the indices taken modulo $k$. Sós, and independently Verstraëte, asked the following question: how many edges can there be in an $n$-vertex $r$-uniform hypergraph if it contains no tight cycles of any length? In this talk I will review some known results, and present recent progress on this problem.

Random walks are a common model for the exploration and discovery of complex networks. While numerous algorithms have been proposed to map out an unknown network, a complementary question arises: in a known network, which nodes and edges are most likely to be discovered by a random walker in finite time? In this talk we introduce exposure theory, a statistical mechanics framework that predicts the learning of nodes and edges across several types of networks, including weighted and temporal, and show that edge learning follows a universal trajectory. While the learning of individual nodes and edges is noisy, exposure theory produces a highly accurate prediction of aggregate exploration statistics. As a specific application, we extend exposure theory to better understand human learning with its typical mental errors, and thus account for distortions of learned networks.

This talk is based on https://arxiv.org/abs/2202.11262

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 introduce a classification tool for mathematical theories based on Robinson's notion of model companionship; roughly the idea is to attach to a mathematical theory $T$ those signatures $L$ such that $T$ as axiomatized in $L$ admits a model companion. We also introduce a slight strengthening of model companionship (absolute model companionship - AMC) which characterize those model companionable $L$-theories $T$ whose model companion is axiomatized by the $\Pi_2$-sentences for $L$ which are consistent with the universal theory of any $L$-model of $T$.

We use the above to analyze set theory, and we show that the above classification tools can be used to extract (surprising?) information on the continuum problem.

Affine Hecke algebras and their representations play an important role in the representation theory of p-adic groups since they classify smooth representations generated by Iwahori-fixed vectors. The Deligne-Langlands correspondence, which was proved by Kazhdan and Lusztig, parametrises these representations by geometric data on the Langlands dual group. This talk is supposed to be a gentle introduction to this topic. I will also briefly talk about how this correspondence can be lifted to the derived level.

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.

Las Vergnas and Meyniel conjectured in 1981 that all the $t$-colorings of a $K_t$-minor free graph are Kempe equivalent. This conjecture can be seen as a reconfiguration counterpoint to Hadwiger's conjecture, although it neither implies it or is implied by it. We prove that for all positive $\epsilon$, for all large enough $t$, there exists a graph with no $K_{(2/3 + \epsilon)t}$ minor whose $t$-colorings are not all Kempe equivalent, thereby strongly disproving this conjecture, along with two other conjectures of the same paper.