in this talk, i will discuss the (geometric) intersection number between closed geodesics on finite volume hyperbolic surfaces. specifically, i talk about the optimum upper bound on the intersection number in terms of the product of hyperbolic lengths. i also talk about the equidistribution of the intersection points between closed geodesics.

spectra are among the most fundamental objects in algebraic topology and appear naturally in the study of generalized cohomology theories, algebraic k-groups and cobordism invariants.  i will first explain that spectra define a homotopical enlargement of algebra known as “higher algebra,” where one has topological analogues of algebraic structures like rings, modules, and tensor products.

a striking feature of higher algebra is that there are additional “chromatic characteristics” interpolating between characteristic 0 and characteristic p.  these intermediate characteristics have shed light on mod p phenomena in geometry, number theory, and representation theory.  on the other hand, the extension of algebraic ideas to higher algebra has been fruitful within algebraic topology: i will discuss joint work with robert burklund and tomer schlank which proves a higher analogue of hilbert’s nullstellensatz, thus identifying the ‘’algebraically closed fields’’ of intermediate characteristic.  in addition to initiating the study of “chromatic algebraic geometry,” this work resolves a form of rognes’ chromatic redshift conjecture in algebraic k-theory.

property testing is a fundamental subject in theoretical computer science and combinatorics, which studies when and how global properties of large objects (such as a massive data set or a huge graph) can be robustly inferred when given only local views of the object. famous examples of property testing include testing whether a given graph is triangle-free or whether a given boolean function is linear.

in this talk, i'll present a generalization of the property testing model where the "local views" of an object are not given by deterministic evaluations, but instead by the probabilistic outcomes of measurements on a quantum state. this gives rise to a noncommutative model of property testing, and raises many interesting questions at the interface of complexity theory, quantum information, operator algebras, and more. finally, i'll describe how the recent quantum complexity result mip* = re can be viewed through the lens of noncommutative property testing.

for convex complete intersections, the gromov-witten invariants are often computed using the quantum lefshetz hyperplane theorem, which relates the invariants to those of the ambient space. however,  the convexity condition often fails when the target is an orbifold, even for genus 0, hence quantum lefshetz is no longer guaranteed. in this talk, i will showcase a method to compute these invariants, despite the failure of quantum lefshetz, for orbifold complete intersections in stack quotients of the form [v // g]. this talk will be based on joint works with felix janda (notre dame) and yang zhou (fudan), and with rachel webb (berkeley).

the bruhat order encodes algebraic and topological information of schubert varieties in the flag manifold and possesses rich combinatorial properties. in this talk, we discuss three interrelated stories regarding the bruhat order: self-dual bruhat intervals, billey-postnikov decompositions, and automorphisms of the bruhat graph. this is joint work with christian gaetz. 

we consider generic translation surfaces of genus g>0 with n>1 marked points and take covers branched over the marked points such that the monodromy of every element in the fundamental group lies in a cyclic group of order d. given a translation surface, the number of cylinders with waist curve of length at most l grows like l^2. by work of veech and eskin-masur, when normalizing the number of cylinders by l^2, the limit as l goes to infinity exists and the resulting number is called a siegel-veech constant. the same holds true if we weight the cylinders by their area. remarkably, the siegel-veech constant resulting from counting cylinders weighted by area is independent of the number of branch points n. all necessary background will be given and a connection to combinatorics will be presented. this is joint work with aaron calderon, carlos matheus, nick salter, and martin schmoll.

the study of affine deligne-lusztig varieties (adlvs) $x_w(b)$ and their certain union $x(\mu,b)$ has been crucial in understanding mod-$p$ reduction of shimura varieties; for instance, precise information about the connected components of adlvs (in the hyperspecial level) has proved to be useful in kisin's proof of the langlands-rapoport conjecture. on the other hand, first introduced in the context of enumerative geometry to describe the quantum cohomology ring of complex flag varieties, quantum bruhat graphs have found recent applications in solving certain problems on the adlvs. i will survey such developments and report on my work surrounding a dimension formula for $x(\mu,b)$ in the quasi-split case, as well as some partial description of the dimension and top-dimensional irreducible components in the non quasi-split case.

[pre-talk at 1:20pm]

i’ll talk about ongoing work in collaboration with the ding lab of biomedical engineering at uci. there are unresolved mysteries about the dynamics of rna splicing, an important molecular process in the genetic machinery. these mysteries remain because the obtainable data for this process are not time series, but rather static spatial images of cells with stochastic particles.  from a modeling perspective, this creates a challenge of finding the right mathematical description that respects the stochasticity of individual particles but remains computationally tractable. i’ll share our approach of constructing a spatial cox process with intensity governed by a reaction-diffusion pde. we can do inference on this process with experimental images by employing variational bayesian inference. several outstanding issues remain about how to combine classical and modern statistical/data-science approaches with more exotic mechanistic models in biology.

complete calabi-yau metrics are fundamental objects in kahler geometry arising as singularity models or "bubbles" ​in degenerations of compact calabi-yau manifolds.  the existence of these metrics and their relationship with algebraic geometry are the subjects of several long standing conjectures due to yau and tian-yau.  i will describe some recent progress towards the question of existence, and explain some future directions, highlighting connections with notions of algebro-geometric stability.​

moving boundary (or often called “free boundary”) problems are ubiquitous in nature and technology. a computational perspective of moving boundary problems can provide insight into the “invisible” properties of complex dynamics systems, advance the design of novel technologies, and improve the understanding of biological and chemical phenomena. however, challenges lie in the numerical study of moving boundary problems. examples include difficulties in solving pdes in irregular domains, handling moving boundaries efficiently and accurately, as well as computing efficiency difficulties. in this talk, i will discuss three specific topics of moving boundary problems, with applications to ecology (population dynamics), plasma physics (iter tokamak machine design), and cell biology (cell movement). in addition, some techniques of scientific computing will be discussed.

positroids are certain representable matroids originally studied by postnikov in connection with the totally nonnegative grassmannian and now used widely in algebraic combinatorics.  the positroids give rise to determinantal equations defining positroid varieties as subvarieties of the grassmannian variety. rietsch, knutson-lam-speyer, and pawlowski studied geometric and cohomological properties of these varieties.  in this talk, we continue the study of the geometric properties of positroid varieties by establishing several equivalent conditions characterizing smooth positroid varieties using a variation of pattern avoidance defined on decorated permutations, which are in bijection with positroids.  this allows us to give several formulas for counting the number of smooth positroids according to natural statistics on decorated permutations.  furthermore, we give a combinatorial method for determining the dimension of the tangent space of a positroid variety at the torus fixed points using an induced subgraph of the johnson graph.  we will conclude with some open problems in this area.

this talk is based on joint work with jordan weaver and christian krattenthaler.  

we investigate the analogs of optimal transport theory in the setting of multivariable asymptotic random matrix theory.  asymptotic random matrix theory concerns the behavior of randomly chosen $n \times n$ matrices in the limit as $n \to \infty$.  for several random matrices $x_1^{(n)}$, $\dots$, $x_d^{(n)}$, one can study the asymptotic behavior of expressions like $(1/n) \tr(x_{i_1} \dots x_{i_k})$, and the appropriate limiting object is a non-commutative probability space, that is, a von neumann algebra $a$ of "random variables" together with an expectation map $e: a \to \mathbb{c}$, analogous to the expected trace of a random matrix.  meanwhile, optimal transport theory asks for the most efficient way to rearrange one distribution of mass $\mu$ on $\mathbb{r}^d$ into another such distribution $\nu$.  such a scheme is often given by transporting the mass at point $x$ to point $f(y)$, for a smooth function $f: \mathbb{r}^d \to \mathbb{r}^d$.

optimal transport is more challenging to make sense of in the non-commutative setting because, unlike classical probability theory, there are many non-isomorphic atomless non-commutative probability spaces, and in fact, space of non-commutative probability distributions fails basic separability and finite-dimensional approximation properties that one is used to in classical probability.  so there is often no possibility of transporting given non-commutative probability distribution $\mu$ to $\nu$ by some map $f$; nonetheless, for the relaxed problem of optimal couplings, we can recover a non-commutative analog of the monge-kantorovich duality characterizing optimal couplings. furthermore, in the regime of convex free gibbs laws (an analog of smooth log-concave probability measures on $\mathbb{r}^d$), non-commutative transport can be achieved by non-commutative smooth functions obtained as solutions to differential equations much like the classical case.  moreover, the non-commutative analog of triangular transformations of measures led to new insight into the structure of the underlying von neumann algebras.

we address a system of equations modeling a compressible fluid interacting with an elastic body in dimension three. we prove the local existence and uniqueness of a strong solution when the initial velocity belongs to the space $h^{2+\epsilon}$ and the initial structure velocity is in $h^{1.5+\epsilon}$, where $\epsilon\in(0,1/2)$. 

the learn to optimize paradigm leverages machine learning to accelerate the discovery of new optimization methods. this method's core idea is to use a neural network to simulate the optimization process or provide critical decisions during the process to solve the optimization problem. this talk will introduce two recent research works in learning to optimization.

the first is a theoretical work discussing the application of graph neural networks (gnns) to linear and mixed integer programming. we prove that well-trained gnns can solve linear programs but not mixed integer programs without proper fixes. the other is constructing a fixed-point iterative neural network to solve inverse problems and game problems.

 a {\em permutation statistic} is a complex-valued function on the symmetric group $\mathfrak{s}_n$.  we describe a notion of `locality' which measures the complexity of permutation statistics. applications are given to the asymptotic behavior of families of statistics as the parameter $n$ grows. the key technical tool is an irreducible character evaluation on the symmetric group algebra which involves a novel combinatorics of `monotonic ribbon tableaux'. joint with zach hamaker.

bypassing the formalities of sigma-algebra and measures, i will show how one can see the lebesgue integration as an initial object of some category. the talk is based on a paper by tom leinster.

teichmüller curves are algebraic curves in the moduli space of genus $g$ riemann surfaces that are isometrically immersed for the teichmüller metric. these curves arise from $\mathrm{sl}(2,\mathbb{r})$-orbits of highly symmetric translation surfaces, and the underlying surfaces have remarkable dynamical and algebro-geometric properties. a teichmüller curve is algebraically primitive if the trace field of its affine symmetry group has degree $g$. in genus $2$, calta and mcmullen independently discovered an infinite family of algebraically primitive teichmüller curves. however, in higher genus, such curves seem to be much rarer. we will discuss a result that shows that the regular $14$-gon yields the unique algebraically primitive teichmüller curve in genus $3$ of a particular combinatorial type. all relevant notions will be explained during the talk.

expected shortfall, measuring the average outcome (e.g., portfolio loss) above a given quantile
of its probability distribution, is a common financial risk measure. the same measure can be
used to characterize treatment effects in the tail of an outcome distribution, with applications
ranging from policy evaluation in economics and public health to biomedical investigations.
expected shortfall regression is a natural approach of modeling covariate-adjusted expected
shortfalls. because the expected shortfall cannot be written as a solution of an expected loss
function at the population level, computational as well as statistical challenges around
expected shortfall regression have led to stimulating research. we discuss some recent
developments in this area, with a focus on a new optimization-based semiparametric approach
to estimation of conditional expected shortfall that adapts well to data heterogeneity with
minimal model assumptions.

asymptotically cylindrical flows are ancient solutions to the mean curvature flow whose tangent flow at $-\infty$ are shrinking cylinders. in this talk, we study quantized behavior of asymptotically cylindrical flows. we show that the cylindrical profile function u of these flows have the asymptotics $u(y,\omega, \tau) = \frac{y^{t}qy - 2tr q}{|\tau|} + o(|\tau|^{-1})$ as $\tau\rightarrow -\infty$, where $q$ is a constant symmetric $k\times k$ matrix whose eigenvalues are quantized to be either 0 or $-\frac{\sqrt{2(n-k)}}{4}$. assuming non-collapsing, we can further draw two applications. in the zero rank case, we obtain the full classification. in the full rank case, we obtain the $so(n-k+1)$ symmetry of the solution. this is joint work with wenkui du.

prismatic cohomology is a new p-adic cohomology theory introduced by bhatt and scholze that specializes to various well-known cohomology theories such as étale, de rham and crystalline. i will roughly recall the properties of this cohomology and explain how to prove its poincaré duality.

[pre-talk at 1:20pm]

the matrix completion problems are about completing a partially filled matrix to achieve the lowest possible rank. as they can be interpreted as an understanding of a certain algebraic variety, we consider a corresponding algebraic matroid and desire to characterize its bases. polyhedralizing via tropical algebra may help us to figure out this characterization. we begin the talk with brief introductions on matrix completion problems, algebraic matroids, and tropical algebra. no pre-knowledge is assumed. this is based on ongoing work with may cai, cvetelina hill, and josephine yu. 

for the past 90 years, a fundamental question in classical homotopy theory is to understand the stable homotopy groups of spheres.  the most modern method to study these groups is to compare them with the ``motivic stable homotopy groups of spheres".  motivic homotopy theory has its roots in algebraic geometry.  as a result of the recent advances, there is a reintegration of algebraic topology and algebraic geometry, with close connections to equivariant homotopy theory and number theory.

in this talk, i will introduce the classical and motivic stable homotopy categories and the connections between the two.  i will then talk about the rich properties and extra structures that are present in the motivic stable homotopy category.  the presence of these extra structures gives new computational tools that dramatically improve our understanding of the classical stable homotopy groups.  moreover, the flow of information can be reversed as well, producing new results in motivic stable homotopy theory for general fields.

the yang-mills model is a theoretical framework for fundamental forces and elementary particles. it has made deep impacts in various branches of mathematics. a key challenge in mathematical physics is to construct the quantum yang-mills theory on four dimensional space and prove the existence of a "mass gap". in this talk, we will discuss stochastic quantization i.e. langevin dynamics of the yang-mills model on two and three dimensional tori. this is a stochastic process on the space of "gauge orbits", induced by the solution to a nonlinear lie algebra-valued stochastic pde driven by space-time white noise. the presence of very singular random forcing as well as nonlinearities render it challenging to interpret what one even means by “solutions”, “state space”, “orbit space” and “gauge invariant observables”. we rigorously construct these objects by combining techniques from analysis, pde, stochastic pde,  and especially the theory of regularity structures. the talk is based on joint work with ajay chandra, ilya chevyrev, martin hairer, among many other collaborators.

the focus of the talk is interior-point methods for inequality-constrained quadratic programs, and particularly the system of nonlinear equations to be solved for each value of the barrier parameter. newton iterations give high quality solutions, but we are interested in modified newton systems that are computationally less expensive at the expense of lower quality solutions.  we propose a structured modified newton approach where each modified jacobian is composed of a previous jacobian, plus one low-rank update matrix per succeeding iteration. each update matrix is, for a given rank, chosen such that the distance to the jacobian at the current iterate is minimized, in both 2-norm and frobenius norm. the approach is structured in the sense that it preserves the nonzero pattern of the jacobian. the choice of update matrix is supported by results in an ideal theoretical setting. we also produce numerical results with a basic interior-point implementation to investigate the practical performance within and beyond the theoretical framework. in order to improve performance beyond the theoretical framework, we also motivate and construct two heuristics to be added to the method.

we extend the traditional framework of noncommutative geometry in order to deal with two types of approximation of metric spaces. on the one hand, we consider spectral truncations of geometric spaces, while on the other hand, we consider metric spaces up to finite resolution. in our approach, the traditional role played by c*-algebras is taken over by so-called operator systems. essentially, this is the minimal structure required on a space of operators to be able to speak of positive elements, states, pure states, etc. we illustrate our methods in concrete examples obtained by spectral truncations of the circle and of metric spaces up to finite resolution. the former yield operator systems of finite-dimensional toeplitz matrices, and the latter give suitable subspaces of the compact operators. we also analyze the cones of positive elements and the pure-state spaces for these operator systems, which turn out to possess a very rich structure.

the maxwell-vlasov equations model the evolution of a plasma and can be derived from a suitably chosen lagrangian.  that lagrangian decomposes as the sum of terms associated with the motion of the particles, the energy stored in the electromagnetic field, and the interaction of the particles with the field.  previous structure-preserving approaches to modeling fluid dynamics, using the group structure of the configuration space, and electromagnetic fields in vacuum, using the de rham complex, have proved effective, raising the question whether these results could be leveraged to obtain well-behaved numerical solutions of the maxwell-vlasov system, thought of as a composite.  with this goal in mind, we write the maxwell-vlasov euler-poincaré equations in a weak, variational form, then use approximation spaces suggested by the referenced works to obtain a semidiscrete version of the problem.  we then present work done towards solving the fully discrete problem and indicate future directions.

the schubert polynomials and key polynomials form two important bases for the polynomial ring. schubert and key polynomials are the​``bottom layers” of grothendieck and lascoux polynomials, two inhomogeneous polynomials. in this talk, we look at their​``top layers”. we develop a diagrammatic way to compute the degrees and the leading monomials of these top layers. finally, we describe the hilbert series of the space spanned by these top layers, involving a classical $q$-analogue of the bell numbers.

the aim of this talk to show that several quantities: as the spectral radius of weakly irreducible tensors, maximum of d-homogeneous polynomial with nonnegative coefficients in the unit ball of the d-h¨older norm, are polynomially computable. this computability result is proven for a larger class of minimum of certain convex functions in r n, which was considered by several authors. this is a joint work with stephane gaubert, inria and centre de math´ematiques appliqu´ees (cmap), ecole polytechnique, ip paris, france.

i’ll give the audience three topics that i think are interesting, and they’ll vote on which one they want to hear about. so it’s a surprise!

 a translation surface is given by polygons in the plane, with sides identified by translations to create a closed riemann surface with a flat structure away from finitely many singular points. understanding geodesic flow on a surface involves understanding saddle connections. saddle connections are the geodesics starting and ending at these singular points and are associated to a discrete subset of the plane. to measure the behavior of saddle connections of length at most $r$, we obtain precise decay rates as $r$ goes to infinity for the difference in angle between two almost horizontal saddle connections. this is based on joint work with jon chaika.

the whittaker plancherel theorem appeared as chapter 15 in my two volume book, real reductive groups. it was meant to be an application of harish-chandra’s plancherel theorem.  as it turns out, there are serious gaps in the proof given in the books. at the same time as i was doing my research on the subject, harish-chandra was also working on it. his approach was very different from mine and appears as part of volume 5 of his collected works; which consists of three pieces of research by harish-chandra that were incomplete at his death and organized and edited by gangolli and varadarajan. unfortunately,  it also does not contain a proof of the theorem. there was a complication in the proof of this result that caused substantial difficulties which had to do with the image of the analog of harish-chandra’s method of descent. in this lecture i will explain how one can complete the proof using a recent result of raphael beuzzart-plessis. i will also give an application of the result to the fourier transforms of automorphic functions at cusps.

(this seminar will be given remotely, but there will still be a live audience in the lecture room.)

[pre-talk at 1:20pm]

the moduli spaces of one-dimensional sheaves on p^2, first studied by simpson and le potier, admit a hilbert-chow morphism to a projective base that behaves like a completely integrable system. following a proposal of maulik-toda, one expects to obtain certain bps invariants from the perverse filtration on cohomology induced by this morphism. this motivates us to study the cohomology ring structure of these moduli spaces. in this talk, we present a minimal set of tautological generators for the cohomology ring, and propose a “perverse = chern” conjecture concerning these generators, which specializes to an asymptotic product formula for refined bps invariants of local p^2. this can be viewed as an analogue of the recently proved p=w conjecture for hitchin systems. based on joint work with junliang shen, and with yakov kononov and junliang shen.

the growth of an infinite-dimensional algebra is a fundamental tool to measure its infinitude. growth of noncommutative algebras plays an important role in noncommutative geometry, representation theory, differential algebraic geometry, symbolic dynamics and various recent homological stability results in number theory and arithmetic geometry.

we analyze the space of growth functions of algebras, answering a question of zelmanov (2017) on the existence of certain 'holes' in this space, and prove a strong quantitative version of the kurosh problem on algebraic algebras. we use minimal subshifts with highly correlated oscillating complexities to resolve a question posed by krempa-okninski (1987) and krause-lenagan (2000) on the gk-dimension of tensor products.

an important property implied by subexponential growth (for both groups and algebras) is amenability. we show that minimal subshifts of positive entropy give rise to amenable graded algebras of exponential growth, answering a conjecture of bartholdi (2007; naturally extending a wide open conjecture of vershik on amenable group rings).

this talk is partially based on joint works with j. bell and with e. zelmanov.

integrable systems, both classical and quantum, kept reemerging in mathematics and theoretical physics during the past several decades. in this talk, after briefly reviewing classical and quantum integrable systems, i will focus on two recent geometric incarnations of integrable systems based on quantum groups, solved by the algebraic bethe ansatz method. one is motivated by studying 2- and 3-dimensional supersymmetric gauge theories and mathematically explained through enumerative geometry of quiver varieties. another comes from an instance of geometric langlands correspondence. finally, i will explain the relationship between these two geometrizations and discuss their applications.

 geometric deep learning is an emerging field of research that aims to extend the success of machine learning and, in particular, convolutional neural networks, to data with non-euclidean geometric structure such as graphs and manifolds. despite being in its relative infancy, this field has already found great success and is utilized by, e.g., google maps and amazon’s recommender systems.


in order to improve our understanding of the networks used in this new field, several works have proposed novel versions of the scattering transform, a wavelet-based model of neural networks for graphs, manifolds, and more general measure spaces. in a similar spirit to the original scattering transform, which was designed for euclidean data such as images, these geometric scattering transforms provide a mathematically rigorous framework for understanding the stability and invariance of the networks used in geometric deep learning. additionally, they also have many interesting applications such as discovering new drug-like molecules, solving combinatorial optimization problems, and using single-cell data to predict whether or not a cancer patient will respond to treatment.
 

in 1938, erdos, ko and rado proved a foundational result on the size of intersecting families of sets. ever since, there has been a rich body of results proving similar theorems in different contexts. notably, in geometries over finite fields like projective and polar spaces, such results were obtained by several groups of researchers. i will explain a very successful technique that can be used to prove these results, and indicate its shortcomings. we will show how a generalization of this problem recovers all known results and how algebraic combinatorics such as iwahori-hecke algebras and their representations come into play. the latter is based on joint work with jan de beule and klaus metsch.

we study markov decision processes (mdps) in the space of state-action distributions using algebraic and differential geometric methods. we provide an explicit description of the set of feasible state-action distributions of a partially observable problems with memoryless stochastic policies through polynomial constraints. in particular, this yields a formulation of the reward optimization problem as a polynomially constrained linear objective program. this allows us to study the combinatorial and algebraic complexity of the problem and we obtain explicit upper bounds on the number of critical points over every boundary component of the feasible set for a large class of problems. we demonstrate that the polynomial programming formulation of reward optimization can be solved using tools from constrained optimization and applied algebraic geometry, which exhibit stability improvements and provide globally optimal solutions. further, we study the convergence of several natural policy gradient (npg) methods with regular policy parametrization. for a variety of npgs we show that the trajectories in state-action space are solutions of gradient flows with respect to hessian geometries, based on which we obtain global convergence guarantees and convergence rates. in particular, we show linear convergence for unregularized and regularized npg flows proposed by kakade and morimura and co-authors by observing that these arise from the hessian geometries of conditional entropy and entropy respectively.

the talk will give an overview of categorical semantics - a magical tool that puts our wanted loose ways of reasoning on solid ground. we’ll discuss how grothendieck generic freeness lemma is “internally” a simple one-liner, in what secret sense spec a is free, why intuitionistic mathematics is so natural, and maybe even how to approach algebraic geometry synthetically (i.e. with no set theory references).

a modular form is a certain holomorphic function on the complex upper half plane which has an infinite group of discrete symmetries. i will discuss modular forms and some of their generalizations.  in particular, i will try to answer the following questions: what is a modular form? what are some examples of modular forms? what is a simple open question about modular forms?  the examples of modular forms i will give go under the name of "harmonic theta functions".  time permitting, i will describe some exotic variants of these harmonic theta functions that are tied up with the octonions and the compact lie group g_2.

in recent years we have experienced a remarkable growth on the number and size of available datasets. such growth has led to the intense and challenging pursuit of estimators which are provably both computationally efficient and statistically accurate. notably, the analysis of polynomial-time estimators has revealed intriguing phenomena in several high dimensional estimation tasks, such as their apparent failure of such estimators to reach the optimal statistical guarantees achieved among all estimators (that is the presence of a non-trivial “computational-statistical trade-off”).

in this talk, i will present new such algorithmic results for the well-studied planted clique model and for the fundamental sparse regression model. for planted clique, we reveal the surprising severe failure of the metropolis process to work in polynomial-time, even when simple degree heuristics succeed. in particular, our result resolved a well-known 30-years old open problem on the performance of the metropolis process for the model, posed by jerrum in 1992. for sparse regression, we show the failure of large families of polynomial-time estimators, such as mcmc and low-degree polynomial methods, to improve upon the best-known polynomial-time regression methods. as an outcome, our work offers rigorous evidence that popular regression methods such as lasso are optimally balancing their computational and statistical recourses.

 i will explain the relevance of the lichnerowicz laplacian in several situations and how one can easily understand the zeroth order term in the expression. this leads to simple proofs of some classical results and also to new results with more general curvature conditions.

continuous-time markov chains are frequently used as stochastic models for chemical reaction networks, especially in the growing field of systems biology. a fundamental problem for these stochastic chemical reaction networks (scrns) is to understand the dependence of the stochastic behavior of these systems on the chemical reaction rate parameters. towards solving this problem, in this talk we describe theoretical tools called comparison theorems that provide stochastic ordering results for scrns. these theorems give sufficient conditions for monotonic dependence on parameters in these network models, which allow us to obtain, under suitable conditions, information about transient and steady state behavior. these theorems exploit structural properties of scrns, beyond those of general continuous-time markov chains. furthermore, we derive two theorems to compare stationary distributions and mean first passage times for scrns with different parameter values, or with the same parameters and different initial conditions. these tools are developed for scrns taking values in a generic (finite or countably infinite) state space and can also be applied for non-mass-action kinetics models. we illustrate our results with applications to models of chromatin regulation and enzymatic kinetics.

this talk is based on joint work with simone bruno, felipe campos, domitilla del vecchio and yi fu.

over a commutative ring of finite cardinality, how many $n
\times n$ matrices satisfy a polynomial equation? in this talk, i will explain how to solve this question when the ring is given by integers modulo a prime power and the polynomial is square-free modulo the prime.
then i will discuss how this question is related to the distribution of the cokernel of a random matrix and the cohen--lenstra heuristics. this is joint work with yunqi liang and michael strand, as a result of a
summer undergraduate research i mentored.

[pre-talk at 1:20pm]

i’ll give a short intro to hyperbolic groups and small cancellation theory, and demonstrate how this theory can be used to construct groups with desirable properties. 

the gaussian elimination with partial pivoting (gepp) is a classical algorithm for solving systems of linear equations. empirical evidence strongly suggests that for a typical square coefficient matrix, gepp is numerically stable. we obtain a (partial) theoretical justification of this phenomenon by showing that, given the random n×n standard gaussian coefficient matrix a, the growth factor of the gaussian elimination with partial pivoting is at most polynomially large in n with probability close to one. this implies that with probability close to one the number of bits of precision sufficient to solve ax=b to m bits of accuracy using gepp is m+o(log(n)), which we conjecture to be optimal by the order of magnitude. we further provide tail estimates of the growth factor which can be used to support the empirical observation that gepp is more stable than the gaussian elimination with no pivoting. based on joint work with han huang.

how a turing's reaction-diffusion process in a biological context leads to a rather surprising appearance of ising-like colorings of the skin of mediterranean lizards.

 the balmer spectrum of a tensor triangulated category is a topological tool analogous to the usual spectrum of a commutative ring. it provides a universal theory of support, giving a categorical framework to (among others) the support varieties that have been used to great effect in modular representation theory. in this talk i will present an approach to the balmer spectrum of the stable module category of a hopf algebra using twisted tensor products and emphasizing examples. this will include an unpretentious introduction to twisted tensor products, the balmer spectrum, and the relevance of both in representation theory.

recall that two finitely generated groups g and h are quasi-isometric, if they admit a topological coupling, i.e. an action of g times h on a locally compact topological space such that each factor acts properly and cocompactly. this topological definition of quasi-isometry was given by gromov, and at the same time he proposed a measure theoretic analogue of this definition, called the measure equivalence, which is closely related to the notion of orbit equivalence in ergodic theory. despite the similarity in the definition of measure equivalence and quasi-isometry, their relationship is rather mysterious and not well-understood. we study the relation between these two notions in the class of right-angled artin groups. in this talk, we show if h is a countable group with bounded torsion which is integrable measure equivalence to a right-angled artin group g with finite outer automorphism group, then h is finitely generated, and h and g are quasi-isometric. this allows us to deduce integrable measure equivalence rigidity results from the relevant quasi-isometric rigidity results for a large class of right-angled artin groups. interestly, this class of groups are rigid for a reason which is quite different from other cases of measure equivalence rigidity. we will also do a quick survey of relevant measure equivalence rigidity and quasi-isometric rigidity results of other classes of groups, motivating our choice of right-angled artin groups as a playground. this is joint work with camille horbez.

i will present a recent work on variational problems involving nonlocal energy functionals that appear in nonlocal mechanics. the well-posedness of variational problems is established via a careful study of the associated energy spaces, which are nonstandard. i will discuss some difficulties in proving fundamental structural properties of the function spaces such as compactness. for a sequence of parametrized nonlocal functionals in suitable form, we compute their variational limit and establish a rigorous connection with classical models.

the development of accurate and efficient numerical solutions to the wave equation is a fundamental area of scientific research with applications in several fields, including music, computer graphics, architecture, and telecommunications. a key challenge in wave simulation research concerns the proper handling of wave propagation on an unbounded domain. this challenge is known as the infinite domain problem. in this talk, i present a novel geometric framework for solving this problem based on the classical kelvin transformation. i express the wave equation as a laplace problem in minkowski spacetime and show that the problem is conformally invariant under kelvin transformations using the minkowski metric while the boundedness of the spacetime is not. these two properties of the kelvin transformation in minkowski spacetime ensure that harmonic functions which span infinite spacetime can be simulated using finite computational resources with no loss of accuracy.

 in this talk, i will discuss connections between configuration spaces, an important class of topological space, and combinatorial algebras arising from the theory of reflection groups. in particular, i will present work relating the cohomology rings of some classical configuration spaces - such as the space of n ordered points in euclidean space - with solomon descent algebra and the peak algebra. the talk will be centered around two questions. first, how are these objects related? second, how can studying one inform the other? this is joint, on-going work with marcelo aguiar and vic reiner.

recent radical evolution in distributed sensing, computation, communication, and actuation has fostered the emergence of cyber-physical network systems. regardless of the specific application, one central goal is to shape the network's collective behavior through the design of admissible local decision-making algorithms. this is nontrivial due to various challenges such as local connectivity, system complexity and uncertainty, limited information structure, and the complex intertwined physics and human interactions.

in this talk, i will present our recent progress in formally advancing the systematic design of distributed coordination in network systems via harnessing special properties of the underlying problems and systems. in particular, we will present three examples and discuss three types of properties, i) how to use network structure to ensure the performance of the local controllers; ii) how to use the information and communication structure to develop distributed learning rules; iii) how to use domain-specific properties to further improve the efficiency of the distributed control and learning algorithms.

bio: na li is a gordon mckay professor in electrical engineering and applied mathematics at harvard university.  she received her bachelor degree in mathematics from zhejiang university in 2007 and ph.d. degree in control and dynamical systems from california institute of technology in 2013. she was a postdoctoral associate at massachusetts institute of technology 2013-2014.  she has hold a variety of shorter term visiting appointments including  the simons institute for the theory of computing, mit, and google brain. her research lies in control, learning, and optimization of networked systems, including theory development, algorithm design, and applications to real-world cyber-physical societal system.  she has been an associate editor for ieee transactions on automatic control, systems & control letters, ieee control systems letters, and served on the organizing committee for numerous conferences.  she received nsf career award (2016), afsor young investigator award (2017), onr young investigator award(2019),  donald p. eckman award (2019), mcdonald mentoring award (2020), the ifac manfred thoma medal (2023), along with some other awards.

in this talk, i will introduce a few games for you and your partner (if any exists) to play. they can help you get to know each other and descriptive set theory better. it’s all fun and games.

this talk will provide a basic introduction to the world of nonlinear pdes.

 i will discuss compact uniformly recurrent subgroups and compact invariant random subgroups in locally compact groups, and present results from ongoing projects with pierre-emanuel caprace and waltraud lederle, and with tal cohen.

we prove the existence of nontrivial closed surfaces with constant anisotropic mean curvature with respect to elliptic integrands in closed smooth 3-dimensional riemannian manifolds. the constructed min-max surfaces are smooth with at most one singular point. the constant anisotropic mean curvature can be fixed to be any real number. in particular, we partially solve a conjecture of allard [invent. math.,1983] in dimension 3.

 in this talk we will discuss several stochastic epidemic models recently developed to account for general infectious durations, infection-age dependent infectivity and/or progress loss of immunity/varying susceptibility, extending the standard epidemic models. we construct individual based stochastic models, and prove scaling limits for the associated epidemic dynamics in large populations. each individual is associated with a random function/process that represents the infection-age dependent infectivity force to exert on other individuals. we extend this formulation to associate each individual with a random function that represents the loss of immunity/varying susceptibility. a typical infectivity function first increases and then decreases from the epoch of becoming infected to the time of recovery, while a typical immunity/susceptibility function gradually increases from the time of recovery to the time of losing immunity and becoming susceptible. the scaling limits are deterministic and stochastic volterra integral equations. we also discuss some new pdes models arising from the scaling limits. (this talk is based on joint work with etienne pardoux, raphael forien, and arsene brice zosta ngoufack.)

it is a folklore conjecture that the sup norm of a laplace eigenfunction on a compact hyperbolic surface grows more slowly than any positive power of the eigenvalue.  in dimensions three and higher, this was shown to be false by iwaniec-sarnak and donnelly.  i will present joint work with farrell brumley that strengthens these results, and extends them to locally symmetric spaces associated to $\mathrm{so}(p,q)$.

[pre-talk at 1:20pm]

 i will explain how various results in arithmetic statistics by bhargava, gross, shankar, and others on 2-selmer groups of jacobians of (hyper)elliptic curves can be organized and reproved using the theory of graded lie algebras, following the earlier work of thorne. this gives uniform proof of these results and yields new theorems for certain families of non-hyperelliptic curves. i will also mention some applications to rational points on certain families of curves.

the talk will involve a mixture of representation theory, number theory
and algebraic geometry and i will assume no familiarity with arithmetic
statistics.

 we design a monotone meshfree finite difference method for linear elliptic pdes in non-divergence form on point clouds via a nonlocal relaxation method. the key idea is a combination of a nonlocal integral relaxation of the pde problem with a robust meshfree discretization on point clouds. minimal positive stencils are obtained through a linear optimization procedure that automatically guarantees the stability and, therefore, the convergence of the meshfree discretization.  a major theoretical contribution is the existence of consistent and positive stencils for a given point cloud geometry. we provide sufficient conditions for the existence of positive stencils by finding neighbors within an ellipse (2d) or ellipsoid (3d) surrounding each interior point, generalizing the study for poisson’s equation by seibold in 2008. it is well-known that wide stencils are in general needed for constructing consistent and monotone finite difference schemes for linear elliptic equat ions. our result represents a significant improvement in the stencil width estimate for positive-type finite difference methods for linear elliptic equations in the near-degenerate regime (when the ellipticity constant becomes small), compared to previously known works in this area. numerical algorithms and practical guidance are provided with an eye on the case of small ellipticity constant. numerical results will be presented in both 2d and 3d, examining a range of ellipticity constants including the near-degenerate regime.

 in this talk, i will discuss injectivity and injective envelope of objects in different categories. i will present our recent work, which attempts to answer the question “what happens to injective objects under particular functors?” this is based on joint work with david blecher and mehrdad kalantar. 

we generalize a result of mazorchuk and tenner, showing that the “run” statistic influences the shape of the rsk tableaux of an arbitrary permutation. we define and construct the “canonical reduced word” of a boolean permutation, and show that the rsk tableaux for that permutation can be read off directly from this reduced word. we also describe those tableaux that can correspond to boolean permutations in terms of “uncrowded sets.” we then extend this work to fully commutative permutations, showing that each fully commutative permutation has a well-defined “boolean core,” related to the right weak order. the contents of the second row of the insertion tableaux of fully commutative permutations are partially ordered as subsets, with respect to the right weak order. we explore the partial order of these subsets, with particular interest in when they change from uncrowded to crowded. this is joint work with gunawan, russell and tenner, based on recent work in arxiv:2207.05119 and arxiv:2212.05002.

the purpose of this talk is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $f$ is at most $k$ over the algebraic closure of $f$, where $k$ is a given positive integer. we estimate the arithmetic complexity of our algorithm. 

 horospherical group actions on homogeneous spaces are famously known to be extremely rigid. in finite volume homogeneous spaces, it is a special case of ratner's theorems that all horospherical orbit closures are homogeneous. rigidity further extends in rank-one to infinite volume but geometrically finite spaces. the geometrically infinite setting is far less understood. we consider $\mathbb{z}$-covers of compact hyperbolic surfaces and show that they support quite exotic horocycle orbit closures. surprisingly, the topology of such orbit closures delicately depends on the choice of a hyperbolic metric on the covered compact surface. in particular, our constructions provide the first examples of geometrically infinite spaces where a complete description of non-trivial horocycle orbit closures is known. based on joint work with james farre and yair minsky.

we first describe the mathematical foundation of dsgrn (dynamic signatures generated by regulatory networks), an approach that provides a queryable description of global dynamics of a network over its entire parameter space. we also describe a connection to boolean network models that allows us to view dsgrn as a platform for bifurcation theory of boolean maps. finally, we compare dsgrn to racipe, an approach based on sampling parameters for ode models.  we discuss several applications to systems biology as well as design of robust networks in synthetic biology.

analogies between number theory and graph theory have been studied for quite some time now.  during the past few years, it has been observed in particular that there is an analogy between classical iwasawa theory and some phenomena in graph theory.  in this talk, we will explain this analogy and present some of the results that have been obtained so far in this area.

[pre-talk at 1:20pm]

problems in extremal graph theory typically aim to maximize some graph parameter under local restrictions. in order to prove lower bounds for these kinds of problems, several techniques have been developed. the most popular one, initiated by paul erdős, being the probabilistic method. while this technique has enjoyed tremendous success, it does not always provide sharp lower bounds. frequently, algebraically and geometrically defined graphs outperform random graphs. we will show how historically, geometry over finite fields has been a rich source of such graphs. i will show a broad class of graphs defined from geometry of finite fields, which has found several recent applications in extremal graph theory. often, certain interesting families of graph had in fact already been discovered and studied, years before their value in extremal graph theory was realized. i will demonstrate some instances of this phenomenon as well, which indicates that there might still be uncharted territory to explore.

in this talk i will discuss two different topics: a) the topic of precise asymptotics for linear waves on black hole spacetimes, and b) the topic of construction of spacetimes containing curvature singularities. if time permits, i will try to make connections with more general problems for quasilinear wave equations (for both topics).

 inductive limits are a central construction in c*-theory because they allow one to use well-understood building blocks to naturally construct intricate c*-algebras whose properties remain tractable. one task for the structural theory of operator algebras is to determine which classes of operator algebras arise as inductive limits of nice operator algebras.

the model result in this direction is connes' 1970's theorem showing that many classes of von neumann algebras, including semi-discrete von neumann algebras, arise as inductive limits of finite dimensional von neumann algebras. for c*-algebras, an analogous result fails outright: many nuclear c*-algebras are not inductive limits of finite dimensional c*-algebras. however, by generalizing our notion of an inductive system, we can in fact describe any nuclear c*-algebra as the limit of a system of finite dimensional c*-algebras. though seemingly abstract, these generalized inductive systems arise naturally from completely positive approximations of nuclear c*-algebras.

this is based in part on joint work with wilhelm winter. 

the vorticity-streamfunction formulation for incompressible inviscid fluids is the basis for many fluid simulation methods in computer graphics, including vortex methods, streamfunction solvers, spectral methods, and monte carlo methods. we point out that current setups in the vorticity-streamfunction formulation are insufficient at simulating fluids on general non-simply-connected domains. this issue is critical in practice, as obstacles, periodic boundaries, and nonzero genus can all make the fluid domain multiply connected. these scenarios introduce non-trivial cohomology components to the flow in the form of harmonic fields. the dynamics of these harmonic fields have been previously overlooked. in this talk, we derive the missing equations of motion for the fluid cohomology components. we elucidate the physical laws associated with the new equations, and show their importance in reproducing physically correct behaviors of fluid flows on domains with general topology.

we discuss milnor's link invariants through a geometric lens using intersections of seifert surfaces. our work is thus of a similar flavor as that of cochran from 1990, who based his work on particular choices of seifert surfaces. but like mellor and melvin in 2003, who considered only the first invariant (after linking number), we allow for more arbitrary choices. we conjecture that milnor’s invariants can be recovered geometrically using the work of monroe and sinha on linking of letters and sinha and walters on hopf invariants. we expect our approach to recover cochran’s work and to extend work of polyak, kravchenko, goussarov, and viro on gauss diagrams.

 information theory provides a mathematical framework for quantifying information processing tasks, such as storage, computation, and communication. connecting the abstract theory to concrete physical systems often gives insight into a system's physics; conversely, physics can often inspire new ideas in information theory itself. this perspective has been particularly fruitful in quantum gravity, for which the essential question is to understand how information is stored and processed by gravitating systems, such as black holes or even the universe itself. in this talk we will see how quantum gravitational considerations lead to an extended nyquist-shannon sampling theorem for fields on lorentzian manifolds. applying the results to the physics of the early universe leads to predictions for cosmological signatures of quantum gravity that can be tested with present-day observations of the cosmos.

in this work, we present a difference of convex algorithm for solving bilevel programs in which the upper level objective functions are difference of convex functions, and the lower level programs are fully convex. this nontrivial class of bilevel programs provides a powerful modelling framework for dealing with applications arising from hyperparameter selection in machine learning. thanks to the full convexity of the lower level program, the value function of the lower level program turns out to be convex and hence the bilevel program can be reformulated as a difference of convex bilevel program. we propose an algorithm for solving the reformulated difference of convex program and show its convergence to stationary points under very mild assumptions.

in this talk, i will explore the rich interplay between differential equations and machine learning. i will highlight the use of collective dynamics and partial differential equations as powerful tools for improving machine learning algorithms and models. (i) in the first half of the talk, i will introduce a novel dynamical system that draws inspiration from collective intelligence observed in biology. this system offers a compelling alternative to gradient-based optimization. it enables gradient-free optimization to efficiently find global minimum in non-convex optimization problems. (ii) in the second half of the talk, i will build the connection between hamilton-jacobi-bellman equations and the multi-armed bandit (mab) problems. mab is a widely used paradigm for studying the exploration-exploitation trade-off in sequential decision-making under uncertainty. this is the first work that establishes this connection in a general setting. i will present an efficient algorithm for solving mab problems based on this connection and demonstrate its practical applications.

i'm gonna introduce p-adic analysis and i'm gonna talk about the skolem-mahler-lech theorem and i'm gonna blow your mind.

we discuss about smooth actions on manifold by higher rank lattices. we mainly focus on lattices in $\mathrm{sl}_n(\mathbb{r})$ ($n$ is at least $3$). recently, brown-fisher-hurtado and brown-rodriguez hertz-wang showed that if the manifold has dimension at most $(n-1)$, the action is either isometric or projective. both cases, we don't have chaotic dynamics from the action (zero entropy). we focus on the case when one element of the action acts with positive topological entropy. these dynamical properties (positive entropy element) significantly constrains the action. especially, we deduce that if there is a smooth action with positive entropy element on a closed $n$-manifold by a lattice in $\mathrm{sl}_n(\mathbb{r})$ ($n$ is at least $3$) then the lattice should be commensurable with $\mathrm{sl}_n(\mathbb{z})$. this is the work in progress with aaron brown.

 the successive minima of an order in a degree n number field are n real numbers encoding information about the euclidean structure of the order. how many orders in degree n number fields are there with almost prescribed successive minima, fixed galois group, and bounded discriminant? in this talk, i will address this question for n = 3, 4, 5. the answers, appropriately interpreted, turn out to be piecewise linear functions on certain convex bodies. if time permits, i will also discuss function field analogues of this problem.

[pre-talk at 1:20pm]

expander graphs are perhaps one of the most widely useful classes of graphs ever considered. in this talk, we will focus on a fairly weak notion of expanders called sublinear expanders, first introduced by komlós and szemerédi around 25 years ago. they have found many remarkable applications ever since. in particular, we will focus on certain robustness conditions one may impose on sublinear expanders and some applications of this very recent idea, which include: 

- recent progress on one of the most classical decomposition conjectures in combinatorics, the erdős-gallai conjecture,

- rainbow turan problem for cycles, raised by keevash, mubayi, sudakov and verstraete, including an application of this result to additive number theory and 

- essentially tight answers to the classical erdős unit distance and distinct distances problems in "almost all" real normed spaces of any fixed dimension.

moduli of cubic surfaces can be compactified from the point of view of geometric invariant theory (git), and from the point of view of the ball quotient. the kirwan desingularization resolves the git singularities to yield a smooth kirwan compactification, while the toroidal compactification of the ball quotient is also smooth. we show that these two smooth compactifications are, however, not isomorphic. based on joint work with s. casalaina-martin, k. hulek, r. laza

inspired by the rise on the interest for nonlocal models, mainly peridynamics, we decided to study a functional framework suitable for (variational) nonlocal models, such as that of nonlocal hyperelasticity. this has lead to a nonlocal framework based on truncated fractional gradients (i.e. nonlocal gradients with a fractional singularity defined over bounded domains), in which continuous and compact embeddings and, in particular, nonlocal poincaré inqualities has been obtained thanks to a nonlocal version of the fundamental theorem of calculus. as a consequence, the existence of minimizers of nonlocal polyconvex vectorial functionals is obtained, and more recently quasiconvex functionals. some of these last results have been obtained from a result that relates nonlocal gradients with classical ones and vice-versa. these results are accompanied by a study of the localization (recovering of the classical model) when s goes to 1 (actually, continuity on s with s being the fractional index of differentiability).

we will discuss quantum no-signaling correlations introduced by duan and winter with focus on its different subclasses (quantum commuting, quantum and local). they will appear as strategies of quantum-to-quantum non-local games. we will then discuss concurrent quantum non-local games, as quantum versions of synchronous/bisynchronous non-local games focusing on quantum graph homomorphism/isomorphism games, and provide tracial characterisations of their perfect strategies belonging to various correlation classes; e.g. the perfect strategies for quantum graph isomorphism game are given by tracial states on the universal c∗-algebra of the projective free unitary quantum group. this is a joint work with michael brannan, sam harris and ivan todorov.

the animation of delicate vortical structures of gas and liquids has been of great interest in computer graphics. however, common velocity-based fluid solvers can damp the vortical flow, while vorticity-based fluid solvers suffer from performance drawbacks. we propose a new velocity-based fluid solver derived from a reformulated euler equation using covectors. our method generates rich vortex dynamics by an advection process that respects the kelvin circulation theorem. the numerical algorithm requires only a small local adjustment to existing advection-projection methods and can easily leverage recent advances therein. the resulting solver emulates a vortex method without the expensive conversion between vortical variables and velocities. we demonstrate that our method preserves vorticity in both vortex filament dynamics and turbulent flows significantly better than previous methods, while also improving preservation of energy.

among all nd euclidean shapes carrying a degree of shade function, only those black and white ones, defined by a single polynomial inequality are determined by finitely many moments. in the single variable situation, a landmark moment transform discovered by a. markov untangles the above uniqueness feature. the 2d case is not less interesting, touching some spectral inverse problem for pairs of non-commuting self-adjoint transforms. a super-resolution phenomenon will be described in some detail with optimization and asymptotic expansion techniques.

i will begin by defining the notion of the differential power of an ideal. focusing on polynomial rings in two or three variables over a field of characteristic zero, i will discuss when the differential power of an ideal becomes principal. i will use differential powers to define the differential closure of an ideal and discuss how it relates to the radical of an ideal.

 the possible asymptotic distributions of a random dynamical system are described by stationary measures, and in this talk, we will be interested in the properties of these measures — in particular, whether they are absolutely continuous. first, i will quickly describe the case of bernoulli convolutions, which can be seen as generalizations of the cantor middle third set, and then the case of random iterations of matrices in $\mathrm{sl}(2, \mathbb{r})$ acting on the real projective line, where the stationary measure is unique under certain conditions and is called the furstenberg measure. it had been conjectured that the furstenberg measure is always singular when the random walk has finite support. there have been several counter-examples, and the aim of the talk will be to describe that of bourgain, where the measure even has a very regular density. i will explain why the construction works for any simple lie group, using the work of boutonnet, ioana, and salehi golsefidy on local spectral gaps in simple lie groups.

 translators are known as candidates of type ii blow-up model for mean curvature flows. various examples of mean curvature flow translators have been constructed in the convex case and semi-graphical case, most of which have either infinite entropy or higher multiplicity asymptotics near infinity. in this talk, we shall present the construction of a new family of translators with prescribed end. this is based on the joint work with ao sun.

the central limit theorem (clt) plays an indispensable role in classical statistical inference for finite-dimensional parameters, including calibration of confidence sets and statistical tests. however, the validity of the clt in high dimensional problems where the dimension (p) of the observations diverges to infinity with the sample size (n) is no longer guaranteed. there is extensive recent work on the problem, following the seminal paper by chernozhukov, chetverikov, and kato (2013; annals of statistics), that attempts to establish the clt (or gaussian approximation) in high dimensions under various growth conditions on the dimension p. in this talk, we present some new results on gaussian approximation for different classes of sets, providing insights into specific distributional characteristics of the underlying high dimensional random vectors that determine the optimal growth rates.

i will talk about my recent joint work with aubert where we prove the local langlands conjecture for g_2 (explicitly). this  uses our earlier results on hecke algebras attached to bernstein components of reductive p-adic groups, as well as an expected property on cuspidal support, along with a list of characterizing properties. in particular, we obtain "mixed" l-packets containing f-singular supercuspidals and non-supercuspidals.

[pre-talk at 1:20pm]

the growth of an e. coli colony on hard agar exhibits robust expansion kinetics and morphology despite the complex interactions between millions of cells experiencing compact confinement under a spatiotemporally varying nutrient gradient. to probe the mechanistic origins of such robust colony characteristics, an agent-based model along with a set of reaction-diffusion equations to model the spatiotemporal dynamics of extracellular metabolites is employed. for colonies grown on glucose minimal medium plates, we find glucose depletion driven by anaerobiosis to be the primary factor contributing to the experimentally observed saturation in vertical expansion, while the excreted fermentation products play a crucial role for cell maintenance at the aerated colony surface. we also establish that the well-known linear expansion of the colony radius is not limited by nutrients. overall, our study emphasizes that in addition to mechanical interactions, the spatiotemporally varying metabolite gradients and the mode of metabolism of the individual cells determine the emergent morphology and expansion kinetics of the macroscopic colony.

i will talk about manolescu's work on the triangulation conjecture. using equivariant homology theory, it is proved that there exist non-triangulable manifolds in high dimensions. i will introduce the equivariant stable homotopy theory and some of its applications.

the slopes of modular forms are the $p$-adic valuations of the eigenvalues of the hecke operators $t_p$. the study of slopes plays an important role in understanding the geometry of the eigencurves, introduced by coleman and mazur.

the study of the slope began in the 1990s when gouvea and mazur computed many numerical data and made several interesting conjectures. later, buzzard, calegari, and other people made more precise conjectures by studying the space of overconvergent modular forms. recently, bergdall and pollack introduced the ghost conjecture that unifies the previous conjectures in most cases. the ghost conjecture states that the slope can be predicted by an explicitly defined power series. we prove the ghost conjecture under a certain mild technical condition. in the pre-talk, i will explain an example in the quaternionic setting which was used as a testing ground for the proof.

this is joint work with ruochuan liu, liang xiao, and bin zhao.

the q-canonical commutation relation (q-ccr) is an interpolation between the ccr and the car with a parameter q. in the 1990s, m. bożejko and r. speicher found that the q-ccr is represented on the q-fock space. the q-gaussians are realized as the field operators with the vacuum state, which forms a non-commutative distribution. 

on the other hand, a conjugate system is a notion of free probability introduced by d. voiculescu. this carries important information about a non-commutative distribution of given operators and has many implications for the generated von neumann algebra.  

in this talk, i will present a concrete formula for the conjugate system for the q-gaussians. this talk is based on the joint work with r. speicher.

we will discuss various constructions of modular forms in the context of classical and exceptional theta correspondences. 

geometric numerical integrators are numerical methods used to solve ordinary and partial differential equations that preserve geometric properties of the underlying dynamical systems. these methods are designed to accurately approximate the trajectories of the systems while conserving important physical or mathematical properties such as energy, momentum, symplecticity, or volume. in this talk, i will be talking about two classes of geometric numerical integrators both of which suffer from parasitic instabilities namely g-symplectic general linear methods for hamiltonian systems and variational integrators for degenerate lagrangian systems. i will also discuss the strategies to control the effect of parasitism in these methods.

the $c_2$-equivariant stable stems were first studied by bredon and landweber, in the 1960s. from the start, it was clear that these groups exhibited certain periodic behavior closely related to james periodicity for stunted projective spaces. this was made more explicit and extensively applied to computations by araki and iriye in the late 1970s / early 1980s. in the past decade, this phenomena has been lifted to $\mathbb{r}$-motivic homotopy theory under the guise of "$\tau$-periodicity", and plays a central role in behrens and shah's work relating $\mathbb{r}$-motivic and $c_2$-equivariant homotopy theory.

in this talk, i will review some of the above story, and then explain how similar periodic phenomena occurs in $g$-equivariant stable homotopy theory for an arbitrary finite group $g$.

how many essentially distinct ways are there to arrange $n$ convex sets in $\mathbb{r}^d$? here, `essentially distinct' means with different intersection pattern'. we discuss this question both in the dimension $1$, where it amounts to counting the interval graphs, and in higher dimenions. based on the joint works with amzi jeffs.  plain text abstract: how many essentially distinct ways are there to arrange n convex sets in r^d? here, `essentially distinct' means `with different intersection pattern'. we discuss this question both in the dimension 1, where it amounts to counting the interval graphs, and in higher dimenions. based on the joint works with amzi jeffs.

the classical kakeya needle problem asks: what is the smallest set in the plane inside which a unit-length needle can be translated and rotated through a full 360-degree turn? in this talk, we will show how to construct such sets of arbitrarily small measures (known as kakeya sets). we will then describe some applications to several important problems in analysis where this seemingly innocuous rotation property can lead to very counterintuitive and pathological results.

the quantum unique ergodicity conjecture of rudnick and sarnak says that eigenfunctions of the laplacian on a compact manifold of negative curvature become equidistributed as the eigenvalue tends to infinity. in the talk, i will discuss recent work on this problem for arithmetic quotients of the three-dimensional hyperbolic space. i will discuss our key result that hecke eigenfunctions cannot concentrate on certain proper submanifolds. joint work with lior silberman.

we consider {0,1}-matrices. for matrices a and b, we say a contains b as a configuration if there is a submatrix of a that is a column and row permutation of b. for instance, if a and b are incidence matrices of graphs g and h respectively, then a contains b as a configuration if and only if g contains h as a subgraph. in this talk, we study some extremal problems for matrices and hypergraphs (set systems).

the birational classification of foliated surface is pretty much complete, thanks to the work of brunella, mendes, mcquillan. the next obvious step in this endeavour, in analogy with the classical case of projective varieties and log pairs, is to construct moduli spaces for foliated varieties (starting from the general type case). the first question to ask, on the road towards constructing such a moduli space, is how to show that foliated varieties of fixed kodaira dimension are bounded, that is, they come in finitely many algebraic families ― provided, of course, that we fix certain appropriate numerical invariants. it turns out that, to best answer this question, rather than working with the canonical divisor of a foliation it is better to consider linear systems of the form $|nk_x + mk_f|, n,m >0, as those encode a lot of the positivity features that classically the canonical divisor of a projective variety displays.
in this talk, i will introduce this framework and explain how this approach leads to answering the question about boundedness for foliated surfaces. time permitting, i will address also what happens when we try to construct a moduli functor, or rather, what we have been finding out, so far. this talk features joint work with c. spicer, work with j. pereira, and work in progress with m. mcquillan and c. spicer.

numerical semigroups are combinatorial objects that lead to deep and subtle questions.  with tools from complex, harmonic, and functional analysis, probability theory, algebraic combinatorics, and computer-aided design, we answer virtually all asymptotic questions about factorization lengths in numerical semigroups.  our results yield uncannily accurate predictions, along with unexpected results about symmetric functions, trace polynomials, and the statistical properties of certain af c$^*$-algebras. 

partially supported by nsf grants dms-1800123 and dms-2054002.  joint work (in various combinations) with k.~aguilar, a.~b\"ottcher, \'a. ch\'avez, l.~fukshansky, m.~omar, c.~o'neill, j.~vol\v{c}i\v{c} and undergraduate 2022年亚洲世界杯预选赛 j.~hurley, g.~udell, t.~wesley, s.~yih.

 modified newton methods are designed to extend the desirable properties of classical newton method to a wider class of optimization problems. if the hessian of the objective function is singular at the solution, these methods tend to behave like gradient descent and rapid local convergence is lost. an adaptive regularization technique is described that yields a modified newton method that retains superlinear local convergence on non-convex problems without the nonsingularity assumption at the solution. the minimum norm perturbation and symmetric indefinite factorization used to construct a sufficiently positive definite approximate hessian are discussed, and numerical results comparing regularized and standard modified newton methods will be presented. lastly, a well-behaved pathological example will be used to illustrate an assumption required for superlinear convergence.

i will present a recent joint work with andrew lawrie from mit. we consider the harmonic map heat flow for maps from the plane $r^2$ to the sphere $s^2$, under the so-called equivariant symmetry. it is known that solutions to the initial value problem exhibit bubbling along a sequence of times - the solution decouples into a superposition of harmonic maps concentrating at different scales and a body map that accounts for the rest of the energy. we prove that this bubble decomposition occurs continuously in time. the main new ingredient in the proof is the notion of a collision interval motivated by our recent work on the soliton resolution problem for equivariant wave maps.

schubert polynomials originated in the study of the cohomology ring for the complete flag manifold by bernstein, gelfand, and gelfand and demazure, with their combinatorics, developed extensively by lascoux and schutzenberger. for each permutation, there is a schubert polynomial which, when evaluated at certain chern classes, gives the cohomology class of a schubert subvariety of the flag manifold. thus the schubert structure constants enumerate flags in a suitable triple intersection of schubert varieties. as such, they are known from geometry to be nonnegative. a fundamental open problem in algebraic combinatorics is to give a positive combinatorial formula for these structure constants. 

recently, i conjectured a formula for schubert structure constants in the classical flag manifold that occurs in the product of an arbitrary schubert class by one pulled back from a grassmannian projection. in this talk, i’ll present joint work with nantel bergeron in which we define an insertion algorithm on kohnert diagrams, proving this conjecture. 

this talk should be generally accessible, with no prior knowledge of schubert varieties or schubert polynomials required.

the segal conjecture suggests that the 2-completed $c_2$-equivariant sphere is equivalent to its homotopy completion. however, the genuine $c_2$-equivariant adams spectral sequence for the $c_2$-equivariant sphere is not isomorphic to the borel one. in this talk, i will show that the borel $c_2$-equivariant adams spectral sequence can be obtained from the genuine one through a degree shifting of the negative cone with connecting differentials shortened. i will also show that the borel $c_2$-equivariant adams spectral sequence is related to some classical adams spectral sequences, whose $e_2$-terms are computable through the curtis algorithm.

in 1903, max dehn settled the following question: which rectangles can you tile with finitely many square tiles (possibly of different sizes)? in this talk, we'll see two (relatively) modern proofs of his result. the first involves redefining the area of a rectangle in a way that would make a measure theorist's skin crawl, and the second involves something even more sacrilegious: physics.

equidistribution properties of translates of orbits for subgroup actions on homogeneous spaces are intimately linked to the mixing features of the global action of the ambient group. the connection appears already in margulis' thesis (1969), displaying its full potential in the work of eskin and mcmullen during the nineties. on a quantitative level, the philosophy underlying this linkage allows transferring mixing rates to effective estimates for the rate of equidistribution, albeit at the cost of a sizeable loss in the exponent. in joint work with ravotti, we instead resort to a spectral method, pioneered by ratner in her study of quantitative mixing of geodesic and horocycle flows, in order to obtain the precise asymptotic behavior of averages of regular observables along expanding circles on compact hyperbolic surfaces. the primary goal of the talk is to outline the salient traits of this method, illustrating how it leads to the relevant asymptotic expansion. in addition, we shall also present applications of the main result to distributional limit theorems and to quantitative error estimates on the corresponding hyperbolic lattice point counting problem; predictably, the latter fails to improve upon the currently best-known bound, achieved via finer methods by selberg more than half a century ago.

consider a smooth manifold with a riemannian metric satisfying some sort of curvature or other geometric constraints like, for example, positive scalar curvature, non-negative ricci or negative sectional curvature, being einstein, kähler, sasaki, etc. a natural question to ponder is then what the space of all such metrics does look like. moreover, one can also pose this question for corresponding moduli spaces of metrics, i.e., quotients of the former by (suitable subgroups of) the diffeomorphism group of the manifold, acting by pulling back metrics. the study of spaces of metrics and their moduli has been a topic of interest for differential geometers, global and geometric analysts, and topologists alike, and i will introduce to and survey in detail the main results and open questions in the field with a focus on non-negative ricci or sectional curvature as well as other lower curvature bounds on closed and open manifolds, and, in particular, also discuss broader non-traditional approaches from metric geometry and analysis to these objects and topics

$p$-adic representations are important objects in number theory, and stable lattices serve as a connection between the study of ordinary and modular representations. these stable lattices can be understood as stable vertices in bruhat-tits buildings. from this viewpoint, the study of fixed point sets in these buildings can aid research on $p$-adic representations. the simplicial distance holds an important role as it connects the combinatorics of lattices and the geometry of root systems. in particular, the fixed-point sets of moy-prasad subgroups are precisely the simplicial balls. in this talk, i'll explain those findings and compute their simplicial volume under certain conditions.

[pre-talk at 1:20pm]

we construct a family of operator systems and k-aou spaces generated by a finite number of projections satisfying a set of linear relations. this family is universal in the sense that the map sending the generating projections to any other set of projections that satisfy the same relations is completely positive. these operator systems are constructed as inductive limits of explicitly defined operator systems. by choosing the linear relations to be the non-signaling relations from quantum correlation theory, we obtain a hierarchy of ordered vector spaces dual to the hierarchy of quantum correlation sets. by considering another set of relations, we also find a new necessary condition for the existence of a sic-povm.

i will survey recent results regarding the dynamics of positive definite functions and character rigidity of irreducible lattices in higher-rank semisimple algebraic groups. these results have several applications to ergodic theory, topological dynamics, unitary representation theory, and operator algebras. in the case of lattices in higher-rank simple algebraic groups, i will explain the key operator algebraic novelty, which is a noncommutative nevo-zimmer theorem for actions on von neumann algebras. i will also present a noncommutative margulis' factor theorem and discuss its relevance regarding connes' rigidity conjecture for group von neumann algebras of higher-rank lattices.

semidefinite programming (sdp) forms a class of convex optimization problems with remarkable modeling power. apart from its classical applications in combinatorics and control, it also enjoys a range of applications in data science. this talk first discusses various concrete sdps in data science and their conditioning. in particular, we show that even though slater’s constraint qualification condition may fail, these sdps satisfy an important regularity, strict complementarity, which ensures the good conditioning of the problem. in the second part of the talk, based on the regularity and computational structure shared by these problems, we design time- and space-efficient algorithms to solve these sdps.

we describe a principled approach for constructing non-vacuum initial data sets for the cauchy problem in general relativity. the core idea has an interesting history of having been known in the '70s,
forgotten by the mathematical relativity community for decades, and now
independently rediscovered and rigorously demonstrated. we show how
it explains why certain techniques for generating initial data
worked well in the past, but also how it leads to new equations
with applealing physical properties when generating initial data containing
fluids. the talk will be targeted at a broad audience.

i’ll discuss recent progress on the existence theory for harmonic maps, in particular the existence of harmonic maps of optimal regularity from manifolds of dimension n>2 to every non- aspherical closed manifold containing no stable minimal two-spheres. as an application, we’ll see that every manifold carries a canonical family of sphere-valued harmonic maps, which (in dimension<6) stabilize at a solution of a spectral isoperimetric problem generalizing the conformal maximization of laplace eigenvalues on surfaces. based on joint work with mikhail karpukhin.

 i will discuss recent advances in our understanding of the stable homotopy groups of spheres using formal groups, modular forms, and  (time permitting) motives.

syzygies of algebraic varieties have long been a topic of intense interest among algebraists and geometers alike. starting with the pioneering work of mark green on curves, numerous attempts have been made to extend these results to higher dimensions. ein and lazarsfeld proved that if a is a very ample line bundle, then k_x + ma satisfies property n_p for any m>=n+1+p. it has ever since been an open question if the same holds true for a ample and basepoint free. in joint work with purnaprajna bangere we give a positive answer to this question.

in this talk, i will give a survey of recent and upcoming results on various linear, semilinear, and quasilinear wave equations on a wide class of dynamical spacetimes in various even and odd spatial dimensions. these results include asymptotics for a wide range of nonlinearities. for many of these results, the spacetimes under consideration have only weak asymptotic flatness conditions and are allowed to be large perturbations of the minkowski spacetime, provided that an integrated local energy decay estimate holds. we explain the dichotomy between even- and odd-dimensional wave behaviour. part of this work is joint with mihai tohaneanu and jared wunsch.

in this talk we'll investigate the primeness of generalized wreath product ii1 factors using techniques from deformation/rigidity theory. we give general conditions relating tensor decompositions of generalized wreath products to stabilizers of the associated group action, and use this to find new examples of prime ii1 factors.

configuration spaces are not only fundamental objects in mathematics, but appear in numerous areas such as robot motion planning, dna sequencing, sensor networks, and origami designs. our story is motivated by objects in algebraic geometry, namely the configuration space of surface deformations. to understand this space, we consider a combinatorial viewpoint based on scribbling loops on the surface. this leads to a classification of such spaces that can be realized as convex polytopes, capturing elegant hidden algebraic
structures.  these spaces now appear across a broad spectrum of research, including amplituhedra, geometric group theory, and phylogenetics networks. the entire talk is heavily infused with visual imagery and concrete examples.

topological hochschild homology(thh), which is a lift of hochschild homology to the stable category, has recently seen a large paradigm shift in the way it and related invariants are studied.
this is due to several groundbreaking results, among which are the results of bhatt, morrow, and scholze which introduce the quasisyntomic topology and compute the quasisyntomic filtration of topological hochschild homology, topological negative cyclic homology ($tc^{-}$), topological periodic homology(tp), and topological cyclic homology(tc). building on these results, i will talk about the quasisyntomic filtration on the quasisyntomic sheaves $thh(-)^{hc_n}$ and $thh(-)^{tc_n}$ where $c_n$ is the finite cyclic group of order $n$. these give cohomology theories that interpolate between the quasisyntomic filtrations on $thh$ and those on $tc^{-}$ and $tp$, and as it turns out can be expressed in terms of sheaves already of central importance to the study of the cohomology theories introduced by bhatt, morrow, and scholze.
as applications, i will explain how these filtrations can be used to extend the results of angeltveit, gerhardt, and hesselholt on the k-theory of truncated polynomial algebras, and a result on topological restriction homology.

i'm gonna introduce p-adic analysis and i'm gonna talk about the skolem-mahler-lech theorem and i'm gonna blow your mind.

the fractal uncertainty principle (fup) was introduced by dyatlov and zahl which states that a function cannot be localized near a fractal set in both position and frequency spaces. it has rich applications in spectral gaps and quantum chaos on hyperbolic manifolds and has recently been an active area of research in harmonic analysis. i will talk about the history of the fractal uncertainty principle and explain its applications to spectral gaps. then i will talk about our recent work, joint with aidan backus and james leng, which proves a general fractal uncertainty principle for small fractal sets, improving the volume bound in higher dimensions. this generalizes the work of dyatlov--jin using dolgopyat's method. as an application, we give effective essential spectral gaps for convex cocompact hyperbolic manifolds in higher dimensions with zariski dense fundamental groups.

this talk is an exposition on the partial progress of yau's conjecture on the lower estimate of the first eigenvalue of embedded minimal hypersurfaces in a unit sphere.

in this talk we investigate stochastic chemical reaction networks with scaling methods. this approach is used to study the stability properties of the associated markov processes, but also to investigate the transient behavior of these networks. it may give insight on the impact of complex features of these networks such as their polynomial rates, leading to the coexistence of multiple timescales. several examples are discussed.

please contact professor williams for zoom information.

 a guiding question in number theory, specifically in arithmetic statistics, is counting number fields of fixed degree and galois group as their discriminants grow to infinity.  we will discuss the history of this question and take a closer look at the story in the case of quartic fields. in joint work with florea, serrano lopez, and varma, we extend and make explicit the counts of extensions of an arbitrary number field that was done over the rationals by cohen, diaz y diaz, and olivier.

rochelle gutiérrez defines four dimensions of equity in mathematics education: access, achievement, identity, and power. in this talk, we briefly explore these dimensions and specific examples of how they can motivate course design choices. in particular, i will discuss my redesign of uw-madison's college algebra course from 2016 to 2018 and course design choices for ucsd's math 2 in winter 2022.

recall that an algebraic variety is rational if it is birational to a projective space. in this talk, i will review classical results and i will report on progress in the last decade. this includes rationality of hypersurfaces,  deformation properties, and equivariant properties.

in k-12 school contexts, responsive math pedagogy typically refers to instruction where the teacher continuously elicits information about what 2022年亚洲世界杯预选赛 currently know and understand and responds in ways that move them forward in relation to developmental and grade-level mathematical goals. it is claimed that recognizing what 2022年亚洲世界杯预选赛 know and are able to do and leveraging that to move towards higher level reasoning and problem solving ensures equity and access to mathematics for all 2022年亚洲世界杯预选赛 . inspired by this approach, i discuss my teaching, research, and leadership efforts aimed at fostering a form of responsive pedagogy in collegiate math contexts. i discuss how these efforts can be relevant to mathematics teaching and learning at ucsd, especially in relation to increasing the retention and persistence of 2022年亚洲世界杯预选赛 from historically underrepresented backgrounds. 

a fleming-viot process is a system of n particles driven by independent copies of a driving markov process. when one of the particles hits the boundary of the domain, it is killed, and some other particle branches. there is only one infinite path (spine) in the branching structure. under some assumptions, when n goes to infinity, the distribution of the spine converges to the distribution of the driving markov process conditioned to avoid the boundary of the domain forever. 

based on joint articles with m. bieniek, j. englander, and t. tadic.

ricci flow deforms the riemannian structure of a manifold in the direction of its ricci curvature and tends to regularize the metric. this provides useful information about the underlying space. ricci solitons are special solutions to the ricci flow and arise naturally in the singularity analysis of the flow. we shall discuss some curvature and entropy gap theorems of gradient ricci solitons. this talk is based on joint works with yongjia zhang and zilu ma, eric chen and man-chun lee.

gene expression is the fundamental biological process by which rna and protein molecules are produced in a cell based on the information encoded in the dna. the regulation of gene expression dictates which genes are expressed and when, which is crucial for cells to perform specific functions and adapt to changes in their environment. single-cell experiments reveal that rna production occurs in bursts whose size and timing is random.  over the last thirty years, a plethora of mathematical models of stochastic gene expression have been developed in order to understand the origin of this noise. however, solving these models analytically becomes progressively more difficult as their complexity is increased. in this talk, i will show how many of these models can be solved using the queueing theory, which in turn can help us to solve the inverse problem of inferring the kinetics of gene expression from single-cell measurements of rna numbers.

we introduce a new lattice basis reduction algorithm with approximation guarantees analogous to the lll algorithm and practical performance that far exceeds the current state of the art. we achieve these results by iteratively applying precision management techniques within a recursive algorithm structure and show the stability of this approach. we analyze the asymptotic behavior of our algorithm, and show that the heuristic running time is $o(n^{\omega}(c+n)^{1+\varepsilon})$ for lattices of dimension $n$, $\omega\in (2,3]$ bounding the cost of size reduction, matrix multiplication, and qr factorization, and $c$ bounding the log of the condition number of the input basis $b$. this yields a running time of $o\left(n^\omega (p + n)^{1 + \varepsilon}\right)$ for precision $p = o(\log \|b\|_{max})$ in common applications. our algorithm is fully practical, and we have published our implementation. we experimentally validate our heuristic, give extensive benchmarks against numerous classes of cryptographic lattices, and show that our algorithm significantly outperforms existing implementations.

[pre-talk at 1:20pm]

in this talk, i will give an overview of some tools used in probabilistic combinatorics, and illustrate their use in two different projects. first, in joint work with marcus michelen and will perkins, we establish an asymptotic formula for the number of integer partitions of a general type: namely, partitions of an integer n where the sums of the kth powers of the parts are also fixed, for some collection of values k. second, in joint work with lina li and jinyoung park, we give enumerative and structural results for colorings of the middle layers of the hamming cube. this talk does not assume a lot of background, and it’s definitely okay if you don’t know much probability or combinatorics!

let $f_1,\ldots, f_r \in k[x_1,\ldots, x_n]$ be homogeneous polynomial of degree $d$. ananyan and
hochster (2016) proved that there exists a bound $n = n(r, d)$ where if collective strength
of $f_1, \ldots, f_r \geq n$, then $f_1, \ldots, f_r$ are regular sequence. in this paper, we study the explicit
bound $n(r, d)$ when $r = 3$ and $d = 2, 3$ and show that $n(3, 2) = 2$ and $n(3; 3) > 2$.

the study of regularity in free probability boils down to the question of how much information about a *-algebra can be gleaned from probabilistic properties of its generators. some of the first results in this theme come from the theory of voiculescu's free entropy: generators satisfying certain entropic assumptions generate von neumann algebras which are non-gamma, or prime, or do not admit cartan subalgebras. free stein dimension -- a quantity i introduced with nelson -- is a more recent quantity in a similar vein, which is robust under polynomial transformations and not trivial for variables which do not embeddable in r^\omega.

in this talk, i will recall the motivation and definition of free stein dimension, and spend some time focusing on how (approximate) algebraic relations between generators can be used to provide upper bounds on the stein dimension; of particular interest are commutation, and good behaviour under conjugation, and i will mention how these results apply in some interesting examples. time permitting i will discuss how free stein dimension behaves under ``building block'' operations such as direct sums and tensor products with finite dimensional algebras. this is joint work with brent nelson.

many seemingly ad hoc constructions in algebra become simpler and much more natural through the lens of bicategories. in this talk i'll describe a series of papers with kate ponto touching on euler characteristics, 2 dimensional field theories, and topological hochschild homology, which never could have been written without thinking bicategorically. particular focus will be put on iterated traces (relating to 2d field theories) and the structure of topological hochschild homology.
 

i will discuss recent joint work with hayes wherein we show that any sofic group g that is initially sub-amenable (a limit of amenable groups in grigorchuk's space of marked groups) admits two embeddings into the universal sofic group s that are not conjugate by any automorphism of s. time permitting, i will also characterise precisely when two almost homomorphisms of an amenable group g are conjugate, in terms of certain irs's associated to the two actions of g. one of the applications of this is to recover the result of becker-lubotzky-thom around permutation stability for amenable groups. the main novelty of our work is the usage of von neumann algebraic techniques in a crucial way to obtain group theoretic consequences.

the classical diophantine problem of determining  which integers can be written as a sum of two rational cubes has a long history; it includes works of sylvester,  selmer, satgé, leiman  and the recent work of alpöge-bhargava-shnidman-burungale-skinner.  in this talk, we will  use  selmer groups of elliptic curves and integral binary cubic forms to study some cases of the rational cube sum problem.  this talk is based on  joint works with d. majumdar, p. shingavekar and b. sury.

[pre-talk at 1:20pm]

in this talk we will discuss how to define brownian motions on a curved space. we will briefly discuss some definitions on riemannian manifolds and then focus on a construction on lie groups. if time permits, we will discuss quasi-invariance with respect to left/right-multiplication and how this is related to the geometry of the group. (p.s. a background in probability is not required)

for example, in the case where \calm = bpgl_n, this gives a recipe to extend fibrations in brauer-severi varieties, whereas for \calm = [a^1/gm] this gives a way to extend families of line bundles with a section. the talk is based on a joint work with andrea di lorenzo.

 a natural class of dynamical systems is obtained by iterating polynomial maps, which can be viewed as maps from projective space to itself. one can ask which other projective varieties admit endomorphisms of degree greater than 1. this seems to be an extremely restrictive property, with all known examples coming from toric varieties (such as projective space) or abelian varieties. we describe what is known in this direction, with the new ingredient being the "bott vanishing" property. joint work with tatsuro kawakami.

we give an introduction to the theory of zeta functions for function fields of characteristic p > 0. i will discuss the history of these zeta functions, what is known about their special values, and the question of the distribution of their zeros. i will also present some recent work with joe kramer miller which constitutes a riemman hypothesis for the zeta functions of "ordinary" function fields.

in this talk, we show the extension (in spirit of caffarelli-silvestre) of fractional power of operators defined on banach spaces. starting with the balakrishnan definition, we use semigroup method to prove the extension. this is a joint work with pablo raul stinga.
 

i will talk about $n_\infty$ operads, a generalization of $e_\infty$ operads in the equivariant world, following blumberg-hill. we show that the admissible sets of an $n_\infty$ operad capture the data of the norm maps of its algebra. this ties the notion of norms in the (incomplete) tambara functors, which are the commutative algebra objects in mackey functors.
 

many problems in finite geometry follow the following pattern: say we have a set of points in a plane, and require that some combinatorial property holds. can we say something about the algebraic structure of this set? and what if we impose some extra symmetry conditions?  by far the most famous example of such a theorem is segre’s beautiful characterisation of conics in a desarguesian projective plane of odd order $q$ (1955): every oval (which is a set $c$ of $q+1$  points such that no line contains more than $2$ points of $c$) is the set of points of a conic.  in this talk, we will explore some classical results about ovals and hyperovals and present more recent results of the same flavour about km-arcs and quasi-quadrics.

when considering topological spaces with algebraic structures, there are certain properties which are invariant under homotopy equivalence, such as homotopy-associativity, and others that are not, such as strict associativity. a natural question is: which properties, in general, are homotopy invariant? as this involves a general notion of "property", it is a question of mathematical logic, and in particular suggests that we need a system of logical notation which is somehow well-adapted to the homotopical context. such a system was introduced by voevodsky under the name homotopy type theory. i will discuss a sort of toy version of this, which is the case of "first-order homotopical logic", in which we can very thoroughly work out this question of homotopy-invariance. the proof of the resulting homotopy-invariance theorem involves some interesting ("fibrational") structures coming from categorical logic.

 among the infinitely many mathematical models, which one god chooses for our universe?
what are the common features of all those models? 

we start with two of the most well-studied random matrix ensembles. the limiting eigenvalue distribution of one of which is uniform on the unit disk, and the other of which is a semicircular distribution on the real line. these two distributions have a simple relation: 2 times the real part of the uniform measure on the disk gives you the semicircular distribution. in the first part of the talk i will speak about the "heat flow conjecture" which states that this simple relation can be accomplished in the matrix level by applying the heat operator to the characteristic polynomial of one of the random matrix. then i will move to the case where we apply the heat operator to a random polynomial which has roots distributed approximately uniform on the disk. in this random polynomial case, we can prove a version of the heat flow conjecture if we replace the characteristic polynomial by the random polynomial in the statement of the conjecture. finally, i will speak about the case of heat flow on the plane gaussian analytic function (gaf). these are joint work with brian hall and joint work with brian hall, jonas jalowy, and zakhar kabluchko.

for closed curves evolving by their curvature, the theorem of gage-hamilton and grayson establishes that an embedded curve contracts to a round point. an efficient proof was later found by huisken, with improvements by andrews-bryan, which uses multi-point maximum principle techniques. we’ll discuss the use of these techniques in other settings, particularly for the long-time behaviour of curve shortening flow with free boundary.

perfectoid signature and local étale fundamental group abstract: in this talk i'll talk about a (perfectoid) mixed characteristic version of f-signature and hilbert-kunz multiplicity by utilizing the perfectoidization functor of bhatt-scholze and faltings' normalized length. these definitions coincide with the classical theory in equal characteristic. moreover, perfectoid signature detects bcm regularity and transforms similarly to f-signature or normalized volume under quasi-étale maps. as a consequence, we can prove that bcm-regular
rings have finite local étale fundamental group and torsion part of their divisor class groups. this is joint work with seungsu lee, linquan ma, karl schwede and kevin tucker.

[pre-talk at 1:20pm]

let $\gamma < g = \operatorname{so}(n, 1)^\circ$ be a zariski dense torsion-free discrete subgroup for $n \geq 2$. then the frame bundle of the hyperbolic manifold $x = \gamma \backslash \mathbb{h}^n$ is the homogeneous space $\gamma \backslash g$ and the frame flow is given by the right translation action by a one-parameter diagonalizable subgroup of $g$. suppose $x$ is geometrically finite, i.e., it need not be compact but has at most finitely many ends consisting of cusps and funnels. endow $\gamma \backslash g$ with the unique probability measure of maximal entropy called the bowen-margulis-sullivan measure. in a joint work with jialun li and wenyu pan, we prove that the frame flow is exponentially mixing.

a kakeya set is a set of points in r^n which contains a unit line segment in every direction. the kakeya conjecture states that the dimension of any kakeya set is n. this conjecture remains wide open for all n \geq 3.

together with josh zahl, we study a special collection of the kakeya sets, namely the sticky kakeya sets, where the line segments in nearby directions stay close. we prove that sticky kakeya sets in r^3 have dimension 3.  in this talk, we will discuss background of the problem and its connection to analysis, combinatorics, and geometric measure theory. 

from a directed graph q, called a quiver, one can construct what is known as a quiver variety y_q, an algebraic variety defined as a quotient of a vector space by a group defined in terms of q.  a mutation of a quiver is an operation that produces from q and new directed graph q’ and a new associated quiver variety y_{q’}.  the mutation conjecture predicts a surprising and beautiful connection between the geometry of y_q and that of y_{q’}.  in this talk i will describe quiver varieties and mutations, and show you that you are already well acquainted with some examples of these.  then i will discuss an interesting connection to the gromov—witten theory of degeneracy loci. this is based on joint work with nathan priddis and yaoxiong wen.

we present our construction of novel continuous and discrete type ii variational principles for hamiltonian systems on cotangent bundles of lie groups, which allows for type ii boundary conditions, i.e., fixed initial position and terminal momenta boundary conditions. the motivation for these boundary conditions arises from the adjoint sensitivity method, which is ubiquitous in dynamically-constrained optimization and optimal control problems. traditionally, such type ii variational principles are only defined locally. however, for dynamics on the cotangent bundle of a lie group, left-trivialization allows us to define this variational principle globally. our discrete variational principle leads to an intrinsic, symplectic, and momentum-preserving integrator for lie group hamiltonian systems that allows for type ii boundary conditions and maximally degenerate hamiltonians. we show how this method can be used to exactly compute sensitivities for optimization problems subject to dynamics on a lie group. we conclude with numerical examples of optimal control problems on so(3) and a discussion of future applications of this method. 

stein's restriction conjecture is one of the central topics in fourier analysis. it is closely related to other areas of math, for example, number theory, pdes. in this talk, i will discuss a recent improvement of this conjecture in r^3, based on the joint work with hong wang. our proof is built upon the framework of polynomial partitioning, and, among other things, it uses the refined decoupling theorem, a two-ends kakeya estimate. the two-ends estimate captures some information from the method of induction on scales.

voiculescu developed two main candidates for the analogs of entropy in free probability: the microstates and non-microstates free entropies. in 2003, biane-capitaine-guionnet established a relationship between the two: the microstates free entropy is always bounded above by the non-microstates free entropy. in this talk, we discuss the conditional versions of these notions of free entropy. then, by connecting each of the free entropies with the asymptotics of their classical counterparts, we provide an elementary proof of the result of biane-capitaine-guionnet. this is joint work with david jekel.

the eigencurve is an important object in the study of p-adic families of modular forms, yet many of its geometric structures remain mysterious. i will give an elementary introduction to the theory of p-adic modular forms and the construction of eigencurve. then we will take a glance at this beautiful conjecture.

in 2016 abert, gelander, and nikolov made what they called a provocative conjecture: for lattices in higher-rank simple lie groups, the minimum size of a generating set (rank) is sublinear in the volume. i will discuss our solution to this conjecture. it is a corollary of our main result, where we establish "fixed price one" for a more general class of "higher rank" groups. no familiarity of fixed price or cost is required for the talk. joint work with mikolaj fraczyk and amanda wilkens.

the analysis of non-markovian, self-interacting diffusions, which has motivations from probability, physics, biology, etc., is intimately connected with that of an associated stochastic interface. in this talk, we will look at dynamical fluctuations of this interface, and derive a kpz-type stochastic pde as a scaling limit. unlike the usual kpz equation, the geometry of the underlying manifold plays an important role in the analysis of this spde. deriving the spde from the diffusion model is based on a novel "local-to-global" stochastic homogenization principle. studying the spde itself amounts to relatively modern ideas in stochastic analysis coupled with analysis of pseudo-differential operators on manifolds. based on joint work with amir dembo.

this talk is based on a joint work with xiaojun huang entitled “bergman metrics as pull-backs of the fubini-study metric”. we study domains in cn or stein manifolds m such that their bergman metrics have constant holomorphic sectional curvature κ. we prove a uniformization theorem when κ < 0 through the calabi rigidity theorem and holomorphic extension theorems. we also discuss the case when κ ≥ 0. we provide several interesting examples of the existence of such m. under certain conditions on m, we prove that the bergman metric of m can not have non-negative constant holomorphic sectional curvatures.

 we prove that a sequence of multi-scaled stationary distributions of reflected brownian motions (rbms) has a product-form limit. each component in the limit is an exponential distribution. the multi-scaling corresponds to the "multi-scale heavy traffic" recently advanced in dai, glynn and xu (2023) for generalized jackson networks. the proof utilizes the basic adjoint relationship (bar) first introduced in harrison and williams (1987) that characterizes the stationary distribution of an rbm. this is joint work with jin guang and xinyun chen at cuhk-shenzhen,  and peter glynn at stanford.

in 1976, ken ribet used modular techniques to prove an important relationship between class groups of cyclotomic fields and special values of the zeta function.  ribet’s method was generalized to prove the iwasawa main conjecture for odd primes p by mazur-wiles over q and by wiles over arbitrary totally real fields.  

central to ribet’s technique is the construction of a nontrivial extension of one galois character by another, given a galois representation satisfying certain properties.  throughout the literature, when working integrally at p, one finds the assumption that the two characters are not congruent mod p.  for instance, in wiles’ proof of the main conjecture, it is assumed that p is odd precisely because the relevant characters might be congruent modulo 2, though they are necessarily distinct modulo any odd prime.

in this talk i will present a proof of ribet’s lemma in the case that the characters are residually indistinguishable.  as arithmetic applications, one obtains a proof of the iwasawa main conjecture for totally real fields at p=2.  moreover, we complete the proof of the brumer-stark conjecture by handling the localization at p=2, building on joint work with mahesh kakde for odd p.  our results yield the full equivariant tamagawa number conjecture for the minus part of the tate motive associated to a cm abelian extension of a totally real field, which has many important corollaries.

this is joint work with mahesh kakde, jesse silliman, and jiuya wang.

zeta functions are central objects of study in number theory, and can often be found wherever there is galois theory. in this talk, we will discuss the ihara zeta function of an undirected graph and compare it to the dedekind zeta function. then we will talk about incidence algebras and use them to describe a categorification of both types of zeta functions.

in this talk we will discuss two central problems in algebraic number theory and their interconnections: explicit class field theory and the special values of l-functions.  the goal of explicit class field theory is to describe the abelian extensions of a ground number field via analytic means intrinsic to the ground field; this question lies at the core of hilbert's 12th problem.  meanwhile, there is an abundance of conjectures on the special values of l-functions at certain integer points.  of these, stark's conjecture has special relevance toward explicit class field theory.  i will describe two recent joint results with mahesh kakde on these topics.  the first is a proof of the brumer-stark conjecture. this conjecture states the existence of certain canonical elements in cm abelian extensions of totally real fields.  the second is a proof of an exact formula for brumer-stark units that has been developed over the last 15 years.  we show that these units together with other easily written explicit elements generate the maximal abelian extension of a totally real field, thereby giving a p-adic solution to the question of explicit class field theory for these fields.

recently we developed a general framework to compute asymptotic expansions of certain quantities coming from random matrix theory. more precisely if one considers the expectation of the trace of a sufficiently smooth function evaluated in a random matrix, one can compute a taylor expansion (in the dimension of our random matrix) of this quantity. this method relies notably on free stochastic calculus whom i will briefly talk about. in a previous work we studied the case of gue random matrices, in this talk we consider polynomials in independent haar unitary matrices. i will explain the additional difficulties that this model brings then give a few applications of this result to random matrix theory as well as links with weingarten calculus.

given a finite set, the collection of partitions of this set forms a poset category under the coarsening relation. this category is directly related to a space of trees, which in turn has interesting connections to operads. but what if the finite set comes equipped with a group action? what is an "equivariant partition"? and what connection is there to equivariant trees? we will explore possible answers to these questions in this talk, based on joint work with j. bergner, p. bonventre,d. chan, and m. sarazola.

this talk will survey several results concerning the topology at infinity of ricci solitons, with an emphasis on splitting theorems for solitons that have more than one end or, more generally, counting the number of ends geometrically.

shrinking kahler-ricci solitons model finite-time singularities of the kahler-ricci flow, hence the need for their classification. i will talk about the classification of such solitons in 4 real dimensions. this is joint work with deruelle-sun, cifarelli-deruelle, and bamler-cifarelli-deruelle.

zeta and l-functions are ubiquitous in modern number theory. while some work in the past has brought homotopical methods into the theory of zeta functions, there is in fact a lesser-known zeta function that is native to homotopy theory. namely, every suitably finite decomposition space (aka 2-segal space) admits an abstract zeta function as an element of its incidence algebra. in this talk, i will show how many 'classical' zeta functions in number theory and algebraic geometry can be realized in this homotopical framework. i will also discuss work in progress towards a categorification of motivic zeta and l-functions.

 in dimensions four and higher, the ricci flow may encounter singularities modelled on cones with nonnegative scalar curvature. it may be possible to resolve such singularities and continue the flow using expanding ricci solitons asymptotic to these cones, if they exist. i will discuss joint work with richard bamler in which we develop a degree theory for four-dimensional asymptotically conical expanding ricci solitons, which in particular implies the existence of expanders asymptotic to a large class of cones.
 

 we adapt some carleman estimates from earlier joint work with l. wang to asymptotically conical ricci flows and prove a general backward uniqueness theorem for sections of mixed parabolic inequalities along these flows. as an application, we prove that a solution which flows smoothly into a cone on an end must be a shrinking soliton. we will also discuss other related uniqueness results for asymptotically conical shrinking solitons.

this year's symposium will celebrate the return to in-person convening and usher in the next 50 years of the symposium.  the symposium will be held on the weekend of may 20-21, 2023 at uc san diego. the inaugural ronald getoor distinguished lecture will be delivered on sunday afternoon at the symposium. registration, which is required, for the symposium and/or the getoor lecture, is available via the webpage listed below. 

more information is available at the webpage here: https://sites.google.com/view/scps2023/home

ricci flow is proved to be a powerful tool in the field of differential geometry. to obtain geometric or topological applications via continuing the ricci flow by surgeries, it is of central importance to understand at least qualitatively the (finite-time) singularity models. in this talk, we present some recent developments mainly regarding the qualitative descriptions of the singularity models. we present two notions of blow-downs and their relations. we show an optimal scalar curvature estimate for singularity models. we then introduce some optimal qualitative and asymptotic descriptions for steady ricci solitons, which are self-similar solutions of the ricci flow and may arise as singularity models.

 in this talk, we will discuss some additional structure in the kahler setting for bamler’s limit spaces of noncollapsed ricci flows. we will review various notions of singular set stratification, and then state an improved dimension estimate for odd dimensional strata of limits of kahler-ricci flows. we will also see that tangent flows of kahler metric flows admit natural isometric actions, which are locally free away from the vertex in the case that the tangent flows are static.
 

when steven strogatz wrote a 15-part series on the elements of math for the new york times, to his surprise — and his editor's — each piece climbed the most emailed list and elicited hundreds of appreciative comments. in this talk steve will describe his adventures in bringing math to the masses, and will reflect on what works… and what doesn’t.

steven strogatz is the jacob gould schurman professor of applied mathematics at cornell university. he works on nonlinear dynamics with applications to physics, biology, and the social sciences. his latest book, infinite powers, was a new york times bestseller and was shortlisted for the 2019 royal society science book prize.

presented by the uc san diego research communications program and supported by a grant from the gordon and betty moore foundation.

the morrey conjecture pertains to the properties of quasi-convexity and rank-one convexity in functions, where the former implies the latter, but the converse relationship is not yet established. while sverak has proven the conjecture in three dimensions, it remains unresolved in the two-dimensional case. analyzing these properties analytically is a formidable task, particularly for vector-valued functions. consequently, to investigate the validity of the morrey conjecture, we conducted numerical simulations using a set of example functions by dacorogna and marcellini. based on our results, the morrey conjecture appears to hold true for these functions.

the classical coinvariant ring $r_n$ is obtained from the polynomial ring $\mathbb{c}[x_1, \dots, x_n]$ by quotienting by the ideal $i_n$ generated by symmetric polynomials with vanishing constant terms. the {\em superspace coinvariant ring} $sr_n$ is obtained analogously, but starting with the ring $\omega_n$ of regular differential forms on $n$-space. we describe  the bigraded hilbert series of $sr_n$ in terms of ordered set partitions and give an `operator theorem' which describes the harmonic space attached to $sr_n$. this proves conjectures of n. bergeron, li, machacek, sulzgruber, swanson, wallach, and zabrocki. this talk is based on joint work with andy wilson.

the boardman-vogt tensor product of operads encodes the notion of interchanging algebraic structures. a classic result of dunn tells us that the tensor product of two little cube operads is equivalent to a little cube operad with the dimensions added together. as models for $\mathbb{e}_k$-operads, this reflects a defining property of these operads.
in this talk, we will explore some equivariant generalizations to dunn’s additivity. along the way, we will play with little star-shaped operads, question if we really need group representations for equivariant operads, and learn to love (and hate) the tensor product.

we study a robust approximation method for solving a class of chance constrained optimization problems. the constraints are assumed to be  polynomial in the random vector. a semidefinite relaxation algorithm is proposed for solving this kind of problem. its asymptotic and finite convergence are proven under some mild assumptions.

we consider a finite volume homogeneous space endowed with a random walk whose driving measure is zariski-dense. in the case where jumps have finite exponential moment, eskin-margulis and benoist-quint established recurrence properties for such a walk. i will explain how their results can be extended to walks with finite first moment. the key is to make sense of the following claim: "the walk in a cusp goes down faster that some iid markov chain on r with negative mean". joint work with n. de saxcé.

imagine passing a signal $v$ through a noisy channel, where $v \in \mathbb{c}^n$ is a deterministic unit vector. we assume that the recipient observes a corrupted version of the signal in the form of $\theta vv^* + m$, where $\theta \in \mathbb{r}$ is the strength of the signal and $m$ is a random hermitian $n \times n$ matrix representing the noise. we consider two questions:

1. (detection) is it possible for the recipient to conclude that a signal has been passed based on the observation?
2. (recovery) if so, is it possible for the recipient to recover the signal

for rotationally invariant noise, benaych-georges and nadakuditi answered the detection question in terms of the outlying eigenvalues and the recovery question in terms of the corresponding eigenvectors. their proof crucially relies on the fact that the eigenvectors of a rotationally invariant ensemble are haar distributed (in particular, delocalized). 

we consider a general class of noise that includes non mean-field models such as random band matrices in regimes where the eigenvectors are known to be localized. in contrast to the usual approach to outliers via the resolvent, our analysis relies on moment method calculations for general vector states and a seemingly innocuous isotropic global law.

on a compact manifold with boundary, the map consisting of the scalar curvature in the interior and the mean curvature on the boundary is a local surjection at generic metrics. we prove that this result may be localized to compact subdomains in an arbitrary riemannian manifold with boundary, as motivated by an attempt to generalize the riemannian penrose inequality in dimension 8. this result is a generalization of corvino's result about localized scalar curvature deformations; however, the existence part needs to be handled delicately since the problem is non-variational. for non-generic cases, we give a classification theorem for domains in space forms and schwarzschild manifolds, and show the connection with positive mass theorems.

the classical hele-shaw flow describes the motion of incompressible viscous fluid, which occupies part of the space between two parallel, nearby plates. with source and drift, the equation is used in models of tumor growth where cells evolve with contact inhibition, and congested population dynamics. we consider the flow with hölder continuous source and lipschitz continuous drift. we show that if the free boundary of the solution is locally close to a lipschitz graph, then it is indeed lipschitz, given that the lipschitz constant is small. this is joint work with inwon kim.

non-unital operator systems are norm closed subspaces of b(h) that are closed under the involution map $x \mapsto x^*$. for example, c*-algebras are examples of non-unital operator systems. much like gelfand duality, a result of kadison from the 80s shows that operator systems generated by commuting elements are categorically dual to a class of geometric structures, namely compact convex sets. unlike the c*-theory, a remarkable result due to webster-winkler and davidson-kennedy shows that kadison's duality theorem readily generalizes to the non-commutative unital setting as well. in our talk, we discuss kadison’s original duality as well as the nc convex duality for non-commutative operator systems due to myself, matt kennedy, and nick manor. finally, we will have a discussion of some results on the side of operator systems that this illuminates.

applied benchmark tests for the famous `subgraph isomorphism problem' empirically discovered interesting phase transitions in random graphs. this motivates our rigorous study of two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. in particular, (i) we prove a sharp threshold result for the appearance of g_{n,p_1} as an induced subgraph of g_{n,p_2}, (ii) we show two-point concentration of the size of the maximum common induced subgraph of g_{n, p_1} and g_{n,p_2}, and (iii) we show that the number of induced copies of g_{n,p_1} in g_{n,p_2} has a `squashed lognormal' limiting distribution. these results confirm simulation-based phase transition predictions of mccreesh-prosser-solnon-trimble, and resolve several open problems of chatterjee-diaconis.

the proofs are based on careful refinements of the first and second moment method, using several extra twists to (a) take the non-standard behavior into account, and (b) work around the large variance issues that prevent standard applications of the second moment method, using in particular pseudorandom properties and multi-round exposure arguments to tame the variance.

based on joint work with erlang surya and emily zhu (both ucsd).

variational integrators are a class of geometric structure-preserving numerical integrators for variational differential equations that are based on a discretization of hamilton’s variational principle. we will present our construction of geometric variational integrators for multisymplectic lagrangian and hamiltonian pdes, as well as our construction of geometric variational integrators for adjoint systems arising in optimization and optimal control. for multisymplectic pdes, we will examine their continuous multisymplectic structures and variational principles, and utilize these to develop a discrete variational principle, leading to variational integrators which preserve their multisymplectic structure as well as satisfy a discrete noether’s theorem. for adjoint systems, we will introduce novel type ii variational principles for adjoint systems on vector spaces and lie groups. we utilize these to develop a discrete variational principle for adjoint systems, leading to symplectic and presymplectic integrators for adjoint systems which allow one to compute exact gradients of cost functions in optimization and optimal control problems. numerical examples will be presented throughout.

take a look at the mighty tetrahedron and its mirror image. explore the subgroup lattice of s4 and get a geometric perspective on why some of its subgroups are normal while others have conjugates.

see the sylow-3 and sylow-5 subgroups of a5, and learn how counting to 20 in greek can help you remember how many of them there are. it's quite simple, actually - but we'll finish off with the following not-entirely-trivial question: can you see s5 by holding a dodecahedron up to a mirror?

 asymptotic counting of geometric objects has a long history. in the case of flat surfaces, various works by masur and veech showed the quadratic asymptotic growth of the number of saddle connections of bounded length. in this spirit, athreya, fairchild, and masur showed that, for almost any flat surface, the number of pairs of saddle connection of bounded length and bounded virtual area increases quadratically with the constraint on length. in this case the « almost all » is with respect to the so-called masur-veech measure.

to demonstrate this, they use tools of ergodic theory (hence the result is true almost everywhere). this result can be extended in several ways, giving an error term or extending it to almost any sl(2,r)-invariant measure. we will present several useful tools for tackling these questions.

transportation of measure underlies many contemporary methods in machine learning and statistics. sampling, which is a fundamental building block in computational science, can be done efficiently given an appropriate measure-transport map. we ask: what is the effect of using approximate maps in such algorithms?

we propose a new framework to analyze the approximation power of measure transport. this framework applies to existing algorithms, but also suggests new ones. at the core of our analysis is the theory of optimal transport regularity, approximation theory, and an emerging class of inequalities, previously studied in the context of uncertainty quantification (uq).

imagine a population evolving over time, with genetic information being passed down from generation to generation, while evolution shapes it. the inherently random nature of this process makes it an ideal subject to be studied using stochastic processes, particularly markov processes. now, imagine if the system had memory, meaning genetic information could be inherited from many generations in the past. in such cases, we refer to a "seed bank."

seed banks can break the markovian nature of the process. in this presentation, we will explain how to overcome this difficulty. furthermore, we will describe the connections between seed bank models, stochastic delay differential equations and the fractional brownian motion.

this talk will focus on böhm and lafuente 2017's work on immortal homogeneous ricci flow, where they prove that any sequence of blow-downs of such flow will subconverges to an expanding homogeneous ricci soliton. for a \mathfrac{g}-homogeneous space m, ricci flow of g-invariant metrics can be shown to be equivalent to a flow on ad(h) invariant "bracket." we will show the existence of stratification of the space of brackets that induces curvature estimate on each strata, motivated by geometric invariant theory. the sharp case of the inequality corresponds to the limit case of an expanding g-invariant ricci soliton, and we will show that as immortal homogeneous ricci flow is of type iii, the blowdown will subconverges to such limit case. finally if time allows, we will discuss böhm and lafuente recent proof of alekseevskii's conjecture and its implication to homogeneous ricci soliton.

 in his seminal work on modular curves and the eisenstein ideal, mazur studied the existence of congruences between certain eisenstein series and newforms, proving that eisenstein ideals associated to weight 2 cusp forms of prime level are locally principal.
in this talk, we'll explore generalizations of mazur's result to squarefree level, focusing on recent work, joint with p. wake and c. wang-erickson, about a non-optimal level n that is the product of two distinct primes and where the galois deformation ring is not expected to be gorenstein. first, we will outline a galois-theoretic criterion for the deformation ring to be as small as possible, and when this criterion is satisfied, deduce an r=t theorem. then we'll discuss some of the techniques required to computationally verify the criterion.

it is rumoured that zariski was rather annoyed with grothendieck, since prior to the latter's introduction of sheaves and cohomology into algebraic geometry, only zariski could do the subject whereas subsequntly any idiot could. equally, much of grothendieck's enterprise is purely categorical so we could reasonably expect similar results in, for example, dynamical systems. an example in the litterature that was crying out for such an interpretation was adam epstein's various generalisations of thurston's rigidity of post critically finite rational maps, which we'll put, and improve, in their natural context of a dynamical topus. en passant this also leads to some highly clarifying results about real blow ups. 

 in this paper, we consider polynomial optimization with correlative sparsity. we construct correlative sparse lagrange multiplier expressions (cs-lmes) and propose cs-lme reformulations for polynomial optimization problems using the karush-kuhn-tucker optimality conditions. correlative sparse sum-of-squares (cs-sos) relaxations are applied to solve the cs-lme reformulation. we show that the cs-lme reformulation inherits the original correlative sparsity pattern, and the cs-sos relaxation provides sharper lower bounds when applied to the cs-lme reformulation, compared with when it is applied to  the original problem. moreover, the convergence of our approach is guaranteed under mild conditions. in numerical experiments, our new approach usually finds the global optimal value (up to a negligible error) with a low relaxation order, for cases where directly solving the problem fails to get an accurate approximation. also, by properly exploiting the correlative sparsity, our cs-lme approach requires less computational time than the original lme approach to reach the same accuracy level.

in this survey-style talk i discuss the (old) idea of studying turbulence in stochastically-forced fluid equations. i will discuss definitions of chaos, anomalous dissipation, and various other predictions by physicists that can be phrased as mathematically precise conjectures in this context. then, i will discuss some recent work by my collaborators and i on various aspects, namely (1) a straightforward characterization of anomalous dissipation that implies the classical kolmogorov 4/5 law for 3d nse (joint with michele coti zelati, sam punshon-smith, and franziska weber); (2) the study of "lagrangian chaos" and exponential mixing of scalars and how it leads to a proof of anomalous dissipation and of the power spectrum predicted by batchelor in 1959 for the simpler problem of batchelor-regime passive scalar turbulence (joint with alex blumenthal and sam punshon-smith); (3) the more recent proof of "eulerian chaos" for galerkin truncations of the navier-stokes equations (joint with alex blumenthal and sam punshon-smith).

the foundation of equivariant stable homotopy theory is laid by lewis-may-steinberger in the 80's, while people's understanding of the computational aspect of the subject is very limited even until today. the reason is that the equivariant homotopy groups are $ro(g)$-graded, and even the coefficient rings of eilenberg-maclane spectra involve complicated combinatorics of cell structures. in this talk i'll illustrate the advantages of tate squares in doing $ro(g)$-graded computations. several eilenberg-maclane spectra of particular interest will be discussed: the eilenberg-maclane spectra associated with the constant mackey functors $\mathbb{z}$, $\mathbb{f}_2$, and the burnside ring. time permitting, i'll also talk about some structures of the homotopy of $hm$, for $m$ a general $c_{2^n}$-mackey functor.

in 1995, kuperberg introduced a collection of web bases, which combinatorially encode $sl_2$ and $sl_3$ invariant tensors. by schur-weyl duality, these bases are also bases for the specht modules corresponding to partitions $(k,k) \vdash 2k$ and $(k,k,k) \vdash 3k$ respectively, and have nicer symmetry properties than the standard polytabloid basis. in 2017, rhoades introduced a basis for the specht module corresponding to partition $(k,k,1^{n-2k}) \vdash n$ indexed by noncrossing set partitions and with similarly nice symmetry properties. in this talk, we will explore these bases and the connections between them, and discuss how these connections might be used to create a similar basis for the specht module corresponding to $(k,k,k,1^{n-3k}) \vdash n$.

we'll give a quick introduction to the field of random matrix theory and give partial proof of the famed semicircle law for wigner matrices. to do so, we will incorporate tools from combinatorics, probability, and topology to understand the genus expansion of a random matrix. no background in probability is required, though it may be helpful.

the unstable foliation, that changes the horizontal components of period coordinates, plays an important role in the study of translation surfaces, including their deformation theory, and in the understanding of horocycle invariant measures.

in this talk, we show that measures of large dimension equidistribute in affine invariant manifolds and give an effective rate. an analogous result in the setting of homogeneous dynamics is crucially used in the effective equidistribution results of lindenstrauss-mohammadi and lindenstrauss--mohammadi--wang. background knowledge on translation surfaces and homogenous dynamics will be explained.

mean curvature flow is the negative gradient flow of the area functional, and it has attracted a lot of interest in the past few years. in this talk, we will discuss a pde-based, gauge theoretic, construction of codimension-two mean curvature flows based on the yang-mills-higgs functionals, a natural family of energies associated to sections and metric connections of hermitian line bundles. the underlying idea is to approximate the flow by the solution of a parabolic system of equations and study the corresponding singular limit of these solutions as the scaling parameter goes to zero. this is based on joint work with a. pigati and d. stern. 

while streaming pca (also known as oja’s algorithm) was proposed about four decades ago and has roots going back to 1949, theoretical resolution in terms of obtaining optimal convergence rates has been obtained only in the last decade. however, we are not aware of any available distributional guarantees, which can help provide confidence intervals on the quality of the solution. in this talk, i will present the problem of quantifying uncertainty for the estimation error of the leading eigenvector using oja's algorithm for streaming pca, where the data are generated iid from some unknown distribution. combining classical tools from the u-statistics literature with recent results on high-dimensional central limit theorems for quadratic forms of random vectors and concentration of matrix products, we establish a distributional approximation result for the error between the population eigenvector and the output of oja's algorithm. we also propose an online multiplier bootstrap algorithm and establish conditions under which the bootstrap distribution is close to the corresponding sampling distribution with high probability. while there are optimal rates for the streaming pca problem, they typically apply to the iid setting, whereas in many applications like distributed optimization, the data is generated from a markov chain and the goal is to infer parameters of the limiting stationary distribution. if time permits, i will also present our near-optimal finite sample guarantees which remove the logarithmic dependence on the sample size in previous work, where markovian data is downsampled to get a nearly independent data stream. 

note: the speaker will also give an overview of her latest research.

we overview the cost of a group action, which measures how much information is needed to generate its induced orbit equivalence relation, and the ideal poisson-voronoi tessellation (ipvt), a new random limit with interesting geometric features. in recent work, we use the ipvt to prove all measure preserving and free actions of a higher rank semisimple lie group on a standard probability space have cost 1, answering gaboriau's fixed price question for this class of groups. we sketch a proof, which relies on some simple dynamics of the group action and the definition of a poisson point process. no prior knowledge on cost, ipvts, or lie groups will be assumed. this is joint work with mikolaj fraczyk and sam mellick.

in this talk, i will sketch a surprising proof due to gyorgy elekes on a non-trivial lower bound for the sums-versus-product problem in combinatorial number theory.   

we consider first-order methods with constant step size for minimizing locally lipschitz coercive functions that are tame in an o-minimal structure on the real field. we prove that if the method is approximated by subgradient trajectories, then the iterates eventually remain in a neighborhood of a connected component of the set of critical points. under suitable method-dependent regularity assumptions, this result applies to the subgradient method with momentum, the stochastic subgradient method with random reshuffling and momentum, and the random-permutations cyclic coordinate descent method.

this talk is based on ongoing work of the speaker. we will discuss the stochastic embeddability of snowflakes of finite nagata-dimensional spaces into ultrametric spaces and the induced stochastic embeddings of their hyperbolic fillings into trees. several results follow as applications, for example:
(1) for any uniformly concave gauge $\omega$, the wasserstein 1-metric over $([0,1]^n,\omega(\|\cdot\|))$ bilipschitzly embeds into $\ell^1$.
(2) the wasserstein 1-metric over any finitely generated gromov hyperbolic group bilipschitzly embeds into $\ell^1$.

arithmeticity of quaternionic modular forms on g_2 abstract: quaternionic modular forms (qmfs) on the split exceptional group g_2 are a special class of automorphic functions on this group, whose origin goes back to work of gross-wallach and gan-gross-savin. while the group g_2 does not possess any holomorphic modular forms, the quaternionic modular forms seem to be able to be a good substitute.  in particular, qmfs on g_2 possess a semi-classical fourier expansion and fourier coefficients, just like holomorphic modular forms on shimura varieties.  i will explain the proof that the cuspidal qmfs of even weight at least 6 admit an arithmetic structure: there is a basis of the space of all such cusp forms, for which every fourier coefficient of every element of this basis lies in the cyclotomic extension of q.

in the 90s kollár proved non-rationality of many degrees and dimensions of complex fano hypersurfaces by considering their degenerations modulo p and taking advantage of the surprising existence and positivity of differential forms on their reductions. in a series of papers with chen, church, and ji, we have shown that these differential forms in characteristic p can give insight into many other aspects of the birational geometry of complex hypersurfaces: the degree of irrationality, rational endomorphisms, the birational automorphism group, and rational fibrations in low genus curves.

(based on joint work with ruofan jiang) the hilbert scheme of points on a variety  parametrizes -dimensional quotients of the structure sheaf. when  is a planar singular curve, its enumerative invariants have close relation to mathematical physics, knot theory and combinatorics. in this talk, we investigate two analogous moduli spaces, one being a direct generalization of the hilbert scheme. our results reveal their surprising relations to hall polynomials, matrix equations, modular forms, etc.

"ai is like nuclear energy–both promising and dangerous."
bill gates, 2019

data science is central to ai and has driven most of recent advances in biomedicine and beyond. human judgment calls are ubiquitous at every step of a data science life cycle (dslc): problem formulation, data cleaning, eda, modeling, and reporting. such judgment calls are often responsible for the "dangers" of ai by creating a universe of hidden uncertainties well beyond sample-to-sample uncertainty.

to mitigate these dangers, veridical (truthful) data science is introduced based on three principles: predictability, computability and stability (pcs). the pcs framework and documentation unify, streamline, and expand on the ideas and best practices of statistics and machine learning. in every step of a dslc, pcs emphasizes reality check through predictability, considers computability up front, and takes into account expanded uncertainty sources including those from data curation/cleaning and algorithm choice to build more trust in data results. pcs will be showcased through collaborative research in finding genetic drivers of a heart disease, stress-testing a clinical decision rule, and identifying microbiome-related metabolite signatures for possible early cancer detection. 

i will explain how the fourier transform takes us from functions on g to functions on g dual and switches convolution with pointwise operator multiplication. i’ll motivate from the case of abelian groups, where g dual has a group structure.

partitions arise in linear algebra as smith normal forms of finite dvr-modules. this viewpoint has given rise to several important objects in symmetric function theory; they are indexed by partitions. what if we replace the dvr by other rings? the analogous objects can no longer be indexed by partitions, but certain general properties can still be proved. they show up in discrete random matrix theory (joint with gilyoung cheong) and algebraic geometry (joint with ruofan jiang). in some special cases, these objects can still be expressed in partitions (though more convoluted), and the proven general properties give rise to new identities involving hall polynomials that do not seem to have a direct combinatorial proof.

this presentation focuses on applying the discrete approximation method to establish necessary optimality conditions in an optimization problem for fully controlled constrained sweeping processes. additionally, we explore its applications in various practical dynamical models. the first model deals with the dynamics of mobile robots navigating obstacles, while the second pertains to model predictive control utilizing neural networks.

we give a new short proof of the theorem due to marquis and sabok, which states that the orbit equivalence relation induced by the action of a finitely generated hyperbolic group on its gromov boundary is hyperfinite. our methods permit moreover to show that every such action has finite borel asymptotic dimension. this is a joint work with andrea vaccaro.

in the presence of a large group action, even non-noetherian rings sometimes behave like noetherian rings. for example, cohen proved that every symmetric ideal in the infinite variable polynomial ring is generated by finitely many polynomials (and their orbits under the infinite symmetric group). in this talk, i will give a brief introduction to equivariant commutative algebra where we systematically study such noetherian phenomena in infinite variable polynomial rings, and explain my work over fields of positive characteristic.

what's the general methodology behind ai for math?  ai is disrupting all industries in an unprecedented way. what might happen for mathematics? are mathematicians ever going to be "replaced"?

ehrhart theory—the study of lattice point enumeration in polytopes with rational vertices—can be used to study various combinatorial objects, including posets and graphs. in this talk, we explore two weighted versions of ehrhart theory. we first ask which polynomial weights we can apply to our lattice so that the associated weighted h*-polynomials retain some of their classical properties, such as nonnegativity and monotonicity. we also study a second weighted ehrhart theory, chapoton’s q-analog ehrhart theory, and discuss its relationship to the principal specialization of stanley’s chromatic symmetric function. the first project is joint work with robert davis, jesús a. de loera, alexey garber, sofía garzón mora, katharina jochemko, and josephine yu, and the second project is joint work with matthias beck and andrés r. vindas meléndez.

i will report on recent results stemming from the analysis of schrödinger operators on manifolds. i will first describe results dealing with isoperimetric inequalities and optimal (aka extremal) metrics on closed manifolds. these issues have been instrumental in the study of the spectrum of several classical operators, and are motivated by the understanding of the behaviour of the spectrum under changes of metrics. then, motivated by conjectures of yau on measures of nodal sets (but which are actually related to the first part of the talk), i will describe how eigenfunctions are concentrating in terms of lp norms (with an explicit dependence on the eigenvalues). my goal is to emphasize on the case of schrödinger operators with rough potentials. i will also state several open problems. 

topological order is a notion in theoretical condensed matter physics describing new phases of matter beyond landau's symmetry breaking paradigm. bravyi, hastings, and michalakis introduced certain topological quantum order (tqo) axioms to ensure gap stability of a commuting projector local hamiltonian and stabilize the ground state space with respect to local operators in a quantum spin system. in joint work with corey jones, pieter naaijkens, and daniel wallick (arxiv:2307.12552), we study nets of finite dimensional c*-algebras on a 2d $\mathbb{z}^2$ lattice equipped with a net of projections as an abstract version of a quantum spin system equipped with a local hamiltonian. we introduce a set of local topological order (lto) axioms which imply the tqo conditions of bravyi-hastings-michalakis in the frustration free commuting projector setting, and we show our lto axioms are satisfied by known 2d examples, including kitaev's toric code and levin-wen string net models associated to unitary fusion categories (ufcs). from the lto axioms, we can produce a canonical net of algebras on a codimension 1 $\mathbb{z}$ sublattice which we call the net of boundary algebras. we get a canonical state on the boundary net, and we calculate this canonical state for both the toric code and levin-wen string net models. surprisingly, for the levin-wen model, this state is a trace on the boundary net exactly when the ufc is pointed, i.e., all quantum dimensions are equal to 1. moreover, the boundary net for levin-wen is isomorphic to a fusion categorical net arising directly from the ufc. for these latter nets, corey jones' category of dhr bimodules recovers the drinfeld center, leading to a bulk-boundary correspondence where the bulk topological order is described by representations of the boundary net.

polynomial optimization is an important class of non-convex optimization problems, and has a powerful modelling ability for both continuous and discrete optimization. over the past two decades, the moment-sos hierarchy has been well developed for globally solving polynomial optimization problems. however, the rapidly growing size of sdp relaxations arising from the moment-sos hierarchy makes it computationally intractable for large-scale problems. in this talk, i will show that there are plenty of algebraic structures to be exploited to remarkably improve the scalability of the moment-sos hierarchy, which leads to the new active research area of structured polynomial optimization.

we study variational inequality problems (vips) with involved mappings and feasible sets characterized by polynomial functions (namely, polynomial vips). we propose a numerical algorithm for computing solutions to polynomial vips based on lagrange multiplier expressions and the moment-sos hierarchy of semidefinite relaxations. we also extend our approach to finding more or even all solutions to polynomial vips. we show that the method proposed in this paper can find solutions or detect the nonexistence of solutions within finitely many steps, under some general assumptions. in addition, we show that if the vip is given by generic polynomials, then it has finitely many karush-kuhn-tucker points, and our method can solve it within finitely many steps. numerical experiments are conducted to illustrate the efficiency of the proposed methods.

a borel equivalence relation on a polish space is called hyperfinite if it can be approximated by equivalence relations with finite classes. this notion has long been studied in descriptive set theory to measure complexity of borel equivalence relations. although group actions on hyperbolic spaces don't always induce hyperfinite orbit equivalence relations on the gromov boundary, some natural boundary actions were recently found to be hyperfinite. examples of such actions include actions of hyperbolic groups and relatively hyperbolic groups on their gromov boundary and acylindrical group actions on trees. in this talk, i will show that any acylindrically hyperbolic group admits a non-elementary acylindrical action on a hyperbolic space with hyperfinite boundary action. 

the memory capacity of a statistical model is the largest size of generic data that the model can memorize and has important implications for both training and generalization. in this talk, we will prove a tight memory capacity result for two-layer neural networks with polynomial or real analytic activations. in order to do so, we will use tools from linear algebra, combinatorics, differential topology, and the theory of real analytic functions of several variables. in particular, we will show how to get memorization if the model is a local submersion and we will show that the jacobian has generically full rank. the perspective that is developed also opens up a path towards deeper architectures, alternative models, and training.

the work of gromov, lawson, schoen, yau on scalar curvature inspired progress in metric geometry. in turn, this progress inspired new results about geometry and topology of manifolds with positive scalar curvature. in my talk i will give some examples of how ideas travel between these two worlds. the talk will be based on joint works with lishak-nabutovsky-rotman, maximo, chodosh-li, wang.

 in this talk, we study a tannakian category of admissible pairs, which arise naturally when one is comparing etale and de rham cohomology of p-adic formal schemes. admissible pairs are parameterized by local shimura varieties and their non-minuscule generalizations, which admit period mappings to de rham affine grassmannians. after reviewing this theory, we will state a result characterizing the basic admissible pairs that admit cm in terms of transcendence of their periods. this result can be seen as a p-adic analogue of a theorem of cohen and shiga-wolfhart characterizing cm abelian varieties in terms of transcendence of their periods. all work is joint with sean howe.

[pre-talk at 1:20pm]

i will give an introduction to the $\overline{\partial}$-neumann problem and the bergman kernel, topics that are studied in several complex variables. i will conclude by discussing two open questions about the bergman kernel which motivate research in several complex variables today.

 in prevalent cohort studies with follow-up, the time-to-event outcome is subject to left truncation leading to selection bias. for estimation of the distribution of time-to-event, conventional methods adjusting for left truncation tend to rely on the (quasi-)independence assumption that the truncation time and the event time are ``independent" on the observed region. this assumption is violated when there is dependence between the truncation time and the event time possibly induced by measured covariates. inverse probability of truncation weighting leveraging covariate information can be used in this case, but it is sensitive to misspecification of the truncation model. in this work, we apply the semiparametric theory to find the efficient influence curve of an expected  (arbitrarily transformed) survival time in the presence of covariate-induced dependent left truncation. we then use it to construct estimators that are shown to enjoy double-robustness properties. our work represents the first attempt to construct doubly robust estimators in the presence of left truncation, which does not fall under the established framework of coarsened data where doubly robust approaches are developed. we provide technical conditions for the asymptotic properties that appear to not have been carefully examined in the literature for time-to-event data, and study the estimators via extensive simulation. we apply the estimators to two data sets from practice, with different right-censoring patterns.

a group is said to be frobenius stable if every function from the group to unitaries that is "almost multiplicative" in the point-frobenius norm topology is "close" to a genuine representation of the group in the same topology. in this talk, i will summarize my proof that finitely generated nilpotent groups are frobenius stable if and only if they are virtually cyclic. i will also explain what the same techniques say about operator norm. this generalizes explicit counterexamples developed by voiculescu and kazhdan. 

 in this talk, i will discuss two topics that i have been exploring at the intersection of deep learning and dynamical systems.
    i will first present my recent research on ml-based dynamics learning and surrogate modeling. to circumvent difficulties faced by dynamics models from first principles or standard neural networks, a recent research direction has been considering a hybrid approach, where physics laws and geometric properties are encoded in the design of the deep learning architectures or in the learning process. available physics prior knowledge can be used to construct physics-constrained neural networks with improved design and efficiency and a better generalization capacity, which can take advantage of the function approximation power of deep learning methods to deal with incomplete knowledge. here, i will introduce two different ways to incorporate prior knowledge about the structure of a dynamical system in a strong way to obtain structure-preserving deep learning architectures for dynamics learning and surrogate modeling.
    in the second part of the talk, i will discuss a specific way to leverage deep learning techniques to accelerate the computation of high-resolution solutions of parametric partial differential equations. in numerous contexts, high-resolution solutions are required to capture faithfully essential dynamics which occur at small spatiotemporal scales, but these solutions can be very difficult and slow to obtain using traditional numerical integration methods due to limited computational resources. here, i will introduce a new approach based on the use of neural operators to obtain high-resolution solution operators.

i will introduce some interacting particle systems on finite graphs and cayley graphs of countable groups, and discuss how sofic entropy helps understand them.

more specifically, we consider two notions of statistical equilibrium: an "equilibrium state" maximizes a functional called the pressure while a "gibbs state" satisfies a local equilibrium condition. on amenable groups (for example, integer lattices) these notions are equivalent, under some assumptions on the interaction. barbieri and meyerovitch have recently shown that one direction holds for general sofic groups: equilibrium states are always gibbs.

i will show that the converse fails in the simplest nontrivial case: the free boundary ising state on a free group (an infinite regular tree) is gibbs but not equilibrium. i will also discuss what this says about gibbs states on finite locally-tree-like graphs: it is well-known that their local statistics are described by some gibbs state on the infinite tree, but in fact they must locally look like a mixture of equilibrium states. this constraint can be used to compute local limits of finitary gibbs states for a few interactions.

we consider general mixed $p$-spin mean field spin glass models and provide a method to prove that the spectral gap of the dirichlet form associated with the gibbs measure is of order one at sufficiently high temperature. our proof is based on an iteration scheme relating the spectral gap of the $n$-spin system to that of suitably conditioned subsystems. based on joint work w/ c. brennecke, c. xu, and h-t yau

in this talk i’ll discuss recent work studying benign overfitting in two-layer relu networks trained using gradient descent and hinge loss on noisy data for binary classification. unlike logistic or exponentially tailed losses the implicit bias in this setting is poorly understood and therefore our results and techniques are distinct from other recent and concurrent works on this topic. in particular, we consider linearly separable data for which a relatively small proportion of labels are corrupted and identify conditions on the margin of the clean data which give rise to three distinct training outcomes: benign overfitting, in which zero loss is achieved and with high probability test data is classified correctly; overfitting, in which zero loss is achieved but test data is misclassified with probability lower bounded by a constant; and non-overfitting, in which clean points, but not corrupt points, achieve zero loss and again with high probability test data is classified correctly. our analysis provides a fine-grained description of the dynamics of neurons throughout training and reveals two distinct phases: in the first phase clean points achieve close to zero loss, in the second phase clean points oscillate on the boundary of zero loss while corrupt points either converge towards zero loss or are eventually zeroed by the network. we prove these results using a combinatorial approach that involves bounding the number of clean versus corrupt updates across these phases of training. 

contrary to what people believe, modern computers are sometimes surprisingly bad at computations. integer division is a particular example which computers are agonizingly bad at. we will develop a little bit of the theory of continued fractions and see how these seemingly "only for pure mathematicians" - things can be used for dramatic speed-up of divisions and other types of computations with similar nature.

the effectiveness of the cdcl algorithm for sat is complicated to understand, and so far one of the most successful tools for its analysis has been proof complexity. cdcl is easily seen to be limited by the resolution proof system, and furthermore can be thought of as being equivalent to resolution, in the sense that cdcl can reproduce a given resolution proof with only a polynomial overhead.

but the question of the power of cdcl with respect to resolution is far from closed. to begin with, the previous equivalence is subject to assumptions, only some of which are reasonable. in addition, in a setting where algorithms are expected to run in near-linear time, a polynomial overhead is too coarse a measure.

in this talk we will discuss how exactly cdcl and resolution are equivalent, what breaks when we try to make the assumptions more realistic, and how much of an overhead cdcl needs in order to simulate resolution.

this paper studies how to learn parameters in diagonal gaussian mixture models. the problem can be formulated as computing incomplete symmetric tensor decompositions. we use generating polynomials to compute incomplete symmetric tensor decompositions and approximations. then the tensor approximation method is used to learn diagonal gaussian mixture models. we also do the stability analysis. when the first and third order moments are sufficiently accurate, we show that the obtained parameters for the gaussian mixture models are also highly accurate. numerical experiments are also provided.

a basic question in model theory is whether a theory admits any kind of quantifier reduction. one form of quantifier reduction is called model completeness, and broadly refers to when arbitrary formulas can be "replaced" by existential formulas.
prior to the negative resolution of the connes embedding problem (cep), a result of goldbring, hart, and sinclair showed that a positive solution to cep would imply that there is no ii$_1$ factor with a theory which is model-complete. in this talk, we discuss work on the question of quantifier reduction for tracial von neumann algebras. in particular, we prove that no ii$_1$ factor has a theory that is model complete by using hastings' quantum expanders and a weaker assumption than cep. this is joint work with ilijas farah and david jekel.

for integers $s,t \geq 2$, the ramsey number $r(s,t)$ denotes the minimum $n$ such that every $n$-vertex graph contains a clique of order $s$ or an independent set of order $t$. we prove that \[ r(4,t) = \omega\bigl(\frac{t^3}{\log^4 \! t}\bigr) \quad \quad \mbox{ as }t \rightarrow \infty\] which determines $r(4,t)$ up to a factor of order $\log^2 \! t$, and solves a  conjecture of erdős.


this is a joint work with sam mattheus (accepted in the annals of mathematics).

a countable discrete group is exact if it has a free action on cantor space which is measure-hyperfinite, that is, for every borel probability measure on cantor space, there is a conull set on which the orbit equivalence relation is hyperfinite. for an exact group, it is known that the generic action on cantor space is measure-hyperfinite, and it is open as to whether the generic action is hyperfinite; an exact group for which the generic action is not hyperfinite would resolve a long-standing open conjecture about whether measure-hyperfiniteness and hyperfiniteness are equivalent. we show that for any countable discrete group with finite asymptotic dimension, its generic action on cantor space is hyperfinite. this is joint work with sumun iyer. 

random interface growth is all around us: tumors, bacterial colonies, infections, and propagating flame fronts. the kpz equation is a stochastic pde central to a class of random growth phenomena. in this talk, i will explain how to combine tools from probability, partial differential equations, and integrable systems to understand the behavior of the kpz equation when it exhibits unusual growth.

the fargues-fontaine curve associated to an algebraically closed nonarchimedean field of characteristic $p$ is a fundamental geometric object in $p$-adic hodge theory. via the tilting equivalence it is related to the galois theory of finite extensions of q_p; it also occurs in fargues's program to geometrize the local langlands correspondence for such fields.

recently, peter dillery and alex youcis have proposed using a related object, the "affine cone" over the aforementioned curve, to incorporate some recent insights of kaletha into fargues's program. i will summarize what we do and do not yet know, particularly about vector bundles on this and some related spaces (all joint work in progress with dillery and youcis).

come venture into number theory in this spooky post halloween talk, where i plan on talking about some objects that are (at least tangentially) related to number theory. which objects will show up? maybe elliptic curves, maybe p-adic numbers, maybe lie groups. it's a bit of a mystery, so come to the talk to find out! in order to keep the talk from being too scary, i'll try to keep the prerequisite knowledge to a minimum. 

 it was conjectured by milnor in 1968 that the fundamental group of a complete manifold with nonnegative ricci curvature is finitely generated.  in this talk we will discuss a counterexample, which provides an example m^7 with ric>= 0 such that \pi_1(m)=q/z is infinitely generated.

there are several new points behind the result.  the first is a new topological construction for building manifolds with infinitely generated fundamental groups, which can be interpreted as a smooth version of the fractal snowflake.  the ability to build such a fractal structure will rely on a very twisted gluing mechanism.  thus the other new point is a careful analysis of the mapping class group \pi_0diff(s^3\times s^3) and its relationship to ricci curvature.  in particular, a key point will be to show that the action of \pi_0diff(s^3\times s^3) on the standard metric g_{s^3\times s^3} lives in a path connected component of the space of metrics with ric>0.

a hybrid system is a dynamical system that exhibits both continuous and discrete dynamic behavior. the state of a hybrid system changes either continuously by the flow described by a differential equation or discretely following some jump conditions. a canonical example of a hybrid system is the bouncing ball, imagined as a point-mass, under the influence of gravity. in this talk, we explore the solutions and algorithms to the extensions of this example in 3-dimension where the body of interest is rigid and convex in general. in particular, the solutions utilize the theory of nonsmooth lagrangian mechanics to derive the differential equations and jump conditions, which heavily depend on the collision detection function. the proposed algorithm called lie group variational collision integrator is developed using the combination of techniques and knowledge from variational collision integrators and lie group variational integrators. if time permits, we can discuss how some of these techniques can be used in optimal control and robotics.

a hyperoperation on a set m is an operation that associates to each pair of elements a subset of m. hypergroups and hyperrings are two examples of structures defined in terms of hyperoperations. while they were respectively defined in the 1930s and 1950s, they have recently gained prominence through various appearances in number theory, combinatorics, and absolute algebraic geometry. however, to date there has been relatively little attention given to categories of hyperstructures. i will discuss several categories of hyperstructures that generalize hypergroups. a common theme is that in order for these categories to enjoy good properties like (co)completeness, we must allow for the product or sum of two elements to be the empty subset, which cannot occur in a hypergroup. in particular, i will introduce a category of hyperstructures called mosaics whose subcategory of commutative objects possess a closed monoidal structure reminiscent of the tensor product of abelian groups. this is joint work with so nakamura.

 we present the partition of unity method (pum) and its implementation in fraunhofer scai’s puma software framework. the fundamental idea and benefit of the pum is to reduce the necessary number of degrees of freedom of a simulation while attaining the required accuracy of the application by using application-dependent enrichment functions which can resolve highly localized behavior of the solution instead of using mesh-refinement and standard piecewise polynomial basis functions. we discuss how such application-dependent enrichments can be constructed a-priori and on-the-fly during a simulation for e.g. laminated composites, shells and additive manufacturing problems.

schubert polynomials are distinguished representatives of schubert cells in the cohomology of the flag variety. pipedreams (pd) and bumpless pipedreams (bpd) are two combinatorial models of schubert polynomials. there are many classical perspectives to view pds: fomin and stanley represented each pd as an element in the nilcoexter algebra; lenart and sottile converted each pd into a labeled chain in the bruhat order. in this talk, we unravel the bpd analogues of both viewpoints. one application of our results is a simple bijection between pds and bpds via lenart's growth diagram.

in the first half, i will introduce the subject of random conformal geometry. schramm-loewner evolution (sle) is a random planar curve describing the scaling limits of interfaces in statistical physics models (e.g. percolation, ising model). liouville quantum gravity (lqg) is a random 2d surface arising as the scaling limit of random planar maps. these fractal geometries have deep connections to bosonic string theory and conformal field theories. lqg and sle exhibit a rich interplay: cutting lqg by independent sle gives two independent lqg surfaces [sheffield '10, duplantier-miller-sheffield '14]. in the second half, i will present extensions of these lqg/sle theorems and give several applications.

to any group g is associated the space ch(g) of all characters on g. after defining this space and discussing its interesting properties, i'll turn to discuss dynamics on such spaces. our main result is that the action of any arithmetic group on the character space of its amenable/solvable radical is stiff, i.e, any probability measure which is stationary under random walks must be invariant. this generalizes a classical theorem of furstenberg for dynamics on tori. relying on works of bader, boutonnet, houdayer, and peterson, this stiffness result is used to deduce dichotomy statements (and 'charmenability') for higher rank arithmetic groups pertaining to their normal subgroups, dynamical systems, representation theory and more. the talk is based on a joint work with uri bader.

the class number formula describes the behavior of the dedekind zeta function at s = 0 and s = 1. the stark and gross conjectures extend the class number formula, describing the behavior of artin l-functions and p-adic l-functions at s = 0 and s = 1 in terms of units. the harris–venkatesh conjecture describes the residue of stark units modulo p, giving a modular analogue to the stark and gross conjectures while also serving as the first verifiable part of the broader conjectures of venkatesh, prasanna, and galatius.
in this talk, i will draw an introductory picture, formulate a unified conjecture combining harris–venkatesh and stark for weight one modular forms, and describe the proof of this in the imaginary dihedral case.

over the last few years there have been significant developments in the techniques used to understand singularities within minimal submanifolds. i will discuss this circle of ideas and explain how they enable us to reconnect the study of these geometric singularities with more classical pde techniques, such as those used in unique continuation.

 in this talk, we consider a conjecture by gross and kudla that relates the derivatives of triple-product l-functions  for three modular forms and the height pairing of the gross—schoen cycles on shimura curves.

then, we sketch a proof of a generalization of this conjecture for hilbert modular forms in the spherical case. this is a report of work in progress with xinyi yuan and wei zhang, with help from yifeng liu.

 in this talk, we first consider a formula proved in the 2010s that relates the height pairing of the gross—schoen cycles on the product of a curve over a number field and the self-product of the relative dialyzing sheaves. then, we describe a recent application given by xinyi yuan on the uniform bogomolov conjecture and the uniform mordell—lang conjecture.

 i will present a collection of my favorite equations in mathematical physics and discuss why they are interesting from my own perspective.

 in recent years there has been a considerable interest in questions regarding approximate homomorphisms between groups, going under the name of group stability. for our setting, a group g is said to be hs-stable if any approximate finite dimensional unitary representation of g is close to a true unitary representation of g, where proximity is measured by the (normalized) hilbert-schmidt norm. in the situation of amenable groups, this question can be translated into a finite dimensional approximation property of the character space of g, an object originating in harmonic analysis. we will present an analysis of the character space of b. h. neumann groups, an uncountable family of z-by-locally finite groups, and as a result deduce they are hs-stable. the analysis involves both character bounds of finite symmetric groups, as well as character theory of infinite symmetric groups.

  mean-field game (mfg) systems offer a framework for modeling multi-agent dynamics, but unknown parameters pose challenges. in this work, we tackle an inverse problem, recovering mfg parameters from limited, noisy boundary observations. despite the problem's ill-posed nature, we aim to efficiently retrieve these parameters to understand population dynamics. our focus is on recovering running cost and interaction energy in mfg equations from boundary measurements. we formalize the problem as an constrained optimization problem with l1 regularization. we then develop a fast and robust operator splitting algorithm to solve the optimization using techniques including harmonic extensions, three-operator splitting scheme, and primal-dual hybrid gradient method.  numerical experiments illustrate the effectiveness and robustness of the algorithm. this is a joint work with yat tin chow (ucr), samy wu fung (colorado school of mines), levon nurbekyan (emory), and stanley j.
  osher (
 ucla).

totally positive matrices are matrices in which each minor is positive. lusztig extended the notion to reductive lie groups. he also proved that specialization of elements of the dual canonical basis in representation theory of quantum groups at $q=1$ are totally non-negative polynomials. thus, it is important to investigate classes of functions on matrices that are positive on totally positive matrices. i will discuss several sources of such functions. one has to do with multiplicative determinantal inequalities (joint work with m. gekhtman). another deals with certain partial sums of plucker relations (joint work with p. k. vishwakarma). the third source deals with majorizing monotonicity of symmetrized fischer's products which are a natural generalization of hadamard-fischer inequalities. majorizing monotonicity of symmetrized fischer's products was already known for hermitian positive semidefinite case which brings additional motivation to verify if they hold for totally positive matrices as well (joint work with m. skandera). the main tools we employed are network parametrization, temperley-lieb and monomial trace immanants.

let g be an algebraic group over a local field. we will show that the image of g under an arbitrary continuous homomorphism into any (hausdorff) topological group is closed if and only if the center of g is compact. we will show how mixing properties for unitary representations follow from this topological property.

the reflection coupling method on riemannian manifolds is a powerful tool in the study of harmonic functions and elliptic operators. in this talk, we will provide an overview of some fundamental ideas in stochastic analysis and the coupling method. we will then focus on applying these ideas to the study of the fundamental gap problem on the sphere. based on joint work with gang yang and guofang wei.

mirror symmetry and the breuil-mezard conjecture abstract: the breuil-mezard conjecture predicts the existence of hypothetical "breuil-mezard cycles" that should govern congruences between mod p automorphic forms on a reductive group g. most of the progress thus far has been concentrated on the case g = gl_2, which has several special features. i will talk about joint work with bao le hung on a new approach to the breuil-mezard conjecture, which applies for arbitrary groups (and in particular, in arbitrary rank). it is based on the intuition that the breuil-mezard conjecture is analogous to homological mirror symmetry.

given a smooth surface in r^3, a classical question in differential geometry asks whether the surface can be continuously deformed through a smooth, nontrivial family of isometric surfaces. if such a family exists and does not arise from rigid motions of r^3, then the surface is said to be flexible. an old conjecture asserts that flexible, smooth closed surfaces do not exist. in this talk, we survey this question and the general uniqueness problem for isometric immersions. we then present new examples of flexible, smooth immersed cylinders in r^3 which are neither minimal nor developable. we conclude with a discussion of speculative approaches to the construction of flexible, smooth closed surfaces. these results are part of upcoming work with andrew sageman-furnas.

ricci flow is an important tool in geometric analysis. there have been remarkable topological applications of ricci flow on closed manifolds, such as the poincaré conjecture resolved by perelman, and the recent generalized smale conjecture resolved by bamler-kleiner. in contrast, much less is known about the ricci flow on open manifolds. solitons produce self-similar ricci flows, which often arise as singularity models. collapsed singularities and solitons create additional difficulties for open manifolds. in this talk, i will survey some recent developments in ricci flow on open manifolds. in particular, i will talk about the resolution of hamilton's flying wing conjecture, and the resulting collapsed steady solitons.

the explicit descriptions of low degree k3 surfaces lead to natural compactifications coming from geometric invariant theory (git) and hodge theory. the relationship between these compactifications for degree two k3 surfaces was studied by shah and looijenga, and revisited by laza and o’grady, who also provided a conjectural description for the case of degree four k3 surfaces. i will discuss these results, as well as a verification of this conjectural picture using tools from k-moduli. this is joint work with kristin devleming and yuchen liu.

most algebraic structures can be given a lattice structure. for instance, any r-module defines a lattice where the meet and the join operations are given by the intersection and the sum of modules. furthermore, any r-module morphism gives rise to a usual lattice morphism between the corresponding lattices. actually, these two correspondences comprise a functor from the category of

r-modules to the category of complete modular lattices and usual lattice morphisms. however, this last category does not summon some basic algebraic properties that modules have (for example, the first theorem of isomorphism). with this in mind, we consider the category of linear modular lattices and linear morphisms, where we extend the notions of preradicals, and thus, describe the big lattice of lattice preradicals. in the process, we define some isomorphic structures to such lattice of lattice preradicals.

surprising connections have recently emerged between two very active and previously independent research domains: random permutations and random geometry. this talk will uncover these connections, showing how random geometric objects can be directly used to reconstruct universal limits for random permutations.

we will illustrate this new general theory through concrete examples of baxter permutations and monotone meanders, helping the audience build intuition. in the last part of the talk, we will explain how similar ideas led us to a new conjecture for the scaling limit of uniform random meanders and share progress on this long-standing open problem.

i will present two results on the formation and the interior structure of black holes in general relativity.
the first result proves that extremal (zero temperature) black holes can form dynamically in gravitational collapse. this provides a definitive disproof of the ”third law of black hole thermodynamics.” this is joint work with ryan unger (princeton).
the second result concerns black hole interiors and the strong cosmic censorship conjecture due to penrose. this conjecture asserts the deterministic character of general relativity. i will present work in the context of a negative cosmological constant that shows that whether determinism holds or not surprisingly depends on the diophantine properties of the black hole geometry.

in this work, we present an overview and comparison of spectral bundle methods for solving both primal and dual semidefinite programs (sdps). in particular, we introduce a new family of spectral bundle methods for solving sdps in the primal form. the algorithm developments are parallel to those by helmberg and rendl, mirroring the elegant duality between primal and dual sdps. the new family of spectral bundle methods achieves linear convergence rates for primal feasibility, dual feasibility, and duality gap when the algorithm captures the rank of the dual solutions. the original spectral bundle method by helmberg and rendl is well-suited for sdps with low-rank primal solutions, while on the other hand, our new spectral bundle method works well for sdps with low-rank dual solutions. these theoretical findings are supported by a range of large-scale numerical experiments.

in this talk we will explore one useful connection between graphs and permutation groups. with a little help from a. cayley we'll see how many spanning trees a graph with n vertices has. then we'll use this to find the number of minimal-length factorizations of a permutation into transpositions. the material should be accessible to anyone with a rudimentary knowledge of group theory. undergraduates welcome!

we'll be talking about recent results on the problem of splitting brauer classes by torsors for genus one curves. in its geometric form the question to be asked is: does every severi--brauer variety contain a smooth and projective genus one curve? algebraically, this question is related to the existence of certain finite galois modules inside the linear algebraic automorphism group of the severi--brauer variety. our goal will be to motivate why this is an intuitive and interesting question, giving some new results along the way.

one of the most fundamental unsolved problems in representation theory is to classify the set of irreducible unitary representations of a semisimple lie group. in this talk, i will define a class of such representations coming from filtered quantizations of certain graded poisson varieties. the representations i construct are expected to form the ''building blocks'' of all unitary representations.

this is joint work with srivatsav kunnawalkam elayavalli. i will discuss a new viewpoint we developed on the study of ii_1 factors involving sequential commutation. this gives us new insights on the elementary equivalence problem, and also reveals a new natural spectral gap type property for ii_1 factors strictly strengthening fullness. 

this research presents a framework for evaluating policies in a continuous-time setting, where the dynamics are unknown and represented by lévy processes. initially, we estimate the model using available trajectory data, followed by solving the associated pde to conduct the policy evaluation. our approach encompasses not only the conventional brownian motion but also the non-gaussian and heavy-tailed lévy processes. we have developed an algorithm that demonstrates enhanced performance compared to existing techniques tailored for brownian motion. furthermore, we provide a theoretical guarantee regarding the error in policy evaluation given the model error. experimental results involving both light-tailed and heavy-tailed data will be presented. this research provides a first step to continuous-time model-based reinforcement learning, particularly in scenarios characterized by irregular, heavy-tailed dynamics.

the famous caccetta-häggkvist conjecture states that for any $n$-vertex directed graph $d$, the directed girth of $d$ (the minimum length of a directed cycle in $d$) is at most $\lceil n/k \rceil$, where $k$ is the minimum out-degree of $d$. aharoni raised a strengthening conjecture: for any $n$-vertex graph $g$ equipped with an edge coloring (not necessarily proper) using $n$ colors, the rainbow girth of $g$ (the minimum length of a cycle in $g$ with distinctly colored edges) is at most $\lceil n/k \rceil$, where $k$ is the minimum size of the color class. we will discuss some results in the non-uniform degrees and rainbow versions of the caccetta-häggkvist conjecture.

based on joint work with ron aharoni, eli berger, maria chudnovsky, and shira zerbib.

the exploratory and interactive nature of modern data analysis often introduces selection bias and poses challenges to traditional statistical inference methods. to address selection bias, a common approach is to condition on the selection event. however, this often results in a conditional distribution that is intractable and requires markov chain monte carlo (mcmc) sampling for inference. notably, some of the most widely used selection algorithms yield selection events that can be characterized as polyhedra, such as the lasso for variable selection and the $\varepsilon$-greedy algorithm for multi-armed bandit problems. this talk will present a method that is tailored for conducting inference following polyhedral selection. the proposed method transforms the variables constrained within a polyhedron into variables within a unit cube, allowing for exact sampling. compared to mcmc, this method offers superior speed and accuracy. furthermore, it facilitates the computation of maximum likelihood estimators based on selection-adjusted likelihoods. numerical results demonstrate the enhanced performance of the proposed method compared to alternative approaches for selective inference.

in this talk we will introduce big mapping class groups and compare them to classical mapping class groups. the goal of the talk is to convince you that big mcgs form an interesting class of polish groups.

in this work, we investigate applications of no-collision transportation maps introduced by nurbekyan et al. in 2020 in manifold learning for image data. recently, there has been a surge in applying transportation-based distances and features for data representing motion-like or deformation-like phenomena. indeed, comparing intensities at fixed locations often does not reveal the data structure. no-collision maps and distances developed in [nurbekyan et al., 2020] are sensitive to geometric features similar to optimal transportation (ot) maps but much cheaper to compute due to the absence of optimization. in this work, we prove that no-collision distances provide an isometry between translations (respectively dilations) of a single probability measure and the translation (respectively dilation) vectors equipped with a euclidean distance. furthermore, we prove that no-collision transportation maps, as well as ot and linearized ot maps, do not in general provide an isometry for rotations.  the numerical experiments confirm our theoretical findings and show that no-collision distances achieve similar or better performance on several manifold learning tasks compared to other ot and euclidean-based methods at a fraction of a computational cost.

the first non-round einstein metrics on spheres were described in 1973 by jensen in dimensions 4n+3 (n > 0). for the next 25 years it remained an open problem whether the same could be done in even dimensions. this question was settled in 1998 when c. böhm constructed infinite families of einstein metrics on all spheres of dimension between 5 and 9, in particular on $s^6$ and $s^8$.

in the 25 years since then, all spheres of odd dimension (at least 5) have been shown to admit non-round einstein metrics. however, there have been no new developments in even dimensions above 8, leaving open to speculation the question of whether, if the dimension is even, non-uniqueness of the round metric is a low-dimensional phenomenon or to be expected everywhere.

i will give an overview of the methods used to construct such einstein metrics, which we recently used to construct the first examples of non-round einstein metrics on $s^{10}$.

this is joint work with matthias wink.

the classical spezialschar is the subspace of the space of holomorphic modular forms on  $\mathrm{sp}_4(\mathbb{z})$ whose fourier coefficients satisfy a particular system of linear equations. an equivalent characterization of the spezialschar can be obtained by combining work of maass, andrianov, and zagier, whose work identifies the spezialschar in terms of a theta-lift from $\widetilde{\mathrm{sl}_2}$. inspired by work of gan-gross-savin, weissman and pollack have developed a theory of modular forms on the split adjoint group of type d_4. in this setting we describe an analogue of the classical spezialschar, in which fourier coefficients are used to characterize those modular forms which arise as theta lifts from holomorphic forms on $\mathrm{sp}_4(\mathbb{z})$.

it is well-known that isoperimetric hypersurfaces in a smooth, compact (n+1)-manifold are smooth up to a closed set of codimension at least 7. we prove that the dimension estimate of singularities is sharp. in this talk, we will explore an example of an 8-dimensional closed smooth riemannian manifold, whose unique isoperimetric region, with half the volume of the manifold, displays two isolated singularities on its boundary. furthermore, for n > 7, we utilize similar methods to construct singular isoperimetric hypersurfaces in higher dimensions.
 

rank aggregation from pairwise and multiway comparisons has drawn considerable attention in recent years and has a variety of applications, ranging from recommendation systems to sports rankings to social choice. the existing literature on the ranking problem mainly concerns parameter estimation and algorithm implementation. however, there has been little investigation on the statistical inference theory of ranks. in this talk, i will start with a novel inference framework for ranks based on a modified plackett-luce model for multiway ranking with only the top choice observed. then i will present a new methodology to construct simultaneous confidence intervals for the corresponding ranks through a sophisticated maximum pairwise difference statistic based on the mle. practically a valid gaussian multiplier bootstrap procedure is developed to approximate the distribution of the proposed statistic. with the constructed simultaneous confidence intervals, we are able to study various inference problems on ranks such as testing whether an item of interest is among the top-k ranking. our inference framework for the ranks can be widely applicable in many other ranking problems.  

the main objects of study in algebraic geometry are varieties, which are geometric objects locally defined by polynomial equations, and one goal of the subject is to classify all algebraic varieties of a given type.  we approach this problem by constructing parameter spaces, called moduli spaces, whose points correspond to the geometric objects we aim to parameterize.  depending on the type of variety, there are several different ways to construct a compact moduli space and in this talk we will survey these different moduli spaces and stability conditions (such as git stability, k-stability, ksb/ksba-stability), discuss their relationships, and give several applications.

i will discuss joint work with kenny ascher, dori bejleri, harold blum, giovanni inchiostro, yuchen liu, and xiaowei wang on construction of moduli stacks and moduli spaces of boundary polarized log calabi yau pairs. unlike moduli of canonically polarized varieties (respectively, fano varieties) in which the moduli stack of ksb stable (respectively, k semistable) objects is bounded for fixed volume, dimension, the objects here form unbounded families. despite this unbounded behavior, we define the notion of asymptotically good moduli space, and, in the case of plane curve pairs (p2, c), we construct a projective good moduli space parameterizing s-equivalence classes of such pairs. time permitting, i will discuss applications to the classification of special degenerations of p2, the b-semiampleness conjecture of shokurov and prokhorov, and the hassett-keel program.

on a two dimensional stein space with isolated, normal singularities, finite type boundary and locally algebraic bergman kernel, we find an estimate of the local algebraic degree of the bergman kernel in terms of the type of the boundary. as an application, we characterize two dimensional ball quotients as finite type stein spaces with a rational bergman kernel.

in this talk, i will explore the interesting geometries that emerge in high-dimensional attraction basins, which are important in applications such as protein folding, cell differentiation, and neural networks. as a paradigmatic model, i will consider networks of coupled kuramoto oscillators and show that high-dimensional basins generally cannot be approximated by simple convex shapes. instead, they have tentacle-like structures where most of the basin volume is concentrated. next, i will show that introducing non-pairwise couplings among kuramoto oscillators can make basins deeper but smaller—the attractors become linearly more stable but much harder to find due to basins shrinking dramatically. time allowing, i will also briefly mention a few related projects, including learning basins with reservoir computing and modeling circadian clocks with kuramoto oscillators.

the class of sqp methods solve nonlinear constrained optimization problems by solving a related sequence of simpler problems. these sqp subproblems involve minimization of a quadratic model of the lagrangian function subject to linearized constraints. in contrast to the quasi-newton approach, which maintains a positive definite hessian approximation, second-derivative sqp methods use the exact hessian of the lagrangian. in this context, we will discuss an adaptive convexification strategy that makes minimal matrix modifications while ensuring the subproblem iterates are bounded and the solution defines a descent direction for the relevant lagrangian. this talk will focus on adaptive convexification of stabilized sqp methods, as well as their connection with primal-dual interior methods.

the notion of biexactness for groups was introduced by ozawa in 2004 and has since become a major tool used for studying solidity of von neumann algebras. we introduce the notion of biexactness for von neumann algebras, which allows us to place many previous solidity results in a more systematic context, and naturally leads to extensions of these results. we will also discuss examples of solid factors that are not biexact. this is a joint work with jesse peterson.

we prove a conjecture of k. marton, widely known as the polynomial freiman– ruzsa conjecture, in characteristic 2. the argument extends to odd characteristic, with details to follow in a subsequent paper. this is a joint work with timothy gowers, ben green and terence tao.  

the singularity formation problem is a central question in fluid dynamics, and it is still widely open for fundamental models such as the 3d incompressible euler equations and the navier-stokes equations. in this talk, i will first review the singularity formation problem, and i will describe how particle transport poses the main challenge in constructing blow-up solutions — an effect known as “regularization by transport.” i will then outline a new mechanism, arising from the classical taylor-couette instability, allowing us to overcome regularization by transport in the 3d euler equations, thereby constructing the first swirl-driven singularity in r^3. this is joint work with tarek elgindi (duke university).

topology plays a fundamental role in controlling the dynamics of adaptive biological and physical systems, from chromosomal dna and biofilms to cilia carpets and worm collectives. despite their long history, the subtle interplay between topology, geometry and mechanics in tangled elastic filaments remains poorly understood. to uncover the topological principles underlying the dynamics of knotted and tangled matter, we first develop a mapping between human-designed elastic knots and long-range ferromagnetic spin systems. this mapping gives rise to topological counting rules that predict the relative mechanical stability of commonly used climbing and sailing knots. building upon this framework, we then examine the adaptive topological dynamics exhibited by california blackworms, which form living tangled structures in minutes but can rapidly untangle in milliseconds. using blackworm locomotion datasets, we construct stochastic trajectory equations that explain how the dynamics of individual active filaments control their emergent topological state. by identifying the principles behind stability and adaptivity in living tangled matter, our results have applications in understanding broad classes of adaptive, self-optimizing biological systems.

let $h < g$ both be noncompact connected semisimple real algebraic groups and $\gamma < g$ be a lattice. in the work of gorodnik--weiss, they showed that the distribution of dense $\gamma$-orbit on homogeneous space $g/h$ is asymptotically the same as $g$-orbit on $g/h$. one key ingredient in their proof is shah's theorem derived from the famous ratner's theorem. in this talk, we report an effective version of this result in the case $(g, h, \gamma) = (\mathrm{sl}_3(\mathbb{r}), \mathrm{so}(2, 1), \mathrm{sl}_3(\mathbb{z}))$. the proof uses recent progress by lindenstrauss--mohammadi--wang--yang towards an effective version of ratner's theorem. we also prove the general case if an effective version of ratner's theorem is provided. the talk is based on an ongoing work with pratyush sarkar.

in this talk, i will describe the regularity theory for surfaces minimizing the prescribed mean curvature functional over isotopies in a closed riemannian 3-manifold, which is a prescribed mean curvature counterpart of the celebrated regularity result of meeks, simon and yau about minimizers of the area functional over isotopies. 

whereas for the area functional minimizers over isotopies are smooth embedded minimal surfaces, minimizers of the prescribed mean curvature functional turn out to be c^{1,1} immersions which can have a large self-touching set where the mean curvature vanishes. 

even though the proof broadly follows the same general strategy as in the case of the area functional, several new ideas are needed to deal with the lower regularity setting. this regularity theory plays an important role in z. wang-x. zhou’s recent proof of the existence of 4 embedded minimal spheres in a generic metric on the 3-sphere.

the results in this talk are joint work with douglas stryker (princeton). 

sharp geometric and functional inequalities play an important role in analysis,  pdes and differential geometry. in this talk, we will describe our works in recent years on sharp higher order poincare-sobolev and hardy-sobolev-maz'ya inequalities on real and complex hyperbolic spaces and noncompact symmetric spaces of rank one. the approach we have developed crucially relies on the helgason-fourier analysis on hyperbolic spaces and establishing such inequalities for the gjms operators.  best constants for such inequalities will be compared with the classical higher order sobolev inequalities in euclidean spaces. the borderline case of such inequalities, such as the moser-trudinger and adams inequalities will be also considered. 

the concept of p-adic families of automorphic forms has far reaching applications in number theory. in this talk, we will discuss one of the first examples of such a family, built from the eisenstein series, before allowing this to inform a construction of a family on an exceptional group of type g_2.

[pre-talk at 1:20pm in apm 6402]

modern statistical learning is featured by the high-dimensional nature of data and over-parameterization of models. in this regime, analyzing the dynamics of the used algorithms is challenging but crucial for understanding the performance of learned models. this talk will present recent results on the dynamics of two pivotal algorithms: approximate message passing (amp) and stochastic gradient descent (sgd). specifically, amp refers to a class of iterative algorithms for solving large-scale statistical problems, whose dynamics admit asymptotically a simple but exact description known as state evolution. we will demonstrate the universality of amp's state evolution over large classes of random matrices, and provide illustrative examples of applications of our universality results. secondly, for sgd, a workhorse for training deep neural networks, we will introduce a novel mathematical framework for analyzing its implicit regularization. this is essential for sgd's ability to find solutions with strong generalization performance, particularly in the case of over-parameterization. our framework offers a general method to characterize the implicit regularization induced by gradient noise. finally, in the context of underdetermined linear regression, we will show that both amp and sgd can provably achieve sparse recovery, yet they do so from markedly different perspectives.

integrable lattice models play a pivotal role in the investigation of microscopic multi-particle systems, with their continuum limits forming the foundation of the macroscopic effective theory. these models have found broad applications in condensed matter physics and numerical analysis. in this talk, i will discuss our recent work on the continuum limit of some differential-difference equations. using the ablowitz--ladik system (al) as our prototypical example, we establish that solutions to this discrete model converge to solutions of the cubic nonlinear schr\"odinger equations (nls). notably, we consider merely $l^2$ initial data which combines both slowly varying and rapidly oscillating components, and demonstrate convergence to a decoupled system of nls. this surprising result highlights that a sole nls does not suffice to encapsulate the al evolution in such a low-regularity setting reminiscent of the thermal equilibrium state. i will also explain the framework of our proof and how it has been successfully extended to address more general lattice approximations to nls and mkdv.

f-bundle is a formal version of variation of non-commutative hodge structures. i will explain basic ideas and properties of f-bundles, present an explicit construction of f-bundles associated to blowups, and discuss its relation with iritani’s work on quantum cohomology. joint work with katzarkov, kontsevich and pantev.

reaction-diffusion equations with nonlocal constraints naturally arise as limiting cases of mathematical models of intracellular signaling. among the interesting behaviors of these models, much has been made of their 'geometry-sensing' properties: the strong sensitivity of steady-state solutions to domain geometry is widely seen as illustrative of how a cell establishes an internal coordinate axis. in this talk, i describe recent efforts to formally clarify this geometry dependence through careful study of the long-time behavior of a popular model of biochemical symmetry breaking.  using the tools of formal asymptotics, calculus of variations, and a new fast solver for surface-bound pdes, we study the formation and motion of interfaces on a curved domain across three dynamical timescales. our results allow us to construct several analytical steady-state solutions that serve as counter-examples to received wisdom regarding the geometry-dependence of this class of model. 

from social media trends to family dynamics, social interactions shape our daily lives. in this talk, i will present tools i have developed for statistical inference and decision-making in light of these social interactions.

(1) inference: i will talk about estimation of causal effects in the presence of interference. in causal inference, the term “interference” refers to a situation where, due to interactions between units, the treatment assigned to one unit affects the observed outcomes of others. i will discuss large-sample asymptotics for treatment effect estimation under network interference where the interference graph is a random draw from a graphon. when targeting the direct effect, we show that popular estimators in our setting are considerably more accurate than existing results suggest. meanwhile, when targeting the indirect effect, we propose a consistent estimator in a setting where no other consistent estimators are currently available.

(2) decision-making: turning to reinforcement learning amid social interactions, i will focus on a problem inspired by a specific class of mobile health trials involving both target individuals and their care partners. these trials feature two types of interventions: those targeting individuals directly and those aimed at improving the relationship between the individual and their care partner. i will present an online reinforcement learning algorithm designed to personalize the delivery of these interventions. the algorithm's effectiveness is demonstrated through simulation studies conducted on a realistic test bed, which was constructed using data from a prior mobile health study. the proposed algorithm will be implemented in the adapts hct clinical trial, which seeks to improve medication adherence among adolescents undergoing allogeneic hematopoietic stem cell transplantation.

many statistical learning problems, where one aims to recover an underlying low-dimensional signal, are based on optimization, e.g., the linear programming approach for recovering a sparse vector. existing work often either overlooked the high computational cost in solving the optimization problem, or required case-specific algorithm and analysis -- especially for nonconvex problems. this talk addresses the above two issues from a unified perspective of conditioning. in particular, we show that once the sample size exceeds the intrinsic dimension of the signal, (1) a broad range of convex problems and a set of key nonsmooth nonconvex problems are well-conditioned, (2) well-conditioning, in turn, inspires new algorithm designs and ensures the efficiency of many off-the-shelf optimization methods.