it has been more than a hundred years since the appearance of the landmark 1907 paper by
erhard schmidt where he introduced a method for finding an orthonormal basis for the span of a set of linearly independent vectors. this method has since become known as the classical gram-schmidt process (cgs). in this talk we present a survey of the research on gram-schmidt orthogonalization, its related qr factorization, and the algebraic least squares problem.

we begin by reviewing the two main versions of the gram-schmidt process and the related qr factorization and we briefly discuss the application of these concepts to least squares problems. this is followed by a short survey of eighteenth and nineteenth century papers on overdetermined linear systems and least squares problems. we then examine the original orthogonality papers of both gram and schmidt.

the second part of the talk focuses on such issues as the use of gram-schmidt orthogonalization for stably solving least squares problems, loss of orthogonality, and reorthogonalization. in particular, we focus on noteworthy work by ake bjorck and heinz rutishauser and discuss later results by a host of contemporary authors.

*s. j. leon, ake bjorck and walter gander are co-authors of the paper
gram-schmidt orthogonalization: 100 years and more,
numer. linear algebra appl (2013)
this talk is to a large part based on that paper

we investigate the asymptotic behavior of the free path of a variable density random flight model in an external field as the initial velocity of the particle goes to infinity. the random flight models we study arise naturally as the boltzmann-grad limit of a random lorentz gas in the presence of an external field. by analyzing the time duration of the free path, we obtain exact forms for the asymptotic mean and variance of the free path in terms of the external field and the density of scatterers. as a consequence, we obtain a diffusion approximation for the joint process of the particle observed at reflection times and the amount of time spent in free flight. this is based on joint work with doug rizzolo and eric wayman.

in many real-world statistical problems, we observe a large number of potentially explanatory variables of which a majority portion may be irrelevant. for this type of problems, controlling the false discovery rate (fdr) guarantees that most of the discoveries are truly explanatory and thus replicable. in this talk, we propose a novel method named slope to control the fdr in sparse high-dimensional linear regression. this computationally efficient procedure works by regularizing the fitted coefficients according to their ranks: the higher the rank, the larger the penalty. this is in analogy with the benjamini-hochberg procedure, which compares more significant p-values with more stringent thresholds. whenever the columns of the design matrix are not strongly correlated, we show empirically that slope obtains fdr control at a reasonable level while offering substantial power. we also apply this procedure to a population cohort in finland with the goal of identifying relevant genetic variants to fasting blood high-density lipoprotein levels.

although slope is developed from a multiple testing viewpoint, we show the surprising result that it achieves optimal squared errors under gaussian random designs over a wide range of sparsity classes. an appealing feature is that slope does not require any knowledge of the degree of sparsity. this adaptivity to unknown sparsity has to do with the fdr control, which strikes the right balance between bias and variance. the proof of this result presents several novel elements not found in the high-dimensional statistics literature.

the subject of cauchy-riemann geometry (shortly: cr-geometry), founded in the research of henri poincare, is remarkable in that it lies on the border of several mathematical disciplines, among which we emphasize complex analysis and geometry, differential geometry, and partial differential equations. recently, in our research, we have discovered a new face of cr-geometry. this is a novel approach of interpreting objects arising in cr-geometry (called cr-manifolds) as certain dynamical systems, and vice versa. it turns out that geometric properties of cr-manifolds are in one-to-one correspondence with that of the associated dynamical systems. in this way, we obtain a certain vocabulary between the two theories. the latter approach has enabled us recently to solve a number of long-standing problems in cr-geometry. it also has promising applications for dynamical systems. we call this method the cr (cauchy-riemann manifolds) - ds (dynamical systems) technique.

in this talk, i will outline the cr - ds technique, and describe its recent applications to complex geometry and dynamics.

let $\beta\equiv \beta^{(m)} = \{\beta_{i}\}_{i\in \mathbb{z}_{+}^{n},
|i|\le m}$, $\beta_{0}>0$, denote a real $n$-dimensional multisequence of degree $m$
and let $k$ denote a closed subset of $\mathbb{r}^{n}$.
the
\textit{truncated $k$-moment problem} concerns the existence of a
\textit{$k$-representing measure} for $\beta$, i.e.,
a positive borel measure $\mu$, supported in $k$, such that
\begin{equation}
\beta_{i} = \int_{k} x^{i}d\mu ~~~~~~~~( i\in \mathbb{z}_{+}^{n},~~|i|\le m).
\end{equation}
let $\mathcal{p}_{m} := \{p\in \mathbb{r}[x_{1},\ldots,x_{n}]: ~~deg~p\le m\}$.
we associate to
$\beta$
the \textit{riesz functional} $l_{\beta}:\mathcal{p}_{m} \mapsto \mathbb{r}$ defined by
$l_{\beta}(\sum a_{i}x^{i}) = \sum a_{i}\beta_{i}$. the existence of
a $k$-representing measure implies that $l_{\beta}$ is \textit{$k$-positive},
i.e., if $p\in \mathcal{p}_{m}$ satisfies $p|k\ge 0$, then $l_{\beta}(p)\ge 0$.
in the \textit{full $k$-moment problem} for $\beta \equiv \beta^{(\infty)}$, a classical
theorem of m. riesz ($n=1$) and e.k. haviland $(n>1$) shows that $\beta$ has a
$k$-representing measure if and only if $l_{\beta}$ is $k$-positive. in the
truncated $k$-moment problem, the direct analogue of riesz-haviland is not true.
we discuss the gap between $k$-positivity and the existence of $k$-representing measures,
with reference to tchakaloff's theorem, approximate $k$-representing measures,
a ``truncated" riesz-haviland theorem due to curto-f., a ``strict" k-positivity
existence theorem of f.-nie, and recent results concerning the \textit{core variety} of a
multisequence.

a well-known principle in symplectic geometry says that information about the smooth structure on a manifold should be captured by the symplectic geometry of its cotangent bundle. one prominent example of this is nadler and zaslow's microlocalization correspondence, an equivalence between a category of constructible sheaves on a manifold and a symplectic invariant of its cotangent bundle called the fukaya category.

the goal of this talk is to describe a model for a relative version of this story in the simplest case, corresponding to legendrian knots in the standard contact 3-space. this construction, called the
augmentation category, is a powerful invariant which is defined in terms of holomorphic curves but can also be described combinatorially. i will describe some interesting properties of this category and relate it to a category of sheaves on the plane. this is joint work with lenny ng, dan rutherford, vivek shende, and eric zaslow.

the langlands program is an intricate network of conjectures, which are meant to connect different areas of mathematics, such as number theory, harmonic analysis and representation theory. one striking consequence of the langlands program is the ramanujan conjecture, which is a statement purely within harmonic analysis, about the growth rate of fourier coefficients of modular forms. it turns out to be intimately connected to the weil conjectures, a statement about the cohomology of projective, smooth varieties defined over finite fields.

i will explain this connection and then move towards a mod p analogue of these ideas. more precisely, i will explain a strategy for understanding torsion occurring in the cohomology of locally symmetric spaces and how to detect which degrees torsion will contribute to. the main theorem is
joint work with peter scholze and relies on a p-adic version of hodge theory and on recent developments in p-adic geometry.

i will explain a new construction and characterization of the $p$-adic local langlands correspondence for $\mathrm{gl}_2(\mathbb{q}_p)$. this is joint work with emerton, gee, geraghty, pa\v{s}k\={u}nas and shin and relies on the taylor-wiles patching method and on the notion of projective envelope.

please note the unusual time for this week's seminar (10:00 am).

i will give a brief introduction to hodge theory with some examples of how it is used to study algebraic varieties.

the interface between protein solute and aqueous solvent exhibits complex geometries, and can undergo conformational changes by combined influences from electrostatic force, surface tension, and hydrodynamic force. to understand the role of solvent stokes flow in this process, we develop a dynamic implicit solvent model (dism). based on this model, we first analytically study the linear stability of a cylindrical solute-solvent interface, where the asymptotic dispersion relation reveals a power law. moreover, we develop a computational method to simulate the solvent stokes flow and the interface motion. the key components of our fluid solver are a virtual node method, a pressure poisson equation, a specially designed boundary condition, the schur complement method and the least square technique. level set method is used for the interface motion. we present some 3d numerical results to demonstrate the accuracy and convergence of our method, and show interesting dynamics of protein conformational change.

we will discuss three stories revolving around convex programming. the first is of a new algorithmic framework for a century old problem in physics called phase retrieval, which involves recovering
vectors from quadratic measurements and naturally connects to questions in quantum mechanics and theoretical cs. the second is on recovering the 3d structure of a scene from a collection of images, a fundamental task in computer vision which requires algorithms that are robust to a large fraction of arbitrary corruptions in the input data. lastly, we will present new non-convex guarantees for solving certain semidefinite programs quickly by exploiting parsimony in their solutions.

we will discuss some new density results about the $2$-primary part of
class groups of quadratic number fields and how they fit into the framework
of the cohen-lenstra heuristics. let $\mathrm{cl}(d)$ denote the class
group of the quadratic number field of discriminant $d$. the first result
is that the density of the set of prime numbers $p\equiv -1\bmod 4$ for
which $\mathrm{cl}(-8p)$ has an element of order $16$ is equal to $1/16$.
this is the first density result about the $16$-rank of class groups in a
family of number fields. the second result is that in the set of
fundamental discriminants of the form $-4pq$ (resp. $8pq$), where $p\equiv
q \equiv 1\bmod 4$ are prime numbers and for which $\mathrm{cl}(-4pq)$
(resp. $\mathrm{cl}(8pq)$) has $4$-rank equal to $2$, the subset of those
discriminants for which $\mathrm{cl}(-4pq)$ (resp. $\mathrm{cl}(8pq)$) has
an element of order $8$ has lower density at least $1/4$ (resp. $1/8$). we
will briefly explain the ideas behind the proofs of these results and
emphasize the role played by general bilinear sum estimates.
\newline\newline

note: the speaker will give a prep-talk for graduate 2022年亚洲世界杯预选赛 in
ap&m 7421 at 1:15pm. all graduate 2022年亚洲世界杯预选赛 interested in number theory
are strongly encouraged to attend.

the dynamics of complex biological systems is often driven by multiscale, rare but important events. in this talk, i will introduce the numerical methods for computing transition states, and then give two examples in distinct biological systems: one is a multiscale stochastic model to investigate a novel noise attenuation mechanism that relies on more noises in different cellular processes to coordinate cellular decisions during embryonic development; the other is a phase field model to study the neuroblast delamination in drosophila.

symplectic geometry has recently emerged as a key tool in the study of low-dimensional topology. one approach, championed by arnol'd, is to examine the topology of a smooth manifold through the symplectic geometry of its cotangent bundle, building on the familiar concept of phase space from classical mechanics. i'll describe a way to use this approach to construct a rather powerful invariant of knots called "knot contact homology", and discuss its properties. if time permits, i'll also outline a surprising connection to string theory and mirror symmetry.

i will discuss gromov's non squeezing theorem in symplectic topology,
the notion of gromov radius, and the notion of monotonic symplectic invariant
due to ekeland and hofer. then i will report on recent progress in the subject,
concerning the relations of these results to the existence of symplectic embeddings.

starting from basic principles, we will present some recent developments in the theory of rough paths and in the theory of sub-riemannian diffusions. the first part of the talk will be devoted to the theory of rough paths. this theory was developed in the 1990s by t. lyons, and allows to give a sense to solutions of differential equations driven by irregular paths. the theory itself has nothing to do with probability theory but has had a tremendous impact on several recent developments in stochastic analysis; it served as an inspiration to hairer’s regularity structure theory, for which he was awarded the fields medal in 2014. in the second part of the talk, we will address several problems in the geometric analysis of some sub-riemannian manifolds, which can (surprisingly) be solved using diffusion semigroups techniques.

inspired by the recent developments and mature understanding of the notion of lower-boundedness of ricci curvature in continuous settings (such as riemannian manifolds), several independent groups of researchers have proposed intriguing analogs of such a curvature in discrete settings (such as graphs). the proposals depend on the perspective being probabilistic, analytical or combinatorial. in this talk, i will briefly mention a few of these approaches, consequences, and state some open problems.

i will present applications involving interfaces and consider how different points of view lead to numerical methods for capturing their motions.

we construct a functor from the category of $p$-adic local systems on a smooth rigid analytic variety $x$ over a $p$-adic field to the category of vector bundles with a connection on $x$, which can be regarded as a first step towards the sought-after $p$-adic riemann-hilbert
correspondence. as a consequence, we obtain the following rigidity theorem for $p$-adic local systems on a connected rigid analytic variety: if the stalk of such a local system at one point, regarded as a $p$-adic galois representation, is de rham in the sense of fontaine, then the stalk at every point is de rham. along the way, we also establish some results about the $p$-adic simpson correspondence. finally, we give an application of our results to shimura varieties. joint work with xinwen zhu.

to every action, there is an equal and opposite reaction. however, there turn out to exist in nature situations where the reaction seems neither equal in magnitude nor opposite in direction to the action. we will see a variety of table-top demos and experimental movies, apparently in more and more violation of newton's 3rd law, and give a full analysis of what is happening, discovering in the end that these phenomena are in a sense generic. the keys are shock, singular material property, and supply of `critical geometry'.

the interpretation of experiments is complicated when the outcome of an experimental unit depends not only on its assigned treatment but also on interference from other units. here, we extend the potential outcomes framework of causal inference without such interference between units (rubin, 1974) in order to define and assess causal effects. when two units cannot interfere with each other, then one unit's treatment assignment only affects that unit's outcome. however, when two units can interfere with each other, then one unit's treatment assignment generally affects both of their outcomes. furthermore, the interference can depend on units' characteristics and the treatment assignment itself, and is often only partially revealed. our analysis of data generated by such situations uses both bayesian and frequentist ideas to test sharp null hypotheses about causal effects. in particular, to assess causal effects we model and estimate the interference between units as a network, and develop novel testing procedures that involve repeated sampling of the treatment assignment under constraints from the network topology and the tested hypothesis. we illustrate our causal framework in applications where such forms of interference are ubiquitous but currently not adequately addressed.

i will describe two classes of gluing constructions for minimal surfaces in the 3-sphere; both generate sequences of minimal embeddings converging to singular configurations of multiple clifford tori. one class, an extension of the clifford torus doubling of kapouleas and yang (2010), produces minimal embeddings each of which resembles a stack of approximate clifford tori connected by many small catenoidal tunnels arranged doubly periodically on the tori. the other class (joint work with kapouleas) yields examples which resemble multiple clifford tori intersecting along certain great circles, except that neighborhoods of the intersection circles have been replaced by approximate karcher-scherk towers so that the resulting surfaces are smoothly embedded. all these constructions proceed by first building a surface that is only approximately minimal but possesses the other desired properties and then finding a graph over this initial surface which is exactly minimal. this last step is accomplished by solving the relevant pde, whose linearization has small eigenvalues that require special attention.

adaptive mesh refinement (amr) algorithms are one of two necessary tools
for grand challenging problems in scientific computing. reliability of computer
simulations is responsible for accurate computer predictions/designs. efficient and reliable a posteriori error estimation are, respectively, the key for success of amr algorithms and the reliability of computer predictions/designs.

since babuska's pioneering work in 1976, the a posteriori error estimation has been extensively studied, and impressive progress has been made during the past four decades. however, due to its extreme difficulty, this important research field of computational science and engineering remains wide open. in this talk, i will describe (1) basic principles of the a posteriori error estimation techniques for finite element approximations to partial differential equations and (2) our recent work.

the exponential growth of massive data streams is everywhere, and has been attracting increasing interest. in addition to size, the complexity is certainly an important issue. to handle this kind of datasets, of particular importance is an adaptive model, as well as innovative acquisition of intrinsic features/structure hidden in the massive data-sets. in this talk, i will discuss how to apply the knowledge from differential geometry to model and analyze massive datasets in
different fields. in particular, i will discuss algorithms like graph connection laplacian and vector diffusion maps, and their theoretical justification based on the spectral geometry. i will also discuss at least one of the following applications: cryo-electron microscope, phase retrieval, vector nonlocal mean and f wave analysis.

the wrapping transformation is easily seen to intertwine convolutions of probability measures on the real line and the circle. it is also easily seen to not transform additive free convolution into the multiplicative one. however, we show that on a large class l of probability measures on the line, wrapping does transform not only the free but also boolean and monotone convolutions into their multiplicative counterparts on the circle. this allows us to prove various identities between multiplicative convolutions by simple applications of the additive ones. the restriction of the wrapping to l has several other unexpected nice properties, for example preserving the number of atoms. this is joint work with octavio arizmendi.

i will introduce framework for computationally restrictive statistical analysis. i will focus on usefulness of non-asymptotic analysis and linearization techniques for quantifying uncertainty of estimation in complex datasets.

jean-marc fontaine has shown that there exists an equivalence of categories between the category of continuous $\mathbb{z}_p$-representations of a given galois group and the category of \'{e}tale $(\phi,\gamma)$-modules over a certain ring. we are interested in the question of whether there exists a theory of $(\phi,\gamma)$-modules for the lubin-tate tower. we construct this tower via the rings $r_n$ which parametrize deformations of level $n$ of a given formal module. one can choose prime elements $\pi_n$ in each ring $r_n$ in a compatible way, and consider the tower of fields $(k'_n)_n$ obtained by localizing at $\pi_n$, completing, and passing to fraction fields. by taking the compositum $k_n = k_0 k'_n$ of each field with a certain unramified extension $k_0$ of the base field $k'_0$, one obtains a tower of fields $(k_n)_n$ which is strictly deeply ramified in the sense of anthony scholl. this is the first step towards showing that there exists a theory of $(\phi,\gamma)$-modules for this tower.

in this talk we will introduce the notions of formal modules and their deformations, strictly deeply ramified towers of fields, and $(\phi,\gamma)$-modules, and sketch the proof that the lubin-tate tower is strictly deeply ramified.

i'll explain kontsevich's approach, using gelfand-fuchs cohomology, to constructing characteristic classes of flat symplectic bundles. this can be used to talk about rozansky-witten invariants of holomorphic symplectic manifolds and construct cohomology classes on the moduli space of curves.

i will discuss several recent results on abstract homomorphisms between the groups of rational points of algebraic groups. the main focus will be on a conjecture of borel and tits formulated in their landmark 1973 paper. our result settle this conjecture in several cases; the proofs make use of the notion of an algebraic ring. i will conclude by discussing several applications to character varieties of finitely generated groups and group actions.

for the pre-talk: i will recall some basic concepts from the theory of algebraic groups and outline a general philosophy for the study of rigidity phenomena between the groups of rational points of algebraic groups.

during my talk i will concentrate on the current status and ongoing work on the following:

1) doubling constructions for minimal surfaces: i will first discuss the general motivation and framework and i will mention briefly the earlier work in [kapouleas-yang: 2010] and work of david wiygul. i will then concentrate on the ideas in [kapouleas: arxiv:1409.0226, 2014] and in particular i will present in some detail the linearized doubling methodology. i will also mention ongoing work and future possibilities.

2). desingularization constructions for minimal surfaces: i will first discuss the $o(2)$-invariant initial configuration case as in [kapouleas: jdg 1997]. i will then briefly discuss some recent constructions with more symmetry in various settings, including a current construction with martin li for free boundary minimal surfaces in the unit three-ball. i will outline and discuss extensions to less symmetric settings or settings without any symmetries as discussed in [kapouleas: clay proceedings, vol.2, 2005], [kapouleas: alm, vol 20, 2011], and further ongoing work.

3). i will discuss potential constructions for einstein four-manifolds and some related ancient solutions for the ricci flow as in [brendle-kapouleas: arxiv:1405.0056, 2014].

4). finally to the extent that time permits i will briefly discuss gluing constructions for special lagrangian cones as in [haskins-kapouleas: inventiones 2007] and [haskins-kapouleas: alm, vol.7, 2008]
and ongoing work, and also for cmc (hyper)surfaces in early work of mine and recent work with christine breiner [breiner-kapouleas: math. annalen 2014] and [breiner-kapouleas: preprint close to completion].

this talk introduces a two-grid and a bootstrap multigrid finite element approximations to the laplace-beltrami eigenvalue problem on closed surfaces. the latter can be viewed as a special case of the bamg (bootstrap algebraic multi-grid) framework applying on surface finite element method. nonlinear eigenvalue problems are solved in the enriched finite element space on coarse mesh, while on the fine mesh only linear problems are approximated. several interesting
phenomena for approximating eigenvalues with high multiplicity are shown comparing conventional two-grid/multigrid ideas with the new bootstrap multigrid methods. then some a posteriori error estimation technique for the multigrid iterate will be discussed which considers
how accurate the linear problems need to be approximated to guarantee the overall optimal rate of convergence.

the concept of the autoregressive (ar) sieve bootstrap is investigated for the case of spatial processes in $z^2$. this procedure fits ar models of increasing order to the given data and, via resampling of the residuals, generates bootstrap replicates of the sample. the paper explores the range of validity of this resampling procedure and provides a general check criterion which allows to decide whether the ar sieve bootstrap asymptotically works for a specific statistic of interest or not. the criterion may be applied to a large class of stationary spatial processes. as another major contribution of this paper, a weighted baxter-inequality for spatial processes is provided. this result yields a rate of convergence for the finite predictor coefficients, i.e. the coefficients of finite-order ar model fits, towards the autoregressive coefficients which are inherent to the underlying process under mild conditions. the developed check criterion is applied to some particularly interesting statistics like sample autocorrelations and standardized sample variograms. a simulation study shows that the procedure performs very well compared to normal approximations as well as block bootstrap methods in finite samples.
[joint work with carsten jentsch and jens-peter kreiss.]

there are many important and striking differences between classical complex analysis in one variable and complex analysis in several variables. in this talk, we will illustrate this by discussing just one such difference, the hartogs extension phenomenon. for example, if $d$ denotes the annular domain in $\mathbb c^n$ consisting of the unit ball $b$ minus the closed ball of radius ½, then any holomorphic function in $d$ extends holomorphically to the whole unit ball $b$ ... provided $n\geq 2$; it is clearly not true when $n=1$. this particular result can be proved by using the cauchy integral formula, but a proof that works in more general situations leads to a study of the $\bar \partial$ equation.

for any lie group $g$, we construct a $g$\--equivariant analogue of symplectic capacities and give examples when $g=\mathbb{t}^k\times\mathbb{r}^{d-k}$, in which case the capacity is an invariant of integrable systems. then we study the continuity of these capacities, using the natural topologies on the symplectic $g$\--categories on which they are defined.

this work is joint with alvaro pelayo and alessio figalli.

regularization and stabilization are vital tools for resolving the numerical and theoretical difficulties associated with ill-posed or degenerate optimization problems. broadly speaking, regularization involves perturbing the underlying linear equations so that they are always nonsingular. stabilization is designed to provide a sequence of iterates with fast local convergence, even when the gradients of the constraints satisfied at a solution are linearly dependent.

we discuss the crucial role of regularization and stabilization in the formulation and analysis of modern active-set and interior methods for nonlinear optimization. in particular, we establish the close relationship between regularization and stabilization and propose some new methods based on formulating an associated "simpler" optimization subproblem defined in terms of both the primal and dual variables of the original problem.

the notion of stable weak equivalence for actions on probability spaces has been introduced by kechris and studied by many other authors including abert, bowen, burton, elek, tucker-drob, and weiss. particularly, it was shown by bowen and tucker-drob that the space of stable weak equivalence classes of actions on the standard probability space of a fixed countable group is a metrizable simplex. in the amenable case, such a simplex coincides with the simplex of invariant random subgroups (irs) of the group. in joint work with burton, we initiated the study of stable weak equivalence for actions on the hyperfinite ii1 factor and, more generally, tracial von neumann algebras. in my talk i will provide an introduction to this subject, and present some of our new results.

abstract notions of measurement -- hilbert spaces, metric spaces, measure spaces -- most commonly use the real numbers as the associated measuring stick. in this talk i'll give an overview of some fun applications of more general ordered fields, namely in the areas of fractal geometry and integration theory, and discuss a few notable obstacles and moral guidelines for future use.

google lives on data. search, ads, youtube, maps - they all live on data. the talk will recount how google uses data and statistics, how google is always experimenting to make improvements (yes, this includes your searches!), and how google adapts statistical ideas to do things that have never been done before. (this is a nontechnical talk, also suitable for undergraduates.)

in this talk, we present some results originating from a new general inequality obtained by combining the chen–stein method with malliavin calculus on the poisson space, such as multidimensional poisson approximations, mixed limit theorems, as well as a characterization of asymptotic independence for u–statistics. applications to stochastic geometry through limit theorems involving the joint convergence of vectors of subgraph–counting statistics exhibiting both a poisson and a gaussian behavior will also be discussed.

at some point in graduate school, everyone encounters the rather abstract theorem that every compact topological group possess a unique translation-invariant probability measure, known as the haar measure. rarely, if ever, is the concrete problem of computing integrals under this measure addressed. i will explain an analogue of the fundamental theorem of calculus in this setting: a theorem which reduces the computation of a large class of group integrals to a symbolic problem. this symbolic problem can, in some important cases, be cleverly solved using techniques from algebraic combinatorics.

solvation plays a fundamental role in many biological processes including biomolecular recognition, protein-protein interactions, membrane assembly and many others. the variational implicit solvation method (vism) is currently developed to predict solvation free energies for systems of very complex topology, such as proteins. vism theoretical foundation makes it unique in that i) it couples hydrophobic, dispersion interactions and electrostatic effects into one functional, and ii) it produces the solvation surface as an output of the theory. this allows vism to capture more subtle solvation effects than do other implicit solvation methods. as we plan to expand vism applications to more challenging scenarios, coarse-graining the protein seems a good strategy to keep the computational cost low. in this work, we adapted vism to work with a well established coarse-grain forcefield for proteins and other biomolecules, martini. we then tested how coarse-grained martini-vism compares with (atomistic) vism for a set of six proteins that differ in shape, size and charge distribution. promising results suggest that coarse-graining the protein is indeed the right step to broaden vism applications in the near future.

let $c/\mathbb{q}$ be a curve of genus 3, given as a double cover of a
conic with no $\mathbb{q}$-rational points. such a curve is hyperelliptic
over the algebraic closure of $\mathbb{q}$ but does not have a
hyperelliptic model of the usual form over $\mathbb{q}$. we discuss an
algorithm that computes the local zeta functions
of $c$ simultaneously at all primes of good reduction up to a given
bound $n$ in time $(\log n)^{4+o(1)}$ per prime on average. it works
with the base change of $c$ to a quadratic field $k$, which has a
hyperelliptic model over $k$, and it uses a generalization of the
``accumulating remainder tree'' method to matrices over $k$. we briefly
report on our implementation and its performance in comparison to
previous implementations for the ordinary hyperelliptic case.

joint work with david harvey and andrew v. sutherland.

in the pre-talk, we will introduce some of the objects that the talk is
about, such as curves and their models, the zeta function and how it
relates to point counting, and the particular type of genus 3 curves
that we are interested in.

in this talk, i will propose a refinement of the langlands correspondence in the case of curves, or more generally symplectic galois representations. langlands conjectures that to such a representation one can attach a generic automorphic representation of an odd orthogonal group. i will show that every such representation has a distinguished line. the hope is that the properties of the resulting new form will make it easier to test the general conjecture computationally.

a classical result of skolem, mahler, and lech asserts that a linearly recurrent sequence taking values in a field of characteristic zero has the property that its zero set is a finite union of one-way infinite arithmetic progressions along with a finite set. in positive characteristic, examples due to lech show that this conclusion does not hold. for years the problem of finding a positive characteristic analogue was open until it was solved by derksen in 2005. we describe extensions of derksen's work involving finite-state machines and explain how these extensions allow one to effectively solve many classes of diophantine problems in positive characteristic.

tia is an aspiring globetrotter with a simple method of exploration: she walks straight ahead. suppose tia is randomly dropped on the surface of a unknown planet, which she investigates using her simple strategy. what will tia get to see as she travels along the geodesic she is on? the answer to this question depends on the geometry of the surface she is on, and it can be partially addressed by studying the relationship between the curvature of a surface and the dynamics of its geodesic flow. in this talk, i will state a motivating set of results concerning the relationship between geometry and dynamics, discuss more recent work in this area, and show pictures of some surfaces whose geodesic flows have surprising dynamical properties.

twisted calabi-yau algebras are a class of algebras with nice behavior regarding their hochschild cohomology. they include many classes of examples of recent interest, for example artin-schelter regular algebras. we discuss in particular the theory of twisted calabi-yau algebras of low global dimension which are factors of path algebras of quivers q. for example, we have preliminary results regarding the following question: for which quivers q does there exists a twisted calabi-yau algebra of dimension 3 which is a factor of the path algebra of q?

for the pre-talk: we will give an introduction to some techniques from homological algebra, in particular hochschild cohomology, which are relevant for the talk.

halmos once described problems and their solutions as “the heart of mathematics”. following this line of thinking, one might naturally ask: “what, then, is the heart of problems?” in this talk, i attempt to answer this question using techniques from statistics, information visualization, and machine learning. i begin the journey by cataloging the features of problems delineated by the mathematics and mathematics education communities. these dimensions are explored in a large data set of 2022年亚洲世界杯预选赛 working thousands of problems at the art of problem solving, an online company that provides adaptive mathematical training for 2022年亚洲世界杯预选赛 around the world. to increase the number of features of mathematical problems that can be studied, this quantitative exploration is partnered with a qualitative analysis that involves human scoring of 105 problems and their solutions. using correlation matrices, principal components analysis, and clustering techniques, i explore the relationships among those features frequently discussed in mathematics problems (e.g., difficulty, creativity, novelty, affective engagement, authenticity). along the way, i define a new set of uncorrelated features in problems and use these as the basis for a new mathematical problem typology (nmpt). grounded in the terminology of classical music, the nmpt works to quickly convey the essence and value of a problem, just as terms like “etude” and “mazurka” do for musicians.

in this talk we will review the paper "linear algebra algorithms as dynamical systems" by moody t. chu. many iterative methods in numerical linear algebra can be re-interpreted from a dynamical systems viewpoint. this vantage point can provide new insight into old algorithms and potentially guide the construction of new methods. in addition to some numerical demonstrations, we will ponder what impact structure-preserving algorithms can have on the field of numerical linear algebra.

i will talk about my recent work with erik carlsson in which we studied certain symmetric functions associated to dyck paths. for each dyck path from (0,0) to (n,n) the corresponding symmetric function is a generating function of labelings of the positions 1,2,...,n by positive integers. each labeling is counted with a weight which depends on whether labels on positions i,j are in the correct or reversed order and whether (i,j) is above or under the path. while studying these symmetric functions we discovered an interesting algebraic structure that controls them. this ultimately led us to a proof of the shuffle conjecture by haglund, haiman, loehr, remmel, and ulyanov.

as in the riemannian setting, a subriemannian heat kernel is controlled by the geometry of the underlying manifold. in particular, the asymptotic behavior of the kernel can reveal certain geometric and topological data. we study the logarithmic derivatives of subriemannian heat kernels in some cases and show that, under appropriate scaling, they converge to their analogues on stratified groups. this gives one quantification of the now standard idea that stratified groups play the role of the tangent space to subriemannian manifolds.

this is joint work with joshua campbell.

i will give a brief introduction to orbit equivalence theory. this aims at studying the orbit structure of measure preserving actions of countable groups.

a crowning achievement of number theory in the 20th century is a theorem of wiles which states that for an elliptic curve $e$ over $\mathbb{q}$ of conductor $n$, there is a non-constant map from the modular curve $x_0(n)$ to $e$. for some curve isogenous to $e$, the degree of this map will be minimal; this is the modular degree. the jacquet-langlands correspondence allows us to similarly parameterize elliptic curves by shimura curves.
in this case we have several different shimura curve parameterizations for a given isogeny class. further, this generalizes to elliptic curves over totally real number fields. in this talk i will discuss these degrees and i compare them with $d$-new modular degrees and $d$-new congruence primes. this data indicates that there is a strong relationship between shimura degrees and new modular degrees and congruence primes.

i will discuss the special properties of differential forms on symplectic manifolds. i will show how the presence of a symplectic structure leads naturally to a-infinity algebra structures and hence also cohomology rings of differential forms. these cohomology rings are novel symplectic invariants and i will describe some of their interesting properties and applications.

rivin conjectured that the formal conjugacy growth series of a hyperbolic group is rational if and only if the group is virtually cyclic. in this talk, i will present a proof of rivin's conjecture and supporting evidence for the analogous statement for acylindrically hyperbolic groups. the class of acylindrically hyperbolic groups is a wide class of groups that contains (among many other examples) the outer automorphism groups of free groups and the mapping class groups of hyperbolic surfaces. this is a joint work with laura ciobanu.

for the pre-talk: hyperbolic groups will be defined and it will be explained why the generating function of the sequence counting the number of elements of length n is rational.

in this talk, we compare and contrast a few finite element h-adaptive and hp-adaptive algorithms. we test these schemes on three example pde problems and we utilize and evaluate an a posteriori error estimate.

in the process, we introduce a new framework to study adaptive algorithms and a posteriori error estimators. our innovative environment begins with a solution u and then uses interpolation to simulate solving a corresponding pde. as a result, we always know the exact error and we avoid the noise associated with solving.

using an effort indicator, we evaluate the relationship between accuracy and computational work. we report the order of convergence of different approaches. and we evaluate the accuracy and effectiveness of an a posteriori error estimator.

let $k$ be a field with a valuation $v$. given a projective variety $x$ over $k$, we can associate an analytification $x^{an}$ with respect to $v$ called the berkovich space. these spaces appear in various contexts, such as tropical geometry and number theory. more recently there have appeared surprising connections between berkovich geometry and birational geometry. i will give a brief overview of berkovich spaces with examples, and describe how the birational geometry of $x$ is reflected in the geometry of the associated berkovich space.

let g be a finitely generated subgroup of gl(n,q). under certain algebraic conditions, strong approximation describes the
closure of g with respect to its congruence topology. super-approximation essentially tells us how dense g is in its closure! here is my plan for this talk:

1. i will start with the precise formulation of this property.

2. some of the main results on this subject will be mentioned.

3. some of the (unexpected) applications of super-approximation will be mentioned, e.g. banach-ruziewicz problem, orbit equivalence rigidity, variation of galois representations.

4. some of the auxiliary results that were needed in the proof of super-approximation will be mentioned: sum-product phenomena, existence of small solutions

this talk will begin with an introduction to one of the fundamental stochastic processes in probability theory, brownian motion. next comes a constrained version, called reflected brownian motion, a process arising as a diffusion limit of stochastic networks and of interacting particle models in statistical physics. this leads to many mathematical questions, some of which we shall see in the talk.

quaternion algebras contain quadratic field extensions of the center. given two algebras, a natural question to ask is whether they share a common field extension. this gives us an idea of how closely related those algebras are to one another. if the center is of characteristic 2 then those extensions divide into two types - the separable type and the inseparable type. it is known that if two quaternion algebras share an inseparable field extension then they also share a separable field extension and that the converse is not true. we shall discuss this fact and its generalization to p-algebras of arbitrary prime degree.

this talk is intended for those who, like the speaker, have at some point wondered whether there is a theory of three- or higher-dimensional matrices that parallels matrix theory. a $d$-dimensional hypermatrix may be viewed as a coordinate representation of an order-$d$ tensor but we will explain why it is not quite the same. we discuss how notions like rank, norm, determinant, eigen and singular values may be generalized to hypermatrices. we will see that, far from being artificial constructs, these notions have appeared naturally in a wide range of applications and can be enormously useful.

let $p_{\hbar}$ and $q_{\hbar}$ be momentum and position operators
respectively. in 1973, hepp showed the classical limit and quantum
correction of an observable $e^{i(rq_{\hbar}+sp_{\hbar})}$ under
the evolution generated by a hamiltionian
\[
h_{\hbar}=-\frac{\hbar}{2m}\partial^2+v\left(\sqrt{\hbar}x\right)
\]
on all state $\psi\in l^{2}\left(\mathbb{r}\right)$ in the classical
limit for quantum mechanical correclation functions. in contrast to
the hepp' s result, in our talk, we are interested in unbounded ``observables''
and more general hamiltionians. motivated by the idea in quantum fluctuations
and rate of convergence towards mean field dynamics by rodnianski
and schlein in 2009. classical mechanics can be recovered from quantum
mechanics by studying the asymptotic behavior of quantum expectations
relative to $\sqrt{\hbar}.$

a semitoric helix is a generalization of the notion of a toric fan for the case in which the acting torus is lower dimensional. the goal of this talk is to characterize the minimal models that can be obtained from a semitoric helix by a finite sequence of blowdowns. as a tool towards this end we produce a standard form for elements of $\mathrm{psl}_2(\mathbb{z})$.

this is an expository talk focused on the ideas involved in moser's theorem for volume forms, and its subsequent generalizations
by greene and shiohama.

for a non-degenerate integral quadratic form $f(x_1, \dots , x_d)$ in 5 (or more) variables, we prove an optimal strong approximation theorem. fix any compact subspace $\omega\subset\mathbb{r}^d$ of the affine quadric $f(x_1,\dots,x_d)=1$. suppose that we are given a small ball $b$ of radius $0<r<1$ inside $\omega$, and an integer $m$. further assume that $n$ is a given integer which satisfies $n\gg(r^{-1}m)^{4+\epsilon}$ for any $\epsilon>0$. finally assume that we are given an integral vector $(\lambda_1, \dots, \lambda_d) $ mod $m$. then we show that there exists an integral solution $x=(x_1,\dots,x_d)$ of $f(x)=n$ such that $x_i\equiv \lambda_i \text{ mod } m$ and $\frac{x}{\sqrt{n}}\in b$, provided that all the local conditions are satisfied. we also show that 4 is the best possible exponent. moreover, for a non-degenerate integral quadratic form $f(x_1, \dots , x_4)$ in 4 variables we prove the same result if $n\geq (r^{-1}m)^{6+\epsilon}$ and some non-singular local conditions for $n$ are satisfied. based on some numerical experiments on the diameter of lps ramanujan graphs, we conjecture that the optimal strong approximation theorem holds for any quadratic form $f(x)$ in 4 variables with the optimal exponent $4$.

we prove that the volume of a free boundary minimal surface $\sigma^k \subset b^n$ where is a geodesic ball in hyperbolic space $h^n$ is bounded from below by the volume of a geodesic k-ball with the same radius as $b^n$. more generally, we prove analogous results for the case where the ambient space is conformally euclidean, spherically symmetric, and the conformal factor is nondecreasing in the radial variable. these results follow work of brendle and fraser-schoen, who proved analogous results for surfaces in the unit ball in $r^n$. this is joint work with brian freidin.

this talk gives an overview of recent progress made in the design and analysis of algebraic multigrid methods. the focus is on the setup algorithm that automatically constructs the multilevel hierarchy used in the solve phase. a sharp two-grid theory is introduced and then used to derive various quality measures of the coarse spaces constructed by the setup algorithm, based on the ideas of compatible relaxation, a related identity that assumes the use of the so-called ideal interpolation operator, and an optimal form of classical algebraic multigrid interpolation that gives the best possible two-grid convergence rate. various numerical results are presented to illustrate these theoretical results. as a test problem, we focus on a finite volume discretization of a scalar diffusion problem with highly varying (discontinuous) diffusion coefficient.

heat kernel measure $k(t, i, a) da$ on positive hermitian $nxn$ matrices is a probability measure whose large $n$ limit is important for several different types of problems in mathematical physics. my talk introduces a new application: to random kahler metrics on any kahler manifold. the pair correlation function of random metrics is explicitly calculated for each $n$. the large $n$ asymptotics are closely related to zero sets of random holomorphic functions.

the goal of the talk is to give some idea of what the all-important langlands program is all about, and it is aimed
at a general audience with no or limited experience in number theory. for $gl(2)$ we will illustrate these ideas by discussing the case of elliptic curves and modular forms, which led to a proof of fermat's last theorem! we will then try to give a flavor of what's expected for $gl(n)$, and point to how the so-called p-adic langlands program was envisaged. this ties up with the number theory topics class offered in the spring quarter.

let $a$ be an abelian variety defined over a number field $k$ that is isogenous over an algebraic closure to the power of an
elliptic curve $e$. if $e$ does not have cm, by results of ribet and elkies concerning fields of definition of $k$-curves, $e$ is isogenous to an elliptic curve defined over a polyquadratic extension of $k$. we show that one can adapt ribet's methods to study the field of definition of $e$ up to isogeny also in the cm case. we find two applications of this analysis to the theory of sato-tate groups of abelian surfaces: first, we show that 18 of the 34 possible sato-tate groups of abelian surfaces over $\mathbb{q}$, only occur among at most 51 $\overline{\mathbb{q}}$-isogeny classes of abelian surfaces over $\mathbb{q}$; second, we give a positive answer to a question of serre concerning the existence of a number field over which abelian surfaces
can be found realizing each of the 52 possible sato-tate groups of abelian surfaces. this is a joint work with xevi guitart.

preparatory talk: in the preparatory talk i plan to review very briefly basic definitions concerning abelian varieties necessary to
introduce (in the main talk) the notion of abelian $k$-variety. i will also present the (general) sato-tate conjecture and show how it
motivates the problem considered in the main talk.

the numerical solution of high frequency wave propagation has been a longstanding challenge in computational science and engineering. this talk addresses this problem in the time-harmonic regime. we consider a sequence of examples with important applications, and for each we construct an efficient preconditioner (approximate inverse) that allows one to solve the system with a small number of iterations. from these examples emerges a new framework, where sparsity, geometry of wave phenomenon, and highly accurate discretizations are combined together to address this challenging topic.

alvarez-gaumé gave arguments based on path integrals in supersymmetric quantum mechanics for index theorems including the gauss-bonnet-chern, hirzebruch, and atiyah-singer theorems. in this talk, i summarize these heuristic arguments, and describe a new construction of path integrals. this is also a new construction of the heat kernel for a generalized laplacian, and leads to rigorous path-integral proofs of these index theorems.

supercurves are the simplest class of complex super manifolds, "one-dimensional" in some sense and thus analogs of riemann surfaces. i will describe a remarkable duality between pairs of super curves that generalizes serre duality for riemann surfaces. self-dual super curves are precisely the "super riemann surfaces" introduced by physicists in connection with string theory. i'll suggest connections between this duality and the classical duality between points and hyperplanes in projective space. no prior knowledge of supergeometry is required.

it was shown by bessis that the hurwitz action is transitive on minimum-length reflection factorizations of a coxeter element in a finite coxeter group. in this talk, i'll explain how to extend bessis's result to longer factorizations, showing that two factorizations of a coxeter element into an arbitrary number of reflections lie in the same orbit under the hurwitz action if and only if they use the same multiset of conjugacy classes. the proof makes use of a surprising lemma about the acuteness structure of minimal dependent sets in root systems. this work is joint with vic reiner.

we will discuss the common submanifolds of two hermitian symmetric spaces. in particular, we proved that the euclidean space and a bounded symmetric domain cannot share a common submanifold. this is based on the joint work with professor x. huang.

the problem of understanding the local geometry of cr embedded submanifolds in cr manifolds arises naturally in several complex variables analysis, e.g., in the study of isolated singularities of analytic varieties (via their links). significant work has been done on this in connection with rigidity phenomena and the classification of proper holomorphic mappings between balls. we develop from scratch a cr invariant local theory based on the cr tractor calculus associated to the chern-moser-cartan connection. this produces the tools for constructing local invariants and invariant operators in a way parallel to the classical gauss-codazzi-ricci calculus for riemannian submanifolds.

turan-type problems in graph theory ask how many edges a graph may have if a certain subgraph is forbidden. one can think of this as an optimization problem, as one is maximizing the global condition of number of edges subject to the local constraint that there is no forbidden subgraph. problems in combinatorial number theory ask one to deduce properties of a set of (for example) integers while knowing only how large the set is. we study the connection between these two seemingly disjoint areas. graphs coming from finite projective planes are intimately related to both areas.

i will survey some aspects of the theory of noncommutative completely positive kernels, which are the generalization of usual positive kernels to the setting of free noncommutative function theory. i will then use the language of noncommutative completely positive kernels to discuss the noncommutative generalizations of the interpolation and realization theorems for the schur-agler class. this is a joint work with j. ball and g. marx.

the complex hessian equation is a class of important fully nonlinear geometric elliptic equations which can be viewed as an intermediate case between the laplacian equations and the complex monge-ampere equations. in this talk, we will talk about some a priori estimates for a complex hessian equation motivated from fu-yau’s generalization of the strominger system. this is a joint work with d. phong and s. picard.

in this talk we discuss the possible closures of geodesic planes in a hyperbolic 3-manifold m. when m has finite volume shah and ratner (independently) showed that a very strong rigidity phenomenon holds, and in particular such closures are always properly immersed submanifolds of m with finite area. manifolds with infinite volume, however, are far less understood and are the main subject of this talk. this is based on a joint ongoing work with c. mcmullen and h. oh.

integrable systems are, roughly, dynamical systems with many conserved quantities.
recently, pelayo-v\~{u} ng\d{o}c classified semitoric integrable
systems, which generalize toric integrable systems in dimension four,
in terms of five symplectic invariants. using this
classification, i construct a metric on the space of
semitoric integrable systems.
by studying continuous paths in this space produced via symplectic blowups
i determine its connected components.
this uses a new algebraic technique in which i
lift matrix equations from $\mathrm{sl}(2,\mathbb{z})$ to
its preimage in the universal cover of $\mathrm{sl}(2,\mathbb{r})$ and
i further use this technique to completely classify all semitoric
minimal models.
i also produce invariants of integrable systems by constructing
an equivariant version of the ekeland-hofer
symplectic capacities
and, as a first step towards a metric on general integrable systems,
i provide a framework to study convergence properties of families of maps
between manifolds which have distinct domains.

this work is partially joint with \'alvaro pelayo, daniel m. kane, and alessio figalli.

graduate student career advisor, giulia hoffmann, will provide information on the variety of career options for math/csme 2022年亚洲世界杯预选赛 , as well as the resources and events available through the career services center to help graduate 2022年亚洲世界杯预选赛 find the right career match.

statistical latent class models are widely used in social and psychological researches, yet it is often difficult to establish the identifiability of the model parameters. this talk will focus on a class of restricted latent class models with binary responses. this
class of models have recently gained great interests in psychological and educational measurement, psychiatry and many other research areas, where a classification-based decision needs to be made about an individual’s latent traits, based on his or her observed responses. the model parameters are usually restricted via a pre-specified matrix to reflect the diagnostic assumptions on the latent traits. in this talk, i will first give an introduction to such restricted latent class models, followed by discussions on key issues and challenges. i will then present some fundamental identifiability results and specify which types of the restriction matrices would ensure the estimability of the model parameters. these identifiability conditions not only lead to the consistency and asymptotic normality of the maximum likelihood estimators, but also provide a guideline for the related experimental design, whereas in the current applications the design is usually experience based and identifiability may not be guaranteed.

drinfeld level structures are a key concept in the arithmetic study of the moduli of elliptic curves. they also play an important role in the moduli of 1 dimensional p-divisible groups, and related shimura varieties studied by harris and taylor. i'll explain why drinfeld level structures (and the related "full set of sections" defined by katz and mazur) are not adequate for studying more general shimura varieties. i'll discuss two examples of a satisfying theory of level structure outside the drinfeld case: i) full level structures on the group $\mu_p x \mu_p$; ii) $\gamma_1(p^r)$-type level structures on an arbitrary p-divisible group (joint work with r. kottwitz).

this is a talk for a general audience. let $g$ be a complex lie group and let $q$ be a stein manifold (closed complex submanifold of some $\bbb c^n$). suppose that $x$ and $y$ are holomorphic principal $g$-bundles over $q$ which admit an isomorphism $\phi$ as topological principal $g$-bundles. then the famous oka principle of grauert says that there is a homotopy $\phi_t$ of topological isomorphisms of the principal $g$-bundles $x$ and $y$ with $\phi_0=\phi$ and $\phi_1$ biholomorphic. we prove generalizations of grauert's oka principle in the following situation: $g$ is reductive, $x$ and $y$ are stein $g$-manifolds whose (categorical) quotients are biholomorphic to the same stein space $q$.

we give an application to the holomorphic linearization problem. let $g$ act holomorphically on $\bbb c^n$. when is there a biholomorphic map $\phi\colon \bbb c^n \to \bbb c^n$ such that $\phi^{-1} \circ g \circ \phi \in \rm{gl}(n,c)$ for all $g \in g$? we describe a condition which is necessary and sufficient for ``most" $g$-actions.

this is joint work with f. kutzschebauch and f. larusson.

let $k$ be a compact lie group and $v$ a unitary $k$-module. let $\mu\colon v\to \frak k^*$ be the associated moment mapping and let $m_0$ denote the quotient of $\mu^{-1}(0)$ by $k$. this is the (symplectic) quotient associated to the $k$-action. now $k$ is a real algebraic subgroup of the unitary group of $v$ and its complex points are a complex reductive subgroup $g$ of $\rm{gl}(v)$. we recall the invariant theory quotient $v{/\!\!/} g$ associated to the $g$-action, and the fact that $v{/\!\!/} g$ is homeomorphic to $m_0$. this fact is enormously useful.

the simplest kinds of symplectic quotients are those of the form $w/h$ where $w$ is a unitary $h$-module and $h$ is finite. let $\dim k>0$. for $k$-modules $v$ which are ``small,'' there are examples of isomorphisms of $m_0$ with some $w/h$. we show that for most $k$-modules, there can be no such isomorphism. we give necessary and sufficient conditions for such isomorphisms for $k=s^1$ and $k=\rm{su}(2,\bbb c)$.

this is joint work with h.-c. herbig and c. seaton.

phase retrieval is a non-convex inverse problem arising in many practical applications, such as diffraction imaging and speech recognition. more precisely, we seek to recover a signal of interest from its intensity measurements with respect to some measurement frame. in practice, phaseless measurements with respect to a gabor frame are relevant for many applications. we are going to describe the idea of a reconstruction algorithm for the case of gabor measurements, and then show how geometric properties of the measurement frame, such as projective uniformity and flatness of the vector of frame coefficients, are related to the robustness of the presented algorithm.

the circular beta ensemble is a family of random unitary matrices whose eigenvalue distribution plays an important role in statistical physics. the spectral measure is a canonical way of describing the unitary matrix that takes into account the full operator, not just its eigenvalues. when the matrix is infinitely large (i.e. an operator on some infinite-dimensional hilbert space) the spectral measure is supported on a fractal set and has a rough geometry on all scales. this talk will describe the analysis of these fractal properties. joint work with raoul normand and balint virag.

in 2012 it was conjectured by emerton and helm that the local langlands correspondence for $gl(n)$ of a $p$-adic field should interpolate in $\ell$-adic families, where $\ell$ is a prime different from $p$. recently, helm showed that the conjecture follows from the existence of an appropriate map from the integral bernstein center to a galois deformation ring. in this talk we will present recent work (joint with david helm) showing the existence of such a map and describing its image.

the boolean pythagorean triples problem has been a long-standing open problem in ramsey theory: can the set $n = {1,2,3,…}$ of natural numbers be partitioned into two parts, such that neither part contains a triple $(a, b, c)$ with $a^2 + b^2 = c^2$ ? a prize for the solution was offered by ron graham over two decades ago. we show that such a partition is possible for the set
of integers in $[1,7824]$, but that it is not possible for the set of integers in $[1,m]$ for any $m > 7824$. of course, it is completely infeasible to attempt prove this directly by examining all $2^m$ possible partitions of $[1,m]$ when $m = 7825$, for example. we solve this problem by using the cube-and-conquer paradigm, a hybrid sat method for hard problems, employing both look-ahead and cdcl solvers. an important role is played by dedicated look-ahead heuristics, which indeed allowed us to solve the problem on a cluster with 800 cores in about 2 days. due to the general interest in this mathematical problem, our result requires a formal proof. exploiting recent progress in unsatisfiability proofs of sat solvers, we produced and verified a proof in the drat format, which is almost 200 terabytes in size. from this we extracted and made available a compressed certificate of 68 gigabytes, that allows anyone to reconstruct the drat proof for checking. these techniques show great promise for attacking a variety of similar computational problems arising in combinatorics and computer science.

toric varieties are ubiquitous in algebraic geometry. they have a rich combinatorial structure, and give the simplest examples of log
calabi-yau varieties.

we give a simple criterion for characterizing when a log calabi-yau pair is toric, which answers a case of a conjecture of shokurov.

this is joint work with james mckernan, roberto svaldi, and runpu zong.

many recent results in the theory of measure preserving group actions and equivalence relations that do not {\it a priori} involve von neumann algebras were obtained using von neumann algebraic techniques. this talk will focus on further examples of this phenomenon in two directions. first, we study unique factorization for products of measure preserving equivalence relations $\mathcal{r}_1 \times \mathcal{r}_2 \times \cdots \times \mathcal{r}_k$. second, we will discuss a joint work with lewis bowen and adrian ioana, which concerns properties of general non-amenable groups and equivalence relations that can deduced from properties of a prototypical non-amenable group $\mathbb{f}_2$, the free group on two generators.

in this talk i would like to discuss the global rigidity property for local holomorphic maps from an open piece of a hermitian symmetric space $m$ into a cartesian product of $m$. this study has been related to problems in number theory in classifying the modular correspondences, as initated by the work of clozel-ullmo. we will
discuss the work of mok-ng on the rigidity pehomenon when the map is local area preserving and $m$ is of non-compact type. we then focus on our recent joint work with h. fang and m. xiao when $m$ is of compact type.

a solution to the unnormalized ricci flow equation is called immortal if it exists for all times $t > 0$. the asymptotic behavior of these solutions is in general much less understood than in the case of a finite time singularity. for instance, they might be collapsed, and they might also converge locally to non-gradient solitons, which cannot be detected using perelman's entropy functional. in this talk, we will show that for immortal homogeneous solutions of arbitrary dimension and isometry group, the flow subconverges (after parabolic rescaling) to an expanding homogeneous ricci soliton. we will also give further results in the special case of solvable lie groups. this is joint work with christoph bohm.

consider the defocusing quintic nonlinear schrodinger equation on $r^3$ with initial data in the energy space. this problem is "energy-critical" in view of a certain scaling invariance, which is a main source of difficulty in the analysis of this equation. it is a nontrivial fact that all finite-energy solutions scatter to linear solutions. we show that this remains true under small compact deformations of the euclidean metric.

molecular transport and interaction are of fundamental importance in biology and medicine. the spatiotemporal diffusion map can reflect the regulation of molecular interactions and their intracellular functions. to construction subcellular diffusion maps based on bio-imaging data, we explore a general optimization framework with diffusion equation constraints (opt-pde) and finite element discretization to enable the solution of a spatiotemporal and anisotropic diffusion map. we characterize the wellposedness and convergence property of the opt-pde solver and demonstrate its applicability in re-covering heterogeneous and anisotropic diffusion maps in bio-imaging. furthermore, to study molecular interactions based on live-cell imaging, we developed a correlative fret imaging microscopy (cfim) approach for the quantitatively analysis of subcellular coordination between the enzymatic activity and the structural focal adhesion (fa) dynamics. by cfim, we found that different fa subpopulations have distinct regulation mechanisms controlled by local kinase activity. therefore, our work highlights the importance of computational model-based analysis and its integration with bio-imaging.

this will be a panel discussion on the academic job search given by current 5th year graduate 2022年亚洲世界杯预选赛 . the panel will be interactive, so come prepared with questions!

a free spectrahedron d is the matricial solution set of a linear matrix inequality (lmi). thus , for some positive integer g, d is a subset of the union, over n, of g-tuples of n by n matrices. free spectrahedra arise naturally, in several contexts including model engineering problems and the the theory of operator systems and completely positive maps. we consider the problem of classifying, up to affine linear equivalence, free bianalytic mappings from one free spectrahedra d to another e. under some irreducibility inspired hypotheses on d, there are few such maps, d must support an underlying algebra/module structure and the map itself has a particularly pleasing form arising from this algebra/module structure. the work is joint with meric augat, bill helton and igor klep.

our variational implicit solvent model (vism) improves upon the conventional implicit-solvent model by implementing a physical molecular surface that is generated from minimizing the free energy between the solute and the solvent. the free energy includes both the solute-solvent electrostatic and the van der waals interactions, thus coupling the two types of interactions during the minimization process. here we apply vism to the calculation of the solvation free energy of realistic proteins. the vism results are compared to both the conventional implicit-solvent and the molecular dynamics (md) free energy perturbation results. it is shown that, without any parameter fitting, vism solvation free energy is closer to that of md comparing to the conventional implicit-solvent model.

i will review the quantization procedure of compact kahler manifolds (geometric quantization), and i will describe a way to associate quantum states to certain submanifolds. if time permits, i will explain how to compare two such states and give semiclassical estimates when the two submanifolds are lagrangians intersecting transversally.

quasisymmetric functions and symmetric functions are important tools in algebraic combinatorics, especially in representation theory. on the other side of combinatorics, pattern avoidance is a subject in enumerative combinatorics which focus on counting the number of combinatorial structures avoiding a certain collection of patterns. it turns out that those two not-so-related subjects have interesting connections. in this talk, we will first introduce symmetric functions and, quasisymmetric functions, and discuss known results. then, we will move on to basic definitions on pattern-avoiding permutations, as well as their known results. finally, we will explore the relationship between the two subjects.

random walks on groups and harmonic functions on groups are intimately related to stationary group actions, which are a generalization of measure preserving group actions. an important invariant of stationary group actions is their furstenberg entropy. the furstenberg entropy realization problem is the question of determining the range of possible entropy values realizable for a given random walk. the talk will include an introduction to this field, an overview of what (little) is known, and some new results.

tensor, or multiarrays with $d>=3$ indices, are ubiquitous in modern applications, mainly due to data explosion. while matrices, $d=2$, are well understood and widely used, tensors pose theoretical and numerical challenges. tensors also arise naturally in quantum physics, when dealing with d-particle systems. in this talk, for general mathematical audience, we will describe several fundamental results and problems in tensors: tensor ranks, low rank approximation of tensors, spectral and nuclear norm of tensors, and their relation to the entanglement and nonseparability in quantum information theory.

i'll start by explaining enough of the theory of supermanifolds to show that the de rham complex of an ordinary manifold should most naturally be interpreted as the ring of functions on its odd tangent bundle. (just this fact, to me, is enough to justify taking supergeometry very seriously!)

i'll then try to talk about some symplectic aspects of supergeometry - for example the quantization of odd symplectic vector spaces.

the first weyl algebra $a = k\langle x,y \rangle/(xy - yx - 1)$ is a well-studied noncommutative $\mathbb {z}$-graded ring. generalized weyl algebras, introduced by bavula, are a class of noncommutative $\mathbb {z}$-graded rings which generalize the weyl algebra. in this talk, we investigate the category of graded modules over certain generalized weyl algebras and construct commutative rings with equivalent graded module categories. along the way, we will learn about graded rings, noncommutative projective schemes, and how to do geometry without a geometric space.

we prove global well-posedness of the $(d+1)$-dimensional $(d\geq 4)$ massless maxwell-dirac equation in coulomb gauge for data with small scale-critical sobolev norm. a key step is to exploit (and justify) a deep analogy between maxwell-dirac and maxwell-klein-gordon (for which an analogous result was proved earlier by krieger-sterbenz-tataru), which says that the most difficult part of maxwell-dirac takes essentially the same form as maxwell-klein-gordon. this is a joint work with c. gavrus.

a new class of derivative-free optimization algorithms is developed to solve, with remarkable efficiency, a range of practical nonconvex optimization problems whose function evaluations are computationally (or experimentally) expensive. these new algorithms, which are provably convergent under the appropriate assumptions, are response surface methods which iteratively minimize metrics based on an interpolation of existing datapoints and a synthetic model of the uncertainty of this interpolant, which itself is built on the framework of a delaunay triangulation over the existing datapoints. unlike other response surface methods, our algorithms can employ any well-behaved interpolation strategy.

we read misspelled words all the time, yet somehow we often manage to make sense of them. coding theory deals with the design of error-correcting codes that do precisely this: take corrupted data and recover the original message. in this talk, we'll go on an adventure through the basics of codes, the types of errors that can be introduced, and some cool techniques to correct them. my talk will be mostly accurate, and by the end of it you should be able to correct any mistakes i've made.

over the past 25 years, catastrophe analytics has made a remarkable imprint on the insurance and greater financial markets. by applying probabilistic modeling practices to an ever-advancing technological ecosystem, catastrophe modelers can provide the means to efficiently trade risk, which facilitates an acceleration of capital into risk-bearing markets. the study of hurricane andrew, northridge earthquake, 9/11, hurricane katrina, joplin tornado and other recent disasters both inform model calibration and steer the economy toward increased resilience in an uncertain world. graduates in mathematics are currently in high-demand in this industry to fill positions in what is a young and growing profession.

in 2013, kobayashi proved an analogue of perrin-riou's p-adic gross-zagier formula for supersingular primes. in this talk, we will explain an extension of kobayashi's result to the lambda-adic setting. the main formula is in terms of plus/minus heegner points up the anticyclotomic tower, and its proof, rather than on calculations inspired by the original work of gross-zagier, is via iwasawa theory, based on the connection between heegner points, beilinson-flach elements, and different p-adic l-functions. (joint work in progress with xin wan.)

in recent years, there have been major breakthroughs on the topic of super-approximation for algebraic groups, which is a qualitative version of strong approximation. super-approximation has proven to be incredibly useful in many areas of both pure and applied mathematics. we discuss the difficulties of super-approximation in positive characteristic, as well as recent new results for absolutely almost simple groups over $k(t)$, where $k$ is a finite field.

we study the spectrum of complete non-compact manifolds with bounded curvature and positive injectivity radius. we give general conditions which imply that their essential spectrum has an arbitrarily large finite number of gaps. as applications, we construct metrics with an arbitrarily large finite number of gaps in its essential spectrum on non-compact covering of a compact manifold and complete non-compact manifold with bounded curvature and positive injectivity radius.this is a joint work with richard schoen.

in this talk i will present a recent proof of a conjecture of c. villani, namely the exponential convergence of solutions of spatially inhomogeneous boitzmann equations, with hard sphere potentials, to some equilibriums, called maxwellians.

uncertainty quantification seeks to provide a quantitative means to understand complex systems that are impacted by uncertainty in their parameters. the polynomial chaos method is a computational approach to solve stochastic partial differential equations (spde) by projecting the solution onto a space of orthogonal polynomials of the stochastic variables and solving for the deterministic coefficients. polynomial chaos can be more efficient than monte carlo methods when the number of stochastic variables is low, and the integration time is not too large. when performing long-term integration, however, achieving accurate solutions often requires the space of polynomial functions to become unacceptably large. this talk will introduce alternative approach, where sets of empirical basis functions are constructing by examining the behavior of the solution for fixed values of the random variables. the empirical basis functions are evolved over time, which means that the total number of basis functions can be kept small, even when performing long-term integration.

we will prove the cayley-hamilton theorem for commutative rings in an elementary/remarkable way. this is an exposition of a paper by howard straubing.

i will talk about the conjecture of hausel, letellier and villegas, which gives precise predictions for mixed hodge polynomials of character varieties. in certain specializations this conjecture also computes hurwitz numbers, kac's polynomials of quiver varieties, and zeta functions of moduli spaces of higgs bundles. the subject is at an exciting intersection of number theory, algebraic geometry, combinatorics and mathematical physics, and is an area of active research. the talk is deemed as an introduction for a general audience. if time permits, i will explain my recent results in this area.

k3 surfaces are two dimensional calabi-yau manifolds. their moduli space is
of interest in algebraic geometry, but also has connections with number
theory and string theory. i will discuss ongoing joint work with alina
marian and rahul pandharipande aimed at studying the tautological ring of
the moduli space of k3 surfaces. in particular, i will discuss different
notions of tautological classes. next, i will explain a method of deriving
relations between tautological classes via the geometry of the relative
quot scheme.

the proof of fermat's last theorem established a deep relation
between elliptic curves and modular forms, mediated by an equality of
l-functions (which are analogous to the riemann zeta function). the
common ground is galois representations, and wiles' overall strategy
was to parametrize their deformations via algebras of hecke
operators. in higher rank the global langlands conjecture posits a
correspondence between n-dimensional galois representations arising
from the cohomology of algebraic varieties and certain so-called
automorphic representations of $gl(n)$, which belong in the realm of
harmonic analysis. there is a known analogue over local fields (such
as the p-adic numbers $q_p$) and one of the key desiderata is
local-global compatibility. this naturally leads one to speculate
about the existence of a finer "p-adic" version of the local langlands
correspondence which should somehow be built from a "mod p" version
through deformation theory. over the last decade this picture has been
completed for $gl(2)$ over $q_p$, and extending it to other groups is a
very active research area. in my talk i will try to motivate these
ideas, and eventually focus on deformations of smooth representations
of $gl(n)$ over $q_p$ (or any p-adic reductive group). it seems to be an
open problem whether universal deformation rings are noetherian in
this context. at the end we report on progress in this direction
(joint with julien hauseux and tobias schmidt). the talk only assumes
familiarity with basic notions in algebraic number theory.

this presentation will focus on (1) teaching positions in community colleges and (2) tenure-track faculty positions in universities. the tenure system (as practiced at ucsd) will also be explained.

bonus: a guest has been invited to talk firsthand about the experience of recently becoming a tenure-track faculty member at a research university.

we classify reflection groups in riemannian manifolds with non negative sectional curvature. this is a joint work with karsten grove.

the symmetric function operator, nabla, introduced by bergeron and garsia (1999), has many astounding combinatorial properties. the (recently proven) shuffle conjecture of haglund, haiman, loehr, remmel, and ulyanov (2005) relates nabla en to parking functions. the rational compositional shuffle conjecture of the author, bergeron, garsia, and xin (2015) relates a whole family of operators (closely linked to nabla) to rational parking functions. in (2007), loehr and warrington conjectured a relationship between nabla pn and preference functions. we prove this conjecture and provide another combinatorial interpretation in terms of parking functions. this new formula reveals a connection between nabla pn and an operator appearing in the rational compositional shuffle conjecture at $t = 1/q$.

nonlinear constrained optimization problem can be effectively solved by
minimizing a sequence of unconstrained or linearly constrained
subproblems, where the augmented lagrangian function plays a vital role.
this talk introduces a generalized hestenes-powell augmented lagrangian
function, which can be seen as a continuum of many well-known methods as
specific cases. a new primal dual sequential quadratic programming (pdsqp)
method will be given for minimizing the given augmented lagrangian

the gaussian distribution---which may be the center of a majority of statistical applications and research---will be introduced. we will focus on an interesting phenomenon on the maximum of a sequence of gaussian variables, and a direct application to human genome research will be displayed.

in 2008, oded schramm asked the following question: for what values of k and q does there exist a stationary, k-dependent sequence of random variables with values in {1,2,...,q} assigning different values to consecutive integers? schramm proved a number of results related to this question, and speculated about what the answer might be in general. as it turns out, the truth is quite different from his informed guess. this is joint work with a. e. holroyd.

given a graph, perform the following randomized coloring procedure to it: pick an edge at random and with probability $p$ color the end vertices of that edge blue; otherwise color them red. repeat indefinitely, choosing the edges with replacement. this induces a random walk in the space of all red/blue colorings of the graph, which converges to a stationary distribution. in this talk we will study this stationary distribution for the complete graph with the goal of getting jay a phd.

calcium is critical to a wide range of physiological processes, including neurological function, immune responses, and muscle contraction. calcium-dependent signaling pathways enlist a variety of proteins and channels that must rapidly and selectively bind calcium against thousand-fold higher cationic concentrations. frequently these pathways further require the co-localization of these proteins within specialized subcellular structures to function properly. our lab has developed multi-scale simulation tools to elucidate how protein structure and co-localization facilitate intracellular calcium signaling. developments include combining molecular simulations with a statistical mechanical model of ion binding, a homogenization theory to upscale molecular interactions into micron-scale diffusion models, and reaction-diffusion simulations that leverage sub-micron microscopy data. in this seminar, i will describe these tools and their applications toward molecular mechanisms of calcium-selective recognition and cross-talk between co-localized calcium binding proteins inside the cell.

schreieder recently introduced a class of smooth projective varieties that have unexpected hodge numbers. we investigate the geometry of these varieties and show how, in dimension two, these varieties may in fact be realized as elliptic modular surfaces.

semitoric integrable systems, or semitoric manifiolds, have been completely classified in terms of five symplectic invariants, but there are properties of these systems which, while encoded in the invariants, are not easy to extract. in this talk i introduce a new invariant of semitoric systems which we call a semitoric helix and i outline its constrction. using this invariant we are able to see clearly the effect of a semitoric blowdown/blowup on the system. we are then able to completely classify minimal semitoric manifolds; those that do not admit a semitoric blowdown. this work is joint with alvaro pelayo and daniel m. kane.

finite element methods are numerical methods that approximate solutions to
pdes using piecewise polynomials on a mesh representing the problem
domain. adaptive finite element methods are a class of finite element
methods that selectively refine specific elements in the mesh based on
their predicted error. in order to establish the viability of an afem, it
is essential to know whether or not that method can be proven to converge.
in this talk i will present a general framework that would establish
convergence for an afem and apply the framework to specific problems.

special values of zeta functions have been around for a very long time, and yet are still quite mysterious. once the basic theory of the riemann zeta function has been established, i will introduce the dedekind zeta function along with ties between special values and algebraic k-theory.

processor sharing is a mathematical idealization of round-robin scheduling algorithms commonly used in computer time-sharing. it is a fundamental example of a non-head-of-the-line service discipline. for such disciplines, it is typical that any markov description of the system state is infinite dimensional. due to this, measure-valued stochastic processes are becoming a key tool used in the modeling and analysis of stochastic network models operating under various non-head-of-the-line service disciplines.

in this talk, we discuss a new approach to studying the asymptotic behavior of fluid model solutions (formal functional law of large numbers limits) for critically loaded processor sharing queues. for this, we introduce a notion of relative entropy associated with measure-valued fluid model solutions. this approach is developed with idea that similar notions involving relative entropy may be helpful for understanding the asymptotic behavior of critical fluid model solutions for stochastic networks operating under protocols naturally described by measure-valued processes.

we show that the $\phi$-selmer ranks of twists of an elliptic curve $e$ with a point of order two are distributed like the ranks of random groups in a manner consistent with the philosophy underlying the cohen-lenstra heuristics.

if $e$ has a point of order two, then the distribution of $dim_{\mathbb{f}_2} \operatorname{sel}_\phi{(e^d/{\mathbb{q}})} - dim_{\mathbb{f}_2} \operatorname{sel}_{\hat\phi}{(e^{\prime d}/{\mathbb{q}})}$ tends to the discrete normal distribution $\mathcal{n}(0,\frac{1}{2} \log \log x)$ as $x \rightarrow \infty$. we consider the distribution of $dim_{\mathbb{f}_2} \operatorname{sel}_\phi{(e^d/{\mathbb{q}})} - dim_{\mathbb{f}_2} \operatorname{sel}_{\hat\phi}{(e^{\prime d}/{\mathbb{q}})}$ has a fixed value $u$.

we show that for every $r$, the limiting probability that $dim_{\mathbb{f}_2} \operatorname{sel}_\phi{(e^d/{\mathbb{q}})}= r$ is given by an explicit constant $\alpha_{r,u}$ introduced in cohen and lenstra's original work on the distribution of class groups.

symmetry, and the study of invariant and equivariant objects, is a deep and unifying principle underlying a variety of mathematical fields. in particular, geometric mechanics is characterized by the application of symmetry and differential geometric techniques to lagrangian and hamiltonian mechanics, and geometric integration is concerned with the construction of numerical methods with geometric invariant and equivariant properties. computational geometric mechanics blends these fields, and uses a self-consistent discretization of geometry and mechanics to systematically construct geometric structure-preserving numerical schemes.

in this talk, we will introduce a systematic method of constructing geometric integrators based on a discrete hamilton's variational principle. this involves the construction of discrete lagrangians that approximate jacobi's solution to the hamilton-jacobi equation. jacobi's solution can be characterized either in terms of a boundary-value problem or variationally, and these lead to shooting-based variational integrators and galerkin variational integrators, respectively. we prove that the resulting variational integrator is order-optimal, and when spectral basis elements are used in the galerkin formulation, one obtains geometrically convergent variational integrators.

we will also introduce the notion of a boundary lagrangian, which is analogue of jacobi's solution in the setting of lagrangian pdes. this provides the basis for developing a theory of variational error analysis for multisymplectic discretizations of lagrangian pdes. equivariant approximation spaces will play an important role in the construction of geometric integrators that exhibit multimomentum conservation properties, and we will describe two approaches based on spacetime generalizations of finite-element exterior calculus, and geodesic finite-elements on the space of lorentzian metrics.

originally, groups emerged in mathematics as structures describing the symmetries of all kinds of objects. nowadays we of course also have an abstract definition of a group. it is this abstract description that recently has been exploited to generalize things to the notion of so-called quantum groups. once a good definition of a quantum group was established, people tried to reverse the process and see quantum groups as describing “symmetries”of various objects.

in this talk we will 1) try to understand the definition of a (compact) quantum group, 2) discuss several examples, and 3) see how we can define quantum symmetry groups via actions of quantum groups on various spaces.

everybody is welcome! necessary background beyond undergraduate analysis and algebra will be provided during the talk.

perfectoid spaces were introduced to provide a geometric framework to the field of norms isomorphism from $p$-adic hodge theory, however, have proven their value well beyond this old result. for this reason, the geometry of perfectoid spaces is worth
studying, for its own sake. in this talk, we explicitly compute the picard group for the projectivoid line.

with the desire to generalize this result to other perfectoid spaces, as well as to classify higher-rank vector bundles on these $p$-adic analytic spaces, we ask whether an appropriate gaga theorem holds for perfections of proper schemes over a base nonarchimedean field of characteristic $p >0$.

the log-sobolev inequality (lsi) is a very useful tool for analyzing high-dimensional situations. for example, the lsi can be used for deriving hydrodynamic limits, for estimating the error in stochastic homogenization, for deducing upper bounds on the mixing times of markov chains, and even in the proof of the poincaré conjecture by perelman. for most applications, it is crucial that the constant in the lsi is uniform in the size of the underlying system. in this talk, we discuss when to expect a uniform lsi in the setting of unbounded spin systems.

accurate simulations of elasticity properties can be constructed by solving second order elliptic boundary value problems which have been approximated using finite elements. this talk will examine the process of converting the given pde into a weaker form and applying the galerkin method. in addition, novel matlab programs will be introduced, which will display a visual depiction of an object after force is applied, given a subdivision of the shape into regular or irregular triangles, a dirichlet boundary condition, and a two dimensional force function.

while the sequence of primes is very well distributed in the reduced residue classes (mod q), the distribution of pairs of
consecutive primes among the permissible pairs of reduced residue classes (mod q) is surprisingly erratic. we propose a conjectural explanation for this phenomenon, based on the hardy-littlewood conjectures, which fits the observed data very well. we also study the distribution of the terms predicted by the conjecture, which proves to be surprisingly subtle. this is joint work with kannan soundararajan.

a tensor is a vector that lies in a tensor product of vector spaces. the rank of a tensor t is the smallest integer r such that t can be written as a sum of r pure tensors. finding such low rank decompositions of a tensor t is known as the parafac model. this model has many applications: algebraic complexity theory, chemometrics, neuroscience, signal processing to name a few. an alternative is the convex decomposition (code) model. it uses the nuclear norm of tensors and is more numerically stable. we will discuss upper and lower bound for the rank and nuclear norm of some tensors of interest, and some applications.

supercurves are the simplest class of complex supermanifolds, “one-dimensional” in some sense and thus analogs of riemann surfaces. i will describe a remarkable duality between pairs of supercurves that generalizes serre duality for riemann surfaces. self-dual supercurves are precisely the “super riemann surfaces” introduced by physicists in connection with string theory. i’ll suggest connections between this duality and the classical duality between points and hyperplanes in projective space. no prior knowledge of supergeometry is required.
(this is a continuation of the talk i gave earlier this quarter, and will begin with a review of that talk.)

during the last 20 years, it was realized that certain combinatorial objects (combinatorial hopf algebras, to be precise) underly many mathematical theories. the talk will survey some of these developments, and then focus largely on two of the most emblematic and universal such objects, namely the higher algebraic structures that can be constructed out of permutations, and out of surjections.

the link is made through the notion of special poset (equivalent to labelled poset of stanley): linear extensions of a poset can be seen as bijections, while the generating function of a poset p with respect to stanley's classical definition of p-partitions associated to a special poset is a quasi-symmetric: in fact, it is a homomorphism between the hopf algebra of labelled posets and that of quasi-symmetric functions; while linearisation is a homomorphism onto the hopf algebra of permutations.

the aim is to generalize this frame to preorders, which are in one-to-one correspondence with finite topologies: the objects corresponding to bijections are surjections: they can be seen as linear extensions of a preorder and are encoded by packed words. we can hence define the notion of t-partitions associated to a finite topology t, and deduce a hopf algebra morphism from a new hopf algebra on topologies to the hopf algebra of packed words.

this is joint work with l. foissy and f. patras.

crystals are colored directed graphs encoding information about lie algebra representations. kirillov-reshetikhin (kr) crystals correspond to certain finite-dimensional representations of affine lie algebras. i will present a combinatorial model which realizes tensor products of (column shape) kr crystals uniformly across affine types. some computational applications are discussed. a corollary states that the macdonald polynomials (which generalize the irreducible characters of semisimple lie algebras), upon a certain specialization, coincide with the graded characters of tensor products of kr modules. the talk is largely self-contained, and is based on a series of papers with a. lubovsky, s. naito, d. sagaki, a. schilling, and m. shimozono.

explicit constructions of einstein metrics and various generalizations have long been a central problem in differential geometry. i will present a unified description, in the toric framework, for constructing the page einstein metric, the koiso-cao ricci soliton, and the lu-page-pope quasi- einstein metrics on the first del pezzo surface. the existence of quasi-einstein metrics on toric fano manifolds is in general open; our constructions yield some insight into the potential form of such metrics. numerical evidence for the existence of such metrics on the second del pezzo surface will also be outlined, as well as future plans to construct a rigorous proof. this is all joint with s. hall, and partly joint with w. bataat and a. jizany.

we will prove that an einstein manifold with positive isotropic curvature has constant sectional curvature.

this study revisits the canadian traveller problem (ctp), which finds applications to dynamic navigation systems. given a road network $g=(v,e)$ with a source $s$ and a destination $t$ in $v$, a traveller knows the entire network in advance, and wishes to travel as quickly as possible from $s$ to $t$, but discovers online that some roads are blocked (e.g., by snow or accidents) once reaching them. the objective is to derive an adaptive strategy so that its competitive ratio, which compares the distance traversed with that of the static shortest $s,t$-path in hindsight, is minimized. this problem was initiated by papadimitriou and yannakakis in 1991. they proved that it is pspace-complete to obtain an algorithm with a bounded competitive ratio. furthermore, if at most $k$ roads can be blocked, then the optimal competitive ratio for a deterministic online algorithm is $2k+1$, while the only randomized result known is a lower bound of $k+1$.

in this study, we show for the first time that a polynomial time randomized algorithm can beat the best deterministic algorithms, surpassing the $2k+1$ lower bound by an $o(1)$ factor. moreover, we prove the randomized algorithm achieving a better $(1.7k +1)$-competitive ratio in pseudo-polynomial time.

we will present a version of bony's strong maximum principle for degenerate pdes. we will mainly discuss the proof and its applications in studying rigidity problems in geometry.

the talk mainly concerns the structure at infinity for complete gradient shrinking ricci solitons. we show that for such a soliton with bounded curvature, if the round cylinder $$r\times s^{n-1}/\gamma$$ occurs as a limit for a sequence of points going to infinity along an end, then the end is asymptotic to the same round cylinder at infinity.

a basic result from complex function theory states that the logarithmic residue (i.e., the contour integral of the logarithmic derivative) of a scalar analytic function can only vanish when the function has no zeros inside the contour. question: does this result generalize to the vector-valued case?

assuming that the functions in question take values in a banach algebra, the answer depends on which banach algebra. positive results have been obtained for large classes of algebras, among them that of the polynomial identity banach algebras. instrumental in this context is what is called non-commutative gelfand theory involving the use of families of matrix representations.

there is a close connection between logarithmic residues and sums of idempotents. pursuing this connection, negative answers to the above question have come up via the construction of non-trivial zero sums of a finite number of idempotents. it is intriguing that only five idempotents are needed in all known examples. the idempotent constructions relate to deep problems concerning the geometry of banach spaces and general topology. in particular a novel approach to the construction of cantor type sets plays a role.

the talk - accessible to non-specialists - reports on joint work with torsten ehrhardt (santa cruz, california) and bernd silbermann (chemnitz, germany).

the talk mainly concerns the structure at infinity for complete gradient shrinking ricci solitons. we show that for such a soliton with bounded curvature, if the round cylinder $$r\times s^{n-1}/\gamma$$ occurs as a limit for a sequence of points going to infinity along an end, then the end is asymptotic to the same round cylinder at infinity.

the talk mainly concerns the structure at infinity for complete gradient shrinking ricci solitons. we show that for such a soliton with bounded curvature, if the round cylinder $r\times s^{n-1}/\gamma$ occurs as a limit for a sequence of points going to infinity along an end, then the end is asymptotic to the same round cylinder at infinity.

the problem says that if $m$ is a smooth complete embedded self-shrinker with polynomial volume growth in euclidean space and the squared norm of the second fundamental form $|a|^2 =$ constant, then $m$ is a generalized cylinder. it has been verified in dimension 2 without the assumption of polynomial volume growth. cao and li had proved if $m$ is an n-dimensional complete self-shrinker with polynomial volume growth in $r^n+q$, and if $|a|^2 \leq 1$, then $m$ is must be one of the generalize cylinders. but for the case $|a|^2 >1$, they don't know what it is. therefore, qingming cheng and guoxin wei proved if the squared norm of the second fundamental form $|a|^2$ is constant and $|a|^2 \leq 10/7$,
then $m$ is must be one of the generalize cylinders. so we guess that it may be true if the squared norm of the second fundamental form $|a|^2$ is constant.

the problem says that if $m$ is a smooth complete embedded self-shrinker with polynomial volume growth in euclidean space and the squared norm of the second fundamental form $|a|^2 =$ constant, then $m$ is a generalized cylinder. it has been verified in dimension 2 without the assumption of polynomial volume growth. cao and li had proved if $m$ is an n-dimensional complete self-shrinker with polynomial volume growth in $r^n+q$, and if $|a|^2 \leq 1$, then $m$ is must be one of the generalize cylinders. but for the case $|a|^2 >1$, they don't know what it is. therefore, qingming cheng and guoxin wei proved if the squared norm of the second fundamental form $|a|^2$ is constant and $|a|^2 \leq 10/7$,
then $m$ is must be one of the generalize cylinders. so we guess that it may be true if the squared norm of the second fundamental form $|a|^2$ is constant.

this will be a continuation of the talk given on august 26th.

i will discuss recent joint work with ben elias, in which we develop a combinatorial method for computing the triply graded homology (equivalently, the superpolynomial) of certain links, especially torus links. conjecturally, this link homology has deep connections with hilbert schemes and symmetric functions. for instance the superpolynomial of the $(n,nk)$ torus link is conjecturally an evaluation of $nabla^k (p_1)^n$. i will discuss some evidence for this conjecture, including recent work of andy wilson.

in this talk i will try to prove de giorgi’s theorem on the regularity of minimal caccioppoli sets(theorem 8.4). he used a measure theoretic method closely related to properties of function of bounded variation, which is technical and powerful. i will focus on chapter 5-8 in e. giusti’s book. it is based on m. miranda’s simplification of de giorgi’s original proof.

in this talk i will try to prove de giorgi’s theorem on the regularity of minimal caccioppoli sets(theorem 8.4). he used a measure theoretic method closely related to properties of function of bounded variation, which is technical and powerful. i will focus on chapter 5-8 in e. giusti’s book. it is based on m. miranda’s simplification of de giorgi’s original proof.

this will be a continuation of the talk given on september 9th.

given two actions of a countable, discrete group $g$ on probabilty space $x,y$ there is a notion of when the action on $x$ is weakly contained in the action on $y$ (analogous to weak containment of representations) due to kechris: it roughly says that any finitary piece of the action of $g$ on $x$ can be approximated by some finitary piece of $g$ on $y$ (equivalent the measure on $x$ is a weak* limit of the factors of the measure on $y$). we then say that two actions are weakly equivalent when each is weakly contained in the other. we study when algebraic actions of $g$ (i.e. an action by automorphisms on a compact, metrizable, abelian group) are weakly equivalent to bernoulli shifts and find a natural class of actions related to invertible convolution operators on $g$. as part of our work, we also give conditions under which such actions are free.

(joint with asif shakeel, jiri lebl & david meyer)

the content of my previous ''fun with gerbes" talk (of which the
current talk is wholly independent) was etale homotopy 2-types via
grothendieck's theory of champs (the translation stack is awful), and the
content of this talk will be applications to lefshetz theorems. a
particular feature of having the right definition of higher homotopy
groups via n-categories is that the lefschetz theorem becomes a more or
less tautological induction, and at the very least i'll explain the
initial $\pi_0$ step in the induction- typically all problems in this area
are, when correctly understood, are problems about $\pi_0$. a manuscript
containingi the material from the "fun with gerbes" series is available
here: http://arxiv.org/abs/1507.00797

the holy grail of artificial intelligence, true “deep” ai, has been 10 years away ever since the dartmouth conference in 1956, in the same way that fusion reactors have been 20 years out for the past 50 years. in the meantime, we’ve gone through 2 “ai winters” and 3 “ai summers,” as the expectations of investors get lowered to meet the rising actual capabilities of neural nets. the talk will be a brisk tour through the history of neural networks, with particular emphasis on the intuition of how neural networks work.

we will discuss the makeenko--migdal equation (mm equation) which relates variations of a "wilson loop functional" (relative to the euclidean yang--mills measure) in the neighborhood of a simple crossing to the associated wilson loops on either side of the crossing. we will begin by introducing the 2d -- yang-mills measure and explaining the necessary background in order to understand the theorem. the goal is to describe the original heuristic argument of makeenko and migdal and then explain how these arguments can be made rigorous using stochastic calculus.

we discuss traveling front solutions $u(t,x) = u(x-ct)$ of reaction-diffusion equations $u_t = lu + f(u)$ in 1d with ignition reactions $f$ and diffusion operators $l$ generated by symmetric levy processes $x_t$. existence and uniqueness of fronts are well-known in the cases of classical diffusion (i.e., when l is the laplacian) as well as some non-local diffusion operators. we extend these results to general levy operators, showing that a weak diffusivity in the underlying process - in the sense that the first moment of $x_1$ is finite - gives rise to a unique (up to translation) traveling front. we also prove that our result is sharp, showing that no traveling front exists when the first moment of $x_1$ is infinite.

crouzeix's conjecture is among the most intriguing developments in matrix theory in recent years.
made in 2004 by michel crouzeix, it postulates that, for any polynomial $p$ and any matrix $a$,
$||p(a)|| <= 2 max(|p(z)|: z$ in $w(a))$, where the norm is the 2-norm and $w(a)$ is the field
of values (numerical range) of $a$, that is the set of points attained by $v*av$ for some
vector $v$ of unit length. remarkably, crouzeix proved in 2007 that the inequality above
holds if 2 is replaced by 11.08. furthermore, it is known that the conjecture holds in a
number of special cases, including $n=2$. we use nonsmooth optimization to investigate
the conjecture numerically by attempting to minimize the “crouzeix ratio”, defined as the
quotient with numerator the right-hand side and denominator the left-hand side of the
conjectured inequality. we present numerical results that lead to some theorems and
further conjectures, including variational analysis of the crouzeix ratio at conjectured global minimizers.
all the computations strongly support the truth of crouzeix’s conjecture.

this is joint work with anne greenbaum and adrian lewis.

work by mcquillan and brunella demonstrates the existence of a
mori theory for rank 1 foliations on surfaces. in this talk we will
discuss an extension of some of these results to the case of rank 2
foliations on threefolds, as well as indicating how a complete mori theory
could be developed in this case.

we will discuss lefschetz theorems on the homotopy groups of
hyperplane sections in the arithmetic setting, i.e. for a divisor, ample
in the arakelov sense, over a projective scheme defined over the ring of
integers in a number field. an interesting corollary is that the integral
model of a generic complete intersection curve of big height, is a simply
connected arithmetic surface. joint work with michael mcquillan.

in 1942 kelly conjectured that any graph having at least 3 vertices is uniquely determined by the multiset of all its subgraphs obtained by deleting a vertex and all edges adjacent to it. in 1964 harary conjectured analogously that any graph having at least 4 edges is uniquely determined by all its subgraphs obtained by deleting a single edge, which is known as the edge reconstruction conjecture. as of today, both conjectures are still open.

in the talk i will discuss some of the classical results about the conjectures and some evidence in favor of them. also i will explicitly show that the edge reconstruction conjecture holds for a specific type of graphs.

in this talk, we compare and contrast a few finite element h-adaptive
and hp-adaptive algorithms. we test these schemes on three example pde
problems and we utilize and evaluate an a posteriori error estimate.

in the process, we introduce a new framework to
study adaptive algorithms and a posteriori error estimators. our innovative
environment begins with a solution u and then uses interpolation to
simulate solving a corresponding pde. as a result, we always know the
exact error and we avoid the noise associated with solving.

using an effort indicator, we evaluate the relationship between accuracy
and computational work. we report the order of convergence of different
approaches. and we evaluate the accuracy and effectiveness of an
a posteriori error estimator.

differential harnack estimates, also called li-yau-hamilton estimates, play an important part in geometric analysis, especially geometric flows. firstly, i will review the developments of differential harnack estimates. then i will talk about the constrained matrix differential harnack estimates for the heat equation on kaehler manifolds.

in a series of papers, e. hecke described the representation of the group
$sl(2,p)$ on the regular differentials of the modular curve $x$ of level $p$. this was one of the
first applications of character theory outside of finite group theory, and one of the first
constructions of representations using cohomology. i will review hecke's results, and
interpret them in the modern language of automorphic representations.

topological data analysis (tda) emerged as a branch of applied topology about twenty years ago and has produced some of the most valuable tools for the study of big data since then. tda can be used to detect topologically significant features (holes, connected components, etc) of high-dimensional data sets, without any a priori knowledge of the data. it’s even been used to analyze basketball games, and found that basketball players displayed thirteen statistically distinct playing styles, despite there being only five official positions.

in this talk i will introduce the basics of persistent homology, a fundamental tool for tda, and describe some of the recent achievements in this field. i'll also touch on some current areas of active research and why people like nasa are trying to get in on the action.

while the long-time behavior of small amplitude solutions to nonlinear dispersive and wave equations on euclidean spaces $(r^n)$ is relatively well-understood, the situation is marked different on bounded domains. due to the absence of dispersive decay, a very rich set of dynamics can be witnessed even starting from arbitrary small initial data. in particular, the dynamics in this setting is characterized by out-of-equilibrium behavior, in the sense that solutions typically do not exhibit long-time stability near equilibrium configurations. this is even true for equations posed on very large domains (e.g. water waves on the ocean) where the equation exhibits very different behaviors at various time-scales.

in this talk, we shall consider the nonlinear schr\"odinger equation posed on a large box of size $l$. we will analyze the various dynamics exhibited by this equation when $l$ is very large

initial data in general relativity must satisfy certain underdetermined differential equations called the constraint equations. a natural problem is to find a parameterization of all possible initial data. a standard method for this is called the conformal method. in the relatively simple ``constant mean curvature" (cmc) case, this method provides a good parameterization of initial data. however, the far-from-cmc case has resisted analysis. in part this is because researchers were trying to prove theorems that are false. in this talk, i'll introduce the problem and known results, and talk about our numerical results that show that the standard conjectures about solvability were all wrong. numerical investigations can play an important part in informing conjectures about purely analytical questions.

research mathematics is about asking questions. when's the last time you did? bring your cell phone or computer, and be prepared to change the way you approach everything in mathematics, and life.

mori introduced a program for classifying projective varieties by using algebraic surgeries, jian song and gang tian
introduced analytical minimal model program for the classification of kahler varieties by using pde surgeries. for the intermediate
kodaira dimension they proved that there exists a unique generalized kahler-einstein metric which twisted with weil-petersson metric.
i extended their result in my phd thesis on pair $(x,d)$ where $d$ is a snc divisor with conic singularities and i showed that there exists a generalized kahler-einstein metric which twisted with logarithmic weil-petersson metric plus additional term which we can find such additional term by using higher canonical bundle formula of fujino and mori. moreover i extended song-tian program for sasakian varieties in my phd thesis. in fact when the basic first chern class of a
sasakian variety is not definite then the question is how can we find generalized kahler-einstein metric for such varieties. i gave a positive answer to this question in my thesis. moreover i will explain how the lei ni method which later improved by v.tosatti for the classification of the solution of kahler-ricci flow could be extended to conical kahler-ricci flow and i finally will explain how the classification of the solutions of relative kahler-ricci flow is related to the gromov invariant of ruan-tian.

in a series of papers, e. hecke described the representation of the group
$sl(2,p)$ on the regular differentials of the modular curve $x$ of level $p$. this was one of the
first applications of character theory outside of finite group theory, and one of the first
constructions of representations using cohomology. i will review hecke's results, and
interpret them in the modern language of automorphic representations.

we prove that cohomology classes in $h^{2,2}(s_1\times s_2)$
of hodge isometries
$$\psi \colon h^2(s_1,\mathbb q)\rightarrow h^2(s_2,\mathbb q)$$ between
any two
projective complex $k3$ surfaces $s_1$ and $s_2$
are polynomials in chern classes of coherent analytic sheaves.

consequently, the cohomology class of $\psi$ is algebraic
this proves a conjecture of shafarevich announced at icm in 1970.

enumerative combinatorics is an area in combinatorics that mainly focuses on enumerating the number of ways to form certain configurations. with the help from computers and the internet, researches in enumerative combinatorics has developed dramatically in the past decades. in this talk, we will introduce signed permutations and their structures. then we will use signed permutations as an example of how one might use a computer to come up with interesting research problems to solve. then, we will end the talk by presenting some open problems in enumerative combinatorics.

fusion categories appear in many areas of mathematics. they are realized by topological quantum field theories, representations of finite groups and hopf algebras, and invariants for knots and murray-von neumann subfactors. an important numerical invariant of these categories are the frobenius-schur indicators, which are generalized versions of those for finite group representations. it is thought that these indicators should provide a complete invariant for a fairly wide class of fusion categories; in this talk we will discuss new families of so-called near-group fusion categories (i.e. those with only one non-invertible indecomposable object) which satisfy this property.

in many specialized imaging systems, an unknown signal $x$ $c^d$ produces
measurements of the form
$y_i = | a_i , x |2 + \eta_i$ , where ${a_i}\subset c^d$
are known measurement vectors and is an arbitrary noise term.
because this system seems to erase the phases of the entries of $x \in c^d$ , the
problem of reconstructing $x$
from $y$ is known as the phase retrieval problem. the first approaches to this
problem were ad hoc iterative
methods which still have no theoretical guarantees on convergence. recent
advancements including
gradient descent and convex relaxation have supplied some theoretical promises,
but often require such
conditions on the system ${a_i}$ that they cannot be used by scientists in
practice. in particular, they tend
to require some randomness to be used in the choice of ${a_i}$ that does not
reflect the physical systems
that typically yield the phase retrieval problem. our work contributes a
solution to this problem which
features (a) a deterministic, practicable construction for ${a_i}$ (b) numerical
stability with respect to noise
(c) a reconstruction algorithm with competitive runtimes. our most recent
result is an improvement on
the robustness gained by leveraging the graph structure induced by our
measurement scheme.

this lecture will be about a remarkable law of nature discovered by george polya. consider a particle initially situated at a given point of the d-dimensional integer lattice. suppose that, at each tick of the clock, the particle jumps to a neighboring lattice site, with equal probability of jumping in any direction. polya's law states that the particle returns to its initial position with probability one in dimensions d = 1,2, but with probability strictly less than one in all higher dimensions. thus, a drunk person wandering a city grid will always return to their starting point, but if the drunkard can fly s/he might never come back.

suppose $\gamma_1,\ldots,\gamma_n$ are hyperbolic icc groups and denote by $\gamma =\gamma_1\times \cdots \times \gamma_n$. we show whenever $\lambda$ is an arbitrary discrete group such that $l(\gamma)\cong l(\lambda)$ then $\lambda =\lambda_1\times \cdots \times \lambda_n$ and up to amplifications $l(\gamma_i)\cong l(\lambda_i) $ for all $i$; in other words the von neumann algebra $l(\gamma)$ completely remembers the product structure of the underlying group. in addition, we will show that some of the techniques used to prove this product rigidity result can also be successfully applied to produce new examples of prime factors. in particular, we significantly generalize the primeness results obtained earlier by i. chifan, y. kida and s. pant for the factors arising poly-hyperbolic and surface braid groups. these are joint works with i. chifan and t. sinclair, and s. pant, respectively.

conformal and cr geometries are among the class of "parabolic geometries" which posses a canonical cartan connection characterizing the geometry. replacing the levi-civita connection with the cartan connection we develop submanifold theory in parallel with the classical riemannian case. this allows us to apply tools developed for conformal and cr invariant theory to develop a theory of submanifold invariants and invariant operators, relevant to the study of conformally or cr invariant boundary value problems and other problems in geometric analysis involving submanifolds. the technical details of the theory are substantial (especially in the cr case). i will try to emphasize some of the concrete geometric ideas behind the approach, giving insight into the original work of elie cartan.

critical lattice models are believed to converge to a free field in the scaling limit, at or above their critical dimension. this has been (partially) established for ising and $phi^4$ models for $d \geq 4$. we describe a simple spin model from uniform spanning forests in $\mathbb{z}^d$ whose critical dimension is 4 and prove that the scaling limit is the bi-laplacian gaussian field for $d\ge 4$. at dimension 4, there is a logarithmic correction for the spin-spin correlation and the bi-laplacian gaussian field is a log correlated field. the proof also improves the known mean field picture of lerw in d=4, by showing that the renormalized escape probability (and arm events) of 4d lerw converge to some "continuum escaping probability". based on joint works with greg lawler and xin sun.

dynamic conditional beta (dcb) is an approach to estimating regressions with time varying parameters. the conditional covariance matrices of the exogenous and dependent variable for each time period are used to formulate the dynamic beta. joint estimation of the covariance matrices and other regression parameters is developed. tests of the hypothesis that betas are constant are non-nested tests and several approaches are developed including a novel nested model. the methodology is applied to industry multifactor asset pricing and to global systemic risk estimation with non-synchronous prices.

free registration is required to attend. registration information is available at

//www.ladysinger.com/$\sim$rosenblattconf/rosenblattlecture.html

gross showed that to every hermitian symmetric tube domain we
may associate a canonical variation of hodge structure (vhs) of calabi-yau
type. the construction is representation theoretic, not geometric, in
nature, and it is an open question to realize this abstract vhs as the
variation induced by a family of polarized, algebraic calabi-yau
manifolds. in order for a geometric vhs to realize gross's vhs it is
necessary that the invariants associated to the two vhs coincide. for
example, the hodge numbers must agree. the later are discrete/integer
invariants. characteristic forms are differential-geometric invariants
associated to vhs (introduced by sheng and zuo). remarkably, agreement of
the characteristic forms is both necessary and sufficient for a geometric
vhs to realize one of gross's vhs. that is, the characteristic forms
characterize gross's calabi-yau vhs. i will explain this result, and
discuss how characteristic forms have been used to study candidate
geometric realizations of gross's vhs.

in the late 1980's, after jones' define his polynomial, there is a
revolution in this area, followed by witten's reinterpreting jones
polynomial by using chern-simons theory and predicting new quantum
invariants. finally reshetikhin-turaev was the first one to define a
mathematically rigorous theory of such complex-valued invariant for closed
3-manifolds. more importantly, reshetikhin-turaev define their invariant
not only at roots of unity $q(1)$ originally considered by witten but also at
other roots of unity. later turaev-viro defined a real valued invariants
for closed 3-manifolds by triangulation both at $q(1)$ and other roots of
unity.

in 1997, kashaev discover his invariants of hyperbolic knots will become
exponentially large as $n->infinity$ and he further conjectured that the
growth rates corresponds to hyperbolic volume of complement of that knot in
$s^3$. in 2001, h. murakami-j. murakami extend kashaev's volume conjecture
from hyperbolic knots to all knots and hyperbolic volume to simplicial
volume by using colored jones polynomials.

for many years, witten-reshetikhin-turaev invariants evaluated at $q(1)$ was
considered to be only polynomial growth and its asymptotic expansion is
called wae conjecture (witten's asymptotic expansion). last year, in a
joint work with t. yang, we first define a real valued turaev-viro type
invariant for 3-manifold with boundary by using ideal triangulation. then
we discovered this turaev-viro type invariant and reshetikhin-turaev
invariant evaluated at other roots of unity (especially at $q(2)$) will have
exponentially large phenomenon and the the growth rates corresponds to
volume of 3-manifold with boundary and volume of closed 3-manifold
respectively.

thankful to the new tool developed by ohtsuki recently, asymptotic
expansion of kashaev invariants (including volume conjecture) up to 7
crossing has been solved. this new tool can also be used to attack my
volume conjecture with tian yang. i will give a brief introduction for all
these new developments.

finally we expect reshetikhin-turaev at roots of unity other than $q(1)$
could have a different geometry/physics interpretation than original
chern-simons theory given by witten in 1989.

direct observations of the modern geomagnetic field enable us to understand its role in protecting us from the depredations of the solar wind and associated space weather, while paleomagnetic studies provide geological evidence that the field is intimately linked with the history and thermal evolution of our planet. in the past the magnetic field has reversed polarity many times: such reversals occur when its overall strength decays, and there are departures from the usual spatial structure which at earth's surface predominantly resembles that of an axially aligned dipole. reversals are one element of a continuum of geomagnetic field behavior which also includes geomagnetic excursions (often viewed as unsuccessful reversals), and paleosecular variation. the fragmentary and noisy nature of the geological record combined with distance from the field's source in earth's liquid outer core provide a limited view, but one that has been partially characterized by time series analysis, and development of stochastic models describing the variability. analyses of changes in the dipole moment have revealed distinct statistical characteristics associated with growth and decay of field strength in some frequency ranges. paleomagnetic studies are complemented by computationally challenging numerical simulations of geomagnetic field variations. access to details within the numerical model allow the evolution of large scale physical processes to be studied directly, and it is of great interest to determine whether these computational results have earth-like properties. the parameter regime accessible to these simulations is far from ideal, but their adequacy can be assessed and future development guided by comparisons of their statistical properties with robust results from paleomagnetic observations. progress in geomagnetic studies has been greatly facilitated by the application of statistical methods related to stochastic processes and time series analysis, and there remains significant scope for continued improvement in our understanding. this is likely to prove particularly important for understanding the scenarios that can lead to geomagnetic reversals.

free registration is required to attend. registration information is available at

//www.ladysinger.com/$\sim$rosenblattconf/rosenblattlecture.html

are you tired of graphs, paths, and flags on staffs? have all those dyck paths finally crossed the line? are you ready to make a full binary tree and "leaf" the catalan numbers behind? then this is the talk for you! we are going to talk about concepts in combinatorics that have connections to areas of applied mathematics such as compressed sensing, quantization, and convex optimization; in particular, we're going to discuss some magnificent ways in which we can either solve (or approximately solve) certain problems in combinatorics by applying techniques from these areas. conversely, we present cases where we can use ideas from combinatorics to prove results in applied math!

let $q$ be a non-degenerate indefinite quadratic form over $ \mathbb{r}$
in $n \ge 3$ variables. establishing a longstanding conjecture of oppenheim, margulis proved in 1986 that if $q$ is not a multiple of a rational form, then the set of values $q( \mathbb{z}^n)$ is a dense subset of $ \mathbb{r}$.
quantifying this result, eskin, margulis, and mozes proved in 1986 that unless $q$ has signature $(2,1)$ or $(2,2)$, then the number $n(a,b;r)$ of integral vectors $v$ of norm at most $r$ satisfying $q(v) \in (a,b)$ has the asymptotic behavior $n(a,b;r) \sim \lambda(q) \cdot (b-a) r^{n-2}$.

now, let $s$ is a finite set of places of $ \mathbb{q}$ containing the archimedean one, and $q=(q_v)_{v \in s}$
is an $s$-tuple of irrational isotropic quadratic forms over the completions $ \mathbb{q}_v$. in this talk i will discuss the question of distribution of values of $q(v)$ as $v$ runes over $s$-balls in $ \mathbb{z}[1/s]$.
this talk is based on a joint work with seonhee lim and jiyoung han.

the field of geometric numerical integration(gni) seeks to exploit the
underlying (geometric)structure of a dynamical system in order to
construct numerical methods that exhibit desirable properties of
stability and/or preservation of invariants of the flow. variational
integrators are built for hamiltonian systems by discretizing the
generating function of the symplectic flow, rather than discretizing
the differential equations directly. traditionally, the generating
function considered is a type i generating function.
in this talk we will discuss the properties and
advantages/disadvantages of discretizing the type ii/iii generating
function of the flow. after establishing error analysis and adjoint
results, we consider the possible numerical resonance properties
corresponding to the different types of generating functions.

in math 20, we learned how to differentiate and integrate functions defined on euclidean spaces. there is a much wilder world of smooth spaces (manifolds) where a generalization of this calculus is possible, but it requires a steep learning curve and a lot of new language to understand. there is a class of manifolds, however, that is both large and interesting, and also retains enough euclidean-like structure to do calculus almost the same way as in math 20. these are called lie groups.

i will discuss (with two or three guiding examples) how do to calculus on lie groups, which can usually be realized as groups of square matrices. i will then discuss the most important differential equation in the world -- the heat equation -- in the context of matrix lie groups, and the beautiful interplay between geometry and heat flow. finally, i'll talk about my research into the heat flow of eigenvalues in matrix lie groups -- and there'll be lots of cool pictures.

in this talk, we discuss results on gravitational perturbations of black holes by evaluating quasi-local mass on surfaces of fixed size at the null infinity in a gravitational radiation. in particular, a general theorem regarding the decay rate of the quasi-local energy-momentum at infinity is proved and is applied to study the gravitational perturbation of the schwarzschild solution. the theorem associates a 4-vector to each loop near null infinity, which encodes the distinctive features of a gravitational wave.

variational integrators provide a systematic way to derive geometric numerical methods for lagrangian dynamical systems, which preserve a discrete multisymplectic form as well as momenta associated to symmetries of the lagrangian via noether's theorem. an inevitable prerequisite for the derivation of variational integrators is the existence of a variational formulation for the considered dynamical system. even though this is the case for a large class of systems, there are many interesting examples which do not belong to this class, e.g., equations of advection-diffusion type like they are often found in fluid dynamics or plasma physics.

we propose the application of the variational integrator method to so called formal lagrangians, which allow us to embed any dynamical system into a lagrangian system by doubling the number of variables. thereby we are able to derive variational integrators for arbitrary systems, extending the applicability of the method significantly. a discrete version of the noether theorem for formal lagrangians yields the discrete momenta preserved by the resulting numerical schemes.

the theory is applied to dynamical systems from fluid dynamics and plasma physics like the vorticity equation, the vlasov-poisson system and magnetohydrodynamics, including numerical examples. recent attempts of applying this method also to noncanonical hamiltonian odes will be sketched.

in the theory of ``motives", algebraic cycles are central objects. for instance, the so-called ``motivic cohomology groups”, that give the universal bigraded ordinary cohomology on smooth varieties, are obtained from a complex of abelian groups consisting of certain algebraic cycles.

in this talk, we discuss how one can go beyond it, and we show that an infinitesimal version of the above complex of abelian groups of algebraic cycles can be identified with the big de rham-witt complexes after a suitable zariski sheafification. this in a sense implies that the crystalline cohomology theory admits a description in terms of algebraic cycles, going back to a result of s. bloch and l. illusie in the 1970s. this is based on a joint work with amalendu krishna.

in symplectic manifolds, isotropic, coisotropic, and lagrangian submanifolds play a central role, and their study leads to deep problems in symplectic geometry and topology. it turns out that the linearized version of this study is already quite non-trivial.
the classification of pairs of isotropic subspaces in a symplectic vector space turns out to be rather simple, but for isotropic triples, it is much more complicated. in particular, there are families of inequivalent indecomposable isotropic triples depending on one parameter (but no more).

in these talks, i will report on progress on this problem in ongoing work with
christian herrmann (university of dartmstadt) and jonathan lorand (university of z\"urich).

in symplectic manifolds, isotropic, coisotropic, and lagrangian submanifolds play a central role, and their study leads to deep problems in symplectic geometry and topology. it turns out that the linearized version of this study is already quite non-trivial.
the classification of pairs of isotropic subspaces in a symplectic vector space turns out to be rather simple, but for isotropic triples, it is much more complicated. in particular, there are families of inequivalent indecomposable isotropic triples depending on one parameter (but no more).

in these talks, i will report on progress on this problem in ongoing work with
christian herrmann (university of dartmstadt) and jonathan lorand (university of z\"urich).

if r is the free associative algebra in two variables, say over the complex numbers, then the ring of two by two matrices over r is also a quotient of r by a differential ideal i. playing off the two descriptions of r/i leads naturally to the schwarzian korteweg-devries equation, in which a function of x evolves in time driven by the schwarzian derivative. i will present this abstract setup and then explain how ruled surfaces (appropriately chosen) over hyperelliptic curves provide solutions of the equation. i will also describe several commuting flows.

no spoilers!

let $\lambda<sl(2,\mathbb{z})$ be a finitely generated, non-elementary fuchsian group of the second kind, and $\bf{v},\bf{w}$ be two primitive vectors in $\mathbb{z}^2-\bf{0}$. we consider the set $\mathcal{s}=\{\langle \bf{v}\gamma,\bf{w}\rangle_{\mathbb{r}^2}:\gamma\in\lambda\}$, where $\langle\cdot,\cdot\rangle_{\mathbb{r}^2}$ is the standard inner product in $\mathbb{r}^2$. using hardy-littlewood circle method and some infinite co-volume lattice point counting techniques developed by bourgain, kontorovich and sarnak, together with gamburd's $5/6$ spectral gap, we show that if $\lambda$ has parabolic elements, and the critical exponent $\delta$ of $\lambda$ exceeds $0.995371$, then a density-one subset of all admissible integers (i.e. integers passing all local obstructions) are actually in $\mathcal{s}$, with a power savings on the size of the exceptional set (i.e. the set of admissible integers failing to appear in $\mathcal{s}$). this supplements a result of bourgain-kontorovich, which proves a density-one statement for the case when $\lambda$ is free, finitely generated, has no parabolics and has critical exponent $\delta>0.999950$.

several long-standing open problems in the theory of c*-algebras reduce to whether for a given class of c*-algebras there is a locally universal one among them with certain nice properties. i will discuss how techniques from model theory, in particular model-theoretical forcing, can be used to shed light on these problems. this is joint work with isaac goldbring.

we introduce a general framework for studying a class of randomized load balancing models in a system with a large number of servers that have generally distributed service times and use a first-come-first serve policy within each queue. under fairly general conditions, we use an interacting measure-valued process representation to obtain hydrodynamics limits for these models, and establish a propagation of chaos result. furthermore, we present a set of partial differential equations (pdes) whose solution can be used to approximate the transient behavior of such systems. we prove that these pdes have a unique solution, use a numerical scheme to solve them, and demonstrate the efficacy of these approximations using monte carlo simulations. we also illustrate how the pde can be used to gain insight into network performance.

i will present a joint work with martin li. minimal surfaces with free boundary are natural critical points of the area functional in compact smooth manifolds with boundary. in this talk, i will describe a general existence theory for minimal surfaces with free boundary. in particular, i will show the existence of a smooth embedded minimal hypersurface with free boundary in any compact smooth euclidean domain. the minimal surfaces with free boundary were constructed using the min-max method. i will explain the basic ideas behind the min-max theory as well as our new contributions.

we prove that any quasi-isometry between hyperbolic manifolds is homotopic to a harmonic quasi-isometry.

i will discuss joint work with gabriele di cerbo on boundedness
of calabi-yau pairs. recent works in the minimal model program suggest
that pairs with trivial log canonical class should satisfy some
boundedness properties. i will show that calabi-yau pairs which are not
birational to a product are indeed log birationally bounded, if the
dimension is less than 4. in higher dimensions, the same statement can be
deduced assuming the bab conjecture. if time permits, i will discuss
applications of this result to elliptically fibered calabi-yau manifolds.

the lerch zeta function is a three variable zeta function,
with variables $(s, a, c)$,
which generalizes the riemann zeta function and has
a functional equation, but no euler product. we discuss its properties.
it is an eigenfunction of a linear partial
differential equation in the variables $(a, c)$
with eigenvalue $-s$, and it is also preserved under a
a commuting family of two-variable hecke-operators $t_m$
with eigenvalue $m^{-s}$. we give a characterization
of it in terms of being a simultaneous eigenfunction of
these hecke operators.
we then give an automorphic interpretation of the lerch zeta
function in terms of eisenstein series taking
values on the heisenberg nilmanifold, a
quotient of the real heisenberg group modulo
its integer subgroup. part of this work is joint with
w.-c. winnie li.

have you always wondered how the banach-tarski paradox - namely cutting a ball into pieces and assembling those pieces into two balls - actually works? or what the mathematical reason behind it is? in this talk we will answer those questions by 1) reformulating the banach-tarski paradox, 2) explaining what paradoxical decompositions of various objects are, 3) constructing one for a ball, and 4) motivated by all those things introducing the concept of amenability, which has its origin in the aforementioned paradox and is ubiquitous in many areas of mathematics nowadays.

i will talk about the problem of separating multiple signals from each
other when we only have access to a few linear (or non-linear)
combinations of them. an example of this type of problem is at a
cocktail party when you are trying to have a conversation with a
friend but there are several conversations happening around you. your
ears provide you with a superposition of all the voices, and your
brain does remarkably well at focusing on your friend's voice and
drowning out all the others. we will talk about one computer algorithm
(or time permitting, more) that does such a task (reasonably)
successfully. along the way, we will talk about important tools in
mathematical signal processing, including the fourier transform and
sparsity.

a ``higgs bundle" is essentially a family of matrices, and if you
try to diagonalize one you get a "spectral cover." they arise in the
study of moduli of vector bundles. i will introduce higgs bundles and
spectral covers, and then i will describe their cohomological
invariants.

we shall discuss the recent work of brendle, choi and daskalopoulos on the classification via a pogorelov's type estimate.

fusion categories appear in many areas of mathematics. they are
realized by topological quantum field theories, representations of
finite groups and hopf algebras, and invariants for knots and
murray-von neumann subfactors. an important numerical invariant of
these categories are the frobenius-schur indicators, which are
generalized versions of those for finite group representations. using
these categorical indicators we are able to distinguish near-group
fusion categories, that is those fusion categories with one
non-invertible object, and obtain some realizations of their tensor
equivalence classes.

we present a general framework for approximating the component structure of random combinatorial assemblies when both the size $n$ and the number of components $k$ is specified. the approach is an extension of the usual saddle point approximation, and we demonstrate near-universal behavior when the rank $r := n-k$ is small relative to $n$ (hence the name `low rank’).

in particular, for $\ell = 1, 2, \ldots$, when $r \asymp n^\alpha$, for $\alpha \in \left(\frac{\ell}{\ell+1}, \frac{\ell+1}{\ell+2}\right)$, the size~$l_1$ of the largest component converges in probability to $\ell+2$. when $r \sim t\, n^{\ell/(\ell+1)}$ for any $t>0$ and any positive integer $\ell$, we have $p(l_1 \in \{\ell+1, \ell+2\}) \to 1$. we also obtain as a corollary bounds on the number of such combinatorial assemblies, which in the special case of set partitions fills in a countable number of gaps in the asymptotic analysis of louchard for stirling numbers of the second kind.

this is joint work with richard arratia

\noindent
convex cones over a real unital algebra, which in addition are closed under
inversion, may seem peculiar. however, convex invertible cones (cics)
naturally appear in stability analysis of continuous-time physical systems.
\vskip 0.2cm

\noindent
with this motivation, in this talk we explore examples
of cics over some algebras and establish interconnections among them.
\vskip 0.2cm

\noindent
this indicates at the importance of the study of
rational functions, of non-commuting variables, with
certain positivity properties.
\vskip 0.2cm

\noindent
this talk is based on an ongoing research for many years.
some of it in collaboration with daniel alpay, chapman university,
california,
nir cohen, natal, brazil and the late leiba rodman, from the college
of william and mary, virginia.

given a rectangular board b with any set of forbidden states, the rook
number $r_b(k)$ is the number of ways of placing k non-attacking rooks
on board $b$ which avoid the set of forbidden states. when non-attacking
only means no two rooks lie in the same column, the number of such
configurations is called the file number, $f_b(k)$. when the board $b$ is
the staircase board, with row lengths $n-1, n-2, ..., 1$, then the rook
number coincides with the stirling numbers of the second kind, and the
file number coincides with the unsigned stirling numbers of the first
kind.

we will demonstrate, using poisson approximation and an explicit
coupling, how one can obtain quantitative bounds on rook and file
numbers under certain conditions. in the case of stirling numbers, our
results fill a gap in a recent asymptotic expansion which uses
explicitly defined parameters due to louchard.
this is joint work with richard arratia.

after offering some quick answers to the questions "what is learning?" and "what is a quantum computer?", i'll explain how you can improve your learning with a quantum computer. we measure the efficiency of a learning algorithm by its query complexity, and in this field one tries to find upper bounds for the query complexity (by creating algorithms) as well as lower bounds (by proving the optimality of certain algorithms). many of the first quantum algorithms are in fact learning algorithms, and we'll discuss two important ones: grover's search algorithm and the bernstein-vazirani algorithm. these offer amazing speedups in query complexity over classical computers. if time permits, i'll describe recent research which introduces a huge family of learning problems with nonabelian symmetries for which little is known but the (upper and lower bounds for the) query complexity for any given problem can be easily computed on computer algebra software such as gap or sage. this work is in collaboration with orest bucicovschi, hanspeter kraft, david meyer and jamie pommersheim.

in this talk, i focus on factor analysis of high-dimensional time series
data, in which the dimension of data is allowed to be even larger than the
length of data. analysis of high-dimensional data suffers from the curse
of dimensionality. factor analysis is considered as an effective way for
dimension reduction. factor models presume that a few common factors can
explain most of the variation/dynamics of an observed process in high
dimensions. in the models, factor loadings are introduced to reflect the
percentages of variations explained and contributions made by these common
factors. based on real data analysis, it has been discovered that the
loadings may vary in different situations/regimes. to interpret this
observation and capture the regime-switching mechanism often encountered
in practice, we propose a threshold factor model for high-dimensional time
series data, in which a threshold variable is introduced to distinguish
different regimes. loadings controlled by the threshold variable vary
across regimes. the theoretical properties of the procedure are
investigated.

the affine sieve is a technique first developed by bourgain, gamburd, and sarnak in 2006 and later completed by salehi golsefidy and sarnak in 2010 to study almost-primality in a broad class of affine linear actions. the beauty of this is that it gives us effective bounds on the saturation number for thin orbits coming from $gl_n$ - in particular, producing infinitely many $r$-almost primes for some $r$. however, in practice this value of $r$ is often far from optimal. the case of thin pythagorean triangles has been of particular interest since the outset of the affine sieve, and i will discuss recent progress on improving bounds for the saturation numbers for their hypotenuses and areas using archimedean sieve theory.

we give a geometric characterization of mean ergodic convergence in the calkin algebras for certain banach spaces. (joint work with william b. johnson)

shrinking gradient ricci solitons (shrinkers) are models for the local geometry of singular regions of solutions to the ricci flow and their classification is critical to the understanding of singularity formation under the flow. growing evidence suggests that the asymptotic geometry of complete noncompact shrinkers may be particularly constrained; in fact, all examples currently known which do not split locally as products are smoothly asymptotic to a regular cone at infinity. i will present some results from a joint project with lu wang, in which we study the uniqueness of shrinkers asymptotic to such structures as a problem of parabolic unique continuation, and discuss the applications of these results to a conjectured classification in four dimensions.

we fix a monic polynomial $\bar f(x) \in \mathbb{f}_q[x]$
over a finite field of characteristic $p$, and consider the
$\mathbb{z}_{p^{\ell}}$-artin--schreier--witt tower defined by $\bar
f(x)$; this is a tower of curves $\cdots \to c_m \to c_{m-1} \to
\cdots \to c_0 =\mathbb{a}^1$, whose galois group is canonically
isomorphic to $\mathbb{z}_{p^\ell}$, the degree $\ell$ unramified
extension of $\mathbb{z}_p$, which is abstractly isomorphic to
$(\mathbb{z}_p)^\ell$ as a topological group.
we study the newton slopes of zeta functions of this tower of curves.
this reduces to the study of the newton slopes of l-functions
associated to characters of the galois group of this tower. we prove
that, when the conductor of the character is large enough, the newton
slopes of the l-function
asymptotically form a finite union of arithmetic progressions. as a
corollary, we prove the spectral halo property of the spectral variety
associated to the $\mathbb{z}_{p^{\ell}}$-artin--schreier--witt tower.
this extends the main result of davis--wan--xiao from rank one
case $\ell=1$ to the higher rank case $\ell\geq 1$.

motivated by kolmogorov's theory of hydrodynamic turbulence, we considerdissipative weak solutions to the 3d incompressible euler equations and the 2d surface quasi-geostrophic equations. we prove that up to a certain regularity threshold weak solutions are not unique. in the case of the euler system this is the threshold determined by the onsager conjecture.
for sqg, this answers an open problem posed by de lellis and szekelyhidi jr.

following ideas of marian and oprea, finite quot schemes can be
used to investigate le potier's strange duality conjecture for surfaces. i
will discuss recent work with aaron bertram and drew johnson in which we
prove the existence of a large class of finite quot schemes on the
projective plane. we use nice resolutions of general stable vector
bundles, which also yield an easy proof that these bundles are globally
generated whenever their euler characteristic suggests that they should
be.

synthetic aperture radar (sar) uses relative motion to produce fine resolution images from microwave frequencies and is a useful tool for regular monitoring and mapping applications. unfortunately, if target distance is estimated poorly, then phase errors are incurred in the data, producing a blurry reconstruction of the image. in this talk, we introduce a multistatic methodology for determining these phase errors from interferometry-inspired combinations of signals. to motivate this, we first consider a more general problem called phase retrieval, in which a signal is reconstructed from linear measurements whose phases are either unreliable or unavailable. we apply certain ideas from phase retrieval to resolve phase errors in sar; specifically, we use bistatic techniques to measure relative phases and then apply a graph-theoretic phase retrieval algorithm to recover the phase errors. we conclude by devising an image reconstruction procedure based on this algorithm, and we provide simulations that demonstrate stability to noise.

in the classification of (commutative) projective surfaces, one first classifies minimal models for a given birational class, and then shows that any surface can be blown down at a finite number of curves to obtain a minimal model.

artin has proposed a similar programme for noncommutative surfaces (that is, domains of $gk$-dimension 3). in the generic ``rational'' case of rings birational to a sklyanin algebra, the likely candidates for minimal models are the sklyanin algebra itself and van den bergh's quadric surfaces. we show, using our previously developed noncommutative version of blowing down, that these algebras are minimal in a very strong sense: given a sklyanin algebra or quadric $r$, if $s$ is a connected graded, noetherian overring of $r$ with the same graded ring of fractions, then $s=r$.

this is a joint work with rogalski and stafford.

2015 was the centinnial year of einstein's general theory of relativity, and fittingly concluded with the discovery of gravitational waves, which he had predicted. despite knowing the key physical principles, einstein was only able to formulate his theory after learning differential geometry from mathematician marcel grossmann in 1912. in a sense, general relativity simply $is$ applied differential geometry. this talk will sketch the key ideas of differential geometry and how they apply to einstein's theory of gravity. the presentation will emphasize ideas and pictures, rather than equations.

in this talk we will try to discuss the
following questions:

1. what is the space of distributions? what are its key
properties? why do we need it? how do we use it?

2. what is a function space? what are the nice properties that
we would like our function spaces to possess?

3. why is the gagliardo seminorm defined the way it is?

4. how do interpolation theory and littlewood-paley theory come
into play in the study of slobodeckij spaces?

5. for what values of $s$ and $p$, $\partial^\alpha: w^{s,p}(\omega)\rightarrow
w^{s-|\alpha|,p}(\omega)$ is a well defined bounded linear
operator for all $\alpha\in \mathbb{n}_0^n$? why do we care about
this question?

the asymmetric simple exclusion process (asep) is a model from statistical physics that describes the dynamics of particles hopping right and left on a finite 1-dimensional lattice. particles can enter and exit at the left and right boundaries, and at most one particle can occupy each site. the asep plays an important role in the study of non-equilibrium statistical mechanics and has appeared in many contexts, for instance as a model for 1-dimensional transport processes such as protein synthesis, molecular and cellular transport, and traffic flow. moreover, it displays rich combinatorial structure: one can compute the stationary probabilities for the asep using fillings of certain tableaux. in this talk, we will discuss some of the combinatorial results from the past decade as well as recent developments, including combinatorial formulae for a two-species generalization of the asep and a remarkable connection to orthogonal polynomials. this talk is based on joint works with x. viennot and separately with s. corteel and l. williams.

this talk will introduce the space of $id{e}les$ for a global field $k$. for convenience, the construction given in the talk will use the rational numbers. in the process, completions, additive/multiplicative valuations, and connections to ideals will be discussed. if time permits, we will generalize to an arbitrary galois number field, ultimately ending with some galois-theoretic properties of the $id{e}les$.

we will discuss rigidity results for holomorphic mappings in cr and complex geometry, emphasizing the connections between the two types of rigidity. we discuss in more detail rigidity of volume-preserving maps between hermitian symmetric spaces, based on the work of mok-ng and my recent joint work with fang and huang.

mean curvature flow is the negative gradient flow of volume, so any closed hypersurface flows in the direction of steepest descent for volume and eventually becomes extinct in finite time. in most cases, the flow develops singularities before its extinction time. it is known that the asymptotic behaviors of the flow near a singularity are modeled on a special class of solutions to mean curvature flow, which are called self-shrinkers. in this talk, we will outline a program on the classification of noncompact two-dimensional self-shrinkers, and report some recent progress with an emphasis on the geometry at infinity of these self-shrinkers.

in this talk, i will start with an introduction to the einstein 4-manifold. then i will discuss some earlier result on classification of the positive case. finally i will mention some recent development in this area.

a common problem in modern statistical applications is to select, from a large set of candidates, a subset of variables which are important for determining an outcome of interest. for instance, the outcome may be disease status and the variables may be hundreds of thousands of single nucleotide polymorphisms on the genome. for data coming from low-dimensional ($n \ge p$) linear homoscedastic models, the knockoff procedure recently introduced by barber and cand\'es solves the problem by performing variable selection while controlling the false discovery rate (fdr). in this talk i will discuss an extension of the knockoff framework to arbitrary (and unknown) conditional models and any dimensions, including $n < p$, allowing it to solve a much broader array of problems. this extension requires the design matrix be random (independent and identically distributed rows) with a covariate distribution that is known, although the procedure appears to be robust to unknown/estimated distributions. no other procedure solves the variable selection problem in such generality, but in the restricted settings where competitors exist, i will demonstrate the superior power of knockoffs through simulations. finally, applying the new procedure to data from a case-control study of crohn’s disease in the united kingdom resulted in twice as many discoveries as the original analysis of the same data.

the classic 1935 paper of erdos and szekeres entitled ``a combinatorial problem in geometry" was a starting point of a very rich discipline within combinatorics: ramsey theory. in that paper, erdos and szekeres studied the following geometric problem. for every integer $n \geq 3$, determine the smallest integer $es(n)$ such that any set of $es(n)$ points in the plane in general position contains n members in convex position, that is, n points that form the vertex set of a convex polygon. their main result showed that $es(n) \leq {2n - 4\choose n-2} + 1 = 4^{n -o(n)}$. in 1960, they showed that $es(n) \geq 2^{n-2} + 1$ and conjectured this to be optimal. despite the efforts of many researchers, no improvement in the order of magnitude has been made on the upper bound over the last 81 years. in this talk, we will sketch a proof showing that $es(n) =2^{n +o(n)}$.

in joint work with daniel hast and joseph we count degree 3 and 4 covers of the projective line over finite fields. this is a geometric analogue of the number field side of counting cubic and quartic fields. we take a geometric approach, by using a vector bundle parametrization of these curves which is different from the recent work of manjul bhargava, arul shankar, xiaoheng wang "geometry of numbers methods over global fields: prehomogeneous vector spaces" in which the authors extend the geometry of numbers methods to global fields. our count is just for $s_3$ and $s_4$ covers, and we put the rest of the curves in our error term.

we start by discussing bochner's canonical decomposition of negative definite functions on the space of infinite sequences of real numbers and then look at extensions of this theorem within the framework of more general infinite-dimensional groups like the infinite symmetric group. the chosen approach relies on the theory of spherical functions developed by g. olshanski.

in classical hodge theory, variations of hodge structure and their associated period mappings play a crucial role. in the $p$-adic world, it turns out there are *two* natural kinds of period maps associated with variations of $p$-adic hodge structure: the ``grothendieck-messing" period maps, which roughly come from comparing crystalline and de rham cohomology, and the ``hodge-tate" period maps, which come from comparing de rham and $p$-adic etale cohomology. i'll discuss these period maps, their applications, and some new results on their construction and geometry. this is partially joint work with jared weinstein.

i will describe a construction which associates a canonical $p$-adic l-function with a refined cohomological hilbert modular form $(\pi, \alpha)$ under some mild and natural assumptions. the main novelty is that we do not impose any hypothesis of “small slope” or “noncriticality” on the allowable refinements. over $\mathbb{q}$, this result is due to bellaiche. our strategy for dealing with critical refinements is roughly parallel to his, and in particular relies on a careful study of the local geometry of eigenvarieties at classical (but possibly critical) points. this is joint work with john bergdall.

data assimilation or filtering of nonlinear dynamical systems combines numerical models and observational data to provide the best statistical estimates of the systems. ensemble-based methods have proved to be indispensable filtering tools in atmosphere and ocean systems that are typically high dimensional turbulent systems. in operational applications, due to the limited computing power in solving the high dimensional systems, it is desirable to use cheap and robust reduced-order forecast models to increase the number of ensemble for accuracy and reliability. this talk describes a multiscale data assimilation framework to incorporate reduced-order multiscale forecast methods for filtering high dimensional complex systems. a reduced-order model for two-layer quasi-geostrophic equations, which uses stochastic modeling for unresolved scales, will be discussed and applied for filtering to capture important features of geophysical flows such as zonal jets. if time permits, a generalization of the ensemble-based methods, multiscale clustered particle filters, will be discussed, which can capture strongly non-gaussian statistics using relatively few particles.

the verlinde formula is a celebrated explicit computation of the
dimension of the space of sections of certain positive line bundles over
the moduli space of semistable vector bundles over an algebraic curve. i
will describe a recent generalization of this formula in which the
moduli of vector bundles is replaced by the moduli of semistable higgs
bundles, a moduli space of great interest in geometric representation
theory. a key part of the proof is a new ``virtual non-abelian
localization formula" in k-theory, which has broader applications in
enumerative geometry. the localization formula is an application of the
nascent theory of theta-stratifications, and it serves as a new source
of applications of derived algebraic geometry to more classical questions.

large amounts of data now stream from daily life; data
analytics has been helping to discover hidden patterns, correlations and
other insights. this talk introduces the mode decomposition problem in
the analysis of oscillatory data. this problem aims at identifying and
separating pre-assumed data patterns from their superposition. it has
motivated new mathematical theory and scientific computing tools in
applied harmonic analysis. these methods are already leading to
interesting and useful results, e.g., electronic health record analysis,
microscopy image analysis in materials science, art and history.

the development of the theory of mirror symmetry in high energy
physics has led to deep conjectures regarding the geometry of a
special class of complex manifolds called calabi-yau manifolds. one of
the most intriguing of these conjectures states that various geometric
invariants, some classical and some more homological in nature, agree
for any two calabi-yau manifolds which are ``birationally equivalent"
to one another. i will discuss how new methods in equivariant geometry
have shed light on this conjecture over the past few years, leading to
the first substantial progress for compact calabi-yau manifolds of
dimension greater than three. the key technique is the new theory of
``theta-stratifications," which allows one to bring ideas from
equivariant morse theory into the setting of algebraic geometry.

in this talk i will talk on our recent work on asymptotically hyperbolic einstein manifolds. i will present a proof for a sharp volume comparison theorem for asymptotically hyperbolic einstein manifolds, which will imply not only the rigidity theorem for hyperbolic space in general dimension but also curvature estimates for asymptotically hyperbolic einstein manifolds. in particular, as a consequence of our curvature estimates, one now knows that the asymptotically hyperbolic einstein metrics with conformal infinities of sufficiently large yamabe constant have to be negatively curved.

this talk focuses on two instances in which scientific fields outside mathematics benefit from incorporating the geometry of the data. in each instance, the applications area motivates the need for new mathematical approaches and algorithms, and leads to interesting new questions. (1) a method to determine and predict drug treatment effectiveness for patients based off their baseline information. this motivates building a function adapted diffusion operator for high dimensional data x when the function f can only be evaluated on large subsets of x, and defining a localized filtration of f and estimation values of f at a finer scale than it is reliable naively. (2) the current empirical success of deep learning in imaging and medical applications, in which theory and understanding is lagging far behind. by assuming the data lies near low dimensional manifolds and building local wavelet frames, we improve on existing theory that breaks down when the ambient dimension is large (the regime in which deep learning has seen the most success).

the spectra of signed matrices have played a fundamental role in social sciences, graph theory and control theory. they have been key to understanding balance in social networks, to counting perfect matchings in bipartite graphs, and to analyzing robust stability of dynamic systems involving uncertainties. more recently, the results of marcus et al. have shown that an efficient algorithm to find a signing of a given adjacency matrix that minimizes the largest eigenvalue could immediately lead to efficient construction of ramanujan expanders.
motivated by these applications, this talk investigates natural spectral properties of signed matrices and address the computational problems of identifying signings with these spectral properties. there are three main results we will talk about: (a) np-completeness of three signing related problems with (negative) implications to efficiently constructing expander graphs, (b) a complete characterization of graphs that have all their signed adjacency matrices be singular, which implies a polynomial-time algorithm to verify whether a given matrix has a signing that is invertible, and (c) a polynomial-time algorithm to find a minimum increase in support of a given symmetric matrix so that it has an invertible signing.

quantum computers are known to outperform classical
computers in a variety of computational tasks. this includes search on
various networks or databases, which can be encoded as graphs. the
search is performed using a quantum walk--the quantum mechanical
analogue of a random walk--and quantum walks often search
quadratically faster than random walks. despite this success, we show
that certain graphs and arrangements of marked vertices cause
difficulties for quantum walks, causing them to perform worse than
classical random walks. on the other hand, some of these difficulties
are successes in disguise, and we use them to construct
greater-than-quadratic speedups for spatial search by quantum walk.

this is joint work with krisjanis prusis, jevgenijs vihrovs, and
raqueline santos in http://arxiv.org/abs/1608.00136 and
http://arxiv.org/abs/1610.06075.