Difference between revisions of "Colloquia"
(→Fall 2019) |
(→Fall 2019) |
||
Line 73: | Line 73: | ||
|Erman | |Erman | ||
|- | |- | ||
− | |Nov | + | |Nov 13 '''Wednesday 4-5pm''' |
|Ananth Shankar (MIT) | |Ananth Shankar (MIT) | ||
|Exceptional splitting of abelian surfaces | |Exceptional splitting of abelian surfaces |
Revision as of 14:16, 8 November 2019
Contents
- 1 Mathematics Colloquium
- 1.1 Fall 2019
- 1.2 Spring 2020
- 1.3 Abstracts
- 1.3.1 Will Sawin (Columbia)
- 1.3.2 Yan Soibelman (Kansas State)
- 1.3.3 Alicia Dickenstein (Buenos Aires)
- 1.3.4 Jianfeng Lu (Duke)
- 1.3.5 Eugenia Cheng (School of the Art Institute of Chicago)
- 1.3.6 Omer Mermelstein (Madison)
- 1.3.7 Shamgar Gurevich (Madison)
- 1.3.8 Jose Rodriguez (UW-Madison)
- 1.3.9 Ananth Shankar (MIT)
- 1.3.10 Franca Hoffman (Caltech)
- 1.3.11 Jeffrey Danciger (UT Austin)
- 1.4 Future Colloquia
- 1.5 Past Colloquia
Mathematics Colloquium
All colloquia are on Fridays at 4:00 pm in Van Vleck B239, unless otherwise indicated.
Fall 2019
date | speaker | title | host(s) | |
---|---|---|---|---|
Sept 6 Room 911 | Will Sawin (Columbia) | On Chowla's Conjecture over F_q[T] | Marshall | |
Sept 13 | Yan Soibelman (Kansas State) | Riemann-Hilbert correspondence and Fukaya categories | Caldararu | |
Sept 16 Monday Room 911 | Alicia Dickenstein (Buenos Aires) | Algebra and geometry in the study of enzymatic cascades | Craciun | |
Sept 20 | Jianfeng Lu (Duke) | How to "localize" the computation? | Qin | |
Sept 26 Thursday 3-4 pm Room 911 | Eugenia Cheng (School of the Art Institute of Chicago) | Character vs gender in mathematics and beyond | Marshall / Friends of UW Madison Libraries | |
Sept 27 | ||||
Oct 4 | ||||
Oct 11 | Omer Mermelstein (Madison) | Generic flat pregeometries | Andrews | |
Oct 18 | Shamgar Gurevich (Madison) | Harmonic Analysis on GL(n) over Finite Fields | Marshall | |
Oct 25 | ||||
Nov 1 | Elchanan Mossel (MIT) | Distinguished Lecture | Roch | |
Nov 8 | Jose Rodriguez (UW-Madison) | Nearest Point Problems and Euclidean Distance Degrees | Erman | |
Nov 13 Wednesday 4-5pm | Ananth Shankar (MIT) | Exceptional splitting of abelian surfaces | ||
Nov 20 Wednesday 4-5pm | Franca Hoffman (Caltech) | Gradient Flows: From PDE to Data Analysis | Smith | |
Nov 22 | Jeffrey Danciger (UT Austin) | "TBA" | Kent | |
Nov 29 | Thanksgiving | |||
Dec 6 | Reserved for job talk | |||
Dec 11 Wednesday | Nick Higham (Manchester) | LAA lecture | Brualdi | |
Dec 13 | Reserved for job talk |
Spring 2020
date | speaker | title | host(s) | |
---|---|---|---|---|
Jan 24 | Reserved for job talk | |||
Jan 31 | Reserved for job talk | |||
Feb 7 | Reserved for job talk | |||
Feb 14 | Reserved for job talk | |||
Feb 21 | Shai Evra (IAS) | Gurevich | ||
Feb 28 | Brett Wick (Washington University, St. Louis) | Seeger | ||
March 6 | Jessica Fintzen (Michigan) | Marshall | ||
March 13 | ||||
March 20 | Spring break | |||
March 27 | (Moduli Spaces Conference) | Boggess, Sankar | ||
April 3 | Caroline Turnage-Butterbaugh (Carleton College) | Marshall | ||
April 10 | Sarah Koch (Michigan) | Bruce (WIMAW) | ||
April 17 | Song Sun (Berkeley) | Huang | ||
April 24 | Natasa Sesum (Rutgers University) | Angenent | ||
May 1 | Robert Lazarsfeld (Stony Brook) | Distinguished lecture | Erman |
Abstracts
Will Sawin (Columbia)
Title: On Chowla's Conjecture over F_q[T]
Abstract: The Mobius function in number theory is a sequences of 1s, -1s, and 0s, which is simple to define and closely related to the prime numbers. Its behavior seems highly random. Chowla's conjecture is one precise formalization of this randomness, and has seen recent work by Matomaki, Radziwill, Tao, and Teravainen making progress on it. In joint work with Mark Shusterman, we modify this conjecture by replacing the natural numbers parameterizing this sequence with polynomials over a finite field. Under mild conditions on the finite field, we are able to prove a strong form of this conjecture. The proof is based on taking a geometric perspective on the problem, and succeeds because we are able to simplify the geometry using a trick based on the strange properties of polynomial derivatives over finite fields.
Yan Soibelman (Kansas State)
Title: Riemann-Hilbert correspondence and Fukaya categories
Abstract: In this talk I am going to discuss the role of Fukaya categories in the Riemann-Hilbert correspondence for differential, q-difference and elliptic difference equations in dimension one. This approach not only gives a unified answer for several versions of the Riemann-Hilbert correspondence but also leads to a natural formulation of the non-abelian Hodge theory in dimension one. It also explains why periodic monopoles should appear as harmonic objects in this generalized non-abelian Hodge theory. All that is a part of the bigger project ``Holomorphic Floer theory", joint with Maxim Kontsevich.
Alicia Dickenstein (Buenos Aires)
Title: Algebra and geometry in the study of enzymatic cascades
Abstract: In recent years, techniques from computational and real algebraic geometry have been successfully used to address mathematical challenges in systems biology. The algebraic theory of chemical reaction systems aims to understand their dynamic behavior by taking advantage of the inherent algebraic structure in the kinetic equations, and does not need the determination of the parameters a priori, which can be theoretically or practically impossible. I will give a gentle introduction to general results based on the network structure. In particular, I will describe a general framework for biological systems, called MESSI systems, that describe Modifications of type Enzyme-Substrate or Swap with Intermediates, and include many networks that model post-translational modifications of proteins inside the cell. I will also outline recent methods to address the important question of multistationarity, in particular in the study of enzymatic cascades, and will point out some of the mathematical challenges that arise from this application.
Jianfeng Lu (Duke)
Title: How to ``localize" the computation?
It is often desirable to restrict the numerical computation to a local region to achieve best balance between accuracy and affordability in scientific computing. It is important to avoid artifacts and guarantee predictable modelling while artificial boundary conditions have to be introduced to restrict the computation. In this talk, we will discuss some recent understanding on how to achieve such local computation in the context of topological edge states and elliptic random media.
Eugenia Cheng (School of the Art Institute of Chicago)
Title: Character vs gender in mathematics and beyond
Abstract: This presentation will be based on my experience of being a female mathematician, and teaching mathematics at all levels from elementary school to grad school. The question of why women are under-represented in mathematics is complex and there are no simple answers, only many many contributing factors. I will focus on character traits, and argue that if we focus on this rather than gender we can have a more productive and less divisive conversation. To try and focus on characters rather than genders I will introduce gender-neutral character adjectives "ingressive" and "congressive" to replace masculine and feminine. I will share my experience of teaching congressive abstract mathematics to art students, in a congressive way, and the possible effects this could have for everyone in mathematics, not just women.
Omer Mermelstein (Madison)
Title: Generic flat pregeometries
Abstract: In model theory, the tamest of structures are the strongly minimal ones -- those in which every equation in a single variable has either finitely many or cofinitely many solution. Algebraically closed fields and vector spaces are the canonical examples. Zilber’s conjecture, later refuted by Hrushovski, states that the source of geometric complexity in a strongly minimal structure must be algebraic. The property of "flatness" (strict gammoid) of a geometry (matroid) is that which guarantees Hrushovski's construction is devoid of any associative structure. The majority of the talk will explain what flatness is, how it should be thought of, and how closely it relates to hypergraphs and Hrushovski's construction method. Model theory makes an appearance only in the second part, where I will share results pertaining to the specific family of geometries arising from Hrushovski's methods.
Shamgar Gurevich (Madison)
Title: Harmonic Analysis on GL(n) over Finite Fields.
Abstract: There are many formulas that express interesting properties of a finite group G in terms of sums over its characters. For evaluating or estimating these sums, one of the most salient quantities to understand is the character ratio:
trace(ρ(g)) / dim(ρ),
for an irreducible representation ρ of G and an element g of G. For example, Diaconis and Shahshahani stated a formula of the mentioned type for analyzing certain random walks on G.
Recently, we discovered that for classical groups G over finite fields there is a natural invariant of representations that provides strong information on the character ratio. We call this invariant rank.
This talk will discuss the notion of rank for the group GLn over finite fields, demonstrate how it controls the character ratio, and explain how one can apply the results to verify mixing time and rate for certain random walks.
This is joint work with Roger Howe (Yale and Texas AM). The numerics for this work was carried by Steve Goldstein (Madison)
Jose Rodriguez (UW-Madison)
Determining the closest point to a model (subset of Euclidean space) is an important problem in many applications in science, engineering, and statistics. One way to solve this problem is by minimizing the squared Euclidean distance function using a gradient descent approach. However, when there are multiple local minima, there is no guarantee of convergence to the true global minimizer. An alternative method is to determine the critical points of an objective function on the model. In algebraic statistics, the models of interest are algebraic sets, i.e., solution sets to a system of multivariate polynomial equations. In this situation, the number of critical points of the squared Euclidean distance function on the model’s Zariski closure is a topological invariant called the Euclidean distance degree (ED degree). In this talk, I will present some models from computer vision and statistics that may be described as algebraic sets. Moreover, I will describe a topological method for determining a Euclidean distance degree and a numerical algebraic geometry approach for determining critical points of the squared Euclidean distance function.
Ananth Shankar (MIT)
An abelian surface 'splits' if it admits a non-trivial map to some elliptic curve. It is well known that the set of abelian surfaces that split are sparse in the set of all abelian surfaces. Nevertheless, we prove that there are infinitely many split abelian surfaces in arithmetic one-parameter families of generically non-split abelian surfaces. I will describe this work, and if time permits, mention generalizations of this result to the setting of K3 surfaces, as well as applications to the dynamics of hecke orbits. This is joint work with Tang, Maulik-Tang, and Shankar-Tang-Tayou.
Franca Hoffman (Caltech)
Title: Gradient Flows: From PDE to Data Analysis.
Abstract: Certain diffusive PDEs can be viewed as infinite-dimensional gradient flows. This fact has led to the development of new tools in various areas of mathematics ranging from PDE theory to data science. In this talk, we focus on two different directions: model-driven approaches and data-driven approaches. In the first part of the talk we use gradient flows for analyzing non-linear and non-local aggregation-diffusion equations when the corresponding energy functionals are not necessarily convex. Moreover, the gradient flow structure enables us to make connections to well-known functional inequalities, revealing possible links between the optimizers of these inequalities and the equilibria of certain aggregation-diffusion PDEs. In the second part, we use and develop gradient flow theory to design novel tools for data analysis. We draw a connection between gradient flows and Ensemble Kalman methods for parameter estimation. We introduce the Ensemble Kalman Sampler - a derivative-free methodology for model calibration and uncertainty quantification in expensive black-box models. The interacting particle dynamics underlying our algorithm can be approximated by a novel gradient flow structure in a modified Wasserstein metric which reflects particle correlations. The geometry of this modified Wasserstein metric is of independent theoretical interest.
Jeffrey Danciger (UT Austin)
Title: TBA