The colloquium typically meets Mondays at 4:00 PM in Room 617 on the sixth floor of Wachman Hall.
The colloquium is preceded by tea starting at 3:30 in the Faculty Lounge, adjacent to Room 617. Click on title for abstract.
Andre Guerra, Institute for Advanced Study
Quasiconvexity is a fundamental notion in the vectorial Calculus of Variations and is essentially equivalent to the applicability of the Direct Method. A fundamental problem, considered by Morrey in the 50s and 60s, is whether quasiconvexity is equivalent to ellipticity (in the sense of Legendre-Hadamard). In 1992 Vladimir Sverak showed that in 3 or higher dimensions they are not equivalent, but the two-dimensional case remains open. In this case one can expect a "complex analysis miracle", and we will discuss deep connections of Morrey's problem to old questions in Quasiconformal Analysis.
Elliptic curves are fundamental and well-studied objects in arithmetic geometry. However, much is still not known about many basic properties, such as the number of rational points on a "random" elliptic curve. We will discuss some conjectures and theorems about this "arithmetic statistics" problem, and then show how they can be applied to answer a related question about the number of integral points on elliptic curves over Q. In particular, we show that the second moment (and the average) for the number of integral points on elliptic curves over any number field is bounded (joint work with Levent Alpöge).
In this talk, I will survey what is known or conjectured about maps between configuration spaces and moduli spaces of surfaces. Among them, we consider two categories: continuous maps and also holomorphic maps. We will also talk about some results and conjectures about maps between finite covers of those spaces. Unlike the case of the whole spaces, much less is known about their finite covers.
In the middle of the nineteenth century, Kummer observed striking congruences between certain values of the Riemann zeta function, which have important consequences in number theory. In spite of its potential, this topic lay mostly dormant for nearly a century until breakthroughs by Iwasawa in the middle of the twentieth century. Since then, advances in arithmetic geometry and number theory (in particular, for modular forms, certain analytic functions that play a central role in number theory) have revealed similarly consequential congruences in the context of other arithmetic data. This remains an active area of research. In this talk, I will survey old and new tools for studying such congruences. I will conclude with some unexpected challenges that arise when one tries to take what would seem like immediate next steps beyond the current state of the art.
We use relaxation as in Nash’s work, but replace his iteration (in low codimension) or continuous flow (in high codimension) with a stochastic flow. The main issue in the derivation of our flow is a principled resolution of a semidefinite program. The same fundamental structure applies to several hard constraint systems and nonlinear PDE.
Nattalie Tamam, University of Michigan
The study of group actions gained significant interest in the past several decades, as group actions are a powerful tool when approaching problems from number theory and geometry. We will focus on the dynamical equivalent to vectors with 'infinitely good' diophantine approximation. From this dynamical point of view, Weiss conjectured a complete classification of the relevant trajectories. We will discuss the steps and different tools used in proving this conjecture. This is in part a joint work with Omri Solan, and in part a joint work with Lingmin Liao, Ronggang Shi and Omri Solan.
Many fundamental biophysical processes, from cell division to cellular motility, involve dynamics of thin structures immersed in a very viscous fluid. Various popular models have been developed to describe this interaction mathematically, but much of our understanding of these models is only at the level of numerics and formal asymptotics. Here we seek to develop the PDE theory of filament hydrodynamics.
Second, we consider a classical elastohydrodynamic model for the motion of an immersed inextensible filament. We highlight how the analysis can help to better understand undulatory swimming at low Reynolds number. This includes the development of a novel numerical method to simulate inextensible swimmers.
Low rank approximation methods are a central pillar of modern scientific computing. They are the powerhouse behind many fast and superfast methods relied upon on for computing solutions to various partial differential equations, linear systems, and matrix equations. In this talk, we focus on the role that rational approximation methods can play in the design of such algorithms. We illustrate how rational approximation tools can help us design highly effective low rank methods in the context of two very different (but surprisingly related!) kinds of problems: (1) the development of a direct solver for linear systems involving non-uniform discrete Fourier transform matrices, and (2) the development of solvers for the spectral fractional Poisson equation on geometrically complicated domains.