16:00
Coherence in Dimension 2
Abstract
A group is coherent if all its finitely generated subgroups are finitely presented. Aside from some easy cases, it appears that coherence is a phenomenon that occurs only among groups of cohomological dimension 2. In this talk, we will give many examples of coherent and incoherent groups, discuss techniques to prove a group is coherent, and mention some open problems in the area.
Mathematrix x Mirzakhani: Women and Non-Binary People Coffee and Cake
Abstract
This is a joint event by the Mathematrix and Mirzakhani Societies for all women and non-binary people in the Maths department. Join us in the South Mezzanine for some hot drinks and sweet treats.
11:00
Weak coupling limit for polynomial stochastic Burgers equations in $2d$
Abstract
We explore the weak coupling limit for stochastic Burgers type equation in critical dimension, and show that it is given by a Gaussian stochastic heat equation, with renormalised coefficient depending only on the second order Hermite polynomial of the nonlinearity. We use the approach of Cannizzaro, Gubinelli and Toninelli (2024), who treat the case of quadratic nonlinearities, and we extend it to polynomial nonlinearities. In that sense, we extend the weak universality of the KPZ equation shown by Hairer and Quastel (2018) to the two dimensional generalized stochastic Burgers equation. A key new ingredient is the graph notation for the generator. This enables us to obtain uniform estimates for the generator. This is joint work with Nicolas Perkowski.
16:00
A unified approach for classifying simple nuclear C*-algebras
Abstract
The classification program of C*-algebras aims to classify simple, separable, nuclear C*-algebras by their K-theory and traces, inspired by analogous results obtained for von Neumann algebras. A landmark result in this project was obtained in 2015, building upon the work of numerous researchers over the past 20 years. More recently, Carrión, Gabe, Schafhauser, Tikuisis, and White developed a new, more abstract approach to classification, which connects more explicitly to the von Neumann algebraic classification results. In their paper, they carry out this approach in the stably finite setting, while for the purely infinite case, they refer to the original result obtained by Kirchberg and Phillips. In this talk, I provide an overview of how the new approach can be adapted to classify purely infinite C*-algebras, recovering the Kirchberg-Phillips classification by K-theory and obtaining Kirchberg's absorption theorems as corollaries of classification rather than (pivotal) ingredients. This is joint work with Jamie Gabe.
16:00
Simultaneous extreme values of zeta and L-functions
Abstract
15:00
Universal localizations, Atiyah conjectures and graphs of groups
Abstract
The study of the rationality of the $L^2$-Betti numbers of a countable group has led to the development of a rich theory in $L^2$-homology with deep implications in structural properties of the groups. For decades almost nothing has been known about the general question of whether the strong Atiyah conjecture passes to free products of groups or not. In this talk, we will confirm that the strong and algebraic Atiyah conjectures are stable under the graph of groups construction provided that the edge groups are finite. Moreover, we shall see that in this case the $\ast$-regular closure of the group algebra is precisely a universal localization of the associated graph of rings
Maria Pope: Uncovering Higher-Order Interactions in the Cortex: Applications of Multivariate Information Theory
Abstract
Creating networks of statistical dependencies between brain regions is a powerful tool in neuroscience that has resulted in many new insights and clinical applications. However, recent interest in higher-order interactions has highlighted the need to address beyond-pairwise dependencies in brain activity. Multivariate information theory is one tool for identifying these interactions and is unique in its ability to distinguish between two qualitatively different modes of higher-order interactions: synergy and redundancy. I will present results from applying the O-information, the partial entropy decomposition, and the local O-information to resting state fMRI data. Each of these metrics indicate that higher-order interactions are widespread in the cortex, and further that they reveal different patterns of statistical dependencies than those accessible through pairwise methods alone. We find that highly synergistic subsystems typically sit between canonical functional networks and incorporate brain regions from several of these systems. Additionally, canonical networks as well as the interactions captured by pairwise functional connectivity analyses, are strongly redundancy-dominated. Finally, redundancy/synergy dominance varies in both space and time throughout an fMRI scan with notable recurrence of sets of brain regions engaging synergistically. As a whole, I will argue that higher-order interactions in the brain are an under-explored space that, made accessible with the tools of multivariate information theory, may offer novel insights.
Exponential Improvement for Multicolour Ramsey
Abstract
We give an exponential improvement on the upper bound for the $r$-colour diagonal Ramsey number for all $r$. The proof relies on geometric insights and offers a simplified proof in the case of $r=2$.
Joint Work with: Paul Ballister, Béla Bollobás, Marcelo Campos, Simon Griffiths, Rob Morris, Julian Sahasrabudhe and Marius Tiba.
A recursive formula for plethysm coefficients and some applications
Abstract
Plethysms lie at the intersection of representation theory and algebraic combinatorics. We give a recursive formula for a family of plethysm coefficients encompassing those involved in Foulkes' Conjecture. We also describe some applications, such as to the stability of plethysm coefficients and Sylow branching coefficients for symmetric groups. This is joint work with Y. Okitani.
13:00
Heterotic islands
Abstract
In this talk I will discuss asymmetric orbifolds and will focus on their application to toroidal compactifications of heterotic string theory. I will consider theories in 6 and 4 dimensions with 16 supercharges and reduced rank. I will present a novel formalism, based on the Leech lattice, to construct ‘islands’ without vector multiplets.
16:30
Thomas-Fermi type models of external charge screening in graphene
Abstract
We propose a density functional theory of Thomas-Fermi-(von Weizsacker) type to describe the response of a single layer of graphene to a charge some distance away from the layer. We formulate a variational setting in which the proposed energy functional admits minimizers. We further provide conditions under which those minimizers are unique. The associated Euler-Lagrange equation for the charge density is also obtained, and uniqueness, regularity and decay of the minimizers are proved under general conditions. For a class of special potentials, we also establish a precise universal asymptotic decay rate, as well as an exact charge cancellation by the graphene sheet. In addition, we discuss the existence of nodal minimizers which leads to multiple local minimizers in the TFW model. This is a joint work with Cyrill Muratov (University of Pisa).
16:00
Monochromatic non-commuting products
Abstract
We show that any finite coloring of an amenable group contains 'many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and McCutcheon's non-commutative Schur theorem. Our main new tool is the introduction of what we call `quasirandom colorings,' a condition that is automatically satisfied by colorings of quasirandom groups, and a reduction to this case.
15:30
Large deviations for the Φ^4_3 measure via Stochastic Quantisation
Abstract
14:15
Machine learning detects terminal singularities
Abstract
In this talk, I will describe recent work in the application of machine learning to explore questions in algebraic geometry, specifically in the context of the study of Q-Fano varieties. These are Q-factorial terminal Fano varieties, and they are the key players in the Minimal Model Program. In this work, we ask and answer if machine learning can determine if a toric Fano variety has terminal singularities. We build a high-accuracy neural network that detects this, which has two consequences. Firstly, it inspires the formulation and proof of a new global, combinatorial criterion to determine if a toric variety of Picard rank two has terminal singularities. Secondly, the machine learning model is used directly to give the first sketch of the landscape of Q-Fano varieties in dimension eight. This is joint work with Tom Coates and Al Kasprzyk.
Extended Pareto grid: a tool to compute the matching distance in biparameter persistent homology
Abstract
Multiparameter persistence is an area of topological data analysis that synthesises the geometric information of a topological space via filtered homology. Given a topological space and a function on it, one can consider a filtration given by the sublevel sets of the space induced by the function and then take the homology of such filtration. In the case when the filtering function assumes values in the real plane, the homological features of the filtered object can be recovered through a "curved" grid on the plane called the extended Pareto grid of the function. In this talk, we explore how the computation of the biparameter matching distance between regular filtering functions on a regular manifold depends on the extended Pareto grid of these functions.
Making the Most of Intercollegiate Classes
Abstract
What should you expect in intercollegiate classes? What can you do to get the most out of them? In this session, experienced class tutors will share their thoughts, and a current student will offer tips and advice based on their experience.
All undergraduate and masters students welcome, especially Part B and MSc students attending intercollegiate classes. (Students who attended the Part C/OMMS induction event will find significant overlap between the advice offered there and this session!)
Distinction of unramified principal series representations for GLm(F)
Abstract
Let F be a p-adic field. In this talk I'll study the Om(F)-distinction of some specific principal series representations of Glm(F). The main goal is to give a computing method to see if those representations are distinguished or not so we can also explicitly find a non zero Om(F)-equivariant linear form. This linear form will be given by the integral of the representation's matrix coefficient over Om(F).
After explaining on what specific principal series representations I'm working and why I need those specificities, I'll explain the different steps to compute the integral of my representation's matrix coefficient over Om(F). I'll explicitly give the obtained result for the case m=3. After that I'll explain an asymptotic result we can obtain when we can't compute the integral explicitly.
Novel multi-omics approaches to understand immune cell biology in health and disease
Abstract
Immunological health relies on a balance between the ability to mount an immune response against potential pathogens and tolerance to self. However, how we keep that balance in health and what goes wrong in disease is not well understood. Here, I will describe combination of novel experimental and computational approaches using multi-omics datasets, imaging and functional experiments to dissect the role and defects in immune cells across several disease areas in cancer and autoimmunity. We show how shared mechanisms that are disrupted across diseases, including cellular, migration, immuno-surveillance, regulation and activation, as well as the immunological features associated with better prognosis and immunomodulation.
17:00
Definable convolution and idempotent Keisler measures
Abstract
Given a locally compact topological group, there is a correspondence between idempotent probability measures and compact subgroups. An analogue of this correspondence continues into the model theoretic setting. In particular, if G is a stable group, then there is a one-to-one correspondence between idempotent Keisler measures and type-definable subgroups. The proof of this theorem relies heavily on the theory of local ranks in stability theory. Recently, we have been able to extend a version of this correspondence to the abelian setting. Here, we prove that fim idempotent Keisler measures correspond to fim subgroups. These results rely on recent work of Conant, Hanson and myself connecting generically stable measures to generically stable types over the randomization. This is joint work with Artem Chernikov and Krzysztof Krupinski.
16:00
Risk, utility and sensitivity to large losses
Abstract
Please join us for refreshments outside the lecture room from 15:30.
16:00
Primes of the form $x^2 + ny^2$ with $x$ and $y$ prime
Abstract
If $n$ is congruent to 0 or 4 modulo 6, there are infinitely many primes of the form $x^2 + ny^2$ with both $x$ and $y$ prime. (Joint work with Mehtaab Sawhney, Columbia)
On the loss of orthogonality in low-synchronization variants of reorthogonalized block classical Gram-Schmidt
Abstract
Numerical examples from the BlockStab toolbox are included throughout, to help compare variants and illustrate the effects of different choices of intraorthogonalization subroutines.
Backward error for nonlinear eigenvalue problems
Abstract
The backward error analysis is an important part of the perturbation theory and it is particularly useful for the study of the reliability of the numerical methods. We focus on the backward error for nonlinear eigenvalue problems. In this talk, the matrix-valued function is given as a linear combination of scalar functions multiplying matrix coefficients, and the perturbation is done on the coefficients. We provide theoretical results about the backward error of a set of approximate eigenpairs. Indeed, small backward errors for separate eigenpairs do not imply small backward errors for a set of approximate eigenpairs. In this talk, we provide inexpensive upper bounds, and a way to accurately compute the backward error by means of direct computations or through Riemannian optimization. We also discuss how the backward error can be determined when the matrix coefficients of the matrix-valued function have particular structures (such as symmetry, sparsity, or low-rank), and the perturbations are required to preserve them. For special cases (such as for symmetric coefficients), explicit and inexpensive formulas to compute the perturbed matrix coefficients are also given. This is a joint work with Leonardo Robol (University of Pisa).
Microswimmer motility and natural robustness in pattern formation: the emergence and explanation of non-standard multiscale phenomena
Abstract
Organisational meeting
Abstract
Please attend if you would like to give a talk in the Logic Advanced Class this term.
16:00
Solvability and Order Type for Finite Groups
Abstract
How much can the order type - the list of element orders (with multiplicities)—reveal about the structure of a finite group G? Can it tell us whether G is abelian, nilpotent? Can it always determine whether G is solvable?
This last question was posed in 1987 by John G. Thompson and I answered it negatively this year. The search for a counterexample was quite a puzzle hunt! It involved turning the problem into linear algebra and solving an integer matrix equation Ax=b. This would be easy if not for the fact that the size of A was 100,000 by 10,000…
11:00
Large Values and Moments of the Riemann Zeta Function
Abstract
I will explain the recent techniques developed with co-authors to obtain fine estimates about the large values of the Riemann zeta functions on the critical line. An emphasis will be put on the ideas originating from statistical mechanics and large deviations that may be of general interest for a stochastic analysis audience. No number theory knowledge will be assumed!
16:00
The third moment of the logarithm of the Riemann zeta function
Abstract
I will present joint work with Alessandro Fazzari in which we prove precise conditional estimates for the third (non-absolute) moment of the logarithm of the Riemann zeta function, beyond the Selberg central limit theorem, both for the real and imaginary part. These estimates match predictions made in work of Keating and Snaith. We require the Riemann Hypothesis, a conjecture for the triple correlation of Riemann zeros and another ``twisted'' pair correlation conjecture which captures the interaction of a prime power with Montgomery's pair correlation function. This conjecture can be proved on a certain subrange unconditionally, and on a larger range under the assumption of a variant of the Hardy-Littlewood conjecture with good uniformity.
16:00
Continuous selection in II1 factors
Abstract
In this talk, based on a joint work with Ilijas Farah, I will present an application of an old continuous selection theorem due to Michael to the study of II1 factors. More precisely, I'll show that if two strongly continuous paths (or loops) of projections (p_t), (q_t), for t in [0,1], in a II1 factor are such that every p_t is subequivalent to q_t, then the subequivalence can be realized by a strongly continuous path (or loop) of partial isometries. I will then use an extension of this result to solve affirmatively the so-called trace problem for factorial W*-bundles whose base space is 1-dimensional.
15:00
Random walks on Gromov-hyperbolic spaces
Abstract
I will describe some recent developments in random walks on Gromov-hyperbolic spaces. I will focus in particular on the notions of Schottky sets and pivoting technique introduced respectively by Boulanger-Mathieu-S-Sisto and Gouëzel and mention some consequences. The talk will be introductory; I will not assume specialized knowledge in probability theory.
14:30
Undergraduate Summer Project Presentations: Computational experiments in the restricted universal enveloping algebra of sl 2
Abstract
The problem of finding an explicit description of the centre of the restricted universal enveloping algebra of sl2 for a general prime characteristic p is still open. We use a computational approach to find a basis for the centre for small p. Building on this, we used a special central element t to construct a complete set of (p+1)/2 orthogonal primitive idempotents e_i, which decompose Z into one 1-dimensional and (p-1)/2 3-dimensional subspaces e_i Z. These allow us to compute e_i N as subspaces of the e_i Z, where N is the largest nilpotent ideal of Z. Looking forward, the results perhaps suggest N is a free k[T] / (T^{(p-1)/2}-1)-module of rank 2.
Spanning spheres in Dirac hypergraphs
Abstract
We show that an $n$-vertex $k$-uniform hypergraph, where all $(k-1)$-subsets that are supported by an edge are in fact supported by at least $n/2+o(n)$ edges, contains a spanning $(k-1)$-dimensional sphere. This generalises Dirac's theorem, and confirms a conjecture of Georgakopoulos, Haslegrave, Montgomery, and Narayanan. Unlike typical results in the area, our proof does not rely on the absorption method or the regularity lemma. Instead, we use a recently introduced framework that is based on covering the vertex set of the host hypergraph with a family of complete blow-ups.
This is joint work with Freddie Illingworth, Richard Lang, Olaf Parczyk, and Amedeo Sgueglia.
14:00
Undergraduate Summer Project Presentations: Spin Representations for Coxeter Groups and Generalised Saxl Conjecture
Abstract
A well-known open problem for representations of symmetric groups is the Saxl conjecture. In this talk, we put Saxl's conjecture into a Lie-theoretical framework and present a natural generalisation to Weyl groups. After giving necessary preliminaries on spin representations and the Springer correspondence, we present our progress on the generalised conjecture. Next, we reveal connections to tensor product decomposition problems in symmetric groups and provide an alternative description of Lusztig’s cuspidal families. Finally, we propose a further generalisation to all finite Coxeter groups.
Mathematrix: Meet and Greet
Abstract
Come along for free Pizza and to hear about the Mathematrix events this term.
13:00
Mirror Symmetry and Level-rank Duality for 3d N=4 Rank 0 SCFTs
Abstract
Three-dimensional QFTs with 8 supercharges (N=4 supersymmetry) are a rich playground rife with connections to mathematics. For example, they admit two topological twists and furnish a three-dimensional analogue of the famous mirror symmetry of two-dimensional N=(2,2) QFTs, creatively called 3d mirror symmetry, that exchanges these twists. Recently, there has been increased interest in so-called rank 0 theories that typically do not admit Lagrangian descriptions with manifest N=4 supersymmetry, but their topological twists are expected to realize finite, semisimple TQFTs which are amenable to familiar descriptions in terms of, e.g., modular tensor categories and/or rational vertex operator algebras. In this talk, based off of joint work (arXiv:2406.00138) with Thomas Creutzig and Heeyeon Kim, I will introduce two families of rank 0 theories exchanged by 3d mirror symmetry and various mathematical conjectures stemming from our analysis thereof.
16:30
Large Population Limit for Interacting Particle Systems on Weighted Graphs
Abstract
When studying interacting particle systems, two distinct categories emerge: indistinguishable systems, where particle identity does not influence system dynamics, and non-exchangeable systems, where particle identity plays a significant role. One way to conceptualize these second systems is to see them as particle systems on weighted graphs. In this talk, we focus on the latter category. Recent developments in graph theory have raised renewed interest in understanding largepopulation limits in these systems. Two main approaches have emerged: graph limits and mean-field limits. While mean-field limits were traditionally introduced for indistinguishable particles, they have been extended to the case of non-exchangeable particles recently. In this presentation, we introduce several models, mainly from the field of opinion dynamics, for which rigorous convergence results as N tends to infinity have been obtained. We also clarify the connection between the graph limit approach and the mean-field limit one. The works discussed draw from several papers, some co-authored with Nastassia Pouradier Duteil and David Poyato.
16:00
Self-Similar Sets and Self-Similar Measures
Abstract
We give a gentle introduction to the theory of self-similar sets and self-similar measures. Connections of this topic to Diophantine approximation on Lie groups as well as to additive combinatorics will be exposed. In particular, we will discuss recent progress on Bernoulli convolutions. If time permits, we mention recent joint work with Samuel Kittle on absolutely continuous self-similar measures.
15:30
A Mean Field Game approach for pollution regulation of competitive firms
Abstract
We develop a model based on mean-field games of competitive firms producing similar goods according to a standard AK model with a depreciation rate of capital generating pollution as a byproduct. Our analysis focuses on the widely-used cap-and-trade pollution regulation. Under this regulation, firms have the flexibility to respond by implementing pollution abatement, reducing output, and participating in emission trading, while a regulator dynamically allocates emission allowances to each firm. The resulting mean-field game is of linear quadratic type and equivalent to a mean-field type control problem, i.e., it is a potential game. We find explicit solutions to this problem through the solutions to differential equations of Riccati type. Further, we investigate the carbon emission equilibrium price that satisfies the market clearing condition and find a specific form of FBSDE of McKean-Vlasov type with common noise. The solution to this equation provides an approximate equilibrium price. Additionally, we demonstrate that the degree of competition is vital in determining the economic consequences of pollution regulation.
This is based on joint work with Gianmarco Del Sarto and Marta Leocata.
15:30
The complexity of knots
Abstract
In his final paper in 1954, Alan Turing wrote `No systematic method is yet known by which one can tell whether two knots are the same.' Within the next 20 years, Wolfgang Haken and Geoffrey Hemion had discovered such a method. However, the computational complexity of this problem remains unknown. In my talk, I will give a survey on this area, that draws on the work of many low-dimensional topologists and geometers. Unfortunately, the current upper bounds on the computational complexity of the knot equivalence problem remain quite poor. However, there are some recent results indicating that, perhaps, knots are more tractable than they first seem. Specifically, I will explain a theorem that provides, for each knot type K, a polynomial p_K with the property that any two diagrams of K with n_1 and n_2 crossings differ by at most p_K(n_1) + p_K(n_2) Reidemeister moves.
14:15
Complete cohomogeneity one solitons for G_2 Laplacian flow
Abstract
Bryant’s Laplacian flow is an analogue of Ricci flow that seeks to flow an arbitrary initial closed $G_2$-structure on a 7-manifold toward a torsion-free one, to obtain a Ricci-flat metric with holonomy $G_2$. This talk will give an overview of joint work with Mark Haskins and Rowan Juneman about complete self-similar solutions on the anti-self-dual bundles of ${\mathbb CP}^2$ and $S^4$, with cohomogeneity one actions by SU(3) and Sp(2) respectively. We exhibit examples of all three classes of soliton (steady, expander and shrinker) that are asymptotically conical. In the steady case these form a 1-parameter family, with a complete soliton with exponential volume growth at the boundary of the family. All complete Sp(2)-invariant expanders are asymptotically conical, but in the SU(3)-invariant case there appears to be a boundary of complete expanders with doubly exponential volume growth.
Complexity of Finding Local Minima in Continuous Optimization
Abstract
Can we efficiently find a local minimum of a nonconvex continuous optimization problem?
We give a rather complete answer to this question for optimization problems defined by polynomial data. In the unconstrained case, the answer remains positive for polynomials of degree up to three: We show that while the seemingly easier task of finding a critical point of a cubic polynomial is NP-hard, the complexity of finding a local minimum of a cubic polynomial is equivalent to the complexity of semidefinite programming. In the constrained case, we prove that unless P=NP, there cannot be a polynomial-time algorithm that finds a point within Euclidean distance $c^n$ (for any constant $c\geq 0$) of a local minimum of an $n$-variate quadratic polynomial over a polytope.
This result (with $c=0$) answers a question of Pardalos and Vavasis that appeared on a list of seven open problems in complexity theory for numerical optimization in 1992.
Based on joint work with Jeffrey Zhang (Yale).
Biography
Amir Ali Ahmadi is a Professor at the Department of Operations Research and Financial Engineering at Princeton University and an Associated Faculty member of the Program in Applied and Computational Mathematics, the Department of Computer Science, the Department of Mechanical and Aerospace Engineering, the Department of Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as the Director of the Certificate Program in Optimization and Quantitative Decision Science. He has also held visiting appointments with the industry, as a Visiting Senior Optimization Fellow at Citadel, Global Quantitative Strategies, and a Visiting Research Scientist at Google Brain (in the Robotics group). Amir Ali received his PhD in EECS from MIT and was a Goldstine Fellow at the IBM Watson Research Center prior to joining Princeton. His research interests are in optimization theory, computational aspects of dynamical systems, control-oriented learning, and algorithms and complexity.
Amir Ali's distinctions include the Sloan Fellowship in Computer Science, the Presidential Early Career Award for Scientists and Engineers (PECASE), the NSF CAREER Award, the AFOSR Young Investigator Award, the DARPA Faculty Award, the Google Faculty Award, the MURI award of the AFOSR, the Howard B. Wentz Junior Faculty Award, as well as the Innovation Award of Princeton University, the Goldstine Fellowship of IBM Research, and the Oberwolfach Fellowship of the NSF. His undergraduate course at Princeton (ORF 363, ``Computing and Optimization'') is a three-time recipient of the Teaching Award of the Princeton Engineering Council, as well as a recipient of the Excellence in Teaching of Operations Research Award of the Institute for Industrial and Systems Engineers, the Princeton SEAS Distinguished Teaching Award, and the Phi Beta Kappa Award for Excellence in Undergraduate Teaching at Princeton. Amir Ali's research has been recognized by a number of best-paper awards, including the INFORMS Optimization Society's Young Researchers Prize, the INFORMS Computing Society Prize (for best series of papers at the interface of operations research and computer science), the best conference paper award of the IEEE International Conference on Robotics and Automation, and the best paper prize of the SIAM Journal on Control and Optimization. Amir Ali was a plenary speaker at the 2021 SIAM Conference on Optimization and the 2022 Colombian Conference on Applied and Industrial Mathematics.
13:30
Black Hole Chemistry, an introduction
Abstract
One recent(ish) development in classical black hole thermodynamics is the inclusion of vacuum energy (cosmological constant) in the form of thermodynamic pressure. New thermodynamic phase transitions emerge in this extended phase space, beyond the usual Hawking—Page transition. This allows us to understand black holes from the viewpoint of chemistry in terms of concepts such as Van Der Waals fluids, reentrant phase transitions and triple points. I will review these developments and discuss the dictionary between the bulk laws and those of the dual CFT.
Finite element approximation of eigenvalue problems
Abstract
In this informal talk I will review some theoretical and practical aspects related to the finite element approximation of eigenvalue problems arising from PDEs.
The review will cover elliptic eigenvalue problems and eigenvalue problems in mixed form, with particular emphasis on the Maxwell eigenvalue problem.
Other topics can be discussed depending on the interests of the audience, including adaptive schemes, approximation of parametric problems, reduced order models.
Matroids with coefficients and Lorentzian polynomials
Abstract
In the first half of the talk, I will briefly survey the theory of matroids with coefficients, which was introduced by Andreas Dress and Walter Wenzel in the 1980s and refined by the speaker and Nathan Bowler in 2016. This theory provides a unification of vector subspaces, matroids, valuated matroids, and oriented matroids. Then, in the second half, I will outline an intriguing connection between Lorentzian polynomials, as defined by Petter Brändén and June Huh, and matroids with coefficients. The second part of the talk represents joint work with June Huh, Mario Kummer, and Oliver Lorscheid.
Analytic K-theory for bornological spaces
Abstract
We define a version of algebraic K-theory for bornological algebras, using the recently developed continuous K-theory by Efimov. In the commutative setting, we prove that this invariant satisfies descent for various topologies that arise in analytic geometry, generalising the results of Thomason-Trobaugh for schemes. Finally, we prove a version of the Grothendieck-Riemann-Roch Theorem for analytic spaces. Joint work with Jack Kelly and Federico Bambozzi.