In this talk we discuss partial data inverse boundary problems for magnetic Schrödinger operators on bounded domains in the Euclidean space as well as some Riemannian manifolds with boundary. In particular, we show that the knowledge of the set of the Cauchy data on a portion of the boundary of a domain in the Euclidean…
The pop-stack sorting method takes an ordered list or permutation and reverses each descending run without changing their relative positions. In this talk we will review recent combinatorial results on the pop-stack sorting method, and we will extend the pop-stack sorting method to certain pattern avoiding permutations, called c-sortable. If time permits, we will describe…
I first give a quick introduction to front propagations, Hamilton-Jacobi equations, level-set forced mean curvature flows, and homogenization theory. I will then show the optimal rates of convergence for homogenization of both first-order and second-order Hamilton-Jacobi equations. Based on joint works with J. Qian, T. Sprekeler, and Y. Yu. Zoom meeting: Link
In the past decade, deep learning has made astonishing breakthroughs in various real-world applications. It is a common belief that deep neural networks are good at learning various geometric structures hidden in data sets. One of the central interests in deep learning theory is to understand why deep neural networks are successful, and how they…
In this talk, I will go through some old and new results concerning the rigidity and flexibility of scalar curvature.
Mean field game theory was developed to analyze Nash games with large numbers of players in the continuum limit. The master equation, which can be seen as the limit of an N-player Nash system of PDEs, is a nonlinear PDE equation over time, space, and measure variables that formally gives the Nash equilibrium for a given…
We consider a class of disordered mean-field combinatorial optimization problems, focusing on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a general distribution. We prove Central Limit Theorems for the log-partition function, the weight of a typical configuration, and the…
In wound healing applications, platelet-like particles (PLPs) are engineered biomaterials that aim to mimic the behavior of natural platelets. Platelets play an essential role in the successful formation of the extracellular fibrin matrix in blood clots, aiding in both fibrin polymerization and clot retraction. We consider techniques for data driven mathematical and computational modeling of…
Zoom Link
The famous knot complement theorem of Gordon and Luecke states that two knots in the three-sphere are equivalent if and only if the complements are homeomorphic. This was proved more than 30 years ago using combinatorial methods. In this talk, we will prove some extended results using techniques from gauge theory. If there is time…
In this talk, I will discuss the evolution of rigid bodies in a perfect incompressible fluid, and the limit systems that can be obtained as the bodies shrink to points. The model is as follows: the fluid is driven by the incompressible Euler equation, while the solids evolve according Newton’s equations under the pressure force on…
Spatio-temporal dynamical systems, such as fluid flows or vibrating structures, are prevalent across various applications, from enhancing user comfort and reducing noise in HVAC systems to improving cooling efficiency in electronic devices. However, these systems are notoriously hard to optimize and control due to the infinite dimensionality and nonlinearity of their governing partial differential equations…
The Fisher-KPP equation was introduced in 1937 to model the spread of an advantageous gene through a spatially distributed population. Remarkably precise information on the traveling front has been obtained via a connection with branching Brownian motion, beginning with works of McKean and Bramson in the 70s. I will discuss an extension of this probabilistic…
Determining the sensitivity of model outputs to input parameters is an important precursor to developing informative parameter studies, building surrogate models, and performing rigorous uncertainty quantification. A prominent class of models in many applications is dynamical systems whose trajectories lie on or near some attracting set after a sufficiently long time, and many quantities of…
Determinantal systems are systems of polynomial equations which encode a rank deficiency of a given matrix with polynomial entries over the solution set to other polynomial equations. Such systems arise in a number of areas of computational mathematics such as polynomial optimization, real algebraic and enumerative geometry and engineering sciences such as robotics and biology.…
Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group action. Since the 19th century, studying the structure of various types of invariants and designing methods and algorithms to compute them remains an active area of ongoing research with an abundance of applications, in particular, to…
A "frieze" is an infinite strip of numbers satisfying certain determinantal identities, or any one of several generalizations of this idea. In this talk, I will give an introduction to friezes whose shape is determined by a Dynkin diagram (motivated by their exceptional properties as well as connections to representation theory and cluster algebras). One…
A convex continuous function can be determined, up to a constant, by its remoteness (distance of the subdifferential to zero). Based on this result, we discuss possible extensions in three directions: robustness (sensitivity analysis), slope determination (in the Lipschitz framework) and general determination theory. Zoom meeting: Link
Transition paths connecting metastable states are significant in science and engineering, such as in biochemical reactions. In this talk, I will present a stochastic optimal control formulation for transition path problems over an infinite time horizon, modeled by Markov jump processes on Polish spaces. An unbounded terminal cost at a stopping time and a running…
Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group action. Since the 19th century, studying the structure of various types of invariants and designing methods and algorithms to compute them remains an active area of ongoing research with an abundance of applications, in particular, to…