the talk presents a quick review on landau damping for vlasov-poisson system near penrose stable data, followed by a joint work with d. han-kwan and f. rousset, where the damping, with screening potential, is proved for data with (essentially) $c^{1}$ regularity on the whole space.

in this talk, i will discuss some models and algorithms from
two different fields: (1) machine learning, including logistic
regression and deep learning, and (2) numerical pdes, including
multigrid methods. i will explore mathematical relationships between
these models and algorithms and demonstrate how such relationships can
be used to understand, study and improve the model structures,
mathematical properties and relevant training algorithms for deep
neural networks. in particular, i will demonstrate how a new
convolutional neural network known as mgnet, can be derived by making
very minor modifications of a classic geometric multigrid method for
the poisson equation and then explore the theoretical and practical
potentials of mgnet.

a surface has geometric free-boundary in a barrier hypersurface if its boundary meets the barrier orthogonally, like a bubble on a bathtub. we extend brakke's weak notion of mean curvature flow to have a free-boundary condition, and using toy examples we show why this extension is necessary. contrary to the classical flow, for which the barrier is ``invisible,'' the weak flow allows for the surfaces to ``pop'' upon tangential contact with the barrier. when the initial surface is mean-convex, we generalize white's partial regularity and structure theory to the free-boundary setting. this is in part joint work with robert haslhofer, mohammad ivaki, and jonathan zhu.

khovanov homology, as defined by mikhail khovanov based on the representation theory of quantum groups, is a powerful invariant for knots. it categorifies the famous jones polynomial, meaning that jones polynomial can be recovered as its euler characteristic. despite its simple combinatorial definition, khovanov homology has deep relation with quantum topology, gauge theory and representation theory. in this talk, i will recall the definition of khovanov homology and introduce some of its important properties and applications (including rassmussen's combinatorial proof of the milnor conjecture). no previous knowledge on knot theory will be assumed.

low rank approximation has been extensively studied in the past. it is most suitable to reproduce rectangular like structures in the data. in this talk i introduce a generalization using ``shifted'' rank-1 matrices to approximate $a\in\mathbb{c}^{m\times n}$. these matrices are of the form $s_{\lambda}(uv^*)$ where $u\in\mathbb{c}^m$, $v\in\mathbb{c}^n$ and $\lambda\in\mathbb{z}^n$. the operator $s_{\lambda}$ circularly shifts the $k$-th column of $uv^*$ by $\lambda_k$.

these kind of shifts naturally appear in applications, where an object $u$ is observed in $n$ measurements at different positions indicated by the shift $\lambda$. the vector $v$ gives the observation intensity. this model holds e.g., for seismic waves that are recorded at $n$ sensors at different times $\lambda$.

the main difficulty of the above stated problem lies in finding a suitable shift vector $\lambda$. once the shift is known, a simple singular value decomposition can be applied to reconstruct $u$ and $v$. we propose a greedy method to reconstruct $\lambda$ and validate our approach in numerical examples.

reference:

f. boss mann, j. ma, enhanced image approximation using shifted rank-1 reconstruction, inverse problems and imaging, accepted 2019, https://arxiv.org/abs/1810.01681

the kpz equation, a model for the random growth of rough interfaces, has been the subject of great physical and mathematical interest since its introduction in 1986. by simple changes of variables, it is closely related to the stochastic heat equation, which models the partition function of a random walk in a random environment, and the stochastic burgers equation, a simple model for turbulence. i will explain several recent results about the existence, classification, and properties of spacetime-stationary solutions to these equations on ${\bf r}^d$ for various values of $d$. these solutions thus represent the behavior of the models in large domains on long time scales. most of the results are joint work with various combinations of c. graham, y. gu, l. ryzhik, and o. zeitouni.

symmetric functions are highly ubiquitous in algebraic combinatorics, with connections to the representation theory of $gl_n$ and $s_n$, the geometry of grassmannians, and more. there is a classical way to 'compose' symmetric functions called plethysm which has a nice representation-theoretic interpretation. we will describe a related operation called chern plethysm which has inputs given by a symmetric function f and a vector bundle e and outputs a symmetric polynomial. chern plethysm provides numerous schur-positivity results, indicating a representation-theoretic connection, but finding this connection remains an open problem. joint with sara billey and vasu tewari.

the moduli space m of complex curves of fixed topology is an orbifold classifying space for surface bundles. as such the cohomology rings of m and its various orbifold covers give characteristic classes for surface bundles. i will discuss the steinberg module which is central to the duality present in these cohomology rings. i will then explain current joint work with t. brendle and a. putman on surfaces with marked points which expands on results of n. fullarton and a. putman for surfaces without marked points. we show that certain finite-sheeted orbifold covers m[l] of m have large nontrivial q-cohomology in their cohomological dimension.

given a graph $g$, one can compute the eigenvalues of its adjacency matrix $a_g$. remarkably, these eigenvalues can tell us quite a bit about $g$. more generally, spectral graph theory consists of taking a graph $g$, associating to it a matrix $m_g$, and then using algebraic properties of $m_g$ to recover combinatorial information about $g$. this talk is the first in a series of introductory talks to the subject of spectral graph theory. in particular, we'll be discussing the adjacency matrix and the information encoded by its eigenvalues.

first stated in 1973, the cycle double cover conjecture states that every bridgeless graph has a collection of cycles which cover every edge exactly twice. the problem remains wide open to this day despite much work. this talk is to present my partial results on the problem, explain why the tutte polynomial is awesome, and to draw some of the beautiful proofs by picture that arose in my work.

rational varieties are some of the simplest examples of varieties, e.g. most of their points can be parametrized by affine space. it is natural to ask (1) how can we determine when a variety is rational? and (2) if a variety is not rational, can we measure how far it is from being rational? a famous particular case of this problem is when the variety is a smooth hypersurface in projective space. this problem has attracted a great deal of attention both classically and recently. the interesting case is when the degree of the hypersurface is at most the dimension of the projective space (the ``fano''range), these hypersurfaces share many of the properties of projective space. in this talk, we present recent work with nathan chen which says that smooth fano hypersurfaces of large dimension can have arbitrarily large degrees of irrationality, i.e. they can be arbitrarily far from being rational.

nonlocal models are experiencing a firm upswing recently as more realistic alternatives to the conventional local models for studying various phenomena from physics and biology to materials and social sciences. in this talk, i will describe our recent effort in taming the computational challenges for nonlocal models. i will first highlight a family of numerical schemes - the asymptotically compatible schemes - for nonlocal models that are robust with the modeling parameter approaching an asymptotic limit. second, i will discuss nonlocal-to-local coupling techniques so as to improve the computational efficiency of using nonlocal models. this also motivates the development of new mathematical results - for instance, a new trace theorem that extends the classical results.

although new nonlocal models have been gaining popularity in various applications, they often appear as phenomenological models, such as the peridynamics model in fracture mechanics. here i will illustrate how to characterize the origin of nonlocality through homogenization of wave propagation in periodic media.

a ridge in a data cloud is a low-dimensional geometric feature that generalizes the concept of local modes, in the sense that ridge points are local maxima constrained in some subspace. in this talk we give nonparametric confidence regions for $r$-dimensional ridges of probability density functions on ${r}^d$ , where $1 \leq r \< d$. we view ridges as the intersections of level sets of some special functions. the vertical variation of the plug-in kernel estimators for these functions constrained on the ridges is used as the measure of maximal deviation for ridge estimation. two types of confidence regions for density ridges will be presented: one is based on the asymptotic distribution of the maximal vertical deviation, which is established by utilizing the extreme value theory of nonstationary $\chi^2$-fields indexed by manifolds; and the other is a bootstrap approach (including multiplier bootstrap and empirical bootstrap), the theoretical validity of which leverages the recent study in the literature on the gaussian approximation of suprema of empirical processes.

khovanov homology is a powerful invariant of knots which has many connections to other areas of mathematics, such as representation theory and gauge theory. however, it is strangely difficult to extract topological information from this invariant. after discussing this invariant, we will show that it is able to detect the figure-eight knot.

as in complex analysis, liouville theorems in pdes assert that any solution of a specific equation is trivial. the meaning of
``trivial'' depends on the context. in this lecture, we will discuss liouville theorems for superlinear parabolic pdes. an overview, a typical application, and recent results will be presented.

can one emulate the simple random walk without actually doing anything random? this talk will be about a deterministic version of random walk called rotor walk, and we will measure its performance in emulating the simple random walk with respect to different parameters, e.g., the shape of the trajectory, number of returns to the origin, etc. in particular, we will see that the number of returns to the origin for the rotor walk can be made equal to the same number for the simple random walk. this resolves a conjecture of florescu, ganguly, levine, and peres (2014).

we describe an ongoing program to resolve certain problems at the interface of diophantine approximation and homogenous dynamics. highlights include computing the hausdorff and packing dimensions of the set of singular systems of linear forms and show they are equal, thereby resolving a conjecture of kadyrov-kleinbock-lindenstrauss-margulis (2014) as well as answering a question of bugeaud-cheung-chevallier (2016). as a corollary of the dani correspondence principle, this implies that the set of divergent trajectories of a one-parameter diagonal action on the space of unimodular lattices with exactly two lyapunov exponents with opposite signs has equal hausdorff and packing dimensions. other applications include dimension formulas with respect to the uniform exponent of irrationality for simultaneous and dual approximation in two dimensions. this is joint work with david simmons, lior fishman, and mariusz urbanski. the reduction of various problems to questions about certain combinatorial objects that we call templates along with a variant of schmidt's game allows us to answer some of these problems, while leaving plenty that remain open. the talk will be accessible to 2022年亚洲世界杯预选赛 and faculty interested in some convex combination of homogeneous dynamics, diophantine approximation and geometric measure theory.

in perelman's well-known paper, he claimed the unqueness of the 3d \verb=\=kappa-noncollpased steady grs (without giving any proof or ideas) and conjectured that 3d noncompact \verb=\=kappa-solution with positive sectional curvature must be the ricci flow generated the bryant soliton. perelman's claim and conjecture has been proved by simon brendle in 2012 and 2018, respectively. the classification of 3d \verb=\=kappa-noncollpased steady grs plays an important role in his proof of the conjecture. brendle's work is based on the observation that 3d \verb=\=kappa-noncollpased steady grs must be asymptotically cylindercial. in higher dimensions, the asymptotical geometry of steady grs is much more complicated. in this talk, we will talk about some recent progress on the asymptotical geometry of 4d steady grs. this is a joint work with prof. bennett chow.

a triangulation of a topological space is a homeomorphism from this space to a simplicial complex. a famous problem in topology is whether all manifolds are triangulable. surprisingly, the answer is no when dimension is at least 4. in this talk, i will explain the beautiful work of galewski-stern and matumoto, which provides an obstruction theory for triangulating manifolds. i will also explain manolescu's disproof of triangulation conjecture in all dimensions greater than 4.

the growth of bacterial colony exhibits striking complex patterns and robust scaling laws. understanding the principles that underlie such growth has far-reaching consequences in biological and health sciences. in this work, we develop a mechanical theory of cell-cell and cell-environmental interactions and construct a hybrid three-dimensional computational model for the growth of {\it e.~coli} colony on a hard agar surface. our model consists of microscopic descriptions of the growth, division, and movement of individual cells, and macroscopic diffusion equations for the nutrients. the cell movement is driven by the cellular mechanical interactions. our unique treatment of the force arising from the liquid-air surface tension is applicable to both the monolayer (discrete) and multilayer (continuum) growth regimes. our large-scale simulations and analysis predict the linear growth of the colony in both the radial and vertical directions, conforming the experimental observations. this work is the first step toward detailed computational modeling of bacterial growth with mechanical and biochemical interactions. this is joint work with mya warren, hui sun, yue yan, jonas cremer, and terence hwa.

motivated by quantum information theory, we study log-sobolev inequalities for matrix valued functions on finite graphs and compact lie groups. using tools from noncommutative geometry we find a surprising link between graph laplacians and sublaplacians on the orthogonal group. simple combinatorial tools, namely the existence of a spanning tree, then allows us to find concrete lower bounds for spectral gaps. joint work with h. li and n. laracuente.

in this talk, we will be discussing the discrete fourier transform in one
and two dimensions, including some of the transform's properties, as well
as various strategies for efficiently evaluating the discrete fourier transform
via several fast fourier transform algorithms. the algorithms discussed
will include the cooley-turkey algorithm, the radix-2 decimation in time
strategy, the split-radix algorithm, the mixed-radix algorithm, the prime
factor algorithm, and rader's algorithm. finally, we will discuss various
applications of the fast fourier transform, as well as considerations for
using it in practical applications.

recently there has been a lot of work on the construction of the k-moduli space, i.e. a good moduli space parametrizing k-polystable fano varieties. it is conjectured that this moduli space is projective and the polarization is given by a natural line bundle, the chow-mumford (cm) line bundle. in this talk, i will present a recent joint work with chenyang xu where we show the cm line bundle is ample on any proper subspace parametrizing reduced uniformly k-stable fano varieties, which conjecturally should be the entire k-moduli. as an application, we prove that the moduli space parametrizing smoothable k-polystable fano varieties is projective.

suppose $l$ is a link with n components and the rank of $kh(l;z/2)$ is $2^n$, we show that $l$ can be obtained by disjoint unions and connected sums of hopf links and unknots. this result gives a positive answer to a question asked by batson-seed, and generalizes the unlink detection theorem of khovanov homology by hedden-ni and batson-seed. the proof relies on a new excision formula for the singular instanton floer homology introduced by kronheimer and mrowka. this is joint work with yi xie.

in this talk i will survey recent work with kleiner in which we verify two topological conjectures using ricci flow. first, we classify the homotopy type of every 3-dimensional spherical space form. this proves the generalized smale conjecture and gives an alternative proof of the smale conjecture, which was originally due to hatcher. second, we show that the space of metrics with positive scalar curvature on every 3-manifold is either contractible or empty. this completes work initiated by marques. our proof is based on a new uniqueness theorem for singular ricci flows, which i have previously obtained with kleiner. singular ricci flows were inspired by perelman's proof of the poincar\'e and geometrization conjectures, which relied on a flow in which singularities were removed by a certain surgery construction. since this surgery construction depended on various auxiliary parameters, the resulting flow was not uniquely determined by its initial data. perelman therefore conjectured that there must be a canonical, weak ricci flow that automatically ``flows through its singularities'' at an infinitesimal scale. our work on the uniqueness of singular ricci flows gives an affirmative answer to perelman's conjecture and allows the study of continuous families of singular ricci flows leading to the topological applications mentioned above.

the study of stochastic processes and their expected suprema arises in many natural contexts. some examples include understanding the modulus of continuity for brownian motion, bounding the maximum singular value of a random matrix, or quantifying discrepancies between a distribution and its corresponding empirical distribution. early attempts at understanding gaussian processes dates back as far as kolmogorov and more recently to dudley, fernique, pisier, and marcus, among many others. michel talagrand has provided a powerful and elegant framework known as the generic chaining which unifies and extends the work of these mathematicians to give optimal bounds on the expected suprema of gaussian processes. the aspirational goal of this talk is to outline chaining \'a la talagrand while focusing on understanding and not getting lost in the details of the set-up. material is drawn mostly from chapter 2 of talagrand's text ``upper and lower bounds for stochastic processes.''

graph distances have proven quite useful in machine learning/statistics, particularly in the estimation of euclidean or geodesic distances. the talk will include a partial review of the literature, and then present more recent developments on the estimation of curvature-constrained distances on a surface, and well as on the estimation of euclidean distances based on an unweighted and noisy neighborhood graph.

thromboembolism, one of the leading causes of morbidity and mortality worldwide, is characterized by formation of obstructive intravascular clots (thrombi) and their mechanical breakage (embolization). a novel two-dimensional multi-phase computational model will be described that simulates active interactions between the main components of the clot, including platelets and fibrin. it can be used for studying the impact of various physiologically relevant blood shear flow conditions on deformation and embolization of a partially obstructive clot with variable permeability. simulations provide new insights into mechanisms underlying clot stability and embolization that cannot be studied experimentally at this time. in particular, multi-phase model simulations, calibrated using experimental intravital imaging of an established arteriolar clot, show that flow-induced changes in size, shape and internal structure of the clot are largely determined by two shear-dependent mechanisms: reversible attachment of platelets to the exterior of the clot and removal of large clot pieces [1]. model simulations also predict that blood clots with higher permeability are more prone to embolization with enhanced disintegration under increasing shear rate. in contrast, less permeable clots are more resistant to rupture due to shear rate dependent clot stiffening originating from enhanced platelet adhesion and aggregation. role of platelets-fibrin network mechanical interactions in determining shape of a clot will be also discussed and quantified using analysis of experimental data [2,3]. these results can be used in future to predict risk of thromboembolism based on the data about composition, permeability and deformability of a clot under specific local hemodynamic conditions.

1. xu s, xu z, kim ov, litvinov ri, weisel jw, alber m. model predictions of deformation, embolization and permeability of partially obstructive blood clots under variable shear flow. j. r. soc. interface 14 (2017) 20170441.

2. oleg v. kim, rustem i. litvinov, mark s. alber & john w. weisel, quantitative structural mechanobiology of platelet driven blood clot contraction, nature communications 8 (2017) 1274.

3. samuel britton, oleg kim, francesco pancaldi, zhiliang xu, rustem i. litvinov, john w.weisel, mark alber [2019], contribution of nascent cohesive fiber-fiber interactions to the non-linear elasticity of fibrin networks under tensile load, acta biomaterialia 94 (2019) 514--523.

using the torelli theorem for k3 surfaces of pyatetskii-shapiro and
shafarevich one can describe the automorphism group of a k3 surface over
${\mathbb c}$ up to finite error as the quotient of the orthogonal group
of its picard lattice by the subgroup generated by reflections in
classes of square -2. we will give a similar description valid over an
arbitrary field in which the reflection group is replaced by a certain
subgroup. we will then illustrate this description by giving several
examples of interesting behaviour of the automorphism group, and by
showing that the automorphism groups of two families of k3 surfaces that
arise from diophantine problems are finite. this is joint work with
martin bright and ronald van luijk (university of leiden).

combining a multi-armed bandit task and bayesian computational modeling, we find that humans systematically under-estimate reward availability in the environment. this apparent pessimism turns out to be an optimism bias in disguise, and one that compensates for other idiosyncrasies in human learning and decision-making under uncertainty, such as a default tendency to assume non-stationarity in environmental statistics as well as the adoption of a simplistic decision policy. in particular, reward rate underestimation discourages the decision-maker from switching away from a ``good'' option, thus achieving near-optimal behavior (which never switches away after a win). furthermore, we demonstrate that the bayesian model that best predicts human behavior is equivalent to a particular class of reinforcement learning models, thus giving statistical, normative grounding to phenomenological models of human behavior.

by a ``modular form'' for a reductive group $g$ we mean an
automorphic form that has some sort of very nice fourier expansion. the
classic example are the holomorphic siegel modular forms, which are
special automorphic functions for the group $\mathrm{sp}_{2g}$.
following work of gan, gross, savin, and wallach, it turns out that
there is a notion of modular forms on certain real forms of the
exceptional groups. i will define these objects and explain what is
known about them.

we introduce the normalized laplacian matrix and study how its eigenvalues relate to random walks on graphs and isoperimetric inequalities.

in the early '60s, abraham robinson scrapped his standard transmission
calc-mobile and built a non-standard (aka automatic) model. his new model
allowed him and others to shift many proofs into a more intuitive gear.
we'll discuss the first time he took his model through the
car- \l o\'s; and d-rive the transfer principle. we'll also get
infinitely close to talking about the hyperreal numbers.

i will discuss compactifications of the moduli space of smooth plane curves of degree d at least 4. we will regard a plane curve as a log fano pair $(\mathbb{p}^2,ac)$, where a is a rational number, and study the compactifications coming from k stability for general log fano pairs. we establish a wall crossing framework to study these spaces as a varies and show that, when a is small, the moduli space coming from k stability is isomorphic to the git moduli space. we describe all wall crossings for degree 4, 5, and 6 plane curves and discuss the picture for general q-gorenstein smoothable log fano pairs. this is joint work with kenneth ascher and yuchen liu.

we will talk about kronheimer and mrowka's knot concordance
invariant, $s^\sharp$. we compute the invariant for various knots. our
computations reveal some unexpected phenomena, including that
$s^\sharp$ differs from rasmussen's invariant $s$, and that it is not
additive under connected sums. we also generalize the definition of
$s^\sharp$ to links by giving a new characterization of the invariant
in terms of immersed cobordisms.

we will discuss central sequence algebras of von neumann algebras, and provide a class of ii$_1$ factors whose central sequence algebra is not the ``tail'' algebra associated to any decreasing sequence of von neumann subalgebras. this settles a question of mcduff from 1969. we will also discuss an application of these techniques to the notion of tracial stability for groups. this is based on joint work with adrian ioana.

the a-function on a coxeter group w is a function a : w $\rightarrow$ n defined by lusztig which is intimately related to the partition of w into kazhdan--lusztig cells and to the representation theory of the hecke algebra of w. it is known that the identity element of w is the only element with a-value 0, while a non-identity element has a-value 1 if and only if it has a unique reduced word. however, as its definition relies on the kazhdan--lusztig basis of the hecke algebra, thea-function is often difficult to compute for general elements.
in this talk we will focus on elements of a-value 2, or a-2 elements. we show that a-2 elements arefully commutative in the sense of stembridge, which allows us to associate to them certain posets called heaps and, in many cases, certain generalized temperley--lieb diagrams. using heaps and temperley--lieb diagrams, we conjecture a combinatorial characterization of a-2 elements, classify all coxeter groups with finitely many a-2 elements, and enumerate a-2 elements for all groups from the classification. joint with richard green.

we will talk about several methods of proving non-asymptotic bounds on
the spectral norm of random matrices including epsilon-net argument and
slepian's lemma. the main idea is to relate the spectral norm of a
random matrix to the supremum of a random process.

in his thesis, m. bhargava proved parameterizations and identified local
conditions which he used to give asymptotic counts for $s_4$ quartic and
quintic number fields, ordered by discriminant. this talk will discuss
results in an ongoing project to add detail to bhargava's work by
considering in addition to the field discriminant, the lattice shape of
the ring of integers in the canonical embedding, and by giving strong
rates with lower order terms in the asymptotics. these results build on
earlier work of taniguchi-thorne, bhargava-shankar-tsimerman and
bhargava-harron.

i will discuss certain methods used to find so called ``cyclotomic
solutions'' to a system of polynomial equations. these are solutions in
which each coordinate is a root of unity. i will then give a simple real
world example in which these methods come in handy, coming from joint work
with christian woll.

belyi's theorem says that on one hand, a curve over a field of
characteristic 0 that admits a finite map to $\mathbf{p}^1$ ramified
over at most three points must descend to a subfield algebraic over
$\mathbb{q}$, and on the other hand any curve over such a subfield does
indeed admit such a morphism (without any further base extension). one
might ask whether a similar statement holds over a field of
characteristic $p$, replacing $\mathbb{q}$ with $\mathbb{f}_p$. for
general morphisms this is false, but it becomes true if we restrict to
tamely ramified morphisms to $\mathbf{p}^1$. such a statement was
originally given by saidi, in which the ``other hand'' assertion was made
conditional on the existence of some tamely ramified morphism from the
given curve to $\mathbf{p}^1$.

in the pre-talk, we will discuss how to establish existence of a tamely
ramified morphism in characteristic \mbox{$p\>2$}. this is ``classical'' over an
infinite algebraic extension of $\mathbb{f}_p$; to do it over a fixed
finite field requires a density statement in the style of poonen's
finite field bertini theorem.

in the talk proper, we will discuss work of sugiyama-yasuda that
establishes the existence of a tamely ramified morphism when the base
field is algebraically closed of characteristic 2. the case where the
base field is finite of characteristic 2 requires a further geometric
reinterpretation of the key construction of sugiyama-yasuda; this is
joint work with daniel litt and jakub witaszek.

abel's theorem (1824) that the generic polynomial of degree n is
solvable in radicals if and only if $n$ $\<$ 5 is well-known. however, the
classical works of bring (1786) and klein (1884) give solutions of the
generic quintic polynomial by allowing certain other ``nice'' algebraic
functions of one variable. for the sextic, it is conjectured that any
solution requires algebraic functions of two variables. in this talk, we
will examine and relate the intrinsic geometries of the known solutions
of the sextic in two variables, extending the work of green (1978).

an important result due to sanderson and ion says that characters of level one demazure modules are specialized macdonald polynomials. in this talk, i will introduce a new class of symmetric polynomials indexed by a pair of dominant weights in $\mathfrak{sl}_{n+1}$ which is expressed as a linear combination of specialized symmetric macdonald polynomials with coefficients defined recursively. these polynomials arose in my own work while investigating the characters of higher level demazure modules. using representation theory, we will see that this new family of polynomials interpolates between characters of level one and level two demazure modules for affine $\mathfrak{sl}_{n+1}$ and give rise to new results in the representation theory of current algebras as a corollary. this is based on joint work with vyjayanthi chari, peri shereen, and jeffrey wand.

in this talk, we will first briefly review the generic chaining method and dudley's inequality. then, we will show the application of chaining methods in random dimensionality reduction. we will mainly consider dimensionality reduction with johnson-lindenstrauss type embeddings, which are random matrix constructions to reduce the dimension while approximately preserving euclidean inter-point distances in the data set. in particular, we will consider ``fast'' and ``sparse'' johnson-lindenstrauss embeddings. finally, we summarize some applications of chaining methods in data streaming algorithms and dictionary learning. the material of this talk is based on some lecture notes by jelani nelson and some research work by sjoerd dirksen, jean bourgain and jelani nelson.

a key question in population biology is understanding the conditions under which the species of an ecosystem persist or go extinct. theoretical and empirical studies have shown that persistence can be facilitated or negated by both biotic interactions and environmental fluctuations. we study the dynamics of n interacting species that live in a stochastic environment. our models are described by $n$ dimensional piecewise deterministic markov processes. these are processes $(x(t), r(t))$ where the vector $x$ denotes the density of the $n$ species and $r(t)$ is a finite state space process which keeps track of the environment. in any fixed environment the process follows the flow given by a system of ordinary differential equations. the randomness comes from the changes or switches in the environment, which happen at random times. we give sharp conditions under which the populations persist as well as conditions under which some populations go extinct exponentially fast. as an example we look at the competitive exclusion principle from ecology and show how the random switching can `rescue' species from extinction.

the complement system plays a major role in the immune system to recognize and clear invading pathogens. although activation of the complement system is tightly controlled, dysregulation leads to a cascade of events that is implicated in autoimmune disorders and infectious diseases. here, to gain a systems-level understanding of the complement system, we developed two comprehensive quantitative models that describe the biochemical reactions of the complement system under a renal disorder known as c3 glomerulopathy (c3g) and bacterial infection by neisseria meningitidis. our c3g model is composed of (odes) 290 ordinary differential equations with 142 kinetic parameters that describe the state of complement system under homeostasis and disease (c3g). furthermore, we introduced therapy states by modeling known inhibitors of the complement system, a compstatin variant (c3 inhibitor) and eculizumab (c5 inhibitor). we then evaluate our system by generating concentration-time profiles of biomarkers such as c3, c3a-desarg, c5, and fc5b-9. our model shows compstatin treatment to have strong restorative effects on early-stage biomarkers such as c3 and c3a-desarg, whereas eculizumab has strong restorative effects on late-stage biomarkers c5 and fc5b-9. these results also implicate the need for patient-tailored therapies that target early stage complement activation under c3g and that treatment may depend on the specific manifestations of a patient's genetic profile in complement regulatory function. after our modeling efforts in c3g, we continued complement modeling for neisseria meningitidis. this pathogen can cause meningococcal disease and studies have shown individuals with deficiencies in the complement system, notably the membrane attack complex (mac), have a 7,000- to 10,000-fold higher risk of developing meningococcal disease. we subsequently developed a quantitative biochemical model to assess dynamics of mac production. bacterial infection by composed of 670 odes with 328 kinetic parameters our model shows highest mac deposition on neisseria meningitidis is mainly dependent on a concentration barrier where immune activators are at least three orders of magnitude higher than regulators. this makes rising levels of immune regulators as early intervention markers for the sporadic meningococcal disease. altogether, our models serve as frameworks to simulate disease-specific scenarios. subsequently, this can lead to early diagnosis, patient-specific treatments, and aid in drug discovery to identify novel inhibitory sites.

change point detection is a popular tool for identifying locations in a data sequence where an abrupt change occurs in the data distribution and has been widely studied for euclidean data. modern data very often is non- euclidean, for example distribution valued data or network data. change point detection is a challenging problem when the underlying data space is a metric space where one does not have basic algebraic operations like addition of the data points and scalar multiplication.
in this talk, i propose a method to infer the presence and location of change points in the distribution of a sequence of independent data taking values in a general metric space. change points are viewed as locations at which the distribution of the data sequence changes abruptly in terms of either its fr\'echet mean or fr\'echet variance or both. the proposed method is based on comparisons of fr\'echet variances before and after putative change point locations. first, i will establish that under the null hypothesis of no change point the limit distribution of the proposed scan function is the square of a standardized brownian bridge. it is well known that such con- vergence is rather slow in moderate to high dimensions. for more accurate results in finite sample applications, i will provide a theoretically justified bootstrap-based scheme for testing the presence of change points. next, i will show that when a change point exists, (1) the proposed test is con- sistent under contiguous alternatives and (2) the estimated location of the change-point is consistent. all of the above results hold for a broad class of metric spaces under mild entropy conditions. examples include the space of univariate probability distributions and the space of graph laplacians for networks. i will illustrate the efficacy of the proposed approach in empirical studies and in real data applications with sequences of maternal fertility distributions. finally, i will talk about some future extensions and other related research directions, for instance, when one has samples of dynamic metric space data. this talk is based on joint work with prof. hans-georg m"uller.

let $x$ be a smooth affine variety over a finite field of characteristic
$p$. the dwork-monsky trace formula is a fundamental tool in
understanding the $l$-functions of $p$-adic representations of
$\pi_1(x)$. we extend this result to the study of representations valued
in a higher-dimensional local ring $r$. the special case
$r=\mathbb{z}_p[[t]]$ arises naturally in the study
of \'etale $\mathbb{z}_p$-towers over $x$. time permitting, we discuss
some spectral-halo type results and conjectures describing the $p$-adic
variation of slopes in certain $\mathbb{z}_p$-towers.

consider a smooth connected closed two-dimensional riemannian manifold
$\sigma$ with positive gauss curvature. if $u$ is a $c^2$ isometric
embedding of $\sigma$, then $u (\sigma)$ is convex. in the fifties nash
and kuiper showed, astonishingly, that this is not necessarily true when
the map is $c^1$. it is expected that the threshold at which isometric
embeddings "change nature" is the $\frac{1}{2}$-hoelder continuity of
their derivatives, a conjecture which shares a striking similarity with
a (recently solved) problem in the theory of fully developed turbulence.

in my talk i will review several plausible reasons for the threshold
and a very recent work, joint with dominik inauen, which indeed shows a
suitably weakened form of the conjecture.

we will define the p-adic numbers and discuss some basic properties,
and in the process try to give the audience a sense of how analysis over
the p-adics compares to (and differs from) analysis over the real or
complex numbers. in particular, we hope to convey why a nice theory of
analytic geometry over the p-adics might be hard to come by, and then
discuss some of the more sophisticated methods created in order to develop
such a theory.

from number theory to knots, hecke algebras have applications within
many areas of mathematics.

in this talk we describe a pictorial calculus for computing convolution
products in affine hecke algebras over fields of characteristic zero.

convolution products of this type have been understood since the work of
iwahori and matsumoto [1965].

however, using results of parkinson, ram and schwer [2006], we can now
draw pictures illustrating the rich combinatorial nature of these products.

we describe this pictorial calculus in the example of
$\mathrm{sl}_3(\mathbb{q}_p)$. its applicability is limited to
characteristic zero.

let $w^{(n)}$ be the $n$-letter word obtained by repeating a fixed word $w$, and let $r_n$ be a random $n$-letter word over the same alphabet. we show several results about the length of the longest common subsequence (lcs) between $w^{(n)}$ and $r_n$; in particular, we show that its expectation is $\gamma_w n-o(\sqrt{n})$ for an efficiently-computable constant $\gamma_w$.\\

this is done by relating the problem to a new interacting particle system, which we dub ``frog dynamics''. in this system, the particles (`frogs') hop over one another in the order given by their labels. stripped of the labeling, the frog dynamics reduces to a variant of the pushasep.\\

in the special case when all symbols of $w$ are distinct, we obtain an explicit formula for the constant $\gamma_w$ and a closed-form expression for the stationary distribution of the associated frog dynamics.\\

froggies on a pond\\
they get scared and hop along\\
scaring others too.\\

their erratic gait\\
gives us tools to calculate\\
lcs of words.\\

(joint work with boris bukh)

the (euclidean) isoperimetric inequality says that any set has larger perimeter than a ball with the same area. the quantitative isoperimetric inequality says that the difference in perimeters is bounded from below by the square of the distance from our set e to the ``closest'' ball of the same area. in this talk, we will discuss an extension of this result to closed riemannian manifolds with analytic metrics. in particular, we show that a similar inequality holds but with the distance raised to a power that depends on the geometry. we also have examples which show that a greater power than two is sometimes necessary and that the analyticity condition is necessary. this is joint work with o. chodosh (stanford) and l. spolaor (ucsd).

grothendieck's inequality guarantees that a certain discrete optimization problem-optimizing a bilinear form
over +1, -1 inputsis equivalent up to a constant, called grothendieck's constant, to a continuous optimization
problem -- optimizing the same bilinear form over unit vectors in a hilbert space. this is important for
convex relaxation, because the former contains np-hard problems such as max-cut, whereas the latter is
a semidefinite program and can be solved in polynomial time. a world apart from convex relaxation is
algebraic computational complexity, where it is well-known that the exponent of matrix multiplication is
exactly the sharp lower bound for the (log of) tensor rank of the strassen matrix multiplication tensor.
we show that grothendieck's constant is the sharp upper bound on a tensor norm of strassen matrix
multiplication tensor. hence these two important quantities from disparate areas of theoretical computer
science strassen's exponent of matrix multiplication and grothendieck's constantare just different measures
of the same underlying tensor. this allows us to rewrite grothendieck's inequality as a norm inequality for
a 3-tensor, which in turn gives a family of natural generalized inequalities. we show that these are locally
sharp and prove that grothendieck's inequality is unique.

a fundamental question in modern cell biology is how cellular and subcellular structures are formed and maintained given their particular molecular components. how are the different shapes, sizes, and functions of cellular organelles determined, and why are specific structures formed at particular locations and stages of the life cycle of a cell? in order to address these questions, it is necessary to consider the theory of self-organizing non-equilibrium systems. we are particularly interested in identifying and analyzing novel mechanisms for pattern formation that go beyond the standard turing mechanism and diffusion-based mechanisms of protein gradient formation. in this talk we present three examples of non-classical biological pattern formation: (i) space-dependent switching diffusivities and cytoplasmic protein gradients in the c. elegans zygote (ii) transport models of cytoneme-based morphogenesis. (iii) hybrid turing mechanism for the homeostatic control of synaptogenesis in c. elegans.

free probability is a subfield of mathematics at the intersection of
operator algebras, complex analysis, probability, and combinatorics. it is
used, among other things, to study the ``$n=\infty$'' case of various $n
\times n$ random matrix models. a concept of central importance in free
probability is \textit{free independence}, the ``noncommutative analogue''
of independence (of random variables) from classical probability. the goal
of this talk is to develop a rigorous understanding of the throw-away
clause in the previous sentence with an interesting mix of analysis and
algebra. time permitting, we may also discuss why classical independence
and free independence are in a precise sense the only ``reasonable''
notions on independence.

khovanov homology is a knot invariant, which generalizes and more specifically categorifies the jones
polynomial of knots. however, in the construction of khovanov homology we seem to make several
choices in the frobenius algebra that we consider. in this talk, we will discuss a distinct alternative to
khovanov homology known as lee theory, in which we make different choices on our frobenius algebra.
these different choices break the q-grading, but allow us to create a filtration, and use this to define a
rasmussen's s-invariant. we will describe several properties and applications of this invariant.

the notion of an elliptic partial differential equation (pde) goes back at least to 1908, when it appeared in a paper j. hadamard. in this talk we present a recently discovered structural condition, called $p$-ellipticity, which generalizes classical ellipticity. it was co-discovered independently by carbonaro and dragicevic on one hand, and pipher and myself on the other, and plays a fundamental role in many seemingly unrelated aspects of the $l^p$ theory of elliptic complex-valued pde. so far, $p$-ellipticity has proven to be the key condition for:

(i) convexity of power functions (bellman functions)
(ii) dimension-free bilinear embeddings,
(iii) $l^p$-contractivity and boundedness of semigroups $(p_t^a)_{t>0}$
associated with elliptic operators,
(iv) holomorphic functional calculus,
(v) multilinear analysis,
(vi) regularity theory of elliptic pde with complex coefficients.

during the talk, i will describe my contribution to this development, in particular to (vi).

given an affine coxeter group w, the corresponding shi arrangement is a refinement of the corresponding coxeter hyperplane arrangements which was introduced by shi to study the kazhdan-lusztig cells for w. shi showed, in particular, that each region of a shi arrangement contains exactly one element in w of minimal length. garside shadows in w were introduced to study the word problem of the corresponding artin-tits (braid) group and turns out to produce automata to study the combinatorics of reduced words in w.

in this talk, we will discuss the following conjecture: the set of minimal length elements of the regions in a shi arrangement is a garside shadow. the talk will be illustrated by the example of the affine symmetric group.

we first talk about gage's area-preserving flow (gapf) for simple, smooth and star-shaped curves. it is shown that gapf drives a centrosymmetric initial curve into a circle as time tends to infinity. then we generalize gapf to deform one convex curve to another. this work gives a partial answer to yau's problem on realizing whitney-graustein theorem via curvature flows.

this talk will be a short review of the construction of the stochastic integral and some basic properties. the purpose is to remind the group of how the integral is defined, the importance of the ito isometry, and the ito formula.

the growth in scope and complexity of modern data sets presents the field of statistics and data science with numerous inferential and computational challenges, among them how to deal with various forms of heterogeneity. latent variable models provide a principled approach to modeling heterogeneous collections of data. however, due to the over-parameterization, it has been observed that parameter estimation and latent structures of these models have non-standard statistical and computational behaviors. in this talk, we provide new insights into these behaviors under mixture models, a building block of latent variable models.

from the statistical viewpoint, we propose a general framework for studying the convergence rates of parameter estimation in mixture models based on wasserstein distance. our study makes explicit the links between model singularities, parameter estimation convergence rates, and the algebraic geometry of the parameter space for mixtures of continuous distributions.

from the computational side, we study the non-asymptotic behavior of the em algorithm under the over-specified settings of mixture models in which the likelihood need not be strongly concave, or, equivalently, the fisher information matrix might be singular. focusing on the simple setting of a two-component mixture fit with equal mixture weights to a multivariate gaussian distribution, we demonstrate that em updates converge to a fixed point at euclidean distance $\mathcal{o}((d/n)^{1/4})$ from the true parameter after $\mathcal{o}((n/d)^{1/2})$ steps where $d$ is the dimension.

from the methodological standpoint, we develop computationally efficient optimization-based methods for the multilevel clustering problem based on wasserstein distance. experimental results with large-scale real-world datasets demonstrate the flexibility and scalability of our approaches. if time allows, we further discuss a novel post-processing procedure, named merge-truncate-merge algorithm, to determine the true number of components in a wide class of latent variable models.

low-rank matrix recovery from structured measurements has been a topic of intense study in the last decade and many important problems such as blind deconvolution and matrix completion have been formulated in this framework. an important benchmark method to solve these problems is to minimize the nuclear norm, a convex proxy for the rank. a common approach to establish recovery guarantees for this convex program relies on the construction of a so-called approximate dual certificate. however, this approach provides only limited insight in various respects. most prominently, the noise bounds exhibit seemingly suboptimal dimension factors. in this talk, we will discuss a more geometric viewpoint to analyze the blind deconvolution scenario. we find that for both these applications the dimension factors in the noise bounds are not an artifact of the proof, but the problems are intrinsically badly conditioned. we show, however, that bad conditioning only arises for very small noise levels: under mild assumptions that include many realistic noise levels we derive near-optimal error estimates for blind deconvolution under adversarial noise. at the end, we will briefly discuss how the results can be extended to the scenario of matrix completion.

in this talk, we will focus on how one can deduce some
geometric invariants of an abelian variety or a k3 surface by
studying their frobenius polynomials. in the case of an abelian variety,
we show how to obtain the decomposition of the endomorphism algebra, the
corresponding dimensions, and centers. similarly, by studying the
variation of the geometric picard rank, we obtain a sufficient criterion
for the existence of infinitely many rational curves on a k3 surface of
even geometric picard rank.

we will discuss stabilization of the betti numbers of the moduli space of
sheaves on surfaces, and in the special case of the projective plane we
will produce lower bounds on the second chern class of the sheaves such
that the betti numbers of their moduli space stabilizes.

can an integer $n$ be represented as a sum of two squares $n=x^2+y^2$? if so, how many different representations are there? we begin with the answers to these classical questions due to fermat and jacobi. we then illustrate hurwitz's class number formula for binary quadratic forms, and put all these classical formulas under the modern perspective of the siegel-weil formula. we explain how the latter perspective led gross-keating to discover a new type of identity between arithmetic intersection numbers on modular surfaces and derivatives of certain eisenstein series. after outlining the influential program of kudla and rapoport for generalization to higher dimensions, we report a recent proof (joint with w. zhang) of the kudla-rapoport conjecture and hint at the usage of the uncertainty principle in the proof.

dear math enthusiast, have you ever been afraid that mathematics
contains nothing of substance? are you afraid of realizing that, maybe,
all the proofs near and dear to you are actually easy corollaries of some
deeper, horrendous technicality with no interesting geometric,
number-theoretic, algebraic, combinatorial, or analytic interpretation?
well, you are in luck! we will be providing the simulation of such an
experience. in this week's food for thought talk, we will present
interesting problems, such as a solution to a version of fermat's last
theorem in a field with large enough characteristic, only to realize that
these problems boil down to dry logical tricks!

in this talk, we will introduce a new bootstrap algorithm for estimating linear combinations of coefficients in high dimensional threshold ridge regression model. in addition, we will also introduce a new definition about prediction and demonstrate how bootstrap calibration algorithm achieves this goal.

cut and project sets are well-studied models of almost-periodic discrete subsets of $r^d$. in 2014 marklof and strombergsson introduced a natural class of random processes which generate cut and project sets in a way which is invariant under the group $asl(d,r)$. using ratner's theorem and the theory of algebraic groups we classify all these measures. using the classification we obtain results analogous to those of siegel, rogers, and schmidt in geometry of numbers: summation formulas and counting points in large sets for typical cut and project sets. joint work with rene ruehr and yotam smilansky.

researchers around the globe are gathering biomedical information at a massive scale. we develop algorithms to compress this data that enable computation on the reduced representation. in this talk, i will discuss how we can leverage the low-dimensional true structure of biological data manifolds in order to build useable compact geometric summaries of this data. i will highlight our latest work on single-cell transcriptomic datasets, that enables an unprecedented scale of data to be effectively pooled from individuals and institutions across nations to enable novel life-saving discoveries.

in this talk, i will show that, given two distinct strictly stable self-expanders (of mean curvature flow) that are asymptotic to the same cone, there is a new self-expander trapped between these two. this is achieved by developing a min-max theory for the relative expander entropy. this is joint with jacob bernstein.

how much time does brownian motion spends at 0? even though it spends lebesgue 0 amount of time there, this is not the end of the story. the local time for brownian motion let us go deeper into this question, creating an object that keeps track of how much time brownian motion spends at 0. once established, we will discuss applications of local time such as tanaka's formula, change of variables formula, engelbert-schimdt 0-1 law and reflected diffusions.

we revisit the tears of wine problem for thin films in water-ethanol mixtures and present a new model for the climbing dynamics. the new formulation includes a marangoni stress balanced by both the normal and tangential components of gravity as well as surface tension which lead to distinctly different behavior. the combined physics can be modeled mathematically by a scalar conservation law with a nonconvex flux and a fourth order regularization due to the bulk surface tension. without the fourth order term, shock solutions must sastify an entropy condition - in which characteristics impinge on the shock from both sides. however, in the case of a nonconvex flux, the fourth order term is a singular perturbation that allows for the possibility of undercompressive shocks in which characteristics travel through the shock. we present computational and experimental evidence that such shocks can happen in the tears of wine problem, with a protocol for how to observe this in a real life setting.

an independent set of size $k$ in a finite undirected graph is a set of $k$ vertices of the graph, no two of which are connected by an edge. the structure of independent sets of size $k$ as $k$ varies is of interest in probability, statistical physics, combinatorics, and computer science. in 1987, alavi, malde, schwenk and erdos conjectured that the number of independent sets of size $k$ in a tree is a unimodal sequence (this number goes up and then it goes down), and this problem is still open. a variation on this question is: do the number of independent sets of size $k$ form a unimodal sequence for erdos-renyi random graphs, or random trees? by adapting an argument of coja-oghlan and efthymiou, we show unimodality for erdos-renyi random graphs, random bipartite graphs and random regular graphs (with high probability as the number of vertices in the graph goes to infinity, when the expected degree of a single vertex is large). the case of random trees remains open, as we can only show weak partial results there.

classically, the transcendence (and even the irrationality) of
odd zeta values is widely conjectured, but yet unproven. however, for
zeta values defined over the rational function field, jing yu succeeded
in proving their transcendence in 1991, and many other transcendence
results (including algebraic independence) followed in the intervening
years. in this work (joint with t. ngo dac), we prove the algebraic
independence of zeta values defined over the function field of an
elliptic curve. the main technique we use is to construct a tannakian
category of t-motives whose associated periods contain these zeta values
- thus we may exploit the existence of a motivic galois group to study
the transcendence degree. we also discuss the difficulties and pathway
to proving algebraic independence for zeta values of function fields of
arbitrary curves.

option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset's future market price. in short, an option has a particular payout that is based on the market price for an asset on a given date in the future. in 1973, black and scholes proposed a valuation model for options that essentially estimates the tail risk of the asset price under the assumption that the price will fluctuate according to geometric brownian motion. more recently, demarzo et al., among others, have proposed more robust valuation schemes, where we can even assume an adversary chooses the price fluctuations. this framework can be considered as a sequential two-player zero-sum game between the investor and nature. we analyze the value of this game in the limit, where the investor can trade at smaller and smaller time intervals. under weak assumptions on the actions of nature (an adversary), we show that the minimax option price asymptotically approaches exactly the black- scholes valuation. the key piece of our analysis is showing that nature's minimax optimal dual strategy converges to geometric brownian motion in the limit.

i will introduce a program, begun by dan-cohen and wewers, to compute
minhyong kim's selmer varieties using mixed tate motives. the idea is as
follows. we care about the galois action on the unipotent fundamental
group of $\mathbf{p}^1 \setminus \{0,1,\infty\}$. this galois action
lives in a certain category of $p$-adic galois representations known as
mixed tate representations. we will see that this category is tannakian
and has a fairly simple description, in terms of its ext groups, which
are just bloch-kato selmer groups. the bloch-kato selmer groups are
$p$-adic vector spaces, but they also have a rational structure coming
from algebraic k-theory. the category of mixed tate motives gives us a
$\mathbb{q}$-linear tannakian category that underlies the
$\mathbb{q}_p$-linear tannakian category of galois representations. this
in turn allows us to define a selmer variety over $\mathbb{q}$ (rather
than $\mathbb{q}_p$), and a more explicit understanding of the category
of mixed tate motives allows us to compute this variety explicitly.

in this talk i'll teach the basics of making a website and how to connect with the ucsd server. if you want to have a working website by the end of the week, it will help to (1) talk to saul about getting your login information for the ucsd math servers, (2) have a text editor to make the website (i like notepad++), and (3) have a way to ssh to the math server (i like winscp). to stall for time i'll also talk about other resources that might be of use to a math phd student. other people are more than welcome to contribute ideas in this direction!

when $x$ is a grassmannian, marian-oprea-pandharipande and toda constructed alternate compactifications of spaces of maps from curves to $x$. the construction has been generalized to a large class of git quotients $x=w//g$ by ciocan-fontanine-kim-maulik and many others. it is called the theory of $\epsilon$-stable quasimaps. in this talk, we will introduce permutation-equivariant k-theoretic epsilon-stable quasimap invariants and prove their wall-crossing formulae for all targets in all genera. the wall-crossing formulae generalize givental's k-theoretic toric mirror theorem in genus zero. in physics literature, these k-theoretic invariants are related to the $3d n = 2$ supersymmetric gauge theories studied by jockers-mayr, and the wall-crossing formulae can be interpreted as relations between invariants in the uv and the ir phases of the $3d$ gauge theory. it is based on joint work with yang zhou.

in this defense i will talk about two lines of research during my phd. i will develop some scan statistics and derive their asymptotic distributions, using moderate deviation, large deviation, kolmogorov's theorem and a poisson approximation. i will briefly mention their applications in global testing and multiple testing, resulting from the work before advancement. next i will talk about another project on causal inference, where the causal effects of etanercept on birth defects are investigated, in the presence of missing outcomes not at random, left truncation, observational nature, and rare events.

i will give a light introduction to the theory of quantum graphs. quantum graphs are non-commutative generalizations of finite graphs that arise naturally in many areas, including the study of zero-error capacities of quantum channels, quantum symmetry groups of graphs, and in the theory of non-local games. i will give an overview of some of these connections and explain some ongoing joint work with kari eifler, christian voigt and moritz weber, where we generalize the well-known graph $c^\ast$-algebra construction to the setting of quantum graphs.

in this talk we will introduce a generalization of babuska-lax-milgram theorem that is particularly well-suited for the study of global existence of solutions to certain parabolic pdes on compact manifolds.

as part of a general theory for the isomorphism problem for actions of amenable groups, ornstein and weiss proved that any two poisson point processes are isomorphic as measure-preserving actions. we give an elementary construction of an isomorphism between poisson point processes that is finitary. this is joint work with terry soo.

the laplacian is a canonical second order elliptic operator defined on any riemannian manifold. the study of upper bounds for its eigenvalues under the volume constraint is a classical problem of spectral geometry going back to j. hersch, p. li and s.-t. yau. the particular interest to this problem stems from a surprising connection to the theory of harmonic maps to spheres. in the present talk we will survey some recent results in the area with an emphasis on the role played by the energy index of harmonic maps. in particular, we will discuss some recent applications, including a min-max proof of the existence of optimisers and an optimal upper bound for laplacian eigenvalues on the projective plane.

in the first part of the talk (based on joint work with l.coburn, j. sj"ostrand, and f. white) we discuss continuity conditions for toeplitz operators acting on spaces of entire functions with quadratic exponential weights (bargmann spaces), in connection with a conjecture by c. berger and l. coburn, relating toeplitz and weyl quantizations. in the second part of the talk (based on joint work in progress with j. sj"ostrand), we discuss elements of a semiglobal approach to analytic second microlocalization with respect to a hypersurface, in the semiclassical case, based on the study of the heat evolution semigroup for large times. we describe properties of the associated exponentially weighted spaces of holomorphic functions with
($h$--dependent) plurisubharmonic exponents and construct asymptotic bergman projections in such spaces.

we show how to express the solution to an ordinary differential
equation as a sum over rooted trees, discover a group structure on the set
of rooted trees, extend it to a hopf algebra related to quantum
renormalization, and finally bring ourselves back down to earth and derive
the coefficients used in runge-kutta integrators.

in his work on modularity theorems, wiles proved a numerical criterion for a map of
rings r $\rightarrow$ t to be an isomorphism of complete intersections. he used this to show
that certain deformation rings and hecke algebras associated to a mod p galois
representation at non-minimal level were isomorphic and complete intersections,
provided the same was true at minimal level. in addition to proving modularity
theorems, this numerical criterion also implies a connection between the order of a
certain selmer group and a special value of an l-function. in this talk i will
consider the case of a hecke algebra acting on the cohomology a shimura curve
associated to a quaternion algebra. in this case, one has an analogous map of ring
r $\rightarrow$ t which is known to be an isomorphism, but in many cases the rings r and t
fail to be complete intersections. this means that wiles' numerical criterion will fail
to hold. i will describe a method for precisely computing the extent to which the
numerical criterion fails (i.e. the ``wiles defect''), which will turn out to be
determined entirely by local information at the primes dividing the discriminant of
the quaternion algebra. this is joint work with gebhard bockle and chandrashekhar
khare.

modeling and tractable computation form two fundamental but competing pillars of data science; indeed, fitting good models to data is often computationally challenging in modern applications. focusing on the canonical tasks of ranking and regression, i introduce problems where this tension is immediately apparent, and present methodological solutions that are both statistically sound and computationally tractable.

i begin by describing a class of ``permutation-based'' models as a flexible alternative to parametric modeling in a host of inference problems including ranking from ordinal data. i introduce procedures that narrow a conjectured statistical-computational gap, demonstrating that carefully chosen non-parametric structure can significantly improve robustness to mis-specification while maintaining interpretability. next, i address a complementary question in the context of convex regression, where i show that the curse of dimensionality inherent to non-parametric modeling can be mitigated via parametric approximation. our provably optimal methodology demonstrates that it is often possible to enhance the interpretability of non-parametric models while maintaining important aspects of their flexibility.

we present one aspect of bergman kernels, which includes the
following topics:
fourier integral operators with complex phase and projections for certain scalar equations,
bergman and szeg"o kernels for strictly pseudoconvex domains,
projections for exponentially weighted spaces and powers of complex line bundles.

oprea and pandharipande studied the virtual euler characteristic of quot schemes on surfaces. based on the calculations in several cases, they conjectured the rationality of the generating series of the virtual invariants. in this talk, i will explain the virtual $\chi_{-y}$-genera of quot schemes, thus refining the work of [op]. the main result expresses the quot scheme invariants universally in terms of seiberg-witten invariants of d"urr, kabanov, and okonek. based on the calculations in several cases and the blow up formula, we resolve the $\chi_{-y}$-genus analogue of the rationality conjecture of [op], for all surfaces with $p_g>0$. in addition, the reduced quot scheme invariants for $k3$ surfaces will be discussed with connections to the kawai-yoshioka formula.

building on previous work of rozansky and willis, we generalise rasmussen's s-invariant to links in connected sums of $s^1 \times s^2$. such an invariant can be computed by approximating the khovanov-lee complex of a link in $\#^r s^1 \times s^2$ with that of appropriate links in $s^3$. we use the approximation result to compute the s-invariant of a family of links in $s^3$ which seems otherwise inaccessible, and use this computation to deduce an adjunction inequality for null-homologous surfaces in a (punctured) connected sum of $\bar{cp^2}$. this inequality has several consequences: first, the s-invariant of a knot in the three-sphere does not increase under the operation of adding a null-homologous full twist. second, the s-invariant cannot be used to distinguish $s^4$ from homotopy 4-spheres obtained by gluck twist on $s^4$. we also prove a connected sum formula for the s-invariant, improving a previous result of beliakova and wehrli. we define two s-invariants for links in $\#^r s^1 \times s^2$. one of them gives a lower bound to the slice genus in $\natural^r s^1 \times b^3$ and the other one to the slice genus in $\natural^r d^2 \times s^2$ . lastly, we give a combinatorial proof of the slice bennequin inequality in $\#^r s^1 \times s^2$.

in this talk, we describe self-generating pointwise lower bounds for solutions of the non-cutoff boltzmann equation, which models the evolution of the particle density of a diffuse gas. these lower bounds imply that vacuum regions in the initial data are filled instantaneously, and also lead to key coercivity estimates for the collision operator. as an application, we can remove the assumptions of mass bounded below and entropy bounded above, from the known criteria for smoothness and continuation of solutions. the proof strategy also applies to the landau equation, and we will compare this (deterministic) proof with our prior (probabilistic) proof of lower bounds for the landau equation. this talk is based on joint work with chris henderson and andrei tarfulea.

complex networks are said to exhibit four key properties: large scale, evolving over time, small world properties, and power law degree distribution. the preferential attachment model (barab\'asi--albert, 1999) and the acl preferential attachment model (aiello, chung, lu, 2001) for random networks, evolve over time and rely on the structure of the graph at the previous time step. further models of complex networks include: the iterated local transitivity model (bonato, hadi, horn, pralat, wang, 2011) and the iterated local anti-transitivity model (bonato, infeld, pokhrel, pralat, 2017). in this talk, we will define and discuss the iterated local model. this is a generalization of the ilt and ilat models, where at each time step edges are added deterministically according to the structure of the graph at the previous time step.

in this talk, we will first introduce several versions of existence and uniqueness theorems for stochastic differential equations(sdes). then we will focus on a special type of sdes, ito diffusions. we will give a detailed proof of the strong markov property of ito diffusions. this talk can be viewed as an extension of math 286 and material is drawn mostly from chapter 10 of chung and williams' $introduction$ $to$ $stochastic$ $integration$.

though promised to solve intractable problems, quantum computers are much noisier than classical computers. to make quantum computers practical, efficient error correction schemes have to be developed. in the first half of the talk, i will first introduce the theory of quantum error correction (qec) and current proposals of using qec to achieve fault-tolerant quantum computing, then i will talk about a new scheme that can greatly lower the cost of qec. in the second half, i will talk about a promising near-term qubit encoding called the gkp qubit that has error-correcting abilities and a protocol to prepare such qubits.

the gaussian multiplicative chaos is a relatively new universal object in probability that has many interesting geometric properties.the characteristic polynomial of many classes of random matrices is, in many cases conjecturally, one class of finite approximation to these random measures. great progress has been made on showing the random matrices from specific ``circular ensembles" converge to the gmc.
likewise, some progress has been made for unitarily-invariant random matrices. we show some new partial progress in showing the ``gaussian-beta ensemble'' has a gmc limit. this we do by using the representation of its characteristic polynomial as an entry in a product of independent random two-by-two matrices. for a point $z$ in the complex plane, at which the transfer matrix is to be evaluated, this product of transfer matrices splits into three independent factors, each of which can be understood as a different dynamical system in the complex plane.
this is joint work with gaultier lambert.

central leaves in the special fiber of shimura varieties are the loci where the isomorphism class of the universal $p$-divisible group remains constant. the hecke orbit conjecture asserts that every prime-to-$p$ hecke orbit in a pel type shimura variety is dense in the central leaf containing it. this conjecture is proved for hilbert modular varieties by c.-f. yu, and for siegel modular varieties by chai and oort. in this talk i give an overview of the conjecture and present my work that generalizes chai and oort's strategy to irreducible components of certain newton strata on shimura varieties of pel type.

a smooth manifold is a topological structure that admits some standard
calculus constructions. a vector bundle over a manifold is a smooth choice
of a vector space at every point of the manifold. one motivation for such
an object is that the differential of a map between two manifolds is a map
between their tangent bundles. at first glance, vector bundles seem as
though they should be cartesian products of the manifold with a vector
space. in general, this is false, and certain ``characteristic classes''
are the explicit obstructions. in this talk, we will construct these
classes and discuss some theorems explaining why they are of interest to
many mathematicians.

quantum computing is receiving increasing attention as
it promises to revolutionize the current computational landscape. the
advent of quantum computers will be particularly disruptive in the
field of cryptography, where characteristically quantum properties
like entanglement and the ``no-cloning theorem'' open up a plethora of
novel opportunities. in this talk, i will describe two broad, and
connected, research questions. the first is: if a quantum device is
meant to perform tasks that are beyond the reach of classical
computers, how can a classical user trust that her quantum device is
behaving as intended? i will focus particularly on the connections of
this question with foundational questions in quantum information. the
second is: once we trust our quantum devices, what kinds of
cryptographic tasks can we realize that are beyond the reach of
classical computers? i will describe some concrete examples.

in my defense, i will talk about three relative topics relative to sparse recovery and representation of signals. i will start with the topic of recovering the low-rank matrix from incomplete measurements with prior information. signal recovery assumes that we know the sensing matrix i.e. the linear transformation. but sometimes, we want the sparse representation of signals without knowing the transformation between the signal and its representation. thus in the second topic, i'll talk about a novel algorithm that allows us to learn the linear transformation as well as the sparse representation and admits the transformation in complexity $o(n\log n)$ for a $n$ dimensional input signal. in the third topic, i'll introduce the usage of representation learning assuming that the transformation is a more complex function. i'll propose a deep neural network structure that can be used in image generation and introduce a specific application about it raised in computer game industry.

quantum computing has notable impacts on computer
science in recent years. while quantum computers are about to achieve
so-called ``quantum supremacy'' (i.e., solving some
classically-intractable computational tasks), it is the right time to
understand the capabilities and limits of quantum computers. in this
talk, i will address the following two questions: 1) what is the power
of near-term quantum computers? 2) what speedup can general quantum
computers achieve for problems in machine learning and data analysis?
we will first see that a general quantum computer is strictly more
powerful than small-depth quantum computers in the presence of
classical computers. then, i will show quantum-inspired classical
algorithms for problems including svm, low-rank linear system,
low-rank sdp, and more. our algorithms running in time polylog(n) are
asymptotically as good as existing quantum ones. this result also
implies that existing quantum machine learning algorithms have not
achieved exponential quantum speedups. finally, i will discuss
polynomial quantum speedups for fundamental problems in data analysis
and their limits under plausible assumptions in complexity theory.

the position states of the harmonic oscillator describe
the location of a particle moving on the real line. similarly, the
phase difference between two superconductors on either side of a
josephson junction takes values in the configuration space of a
particle on a circle. more generally, many physical systems can be
described by a basis of ``position states,'' describing a particle
moving on a more general configuration or state space. most of this
space is usually ignored due to the energy cost required to pin a
particle to a precise ``position''. however, as our control over quantum
systems improves, utilizing more of this higher-energy space harbors
benefits for protecting quantum information and probing quantum
matter. i will discuss quantum applications taking advantage of state
spaces associated with the harmonic oscillator, as well as molecular
rotational and nuclear states.\\

bio: victor v. albert received his bachelor's degree in physics
and mathematics from the university of florida in 2010 and his
ph.d. in physics from yale university in 2017. he is currently a lee
a. dubridge postdoctoral scholar in physics at the california
institute of technology. he pursues an interdisciplinary line of
research in quantum science, including open quantum systems,
error-correction, experimental realizations, and topological band
theory.

this is the first talk in a series on ``sato-tate
distributions''. see https://sites.google.com/view/vantageseminar for a
complete listing.

we will start by giving a brief introduction to representation stability
and combinatorial categories. then we will introduce fulton and
macpherson's ``wonderful compactifications'' of configuration spaces,
and describe how they may be studied through the lens of representation
stability. in particular, we show that under a mild hypothesis we can
approach the representation theory of these spaces using the
combinatorial category $fs^{op}$. we end by discussing an attempt at
showing that these spaces do exhibit representation stability, although
to date the results of this approach have been fairly underwhelming.
this talk can be accessed at https://ucsd.zoom.us/j/309940113 .

entanglement is an essential component of quantum
computation, information, and communication. its applications range
from quantum key distribution and secret sharing to quantum
sensing. these applications drive the increasing need for a quantum
switching network that can supply end-to-end entangled states to
groups of endpoints that request them. to this end, i study a quantum
switch that distributes entanglement to users in a star topology. i
will present models for variants of this system and derive expressions
for switch capacity and the expected number of qubits stored in memory
at the switch.

much of this work focuses on bipartite entanglement switching. for
this case, i will discuss how performance metrics are affected by
decoherence and link heterogeneity. in this talk, i will also discuss
a work wherein we explore a set of switching policies for a switch
that can serve both bipartite and tripartite entangled states. i will
conclude the talk with a discussion of future research directions and
a long-term vision of leveraging tools from performance evaluation to
analyze and help guide the design of future quantum networks.\\

bio: gayane vardoyan is a phd candidate in the college of
information & computer sciences, at the university of massachusetts,
amherst. she is advised by prof. don towsley. she holds a b.s. in
electrical engineering and computer sciences from the university of
california, berkeley. her research interests include the performance
evaluation of classical and quantum communication systems.

she interned at inria, sophia antipolis during the summer of
2017. previously, she worked at the argonne national lab and the
computation institute at the university of chicago. she was a
participant of the rising stars 2019 academic career workshop for
women in eecs.

we shall discuss a classification result of gradient shrinking solitons.

the first demonstration of quantum supremacy in october
2019 was a major achievement of experimental physics. at the same
time, it relied on important developments in theoretical computer
science. in this talk i will describe my recent work laying the
complexity-theoretic foundations for google/ucsb's quantum supremacy
experiment, providing evidence that their device is exponentially
difficult to simulate with a classical computer. this crossroad
between complexity theory and quantum physics also offers new insights
into both disciplines. for example, i will describe how techniques
from quantum complexity theory can be used to settle purely classical
problems.

specifically, i will give a quantum argument which nearly resolves the
approximate degree composition conjecture, generalizing nearly 20
years of prior work. in a different direction, i will show that the
notion of computational pseudorandomness from complexity-based
cryptography has fundamental implications for black hole physics and
the theory of quantum gravity.\\

bio: adam bouland is a postdoctoral researcher in computer science
at the university of california, berkeley. he completed his ph.d. in
computer science at mit in 2017, where he was advised by scott
aaronson. prior to that he completed master's degrees in computer
science and mathematics at the university of cambridge, as well as a
b.s. in computer science/mathematics and physics at yale. his research
focuses on the theory of quantum computation and its connections with
classical complexity theory and physics.

grothendieck's section conjecture predicts that over arithmetically interesting fields (e.g. number fields or p-adic fields), rational points on a smooth projective curve x of genus at least 2 can be detected via the arithmetic of the etale fundamental group of x. we construct infinitely many curves of each genus satisfying the section conjecture in interesting ways, building on work of stix, harari, and szamuely. the main input to our result is an analysis of the degeneration of certain torsion cohomology classes on the moduli space of curves at various boundary components. this is (preliminary) joint work with padmavathi srinivasan, wanlin li, and nick salter.

biharmonic maps are maps between riemannian manifolds which are critical points of the bi-energy. they are solutions of a system of 4thorder pdes and they include harmonic maps and biharmonic functions as special cases. biharmonic submanifolds (which include minimal submanifolds as special cases) are the images of biharmonic isometric immersions. the talk will review some problems, including classification of biharmonic submanifolds in space forms, biharmonic maps into spheres, biharmonic conformal maps, and unique continuation theorems, studied in this field and their progress since 2000. the talk also presents some recent work on equivariant biharmonic maps and the stability and index of biharmonic hypersurfaces in space forms.

for a moduli space $m$ of stable sheaves over a k3 surface $x$, we propose a series of conjectural identities in the chow rings $ch_\ast (m\times x^l)$, $l\geq 1$, generalizing the classic beauville-voisin identity for a k3 surface. we emphasize consequences of the conjecture for the structure of the tautological subring $r_\ast (m)\subset ch_\ast (m)$. we prove the proposed identities when $m$ is the hilbert scheme of points on a k3 surface. this is joint work with l. flapan, a. marian and r. silversmith.

i will illustrate a recent result obtained in collaboration with l. spolaor and b. velichkov concerning the regularity of the free boundaries in the two phase bernoulli problems. the new main point is the analysis of the free boundary close to branch points, where we show that it is given by the union of two $c^1$ graphs. this complete the analysis started by alt caffarelli friedman in the '80s.

the p=w conjecture by de cataldo, hausel, and migliorini suggests a surprising connection between the topology of hitchin systems and hodge theory of character varieties. in this talk, we will focus on interactions between compact and noncompact hyper-kaehler geometries. such connections, together with symmetries coming from the moduli of compact hyper-kaehler manifolds, lead to new progress on the p=w conjecture. i will discuss the results we obtained and the difficulties we met. based on joint work with mark de cataldo and davesh maulik.

recently okounkov proved nekrasovs conjecture expressing the
partition function of k-theoretic dt invariants of the hilbert scheme of
points hilb($\mathbb c^3$, points) on affine 3-space as an explicit
plethystic exponential. we generalise nekrasovs formula to higher rank,
where the quot scheme of finite length quotients of the trivial rank $r$
bundle replaces hilb($\mathbb c^3$,points). this proves a conjecture of
awata-kanno. specialising to cohomological invariants, we obtain the
statement of szabos conjecture. we discuss some further applications if
time permits. this is joint work with nadir fasola and sergej monavari.

the iwasawa theory of selmer groups provides a natural way for p-adic approach to the celebrated birch and swinnerton dyer conjecture. over a non-commutative p-adic lie extension, the (dual) selmer group becomes a module over a non-commutative iwasawa algebra and its structure can be understood by analyzing ``(left) reflexive ideals'' in the iwasawa algebra. in this talk, we will start by recalling several existing conjectures in iwasawa theory and then we will give an explicit ring-theoretic presentation, by generators and relations, of such iwasawa algebras and sketch its implications in understanding the (two-sides) reflexive ideals. generalizing clozel's work for $sl(2)$, we will also show that such an explicit presentation of iwasawa algebras can be obtained for a much wider class of p-adic lie groups viz. uniform pro-p groups and the pro-p iwahori of $gl(n,z_p)$. further, if time permits, i will also sketch some of my recent iwasawa theoretic results joint with sujatha ramdorai.

using ideas from geometric group theory we provide a novel approach to green's conjecture on syzygies of canonical curves. via a strong vanishing result for koszul modules we deduce that a general canonical curve of genus $g$ satisfies green's conjecture when the characteristic is zero or at least $(g+2)/2$. our results are new in positive characteristic (and answer positively a conjecture of eisenbud and schreyer), whereas in characteristic zero they provide a different proof for theorems first obtained in two landmark papers by voisin. joint work with aprodu, papadima, raicu and weyman.

yang-mills flow is one of the classical geometric evolution equations, having much in common both with harmonic map flow and with ricci flow. i will describe its key properties, focusing on the refined energy identities that have led to new results about the flow in dimension four and on special-holonomy manifolds.

the integral geometric satake equivalence in mixed characteristic
abstract: the geometric satake equivalence establishes a link between
two monoidal categories: the category of perverse sheaves on the local
hecke stack and the category of finitely generated representations of
the langlands dual group. it has many important applications in the
study of the geometric langlands program and number theory. in this
talk, i will discuss the integral coefficient geometric satake
equivalence in the mixed characteristic setting. it generalizes the
previous results of lusztig, ginzburg, mirkovic-vilonen, and zhu. time
permitting, i will discuss an application of this result in constructing
a jacquet-langlands transfer.

on a complete riemannian manifold with ricci curvature bounded below, yau proved a sharp gradient estimate for positive harmonic functions. one comparison space is the hyperbolic space (but it is not unique). this talk will report on the corresponding question for complete noncompact kaehler manifolds.

stillman's conjecture asserts the existence of a uniform bound
on the projective dimension of an ideal in a polynomial ring generated
by a fixed number of polynomials of fixed degrees. ananyan and hochster
gave a proof of stillman's conjecture by proving the existence of ``small
subalgebras''. i'll describe a simplification of their approach using
ultraproducts (and in particular, explain what ultraproducts are and all
of the terms mentioned above). this is based on joint work with daniel
erman and andrew snowden.

given a semiabelian variety over a number field and a closed
subvariety thereof, it is a theorem (of various people) that the torsion
points on the subvariety have zariski closure equal to some finite union
of torsion cosets of semiabelian subvarieties. we will focus on this
question for (split) tori, where it manifests as the more concrete
problem of finding solutions to a system of polynomial equations valued
in roots of unity. we compare two effective methods for solving this
problem: a combinatorial approach introduced by conway-jones, and a
commutative algebra approach introduced by beukers-smyth.

hironaka's theorem states that every algebraic variety over a field of characteristic zero admits a resolution, however the algorithm to do so is very complex. it was conjectured by nash that repeated nash blowups (which replace each singular point by limiting positions of tangent spaces at nonsingular points) might provide a simple way to resolve. i plan to investigate the case of toric varieties.

in his landmark paper ``modular forms and the eisenstein
ideal,'' mazur studied congruences modulo a prime p between the hecke
eigenvalues of an eisenstein series and the hecke eigenvalues of cusp
forms, assuming these modular forms have weight 2 and prime level n. he
asked about generalizations to squarefree levels n. i will present some
work on such generalizations, which is joint with preston wake and
catherine hsu.

in the 1980s, richard hamilton invented the ricci flow and initiated the geometric-analytic approach towards the poincar\'e conjecture, which was eventually solved by grisha perelman. in this talk, we will briefly discuss the formation of singularities in the ricci flow and the relations with ricci solitons. we will introduce some recent advances and main conjectures in ricci solitons, especially in steady gradient ricci solitons. we end the talk by discussing some recent results (joint work with professor chow and yuxing deng) about asymptotic behaviors and a rigidity theorem of steady solitons.

a calabi-yau manifold is a ricci-flat kahler manifold. it is a longstanding question to understand how the ricci-flat metrics develop singularities when the complex structure degenerates. an especially intriguing phenomenon is that these metrics can collapse to lower dimensions and exhibit very non-algebraic features, and it is challenging to describe the corresponding geometric behavior. in this talk i will discuss an answer to this question for a special class of degenerations. based on joint works with h. hein-j. viaclovsky-r. zhang 2018 and with r. zhang 2019.

in this talk we will describe some recent works on drinfeld modular forms with values in tate algebras (in `equal positive characteristic'). in particular, we will discuss some remarkable identities (proved or conjectural) for eisenstein and poincar\'e series, and the problem of analytically interpolate families of drinfeld modular forms for congruence subgroups at the infinity place.

over the complex numbers, a famous theorem of siu states that the plurigenera $p_m$ of projective manifolds are invariant under deformations. we give examples of families of elliptic surfaces over a dvr of positive or mixed characteristic such that $p_m$ fails to be constant for all sufficiently divisible $m\geq 0$. time permitting, we will show that (asymptotic) invariance of plurigenera holds for families of quasi-elliptic surfaces.

with the motivation of generalizing the corresponding
geometrization of tamagawa-iwasawa theory after kedlaya-pottharst, and
with motivation of establishing the corresponding equivariant version of
the relative p-adic hodge theory after kedlaya-liu aiming at the
deformation of representations of profinite fundamental groups and the
family of \'etale local systems, we initiate the corresponding
hodge-iwasawa theory with deep point of view and philosophy in mind from
early work of kato and fukaya-kato. in this talk, we are going to
discuss some foundational results on the hodge-iwasawa modules and
hodge-iwasawa sheaves, as well as some interesting investigation towards
the goal in our mind, which are taken from our first paper in this
series project.

this talk will be about refined curve counting on local $p^2$, the noncompact calabi-yau 3-fold total space of the canonical line bundle of the projective plane. i will explain how to construct quasimodular forms starting from betti numbers of moduli spaces of one-dimensional coherent sheaves on $p^2$. this gives a proof of some stringy predictions about the refined topological string theory of local $p^2$ in the nekrasov-shatashvili limit. this work is in part joint with honglu fan, shuai guo, and longting wu.

we show that certain singularities do not arise as blow-ups of mean curvature flow starting at a generic hypersurface. this is joint work with kyeongsu choi, christos mantoulidis, and felix schulze.

in 1998, p. biane and r. speicher developed a theory of stochastic integration against free additive self-adjoint brownian motion, the large-$n$ limit of $n \times n$ hermitian brownian motion. this development included a kind of it\={o} formula for certain functions of free it\={o} processes. in this talk, we discuss -- for motivation -- the finite-$n$ version of this it\={o} formula and use objects called \textit{double operator integrals} to give a new analytic interpretation of the quantities therein, which to date have been understood and interpreted mostly in combinatorial ways. this analytic interpretation yields an extension, which we shall also discuss, of biane and speicher's original formula.

langlands's functoriality conjectures predict the existence of
``liftings'' of automorphic representations along morphisms of l-groups. a
basic case of interest comes from the irreducible algebraic
representations of gl(2), thought of as the l-group of the reductive
group gl(2) over q. i will discuss the proof, joint with james newton,
of the existence of the corresponding functorial liftings for a broad
class of holomorphic modular forms, including ramanujan's delta function.

how many smooth structures are there on a sphere? for dimensions at least 5, kervaire--milnor solved this problem in terms of another problem in algebraic topology: the computations of stable homotopy groups of spheres. in this talk, i will discuss recent progress on this problem in algebraic topology and its applications on smooth structures, which includes the following result with guozhen wang, building up on moise, kervaire--milnor, browder, hill--hopkins--ravenel: among all odd dimensions, the n-sphere has a unique smooth structure if and only if n = 1, 3, 5, 61. i will also discuss some recent progress towards the kervaire invariant problem in dimension 126.

in applications to number theory, it is often desirable to
find effective dynamical results. we want to provide effective
information about averages of orbits of the horospherical subgroup
acting on a hyperbolic manifold of infinite volume. we will start by
presenting the setting and results for manifolds with finite volume.
then, we will discuss the difficulties that arise when studying the
infinite volume setting, and the measures that play a crucial role in
it. this is joint work with jacqueline warren.

based on the lagarias-odlyzko effectivization of the
chebotarev density theorem, kumar murty gave aneffective version of the
sato-tate conjecture for an elliptic curve conditional on the analytic
continuationand the riemann hypothesis for all the symmetric power
l-functions. using similar techniques, kedlaya and i obtained a
similar conditional effectivization of the generalized sato-tate
conjecture for an arbitrary motive. as an application, we obtained a
conditional upper bound of the form $o((\log n)^2(\log \log n)^2)$ for
the smallest prime at which two given rational elliptic curves with
conductor at most $n$ have frobenius traces of opposite sign. in this
talk, i will discuss how to improve this bound to the best possible in
terms of nand under slightly weaker assumptions. our new approach
extends to abelian varieties. this is joint work with kiran kedlaya and
francesc fit\'e.

circle packings in which all circles have integer curvature,
particularly apollonian circle packings, have in the last decade become
objects of great interest in number theory. in this talk, we explore
some of their most fascinating arithmetic features, from local to global
properties to prime components in the packings, going from theorems, to
widely believed conjectures, to wild guesses as to what might be true.

deligne's weight-monodromy conjecture gives control over the zeros of local factors of l-functions of varieties at places of bad reduction. his proof in characteristic p was a step in his proof of the generalized weil conjectures. scholze developed the theory of perfectoid spaces to transfer deligne's proof to characteristic 0, proving the conjecture for complete intersections in toric varieties. building on scholze's techniques, we prove the weight-monodromy conjecture for complete intersections in abelian varieties.

fix a smooth projective variety in projective space and project it to a linear subspace of the same dimension. the ramification divisor of this projection is classically known as the ``apparent boundary''. how does the apparent boundary move when we move the center of projection? i will discuss the geometry arising from this natural question. i will explain why the situation is most interesting for varieties of minimal degree, and how it is related to limit linear series for vector bundles.

a complete kahler metric $g$ on a kahler manifold $m$ is a ``steady gradient kahler-ricci soliton'' if there exists a smooth real-valued function $f:m \rightarrow r$ with $\nabla^{g}f$ holomorphic such that $ric(g)=hess(f)$. i will present a theorem of existence and uniqueness for such metrics. this is joint work with alix deruelle (sorbonne).

when studying the cohomology of shimura varieties and arithmetic manifolds, one encounters the following phenomenon: the same hecke eigensystem shows up in multiple degrees around the middle dimension, and its multiplicities in these degrees resembles that of an exterior algebra.\\

in a series of recent papers, venkatesh and his collaborators provide an explanation: they construct graded objects having a graded action on the cohomology, and show that under good circumstances this action factors through that of an explicit exterior algebra, which in turn acts faithfully and generate the entire hecke eigenspace.\\

in this talk, we discuss joint work with khare where we investigate the p=p situation (as opposed to the l $\neq$ p situation, which is the main object of study of venkatesh's derived hecke algebra paper): we construct a degree-raising action on the cohomology of the ordinary hida tower and show that (under some technical assumptions), this action generates the full hecke eigenspace under its lowest nonzero degree. then, we bring galois representations into the picture, and show that the derived hecke action constructed before is in fact related to the action of a certain dual selmer group.

a classical conjecture of shafarevich, solved by parshin and arakelov, predicts that any smooth projective family of high genus curves over the complex line minus a point or an elliptic curve is isotrivial (has zero variation in its algebraic structure). a natural question then arises as to what other families of manifolds and base spaces might behave in a similar way. kebekus and kov\'acs conjecture that families of manifolds with good minimal models form the most natural category where shafarevich-type conjecturesshould hold. for example, analogous to the original setting of shafarevich conjecture, they expect that over a base space of kodaira dimension zero such families are always (birationally) isotrivial. in this talk i will discuss a solution to kebekus-kov\'acs conjecture.

in this talk we discuss a classification of ribbon categories with the tensor product rules of the finite-dimensional complex representations of $so(n)$, for $n \geq 5$ and $n=3$. the equivalence class of a category with $so(n)$ fusion rules depends only on the eigenvalues of the braid operator on $x \otimes x$, where $x$ corresponds to the defining representation. the classification applies both to generic $so(n)$ tensor product rules, and to certain fusion rings having only finitely many simple objects.

in recent years, k-stability of fano varieties has been proved to be a rich topic for higher dimensional geometers. the transition of knowledge is mutual. in one direction, we use the powerful machinery from higher dimensional geometry, especially the minimal model program, to have a better understanding of various concepts in k-stability. on the other direction, k-stability provides the right subclass to construct moduli spaces of fano varieties, which had been once considered beyond reach by algebraic geometers. in the first half hour, i will explain how people change their viewpoint on the definition of k-stability. then in the main talk, i will focus on the moduli of fano varieties.

i will outline the proof of the classification of two-dimensional shrinking gradient kahler-ricci solitons with scalar curvature tending to zero at infinity. this is joint work with alix deruelle and song sun.

//www.ladysinger.com/\~{}benchow/cc-seminar.html.

//www.ladysinger.com/\~{}benchow/cc-seminar.html

\textbf{august 18-21}\\
\\
\textbf{organizers}\\
shiferaw berhanu (temple university)\\
ming xiao (university of california, san diego)\\
\\
\textbf{speakers}\\
paulo cordaro (universidade de sao paulo)\\
jean-pierre demailly (universit\'e grenoble alpes)\\
tien-cuong dinh (national university of singapore)\\
peter ebenfelt (university of california, san diego)\\
john erik fornaess (norwegian university of science and technology)\\
xianghong gong (university of wisconsin-madison)\\
xiaojun huang (rutgers university-new brunswick)\\
bernhard lamel (texas a&m university at qatar)\\
min ru (university of houston)\\
berit stensones (norwegian university of science and technology)\\
laurent stolovitch (university of nice sophia antipolis)\\
emil straube (texas a&m university)\\
andrew zimmer (university of wisconsin-madison)\\

dropout and its extensions (e.g. dropblock and dropconnect) are popular heuristics for training neural networks, which have been shown to improve generalization performance in practice. however, a theoretical understanding of their optimization and regularization
properties remains elusive. this talk will present a theoretical analysis of several dropout-like regularization strategies, all of which can be understood as stochastic gradient descent methods for minimizing a certain regularized loss. in the case of single
hidden-layer linear networks, we will show that dropout and dropblock induce nuclear norm and spectral k-support norm regularization, respectively, which promote solutions that are low-rank and balanced (i.e. have factors with equal norm). we will also show
that the global minimizer for dropout and dropblock can be computed in closed form, and that dropconnect is equivalent to dropout. we will then show that some of these results can be extended to a general class of dropout-strategies, and, with some assumptions,
to deep non-linear networks when dropout is applied to the last layer.

in addition to frequent single-nucleotide mutations, mammalian and many
other genomes undergo rare and dramatic changes called genome
rearrangements. these include inversions, fissions, fusions, and
translocations. although analysis of genome rearrangements was pioneered
by dobzhansky and sturtevant in 1938, we still know very little about the
rearrangement events that produced the existing varieties of genomic
architectures. recovery of mammalian rearrangement history is a difficult
combinatorial problem that i will cover in this talk. our data sets have
included sequenced genomes (human, mouse, rat, and others), as well as
radiation hybrid maps of additional mammals.

we present a new compactness theory of ricci flows. this theory states that any sequence of ricci flows that is pointed in an appropriate sense, subsequentially converges to a synthetic flow. under a natural non-collapsing condition, this limiting flow is smooth on the complement of a singular set of parabolic codimension at least 4. we furthermore obtain a stratification of the singular set with optimal dimensional bounds depending on the symmetries of the tangent flows. our methods also imply the corresponding quantitative stratification result and the expected $l^p$-curvature bounds.
\\
\\
as an application we obtain a description of the singularity formation at the first singular time and a long-time characterization of immortal flows, which generalizes the thick-thin decomposition in dimension 3. we also obtain a backwards pseudolocality theorem and discuss several other applications.
\\
\\
the schedule of the lecture series will be approximately as follows:
\\
1. heat kernel and entropy estimates on ricci flow backgrounds and related geometric bounds.
\\
2. continuation of lecture 1 + synthetic definition of ricci flows (metric flows) and basic properties
\\
3. convergence and compactness theory of metric flows
\\
4. partial regularity of limits of ricci flows

in this talk i'll introduce the zoom for thought seminar and then
teach the basics of making a website and how to connect with the ucsd
server. if you want to have a working website by the end of the week, it
will help to (1) talk to saul about getting your login information for the
ucsd math servers, (2) have a text editor to make the website (i like
notepad++), and (3) have a way to ssh to the math server (i like winscp).
to stall for time i'll also talk about other resources that might be of
use to a math phd student. other people are more than welcome to
contribute ideas in this direction.

given an $r$-uniform hypergraph $h$ and an $r$-uniform hypergraph $f$, define the relative tur\'an number $ex(h,f)$ to be the maximum number of edges in an $f$-free subgraph of $h$. in this talk we discuss bounds for $ex(h,f)$ when $f$ is a loose cycle, berge cycle, and a complete $r$-partite $r$-graph when the host $h$ is either arbitrary or when it is the random hypergraph $h_{n,p}^r$.
\\
\\
this is joint work with jiaxi nie and jacques verstraete.

we present a new compactness theory of ricci flows. this theory states that any sequence of ricci flows that is pointed in an appropriate sense, subsequentially converges to a synthetic flow. under a natural non-collapsing condition, this limiting flow is smooth on the complement of a singular set of parabolic codimension at least 4. we furthermore obtain a stratification of the singular set with optimal dimensional bounds depending on the symmetries of the tangent flows. our methods also imply the corresponding quantitative stratification result and the expected $l^p$-curvature bounds.
\\
\\
as an application we obtain a description of the singularity formation at the first singular time and a long-time characterization of immortal flows, which generalizes the thick-thin decomposition in dimension 3. we also obtain a backwards pseudolocality theorem and discuss several other applications.
\\
\\
the schedule of the lecture series will be approximately as follows:
\\
1. heat kernel and entropy estimates on ricci flow backgrounds and related geometric bounds.
\\
2. continuation of lecture 1 + synthetic definition of ricci flows (metric flows) and basic properties
\\
3. convergence and compactness theory of metric flows
\\
4. partial regularity of limits of ricci flows

brakke flow is a measure-theoretic generalization of the mean curvature flow which exploits the flexibility of geometric measure theory in order to describe the evolution by (generalized) mean curvature of surfaces exhibiting singularities, such as, for instance, a planar network with multiple junctions. in the first part of this talk, i will discuss the proof of the following result: given any $n$-dimensional rectifiable subset $\gamma_0$ of a strictly convex bounded domain $u \subset \mathbb{r}^{n+1}$ such that $u \setminus \gamma_0$ is not connected, there exists a brakke flow of surfaces (possibly weighted with integer multiplicities) starting from $\gamma_0$ and with the additional property that their boundary coincides with $\partial \gamma_0$ at all times. furthermore, the flow subconverges, as $t \to \infty$ and in the sense of varifolds, to a (generalized) minimal surface in $u$ with the prescribed boundary $\partial \gamma_0$, thus providing a dynamical solution to plateau's problem. in the second part, i will discuss recent developments concerning the relationship between the singularities of a stationary initial surface $\gamma_0$ and the (non) uniqueness of the flow. this investigation leads to the definition of a class of \emph{dynamically stable} stationary varifolds, which seems worthy of further study. based on joint works with yoshihiro tonegawa (tokyo institute of technology).

in this talk i will discuss the optimal transport problem with ``storage fees.'' this is a variant of the semi-discrete optimal transport (a.k.a. monge-kantorovich) problem, where instead of transporting an absolutely continuous measure to a fixed discrete
measure and minimizing the transport cost, one must choose the weights of the target measure, and minimize the sum of the transport cost and some given ``storage fee function'' of the target weights. this problem arises in queue penalization and semi-supervised
data clustering. i will discuss some basic theoretical questions, such as existence, uniqueness, a dual problem, and characterization of solutions. then, i will present a numerical algorithm which has global linear and local superlinear convergence for a subcase
of storage fee functions.
\\
\\
all work in this talk is joint with m. bansil (ucla).

abstract: consider an $n\times n$ deterministic matrix $a$ and a random matrix $m$ with independent standard gaussian entries. in this talk i will discuss recent results that state that, if $||a||\leq 1$, for any $\delta \textgreater 0$, with high probability $a+\delta m$ has eigenvector condition number of order poly$(n/\delta)$ and eigenvalue gaps of order poly$(\delta/n)$, which implies that the randomly perturbed matrix has a stable spectrum. this has useful applications to numerical analysis and was used to obtain the fastest known provable algorithm for diagonalizing an arbitrary matrix.

this is joint work with jess banks, archit kulkarni and nikhil srivastava.

the exceptional group $e_{7,3}$ has a symmetric space with
hermitian tube structure. on it, henry kim wrote down low weight
holomorphic modular forms that are ``singular'' in the sense that their
fourier expansion has many terms equal to zero. the symmetric space
associated to the exceptional group $e_{8,4}$ does not have a hermitian
structure, but it has what might be the next best thing: a quaternionic
structure and associated ``modular forms''. i will explain the
construction of singular modular forms on $e_{8,4}$, and the proof that
these special modular forms have rational fourier expansions, in a
precise sense. this builds off of work of wee teck gan and uses key
input from gordan savin.

how does one measure area? as an example, how can one determine
the area of a region on a map for the purpose of real estate appraisal?
wouldn't it be great if there were an instrument that would measure the
area of a region by simply tracing its boundary? it turns out that there
is such an instrument: it is called a planimeter. in this talk we will
discuss a particular type of planimeter called the compensating polar
planimeter. there will be a little bit of history and some analysis
involving line integrals and green's theorem. finally, there will be a
chance to (virtually) see actual examples of these fascinating instruments
from the speaker's collection.

we present a new compactness theory of ricci flows. this theory states that any sequence of ricci flows that is pointed in an appropriate sense, subsequentially converges to a synthetic flow. under a natural non-collapsing condition, this limiting flow is smooth on the complement of a singular set of parabolic codimension at least 4. we furthermore obtain a stratification of the singular set with optimal dimensional bounds depending on the symmetries of the tangent flows. our methods also imply the corresponding quantitative stratification result and the expected $l^p$-curvature bounds.
\\
\\
as an application we obtain a description of the singularity formation at the first singular time and a long-time characterization of immortal flows, which generalizes the thick-thin decomposition in dimension 3. we also obtain a backwards pseudolocality theorem and discuss several other applications.
\\
\\
the schedule of the lecture series will be approximately as follows:
1. heat kernel and entropy estimates on ricci flow backgrounds and related geometric bounds.
2. continuation of lecture 1 + synthetic definition of ricci flows (metric flows) and basic properties
3. convergence and compactness theory of metric flows
4. partial regularity of limits of ricci flows

polynomial optimization is a class of optimization programs whose objective and constraining functions are polynomials. the core task in polynomial optimization is to compute global optimizers when the optimization is nonconvex. tensor computation is about optimization and decompositions of tensors, such as tensor norms, tensor eigenvalues and tensor decompositions. all these problems are connected to each other by the theory nonnegative polynomials and moment problems. this talk will give an introduction about classical backgrounds, currently existing results and remaining challenges for the research of these topics.

the minimal genus problem is a fundamental question in smooth 4-manifold topology. every 2-dimensional homology class can be represented by a surface. but how small can this surface be? a generation ago, techniques from gauge theory were used to solve this in a large class of 4-manifolds with extra geometric structure, namely symplectic 4-manifolds. recent work on trisections if 4-manifolds has revealed a deep connection with symplectic geometry and gives a new perspective on this result.

if $\operatorname{m}_n(\mathbb{c})$ is the set of $n \times n$ complex
matrices and $a \in \operatorname{m}_n(\mathbb{c})$, then we write
$\sigma(a) \subseteq \mathbb{c}$ for the set of eigenvalues of $a$. if $a$
is diagonalizable and $f \colon \sigma(a) \to \mathbb{c}$ is any function,
then one can define $f(a) \in \operatorname{m}_n(\mathbb{c})$ in a
reasonable way. now, let
$\operatorname{m}_n(\mathbb{c})_{\operatorname{sa}}$ be the set of $n
\times n$ hermitian matrices, which are unitarily diagonalizable and have
real eigenvalues. if $f \colon \mathbb{r} \to \mathbb{c}$ is a continuous
function, then one can fairly easily show that the map $\tilde{f} \colon
\operatorname{m}_n(\mathbb{c})_{\operatorname{sa}} \to
\operatorname{m}_n(\mathbb{c})$ defined by $a \mapsto f(a)$ is also
continuous. in this talk, we shall discuss the less elementary fact that
if $f$ is $k$-times continuously differentiable, then so is $\tilde{f}$.
time permitting, we shall also discuss the much more complicated
infinite-dimensional case -- where instead of matrices, one considers
linear operators on a hilbert space -- which is still an active area of
research.

this is an example-based introduction to the characteristic zero representation theory of p-adic gl(n). highlights include reeder's construction of the ``simple supercuspidal representations'', the proof that these are irreducible, and a discussion of their langlands parameters. we assume a few basic definitions from representation theory and p-adic arithmetic.

we present a new compactness theory of ricci flows. this theory states that any sequence of ricci flows that is pointed in an appropriate sense, subsequentially converges to a synthetic flow. under a natural non-collapsing condition, this limiting flow is smooth on the complement of a singular set of parabolic codimension at least 4. we furthermore obtain a stratification of the singular set with optimal dimensional bounds depending on the symmetries of the tangent flows. our methods also imply the corresponding quantitative stratification result and the expected $l^p$-curvature bounds.
\\
\\
as an application we obtain a description of the singularity formation at the first singular time and a long-time characterization of immortal flows, which generalizes the thick-thin decomposition in dimension 3. we also obtain a backwards pseudolocality theorem and discuss several other applications.
\\
\\
the schedule of the lecture series will be approximately as follows:
1. heat kernel and entropy estimates on ricci flow backgrounds and related geometric bounds.
2. continuation of lecture 1 + synthetic definition of ricci flows (metric flows) and basic properties
3. convergence and compactness theory of metric flows
4. partial regularity of limits of ricci flows

the theory of rcd spaces has seen a huge development in the last teen years. they are metric measure structures satisfying a synthetic notion of ricci bounded below. this class includes several spaces with boundary, such as gromov-hausdorff limits of manifolds with convex boundary and ricci bounded below in the interior. in this talk we will present new stability and regularity results for boundaries of rcd spaces. we will focus mostly on a new epsilon-regularity theorem which is new even in the setting of smooth riemannian manifolds. it is based on a work in progress joint with aaron naber and daniele semola.

convolutional neural networks are highly successful tools for image recovery and restoration. a major contributing factor to this success is that convolutional networks impose
strong prior assumptions about natural images - so strong that they enable image recovery without any training data. a surprising observation that highlights those prior assumptions is that one can remove noise from a corrupted natural image by simply fitting
(via gradient descent) a randomly initialized, over-parameterized convolutional generator to the noisy image.
\\
\\
in this talk, we discuss a simple un-trained convolutional network, called the deep decoder, that provably enables image denoising and regularization of inverse problems such as compressive sensing with excellent performance. we formally characterize the dynamics
of fitting this convolutional network to a noisy signal and to an under-sampled signal, and show that in both cases early-stopped gradient descent provably recovers the clean signal.
\\
\\
finally, we discuss our own numerical results and numerical results from another group demonstrating that un-trained convolutional networks enable magnetic resonance imaging from highly under-sampled measurements, achieving results surprisingly close to trained
networks, and outperforming classical untrained methods.

i will present a vast generalization of taelman's 2012
celebrated class-number formula for drinfeld modules to the setting of
(rigid analytic) l-functions of drinfeld module motives with galois
equivariant coefficients. i will discuss applications and potential
extensions of this formula to the category of t-modules and t-motives.
this is based on joint work with ferrara, green and higgins, and a
result of meetings in the ucsd drinfeld module seminar.

recently, marian-oprea-pandharipande proved lehn's conjecture for
segre numbers associated to hilbert schemes of points on surfaces.
they also provided a conjectural correspondence between segre and
verlinde numbers. for surfaces with holomorphic 2-form, we propose
conjectural generalizations of their results to moduli spaces of
stable sheaves of any rank. we provide several verifications by using
mochizuki's formula. joint work with gottsche.

percy macmahon introduced the ``major index'' of a permutation a century
ago and proved that it has the same distribution as the ``inversion
number''. such statistics are now called ``mahonian''. baxter and
zeilberger considered the joint distribution of inversions and the major
index on permutations and showed they are jointly independently
asymptotically normally distributed. however, baxter-zeilberger's argument
has no hope of giving a more precise ``local limit theorem'' and
zeilberger subsequently offered a \$300 reward for a different proof. this
is the story of that reward.

in these two lectures we plan to survey some known results about complete noncompact shrinking ricci solitons in dimension four. the main goal is to understand the geometry at infinity of these manifolds, and for that we address the following basic questions:
*estimate the number of ends of 4d shrinkers.
*understand the asymptotic geometry along each end.
*uniqueness results.
*open problems/conjectures.

holonomy vectors of translation surfaces provide a geometric generalization for higher genus surfaces of (primitive) integer lattice points. the counting and distribution properties of holonomy vectors on translation surfaces have been studied extensively. a natural question to ask is: how random are the holonomy vectors of a translation surface? we motivate the gap distribution of slopes of holonomy vectors as a measure of randomness and compute the gap distribution for the class of translation surfaces given by gluing two identical tori along a slit. no prior background on translation surfaces or gap distributions will be assumed.

this talk concerns a classical problem in computational wave propagations: how does one truncate an infinite domain to a finite size without introducing reflection waves from the artificial boundaries? the state-of-the-art approach is attaching to those boundaries a perfectly matched layer (pml). in the continuous theory, pmls are subject to an analytically continued wave equation that damps all incident waves without creating any interfacial reflection. however, it is believed that ``numerical reflections'' are unavoidable after discretization. in this talk, i will demonstrate a truly reflectionless discrete pml. the key is to uncover the geometric mechanism hidden in the differential calculus formalism; in discretizing the theory, approximations are the best one can hope for the latter, while the former often admits exact discretization.

i will talk about why some classical theorems (e.g. waldhausen, laudenbach-poenaru) can be modified to hold for non-orientable 3- and 4-manifolds. as a consequence, we can draw kirby diagrams and trisection diagrams and conclude the usual main trisection theorems for non-orientable 4-manifolds. this is joint work with patrick naylor (university of waterloo).

dear zft attendee, has your research ever come down to proving a polynomial inequality? if so, would you want to use boring old analysis to come up with a five line proof? or would you rather spend two days creating an algorithm to find the exact factorization of the polynomial? the latter is the obvious choice. come on over to zft this week and see how clarkson's inequality can be proved in a special case by using linear recursion and binomial coefficients! i guarantee that you will think of the polynomial $y^2-2y+1$ differently for the rest of your life!

roth famously used fourier analysis to upper bound the size of a set of integers without 3-term arithmetic progressions. one might hope that similar techniques can be used for 4 or more term progressions, and some simple examples demonstrate otherwise. however, gowers (2001) introduced a ``higher order'' fourier analysis which generalizes roth's proof to longer arithmetic progressions. in this talk, we will give a combinatorial sketch of the methods of higher order fourier analysis culminating in the key problem of the field, the inverse conjecture for the gowers norms.

an expander graph is a type of graph that is sparse yet highly-connected. they have found uses in many subjects including computer science, topology, algebra, number theory and algebraic geometry. we will talk about the basics of expander graphs and how they can be used to give quantitative versions of algebraic statements regarding interesting groups

ricci soliton is a self-similar solution to the ricci flow and arises naturally in the singularity analysis of the flow. steady ricci soliton is a kind of soliton whose associated ricci flow evolves by reparametrizing a fixed metric. it is closely related to the type ii limit solution to the ricci flow. steady ricci soliton with integrable scalar curvature was studied by deruelle in 2012, later by catino-mastrolia-monticelli in 2016, munteanu-sung-wang in 2019, deng-zhu in 2020. in this talk, we shall discuss a classification result on steady kaehler ricci soliton with nonnegative ricci curvature and integrable scalar curvature. we then apply the result to study the steady kaehler ricci soliton with subquadratic volume growth or fast curvature decay.

in these two lectures we plan to survey some known results about complete noncompact shrinking ricci solitons in dimension four. the main goal is to understand the geometry at infinity of these manifolds, and for that we address the following basic questions:
*estimate the number of ends of 4d shrinkers.
*understand the asymptotic geometry along each end.
*uniqueness results.
*open problems/conjectures.

the multiple access channel (mac) is one of the most well studied and understood network information theoretic models, describing a scenario where k users wish to deliver their information message to one receiver, sharing the same transmission channel. beyond the multitude of practical and somewhat heuristic mac protocols (e.g., tdma, fdma, cdma, csma, aloha, and variations thereof), the information theoretic capacity region is well understood under many situations of interest, and in particular in the gaussian case, modeling the uplink of a wireless system with one access point or base station (receiver) and several users, sharing the same frequency band.
\\
\\
more recently, a variant of this model has been proposed for a situation where a very large (virtually unlimited) number of users wish to communicate only very sporadically, such that at any point in time only a finite and relatively small number of users are ``active''. this scenario is appropriate for machine-type communications and internet of things, where a multitude of sensors and objects have only rather sporadic data to send, but they need to send them when they are created, at random times.
\\
\\
the identification of the active user set, or the active message set (the list of messages transmitted, irrespectively of who is transmitting them) has some points in common with a compressed sensing problem, where the activity vector (entry 1 if a user/message is active and 0 otherwise) is the key object to be estimated at the receiver side.
\\
\\
in this talk we review the basic mac model and results, a variant for massive random access called ``unsourced random access'' where all users use the same codebook, and related recent results and algorithms. including some capacity scaling for this model, which remains quite open as far as a full information theoretic characterization is concerned.

morphogen gradients play a vital role in developmental biology by enabling embryonic cells to infer their spatial location and determine their developmental fate accordingly. the standard mechanism for generating a morphogen gradient involves a morphogen being produced from a localized source and subsequently degrading. while this mechanism is effective over the length and time scales of tissue development, it fails over typical subcellular length scales due to the rapid dissipation of spatial asymmetries. single-particle tracking experiments have recently found that c. elegans zygotes rely on space-dependent switching diffusivities to form intracellular gradients during cell polarization. we analyze a model of switching diffusivities to determine its role in protein concentration gradient formation. in particular, we determine how the presence of switching diffusivities modifies the standard theory and show that space-dependent switching diffusivities can yield a gradient in the absence of a localized source. our mathematical analysis yields explicit formulas for the intracellular concentration gradient which closely match the results of previous experiments and numerical simulations. we further consider how this mechanism of switching diffusive states interacts with a locally varying periodic microstructure in the cell, and use homogenization theory to show that at the typical cellular scales involved, such a microstructure does not necessarily need to be resolved in fine detail in order to accurately capture the dynamics of the system.

this will be a mainly expository talk about some recent
applications of number theory to topology. the crux of these
applications is the construction of a cohomology theory called
topological modular forms (tmf) out of the moduli of elliptic curves.
i'll explain what tmf is, what we have been doing with it, and what we'd
still like to know; i'll also discuss more recent attempts to extend the
theory using level structures, higher-dimensional abelian varieties, and
k3 surfaces. time permitting, i'll talk about my work with dominic
culver on some partial number-theoretic interpretations of tmf
co-operations.

this will be a mainly expository talk about some recent applications of number theory to topology. the crux of these applications is the construction of a cohomology theory called topological modular forms (tmf) out of the moduli of elliptic curves. i'll explain what tmf is, what we have been doing with it, and what we'd still like to know; i'll also discuss more recent attempts to extend the theory using level structures, higher-dimensional abelian varieties, and k3 surfaces. time permitting, i'll talk about my work with dominic culver on some partial number-theoretic interpretations of tmf co-operations.

many familiar objects in algebra, geometry and topology belong to
2-calabi-yau categories, e.g. coherent sheaves on a k3 or abelian
surface, higgs bundles on a smooth and proper curve, local systems on a
riemann surface, and representations of a fixed preprojective algebra.
in each case the borel-moore homology of the stack of objects carries a
hall algebra structure, which in the preprojective algebra case contains
all of the raising operators on the cohomology of nakajima quiver
varieties, and in other cases produces a kind of nonlinear/global
analogue of this theory. by reducing everything locally to the case of
representations of a preprojective algebra, i'll show that in each case
the borel-moore homology of the stack of objects carries a perverse
filtration. i'll explain how this filtration can be used to produce
generators for the borel-moore homology of the stack of objects coming
from intersection cohomology of the coarse moduli space, along with
tautological classes. in joint work with sjoerd beentjes, we show that
in all but one of the examples in the first sentence of this abstract
this borel-moore homology is pure. in the k3 case this proves a
conjecture of halpern-leistner.

given a class of finite structures, is there a way to assemble them into a
countably infinite limit object in a canonical way? for example, consider
the collection of finite linear orders. clearly the limit object should be
some infinite linearly ordered set, but there are lots to choose from.
should we use the order of the naturals? the integers? the rationals?
similarly, consider the class of finite graphs. there are lots of
countably infinite graphs which embed every finite graph. which one is
best? fraisse theory allows us to answer this question; for certain
collections of finite structures, we can consider the ``generic''
countably infinite structure which embeds every member of the finite
class.

isotropic quot scheme is a projective scheme that compactifies the moduli space of maps (of a given degree) from a smooth projective algebraic curve to an isotropic grassmannian. isotropic quot schemes are often not smooth, but we construct a virtual fundamental class which makes it 'virtually' smooth. we use this to understand intersection theory of this space and find a vafa-intriligator type formula for the intersection of certain cohomology classes.

by ratner's famous equidistribution theorem, we know that unipotent orbits in finite volume quotients of lie groups equidistribute in their closures. often, in applications, one needs to know more: specifically, at what rate does the orbit equidistribute? we call a statement that includes a quantitative error term effective. in this talk, i will present an effective equidistribution theorem, with polynomial rate, for horospherical orbits in the frame bundle of certain infinite volume hyperbolic manifolds. this is joint work with nattalie tamam.

in 2010, hedden showed that the ozsvath-szabo concordance invariant tau detects whether a fibered knot induces a tight contact structure on the three-sphere. in 2017, ozsvath, stipsicz, and szabo constructed a one-parameter family of concordance invariants upsilon, which recovers tau as a special case. i will discuss a sufficient condition using upsilon for the monodromy of the open book decomposition of a fibered knot to be right-veering. i will also discuss a generalization of a result of baker on ribbon concordances between fibered knots. this is joint work with dongtai he and diana hubbard.

this talk discusses the saddle point problem of polynomials. we give an algorithm for computing saddle points, based on lasserre's hierarchy of moment-sos relaxations. under some genericity assumptions, we show that: i) if there exists a saddle point, the algorithm can get one by solving a finite number of relaxations; ii) if there is no saddle point, the algorithm can detect its nonexistence.

in a series of papers, voiculescu generalized the notions of entropy and fisher information to the free probability setting. in particular, the notions of free entropy have several applications in the theory of von neumann algebras and free probability such as demonstrating certain von neumann algebras do not have property gamma, demonstrating the absence of atoms in the distributions of polynomials of random matrices, and the construction of free monotone transport. with the recent bi-free extension of free probability being sufficiently developed, it is natural to ask whether there are bi-free extensions of voiculescu's notions of free entropy. in this talk, we will provide an introduction to a few notions of bi-free entropy and discuss the difficulties and peculiarities that occur. this is joint work with ian charlesworth.

a mean field game is usually denoted as a game with the number of
players tending to infinity, which leads us to consider population
densities of players and their resulting ``nash equilibrium'' strategies.
mean field games have been used to model financial markets, population
dynamics, and more, but solving the mean field games ends up requiring us
to solve a high-dimensional pde. to avoid the curse of dimensionality, we
can instead use the method of characteristics to turn one of the pdes in
the mean field game into a system of odes and then solve the mean field
game by parameterizing the dynamics of the ode with a neural network.

theta functions are certain quasi-periodic functions in several complex variables. ``non-abelian'' analogues of theta functions can be defined via moduli of stable bundles over a curve. there exist surprising symmetries in the dimension formulas, called verlinde numbers, of spaces of non-abelian theta functions. we will talk about the strange duality which is a geometric explanation for the symmetry between spaces of non-abelian theta functions.

the fractional obstacle problem in $\mathbb r^n$ with obstacle $\varphi\in c^\infty(\mathbb{r}^n)$ can be written as \[ \min\{(-\delta)^s u , u-\varphi\} = 0,\quad\textrm{in }\quad\mathbb{r}^n. \] the set $\{u = \varphi\} \subset \mathbb{r}^n$ is called the contact set, and its boundary is the free boundary, an unknown of the problem. the free boundary for the fractional obstacle problem can be divided between two subsets: regular points (around which the free boundary is smooth, and is $n-1$ dimensional) and degenerate points. the set of degenerate points, even for smooth obstacles, can be very large (for example, with infinite $\mathcal{h}^{n-1}$ measure). in a joint work with x. ros-oton we show, however, that generically solutions to the fractional obstacle problem have a lower dimensional degenerate set. that is, for almost every solution (in an appropriate sense), the set of degenerate points is lower dimensional.

i will present mcmc algorithms as optimization over the kl-divergence in the space of probabilities. by incorporating a momentum variable, i will discuss an algorithm which performs accelerated gradient descent over the kl-divergence. using optimization-like ideas, a suitable lyapunov function is constructed to prove that an accelerated convergence rate is obtained. i will then discuss how mcmc algorithms compare against variational inference methods in parameterizing the gradient flows in the space of probabilities and how it applies to sequential decision making problems.

right and left eigenvectors of non-hermitian matrices form a bi-orthogonal system to which one can associate homogeneous quantities known as overlaps. the matrix of overlaps quantifies the stability of the spectrum and characterizes the joint eigenvalues increments under dyson-type dynamics. overlaps first appeared in the physics literature: chalker and mehlig calculated their conditional expectation for complex ginibre matrices (1998). for the same model, we extend their results by deriving the distribution of the overlaps and their correlations (joint work with p. bourgade). similar results have been obtained in other integrable settings, namely quaternionic gaussian matrices, as well as matrices from the spherical and truncated unitary ensembles.

outside of laboratories, microbial communities (biofilms and other types)
often exist in relatively stable environments where, on average, resource quality and quantity
are predictable. in these conditions, these communities are able to organize
into tuned chemical factories, efficiently turning resources into biomass and
waste byproducts. to do so, physical, chemical, and biological constraints
must be accomodated. in this seminar, techniques to model this
organization will be discussed. in particular, the importance of coupling microscale
metabolic information to community scale transport processes will be emphasized.

modeling malle's conjecture with random groups
abstract: we construct a random group with a local structure that models
the behavior of the absolute galois group ${\rm gal}(\overline{k}/k)$,
and prove that this random group satisfies malle's conjecture for
counting number fields ordered by discriminant with probability 1. this
work is motivated by the use of random groups to model class group
statistics in families of number fields (and generalizations). we take
care to address the known counter-examples to malle's conjecture and how
these may be incorporated into the random group.

one approach to computing integrals over hilbert schemes of
points on surfaces (and other moduli spaces of sheaves on surfaces) is
to reduce to the special case when the surface in question is $c^2$.
\\
\\
i'll explain how to use the (k-theoretic) donaldson-thomas theory of
threefolds to deduce identities for holomorphic euler characteristics
of tautological bundles over the hilbert scheme of points on $c^2$. i'll
also explain how these identities control the behavior of such euler
characteristics over hilbert schemes of points on general surfaces.

it is known both scientifically and anecdotally that typical large-scale
social networks exhibit short paths between pairs of nodes, hence
the common phrase ``six degrees of separation''. in this talk, mathematical
background for this phenomenon is given, together with a study of the
algorithmic question of how to search such large-scale networks using only
local information. in particular, one could imagine that each
person in the network is allowed to pass a message to one of their
acquaintances, until a particular target person in the network receives the
message. remarkably, for many networks with $n$ nodes, there is a simple
algorithm which does this extremely efficiently -- a ``decentralized
search'' algorithm which runs in time polylogarithmic in the number of
nodes. the mathematics in this talk involves only elementary combinatorics
and probability.

the mahowald invariant is a highly nontrivial map (with indeterminacy) from the homotopy groups of spheres to itself with deep connections to chromatic homotopy theory. in this talk i will discuss a variant of the mahowald invariant that can be computed using knowledge of the r-motivic stable homotopy groups of spheres, and discuss its comparison to the classical mahowald invariant. this is joint work with dan isaksen.

consider the following experiment: a deck with $m$ copies of $n$ different card types is randomly shuffled, and a guesser attempts to guess the cards sequentially as they are drawn. each time a guess is made, some amount of ``feedback'' is given. for example, one could tell the guesser the true identity of the card they just guessed (the complete feedback model) or they could be told nothing at all (the no feedback model).
\\
\\
in this talk we explore a partial feedback model, where upon guessing a card, the guesser is only told whether or not their guess was correct. we show in this setting that, uniformly in $n$, at most $m+o(m^{3/4}\log m)$ cards can be guessed correctly in expectation, which is roughly the number of cards one gets by naively guessing the same card type $mn$ times. this is joint work with persi diaconis, ron graham, and xiaoyu he.

the direct summand conjecture, part of the homological conjectures in commutative algebra, was first proposed by mel hochster in 1973. the conjecture is easily proven when the given ring contains a field, but the ``mixed characteristic'' case seemed, for the most part, impenetrable. in 2016 yves andre announced a proof of the conjecture which utilizes the theory of perfectoid spaces. we will attempt to give a (somewhat) detailed proof of the dsc in a simplified scenario, and then give a general idea of the methods used to prove the theorem in the general case.

in this talk, we will discuss the existence theory of kahler-ricci flow when the kahler metric has unbounded curvature. we will discuss some application of the kahler-ricci flow in the study of uniformization and the regularity of gromov-hausdorff limit. this is joint work with l.-f. tam.

i will talk about some recent work determining the archimedean
components of certain eisenstein series and cap forms induced from the
long root parabolic of $g_2$. i will also discuss how these results are
being used in some work in progress on producing nonzero classes in
symmetric cube selmer groups.

at the microscopic level, the dynamics of arbitrary networks of chemical reactions can be modeled as jump markov processes whose sample paths converge, in the limit of large number of molecules, to the solutions of a set of algebraic ordinary differential equations. fluctuations around these asymptotic trajectories and the corresponding phase transitions can in principle be studied through large deviations theory in path space, also called wentzell-freidlin (w-f) theory. however, the specific form of the jump rates for this family of processes does not satisfy the standard regularity assumptions imposed by such theory, and weaker conditions need to be developed to deal with the framework at hand. using tools of lyapunov stability theory we design sufficient conditions for the applicability of large deviations estimates to the asymptotics of the markov process at hand. we then translate such conditions in terms of the topological structure of the chemical reaction network. this ultimately allows to define a large class of chemical reaction systems to which the estimates of interest can automatically be applied.

we introduce projective space over a field, and we investigate its
geometry. along the way we find connections to many other fascinating
geometries including m\``{o}bius strips, the hopf fibration, and the fano
plane. we also discuss the basics of algebraic geometry in projective
space.

we define a localised euler class for isotropic
sections, and isotropic cones, in so(n) bundles. we use this to give an
algebraic definition of borisov-joyce sheaf counting invariants on
calabi-yau 4-folds. when a torus acts, we prove a localisation result.
this talk is based on the joint work with richard. p. thomas.

a solution to a geometric flow is called ancient if it has a backhistory going back infinitely far in time. ancient solutions of parabolic pde are analogous to entire solutions of elliptic pde. in particular, they play a fundamental role in understanding singularity formation.
\\
\\
perelman studied ancient solutions to the ricci flow in dimension 3 which are kappa-noncollapsed, and proved a crucial structure theorem for these ancient kappa-solutions. moreover, perelman conjectured that, up to scaling, every noncompact ancient kappa-solution in dimension 3 is isometric to either the bryant soliton or the standard cylinder (or a quotient thereof). in these lectures, i will discuss the proof of this conjecture.

for every infinite set x we define s(x) as the group of all permutations of x. on its subgroup consisting of all finitely supported permutations there exists a natural group homomorphism signature. however, thanks to an observation of vitali in 1915, we know that this group homomorphism does not extend to s(x). in the talk we extend the signature on the subgroup of s(x) consisting of all piecewise isometric elements (strongly related to the interval exchange transformation group). this allows us to list all of its normal subgroups and gives also informations about an element of the second cohomology group of some groups.

modeling high dimensional data by latent tree graphical models is a common approach in multiple
machine learning applications. in these models, the key task is to infer the structure of the tree, given
only observations on its leaves. a canonical example of this setting is the tree of life, where the
evolutionary history of a set of organisms is inferred by their nucleotide or protein sequences.
\\
\\
in this talk, we will show that the tree structure is strongly related to the spectral properties of a fully
connected graph, defined over the terminal nodes of the tree. this relation forms the theoretical basis
of two new methods to recover latent tree models. comparing our approach to several competing
methods, we show that in many settings, spectral methods have stronger theoretical guarantees and
work better in practice.

recent work of both gabai and schneiderman-teichner on the smooth isotopy of homotopic surfaces with a common dual has reinvigorated the study of concordance invariants defined by freedman and quinn in the 90's, along with homotopy theoretic invariants of dax from the 70's obstructing isotopy of disks. using the dax invariant, we will give conditions under which pairs of homotopic properly embedded disks in a smooth 4-manifold with boundary with a common dual are isotopic.

in recent years, topological and geometric data analysis (tgda) has emerged as a new and promising field for processing, analyzing and understanding complex data. indeed, geometry and topology form natural platforms for data analysis, with geometry describing the ``shape'' behind data; and topology characterizing / summarizing both the domain where data are sampled from, as well as functions and maps associated to them.
\\
\\
in this talk, i will show how topological (and geometric ideas) can be used to analyze graph data, which occurs ubiquitously across science and engineering. graphs could be geometric in nature, such as road networks in gis, or relational and abstract. i will particularly focus on the reconstruction of hidden geometric graphs from noisy data, as well as graph matching and classification. i will discuss the motivating applications, algorithm development, and theoretical guarantees for these methods. through these topics, i aim to illustrate the important role that topological and geometric ideas can play in data analysis.

i will discuss topics in natural language processing

it has been proved by r. e. greene and h. wu that a simply-connected complete kahler manifold negatively pinched sectional curvature possesses a complete bergman metric. i will briefly review the history and present the estimates of the bergman metric using the bounded geometry. this talk is based on the joint work with yau.

a solution to a geometric flow is called ancient if it has a backhistory going back infinitely far in time. ancient solutions of parabolic pde are analogous to entire solutions of elliptic pde. in particular, they play a fundamental role in understanding singularity formation.
\\
\\
perelman studied ancient solutions to the ricci flow in dimension 3 which are kappa-noncollapsed, and proved a crucial structure theorem for these ancient kappa-solutions. moreover, perelman conjectured that, up to scaling, every noncompact ancient kappa-solution in dimension 3 is isometric to either the bryant soliton or the standard cylinder (or a quotient thereof). in these lectures, i will discuss the proof of this conjecture.

a central problem of machine learning is the following. given data of the form $\{(y_i, f(y_i)+\epsilon_i)_{i=1}^m\}$, where $y_i$'s are drawn randomly from an unknown (marginal) distribution $\mu^*$ and $\epsilon_i$ are random noise variables from another unknown distribution, find an approximation to the unknown function $f$, and estimate the error in terms of $m$.
the approximation is accomplished typically by neural/rbf/kernel networks, where the number of nonlinear units is determined on the basis of an estimate on the degree of approximation, but the actual approximation is computed using an optimization algorithm.
although this paradigm is obviously extremely successful, we point out a number of perceived theoretical shortcomings of this paradigm, the perception reinforced by some recent observations about deep learning.
we describe our efforts to overcome these shortcomings and develop a more direct and elegant approach based on the principles of approximation theory and harmonic analysis.\\
%we demonstrate a duality between certain problems of function approximation and probability estimation in machine learning and problems of super-resolution in signal separation. in particular, we will explain how the same tools from harmonic analysis can be used for both purposes, leading to a unified theory. we will demonstrate our ideas with some numerical examples.

for most microbial communities, the environment and the microbial community structure and function are intimately connected. most environments outside of the lab are physically and chemically heterogeneous, shaping and complicating the metabolisms of their resident microbial communities: spatial variations introduce physics such as diffusive and advective transport of nutrients and byproducts for example. conversely, microbial metabolic activity can strongly affect the environment in which the community must function. hence it is important to link metabolism at the cellular level to physics and chemistry at the community level.
\\
\\
to introduce metabolism to community-scale population dynamics, many modeling methods rely on large numbers of reaction kinetics parameters that are unmeasured, also making detailed metabolic information mostly unusable. the bioengineering community has addressed this difficulty by moving to kinetics-free formulations at the cellular level, termed flux balance analysis. to combine and connect the two scales, we propose to replace classical kinetics functions in community scale models with cell-level metabolic models, and predict metabolism and how it is influenced by and influences the environment. further, our methodology permits assimilation of many types of measurement data. we will discuss the background and motivation, model development, and some numerical simulation results.

let $x/\mathbb{f}_q$ be a smooth affine curve over a finite
field of characteristic $p > 2$. in this talk we discuss the $p$-adic
variation of zeta functions $z(x_n,s)$ in a pro-covering
$x_\infty:\cdots \to x_1 \to x_0 = x$ with total galois group
$\mathbb{z}_p$. for certain ``monodromy stable'' coverings over an
ordinary curve $x$, we prove that the $q$-adic newton slopes of
$z(x_n,s)/z(x,s)$ approach a uniform distribution in the interval
$[0,1]$, confirming a conjecture of daqing wan. we also prove a
``riemann hypothesis'' for a family of galois representations associated
to $x_\infty/x$, analogous to the riemann hypothesis for
equicharacteristic $l$-series as posed by david goss. this is joint
work with joe kramer-miller.

a foliation on an algebraic variety is a partition of the variety into ``parallel'' disjoint immersed complex submanifolds.
\\
\\
this turns out to be a very useful notion and holomorphic foliations
have played a central role in several recent developments in the study
of the geometry of projective varieties.
\\
\\
this is the first part of a two talks series (with roberto svaldi)
in which we will explain some recent work building towards the
birational classification of holomorphic foliations on projective
varieties in the spirit of the minimal model program. we will explain some applications of these ideas
to the study of the dynamics and geometry of foliations and foliation
singularities.
\\
\\
features joint work with p. cascini and r. svaldi

random matrices are an incredibly useful tool for modelling noise and understanding the behavior of large, chaotic systems. they can help us understand the ``average'' complexity of a linear algebra algorithm, model ``on the cheap'' the behavior of large data sets, serve as benchmarks for clustering algorithms, and so much more. and they can do all of this for a very good reason: random matrices are, well, not so random after all. their spectral asymptotics are highly structured, and highly concentrated, and that is the source of their usefulness.
\\
\\
this talk will be accessible to an audience familiar with basic linear algebra and probability.

i will briefly review the convergence theory for non-collapsed einstein 4-manifolds developed by anderson, bando-kasue-nakajima and tian around 1990. this was the main precursor for the more recent higher-dimensional theory of cheeger-colding-naber. however, several difficult problems have remained open even in dimension 4. i will focus on the structure of the possible bubbles and bubble trees in the 4-dimensional theory. in particular, i will explain kronheimer's classical work on gravitational instantons as well as a recent result of biquard-h concerning the renormalized volume of a 4-dimensional ricci-flat ale space.

the f-invariant was introduced by lewis bowen in 2008 and is a real-valued isomorphism invariant that is defined for a large class of probability measure-preserving actions of finite-rank free groups. most notably, the f-invariant provided the first classification up to isomorphism of bernoulli shifts over finite-rank free groups. it is also quite useful for the study of finite state markov chains with values indexed by a finite-rank free group. the f-invariant is conceptually similar to entropy, and it has a formal connection to sofic entropy. in this expository talk, i will introduce the f-invariant and discuss some of its basic properties.

in free probability theory, there is no direct analog of density for probability distributions, but there is something like a notion of ``log-density'' in the study of free gibbs laws and free score functions. non-commutative notions of smoothness are important for studying both these log-densities and the functions used for changes of variables (or transport of measure) in free probability. in the single-variable setting, we have a good understanding of the smoothness properties of a function $f: \mathbb{r} \to \mathbb{r}$ applied to self-adjoint operators thanks to the work of peller, aleksandrov, and nazarov; see the recent paper of evangelos nikitopoulos. however, in the multivariable setting, much of the literature has used classes of functions that are either too restrictive (such as analytic functions) or very technical to define (such as dabrowski, guionnet, and shlyakhtenko's smooth functions where haagerup tensor norms were used for the derivatives). we will discuss a notion of tracial non-commutative smooth functions that is modeled on trace polynomials. these smooth functions have many desirable properties, such as a chain rule, good behavior under conditional expectations, and a natural way to incorporate the one-variable functional calculus. we will sketch current work about the smooth transport of measure for free gibbs laws as well as future directions in relating these smooth functions to free sde.

in this talk, i will introduce the chow t-structure on the motivic stable homotopy category over a general base field. this t-structure is a generalization of the chow-novikov t-structure defined on a p-completed cellular motivic module category in work of gheorghe--wang--xu.
\\
\\
moreover, we identify the heart of this t-structure with a purely algebraic category, and expand the results of gheorghe-wang-xu to integral results on the entire motivic category over general base fields. this leads to computational applications on determining the adams spectral sequences in the classical stable homotopy category, as well as that in the motivic stable homotopy category over c, r, and $f_p$. this is joint work with tom bachmann, guozhen wang and zhouli xu.

detecting differences and building classifiers between distributions, given only finite samples, is an important task in data science applications. optimal transport (ot) has evolved as the most natural concept to measure the distance between distributions, and has gained significant importance in machine learning in recent years. there are some drawbacks to ot: computing ot is usually slow, and it often fails to exploit reduced complexity in case the family of distributions is generated by simple group actions.
\\
\\
in this talk, we discuss how optimal transport embeddings can be used to deal with these issues, both on a theoretical and a computational level. in particular, we'll show how to embed the space of distributions into an $l^2$-space via ot, and how linear techniques can be used to classify families of distributions generated by simple group actions in any dimension. we'll also show conditions under which the $l^2$ distance in the embedding space between two distributions in arbitrary dimension is nearly isometric to wasserstein-2 distance between those distributions. this is of significant computational benefit, as one must only solve n optimal transport problems to define the $n^2$ pairwise distances between n distributions. we'll present some applications in image classification and supervised learning.
\\
\\
this is joint work with alex cloninger.

once upon a time, in the land of mathlandia, the people in the city of algebraic geometria had a brilliant vision: what if all math was algebra, every theorem was category theory, and every proof used cohomology? armed with their categories and rings, they declared war on the other cities of mathlandia. number theoryberg was the first to fall, succumbing to the glory of sheaves and schemes. next was representation theory city, which fell soon after. but alas, despite their efforts the algebraists had not made any progress since... until now! scholze and clausen have started the condensed mathematics program, which vows to take over functional analysisberg and differential geometria. we will deal with the very first matter in this program, the story of locally compact abelian groups.

hurwitz spaces parametrize finite covers of the projective line by curves of genus g. we show that the chow rings of hurwitz spaces of low degree covers exhibit interesting stabilization properties as g goes to infinity. we also consider applications to the moduli space of curves. this is joint work with hannah larson.

often in number theory and geometry, it is necessary to consider topological algebraic objects, like locally compact abelian groups, continuous group cohomology, and adic spaces. however, many of these topological structures don't have good categorical properties, at least when compared to their purely algebraic counterparts. we will explore condensed mathematics, a program of clausen and scholze to systematically add topological structure to algebra with nice categorical properties.

we will discuss classification of ancient solutions to geometric flows. we will focus especially on the ricci flow.

machine learning achieves tremendous success in image classification, speech recognition, and medical diagnosis. in the meantime, machine learning also brings some interesting mathematical questions: how to solve the resulting optimization more efficiently and robustly? how to apply the machine learning technique to tackle challenging problems in mathematics. in this talk, i will view the neural networks model from a nonlinear scientific computing point of view and present some recent work on developing a homotopy training algorithm to train neural networks ``layer-by-layer'' and ``node-by-node.'' i will also review the neural network from numerical algebraic geometry point view and provide a novel initialization for relu networks.

the classical convergence theory and singularity formation for non-collapsed einstein 4-manifolds leaves some important issues open. which singular einstein metrics are actually limits of smooth ones? can we describe the moduli space of einstein metrics close to its boundary? we partially answer these by proving that any einstein manifold sufficiently gh-close to an einstein orbifold is the result of a gluing-perturbation procedure. this completely describes the singularity formation of compact einstein metrics and moreover lets us show that the desingularization of einstein metrics by kronheimer's gravitational instantons is obstructed. the recent results of biquard-hein let us extend a weaker obstruction for general ricci-flat ale spaces.

the famous shannon-nyquist theorem has become a landmark in the development of digital signal and image processing. however, in many modern applications, the signal bandwidths have increased tremendously, while the acquisition capabilities have not scaled sufficiently fast. consequently, conversion to digital has become a serious bottleneck. furthermore, the resulting digital data requires storage, communication and processing at very high rates which is computationally expensive and requires large amounts of power. in the context of medical imaging sampling at high rates often translates to high radiation dosages, increased scanning times, bulky medical devices, and limited resolution.
in this talk, we present a framework for sampling and processing a large class of wideband analog signals at rates far below nyquist in space, time and frequency, which allows to dramatically reduce the number of antennas, sampling rates and band occupancy. our framework relies on exploiting signal structure and the processing task. we consider applications of these concepts to a variety of problems in communications, radar and ultrasound imaging and show several demos of real-time sub-nyquist prototypes including a wireless ultrasound probe, sub-nyquist mimo radar, super-resolution in microscopy and ultrasound, cognitive radio, and joint radar and communication systems. we then discuss how the ideas of exploiting the task, structure and model can be used to develop interpretable model-based deep learning methods that can adapt to existing structure and are trained from small amounts of data. these networks achieve a more favorable trade-off between increase in parameters and data and improvement in performance, while remaining interpretable.

the 2-spin spherical sherrington kirkpatrick (ssk) model was introduced by kosterlitz, thouless and jones as a simplification of the usual sherrington-kirkpatrick model with ising spins. the ssk model admits tractable formulas for many of its observables, allowing for a detailed analysis of its fluctuations using techniques from random matrix theory. we discuss recent results on the fluctuations of the ssk model with a magnetic field as well as at critical temperature. based on joint work with p. sosoe.

in this talk, we study the chow group of the motive associated
to a tempered global l-packet $\pi$ of unitary groups of even rank with
respect to a cm extension, whose global root number is -1. we show that,
under some restrictions on the ramification of $\pi$, if the central
derivative $l'(1/2,\pi)$ is nonvanishing, then the $\pi$-nearly isotypic
localization of the chow group of a certain unitary shimura variety over
its reflex field does not vanish. this proves part of the
beilinson--bloch conjecture for chow groups and l-functions. moreover,
assuming the modularity of kudla's generating functions of special
cycles, we explicitly construct elements in a certain $\pi$-nearly
isotypic subspace of the chow group by arithmetic theta lifting, and
compute their heights in terms of the central derivative $l'(1/2,\pi)$ and
local doubling zeta integrals. this is a joint work with chao li.

kuznetsov conjectured the existence of a correspondence
between different types of fano threefolds which identifies a
distinguished semiorthogonal component of the derived category on each
side. i will explain joint work with arend bayer which resolves one of
the outstanding cases of this conjecture. this relies on the study of
the hodge theory of certain k3 categories associated to the
semiorthogonal components.

arithmetic statistics is a subfield of number theory which studies arithmetic objects in the context of statistical properties like distribution, expected value, etc. work in this field involves both an understanding of the underlying arithmetic structure and the application of strong analytic tools. we will first explore a few types of questions that are studied in this field today, then we discuss a major analytic tool used by researchers called a tauberian theorem.

quot schemes are fundamental objects in moduli theory of algebraic geometry. we show that the generating series of certain virtual invariants of quot schemes of surfaces are expressed by the universal series and seiberg-witten invariants.
we apply this to several cases including homological and k-theoretic descendent series, reduced invariants of k3 surfaces, virtual segre and verlinde series. in particular, descendent series are shown to be rational functions whenever the curve class is of seiberg-witten length n.

branching brownian motion (bbm) is a random particle system where each particle diffuses as brownian motion and branches into a random number of particles at a constant rate. in this talk, we will focus on two variant models of bbm, bbm with absorption and bbm with inhomogeneous breeding potential. in the first model, we derive the long run expected number of particles conditioned on survival in the near critical case. in the second model, we study the entire configuration of particles.

in this talk i will explain an interpretation (due to lewis bowen) of the f-invariant as a variant of sofic entropy: it is the exponential growth rate of the expected number of ``good models'' for an action over a random sofic approximation. i will then introduce the relative f-invariant and provide a similar interpretation of this quantity. this provides a formula for the growth rate of the expected number of good models over a type of stochastic block model.

corks are special contractible 4-manifolds that play a key role in the study of exotic smooth 4-manifolds. in this talk, i will describe applications of corks to the study of surfaces in 4-manifolds. i'll begin with some badly behaved 2-spheres in 4-space, based on joint work with piccirillo. then i'll use a twist on these ideas to construct smoothly (indeed, holomorphically) embedded disks in the 4-ball that are isotopic through ambient homeomorphisms but not through diffeomorphisms. there will be lots of cartoons.

i will talk about joint work with siegfried echterhoff and rufus willett in which we introduce and study amenable actions of locally compact groups on c*-algebras, building on previous similar notions by anantharaman-delaroche for actions of discrete groups. among the new results we prove an extension of matsumura's theorem giving a characterisation of the weak containment property (coincidence of full and reduced crossed products) for actions on commutative c*-algebras and give examples showing that this result does not extend to general noncommutative c*-algebras.

in the 90s', witten gave a physical derivation of an isomorphism
between the verlinde algebra of gl(n) of level l and the quantum
cohomology ring of the grassmannian gr(n,n+l). in the joint work arxiv:1811.01377 with yongbin ruan, we proposed a k-theoretic generalization of witten's work by relating the $gl_n$ verlinde numbers to
the level l quantum k-invariants of the grassmannian gr(n,n+l), and refer
to it as the verlinde/grassmannian correspondence. the correspondence was formulated precisely in the aforementioned paper, and we proved the rank 2
case (n=2) there.
\\
\\
in this talk, i will first explain the background of this correspondence
and its interpretation in physics. then i will discuss the main idea of
the proof for arbitrary rank. a new technical ingredient is the virtual
nonabelian localization formula developed by daniel halpern-leistner.

curvature pinching theorems restrict the topology of smooth manifolds satisfying suitable curvature assumptions. in some situations the ricci flow can transform initial integral curvature bounds into later pointwise bounds and thereby extend pointwise to integral pinching results. i will first review $l^p$ integral pinching theorems of gursky, hebey--vaugon, dai--wei--ye, and others, which all rely on supercritical powers p greater than n/2 or on chern--gauss--bonnet in dimension four. then i will discuss how stronger control of the sobolev inequality obtained using perelman's mu-functional can be used to address the critical case $p=n/2$, leading both to a generalization of previous results as well as to a separate pinching result in the asymptotically flat setting. some of the work presented is joint with guofang wei and rugang ye.

the variational principle of lagrangian pde is encoded geometrically in a multisymplectic structure. this multisymplectic structure gives rise to a covariant formulation of noether's theorem and conservation of multisymplecticity, a spacetime generalization of the symplecticity of lagrangian mechanics. multisymplecticity has many important physical implications, such as reciprocity in electromagnetism and conservation of wave action, a key ingredient in the stability analysis of wave propagation problems. furthermore, upon introducing a foliation of spacetime, multisymplecticity can be reformulated as symplecticity on an infinite-dimensional phase space. consequently, understanding how these multisymplectic structures are affected under discretization is an important aspect to the numerical integration of this class of pde.
\\
\\
in this talk, after discussing the multisymplectic formulation of lagrangian pde, we discuss how the multisymplectic structure is affected under discretization of the variational principle via the finite element method. we show how choices of discretization which preserve functional and geometric relationships of the underlying function spaces naturally give rise to discrete analogs of the continuum multisymplectic structures. in particular, we discuss how cochain projections and group-equivariant projections from the continuum function spaces to the finite element function spaces induce discrete analogs of the variational, multisymplectic, and noether-theoretic structures.
\\
\\
this is joint work with melvin leok.

in the 70s, fred cohen and peter may gave a description of the mod $p$ homology of a free $e_n$-algebra in terms of certain homology operations, known as dyer--lashof operations, and the browder bracket. these operations capture the failure of the $e_n$ multiplication to be strictly commutative, and they prove useful for computations. after reviewing the main ideas from may and cohen's work, i will discuss a framework to generalize these operations to homology with certain twisted coefficient systems and give a complete classification of twisted operations for $e_{\infty}$-algebras. i will also explain computational results that show the existence of new operations for $e_2$-algebras.

of all the polynomials over $\mathbb{q}_p$, those of degree divisible by $p$ are most complicated. similarly, the $p$-local subgroup structure of $\operatorname{gl}_n(\mathbb{c})$ is more complicated if $p$ divides $n$. the talk will be an example based introduction to these ideas, which fall under the ``wild aspect'' of the local langlands correspondence. along the way we will define $\mathbb{q}_p$, some reductive groups of exceptional type, and exhibit wild $p$-structures in both of these examples.

we give a brief introduction to moduli of shtukas, with an eye towards its application in the langlands correspondence for global function fields.

leon simon showed that if an area minimizing hypersurface admits a cylindrical tangent cone of the form c x r, then this tangent cone is unique for a large class of minimal cones c. one of the hypotheses in this result is that c x r is integrable and this excludes the case when c is the simons cone over $s^3 x s^3$. the main result in this talk is that the uniqueness of the tangent cone holds in this case too. the new difficulty in this non-integrable situation is to develop a version of the lojasiewicz-simon inequality that can be used in the setting of tangent cones with non-isolated singularities.

in this talk, i will talk about my construction of relative moduli
spaces of stable sheaves over the stack of quasipolarized surfaces.
for this, i first retrace some of the classical results in the theory
of moduli spaces of sheaves on surfaces to make them work over the
nonample locus. then i will recall the theory of good moduli spaces,
whose study was initiated by alper and concerns an intrinsic (stacky)
reformulation of the notion of good quotients from git. finally, i use
a criterion by alper-heinloth-halpern-leistner to prove existence of
the good moduli space. the application of the construction that i have
in mind is extending the strange duality results to degree two k3
surfaces - this part is still work in progress.

in this talk, we discuss a few simple and optimal methods for solving stochastic variational inequalities (vi). a prominent application of our algorithmic developments is the stochastic policy evaluation problem in reinforcement learning. prior investigations in the literature focused on temporal difference (td) learning by employing nonsmooth finite time analysis motivated by stochastic subgradient descent leading to certain limitations. these encompass the requirement of analyzing a modified td algorithm that involves projection to an a-priori defined euclidean ball, achieving a non-optimal convergence rate and no clear way of deriving the beneficial effects of parallel implementation. our approach remedies these shortcomings in the broader context of stochastic vis and in particular when it comes to stochastic policy evaluation. we developed a variety of simple td learning type algorithms motivated by its original version that maintain its simplicity, while offering distinct advantages from a non-asymptotic analysis point of view. we first provide an improved analysis of the standard td algorithm that can benefit from parallel implementation. then we present versions of a conditional td algorithm (ctd), that involves periodic updates of the stochastic iterates, which reduce the bias and therefore exhibit improved iteration complexity. this brings us to the fast td (ftd) algorithm which combines elements of ctd and our newly developed stochastic operator extrapolation method. for a novel index resetting stepsize policy ftd exhibits the best known convergence rate. we also devised a robust version of the algorithm that is particularly suitable for discounting factors close to 1.

the theory of drinfeld modules is remarkably similar to the
theory of abelian varieties, but their local monodromy behaves
differently and is poorly understood. in this talk i will present a
research program which aims to fully describe this monodromy. the
cornerstone of this program is a ``z-adic'' variant of grothendieck's
l-adic monodromy theorem.
\\
\\
the talk is aimed at a general audience of number theorists and
arithmetic geometers. no special knowledge of monodromy theory or
drinfeld modules is assumed.

in an srpt queue, the job with the shortest remaining processing time is served first, with preemption. the srpt scheduling rule is of interest due to its optimality properties; it minimizes queue length (number of jobs in system). however, even with markovian distributional assumptions on the processing times, an exact analysis is not possible. hence, approximations in the form of a fluid (functional law of large numbers) limit or a diffusion (functional central limit theorem) limit can provide insights into system performance. it was shown by gromoll, kruk and puha (2011) that, if the processing time distribution has unbounded support, then, under standard heavy traffic conditions, the diffusion limit of the queue length process is identically equal to zero. this exhibits the queue length minimization property of srpt in sharpest relief. it also demonstrates that the srpt queue length process is orders of magnitude smaller than the workload process in the diffusion limit. (the workload process tracks the time it will take the server to process the work associated with each job in system.) in this talk, we report on progress in characterizing this order of magnitude difference. we find that distribution dependent scaling must be used to obtain a nontrivial limit for the queue length and the associated measure valued state descriptor. the scaling captures the order of magnitude difference, and the nature of the limit is dependent on the tail decay of the processing time distribution.
\\
\\
this work is joint with sayan banerjee (unc) and amarjit budhiraja (unc).

the spreading behavior of new or invasive species is a central topic in ecology. the modeling of free boundary problems is widely studied to better understand the nature of spreading behaviors of new species. from mathematical modeling point of view, it is a challenge to perform numerical simulations of the free boundary problems, due to the moving boundaries, the topological changes, and the stiffness of the system.
\\
\\
our work is concerned with numerical simulations of the long-term dynamical behavior of invasive species modeled by reaction-diffusion equations with free boundaries. we develop a front-tracking method to track the locations of the moving boundary explicitly in one dimension and higher dimensions with spherical symmetry. in two dimensional cases, we employ the level set method to handle topological bifurcations. for single invasive species, we numerically analyze the spreading-vanishing dichotomy in the diffusive logistic model. various numerical experiments are presented in the two-dimensional spaces to show that the population range tend to be more and more spherical as time increases no matter what geometrical shape the initial population range has if the invasive species spreads successfully. for two invasive species in a weak-strong competition case, we examine how the long-time dynamics of the model changes as the initial functions are varies. specifically, we simulate the ``chase-and-run coexistence'' phenomenon by choosing the initial function properly. the spreading behavior under time-periodic perturbation of the environment is also considered in our work.

most of us learn about determinants in an algebra course, but they have important geometrical meanings. i'll explain a few instances of these in this talk.

curvature pinching theorems restrict the topology of smooth manifolds satisfying suitable curvature assumptions. in some situations the ricci flow can transform initial integral curvature bounds into later pointwise bounds and thereby extend pointwise to integral pinching results. i will first review $ l^p$ integral pinching theorems of gursky, hebey--vaugon, dai--wei--ye, and others, which all rely on supercritical powers p greater than n/2 or on chern--gauss--bonnet in dimension four. then i will discuss how stronger control of the sobolev inequality obtained using perelman's mu-functional can be used to address the critical case p=n/2, leading both to a generalization of previous results as well as to a separate pinching result in the asymptotically flat setting. some of the work presented is joint with guofang wei and rugang ye.

multiscale substitution tilings are a new family of tilings of euclidean space that are generated by multiscale substitution rules. unlike the standard setup of substitution tilings, which is a basic object of study within the aperiodic order community and includes examples such as the penrose and the pinwheel tilings, multiple distinct scaling constants are allowed, and the defining process of inflation and subdivision is a continuous one. under a certain irrationality assumption on the scaling constants, this construction gives rise to a new class of tilings, tiling spaces and tiling dynamical systems, which are intrinsically different from those that arise in the standard setup. in the talk i will describe these new objects and discuss various structural, geometrical, statistical and dynamical results. based on joint work with yaar solomon.

given the ubiquity of vector bundles, it is perhaps surprising that there are so many open questions about them -- even on projective spaces. in this talk, i will outline some results about vector bundles on projective spaces, including my ongoing work on complex rank 3 topological vector bundles on $cp^5$. in particular, i will describe a classification of such bundles which involves a connection to topological modular forms; a concrete, rank-preserving additive structure which allows for the construction of new rank 3 bundles on $cp^5$ from ``simple'' ones; and future directions related to this project.

in mip*$=$re the authors settle the cep in the negative by showing that two computational complexity classes are equal. but the heart of their argument is the construction of a synchronous game with certain properties. in this talk we will describe the theory of synchronous games, and show how our construction of the algebra of a game leads more directly to the cep. this approach to the cep still depends on their construction of a synchronous game with particular properties, but stays within the context of operator algebras and games.

as an independent mathematician, you want to determine which of your axioms are internally consistent. since you only have a finite amount of time, you may choose to come to this talk! i will be giving a countably long survey of results related to the axiom of choice. well, hopefully you find it a maximally useful way to spend your tuesday afternoon. (or maybe you won't not find it useful, depending on what you decide.)

let $v$ be a vector bundle over a smooth projective curve of rank $n$. we are interested in understanding the set of sub-bundles of rank $r$ with maximal degree. when we impose some numerical conditions, this set happens to be finite. in this talk, we will go over chronological developments in finding the number of maximal sub-bundles. surprisingly, these numbers are related to the gromov-witten invariants of grassmannian which are computed by the vafa-intriligator formula.

in this talk i will discuss certain singular (and degenerate) solutions to the kaehler ricci flow (krf) on smooth compact complex manifolds. algebraically this will correspond to solving the kahler ricci flow on a projective varieties with so called log canonical singularities. analytically this will correspond to solving a complex parabolic monge ampere equation on a smooth manifild, with degeneracies and singularities in the equation and possibly the initial condition. settings for this study include the analytic minimal model program via krf, pluri-potential theory and krf, the conical krk, and the flow of complete unbounded curvature metrics. our results will be discussed within each of these contexts.

this talk discusses multiple methods for clustering high-dimensional data, and explores the delicate balance between utilizing data density and data geometry. i will first present path-based spectral clustering, a novel approach which combines a density-based metric with graph-based clustering. this density-based path metric allows for fast algorithms and strong theoretical guarantees when clusters concentrate around low-dimensional sets. however, the method suffers from a loss of geometric information, information which is preserved by simple linear dimension reduction methods such as classic multidimensional scaling (cmds). the second part of the talk will explore when cmds followed by a simple clustering algorithm can exactly recover all cluster labels with high probability. however, scaling conditions become increasingly restrictive as the ambient dimension increases, and the method will fail for irregularly shaped clusters. finally, i will discuss how a more general family of path metrics, combined with mds, give low-dimensional embeddings which respect both data density and data geometry. this new method exhibits promising performance on single cell rna sequence data and can be computed efficiently by restriction to a sparse graph.

the mod p cohomology of locally symmetric spaces for definite
unitary groups at infinite level is expected to realize the mod p local
langlands correspondence for $gl_n$. in particular, one expects the
(component at p) of the associated galois representation to be
determined by cohomology as a smooth representation. i will describe how
one can establish this expectation in many cases when the local galois
representation is fontaine-laffaille.
\\
\\
this is joint work with d. le, s. morra, c. park and z. qian.

deciding nonnegativity of real polynomials is a key
question in real algebraic geometry with crucial importance in
polynomial optimization. it is well-known that in general this problem
is np-hard, therefore one is interested in finding sufficient conditions
(certificates) for nonnegativity, which are easier to check. since the
19th century, sums of squares (sos) are a standard certificate for
nonnegativity, which can be detected by using semidefinite programming
(sdp). this sos/sdp approach, however, has some issues, especially in
practice if the problem has many variables or high degree.
in this talk i will introduce sums of nonnegative circuit polynomials
(sonc). sonc polynomials are certain sparse polynomials having a special
structure in terms of their newton polytopes and supports and serve as a
nonnegativity certificate for real polynomials, which is independent of
sums of squares. i will present some structural results of sonc
polynomials and i will provide an overview about polynomial optimization
via sonc polynomials.

we consider the construction of a polygon $p$ with $n$ vertices whose turning angles at the vertices are given by a sequence $a=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$,
for $i\in\{0,\ldots, n-1\}$.
\\
\\
the problem of realizing $a$ by a polygon can be seen as that of constructing a straight-line drawing of a graph with prescribed angles at vertices, and hence, it is a special case of the well studied problem of constructing an \emph{angle graph}.
\\
\\
in 2d, we characterize sequences $a$ for which every generic polygon $p\subset \mathbb{r}^2$ realizing $a$ has at least $c$ crossings, for every $c\in \mathbb{n}$, and describe an efficient algorithm that constructs, for a given sequence $a$, a generic polygon $p\subset \mathbb{r}^2$ that realizes $a$ with the minimum number of crossings.
\\
\\
in 3d, we describe an efficient algorithm that tests whether a given sequence $a$ can be realized by a (not necessarily generic) polygon $p\subset \mathbb{r}^3$, and for every realizable sequence the algorithm finds a realization.

the variational implicit solvent model (vism) is a theoretical and computational framework for studying bimolecular systems with complex topology. central in vism is an effective free-energy of all possible interfaces separating solutes (e.g., proteins) from solvent (e.g., water). such a functional can be minimized numerically by a level-set method to determine the stable equilibrium conformations and solvation free energies. in this talk we introduce two numerical methods related to vism. the first one is the compact coupling interface method (ccim), which is a finite difference method for elliptic interface problems with accurate gradient approximation. the second one is the binary level set-vism, which is coupled with the monte carlo method to simulate the binding of biomolecules.

please join the division of physical sciences for a virtual public lecture presented by the 2019-20 lattimer fellows: rommie amaro (chemistry and biochemistry), suckjoon jun (physics), and bo li (mathematics).
\\
\\
the george w. and carol a. lattimer faculty research fellowship seeks to stimulate thought about avenues of productive scientific exploration that may result from unique fusions and collaborations and promotes cross-collateral work between scientists and non-scientists at uc san diego.
\\
\\
learn more about this opportunity and hear from past fellows about their research made possible through this fellowship.

we give an overview of dimensionality reduction methods, or sketching, for a number of problems in optimization, first surveying work using these methods for classical problems, which gives near optimal algorithms for regression, low rank approximation, and natural variants. we then survey recent work applying sketching to column subset selection, kernel methods, sublinear algorithms for structured matrices, tensors, trace estimation, and so on. the focus in the talk will be on fast algorithms.