Mathematics Colloquium

Spring 2024

Location and Time: Minard 210 at 3:00 PM (Refreshments at 2:30 in Minard 404)

*Special Colloquia or Tri-College Colloquia venues and times may vary, please consult the individual listing.

Tuesday, January 30         
Christian Parkinson, University of Arizona

Optimal Path Planning in the Hamilton-Jacobi Formulation

Abstract:  We present a partial-differential-equation-based optimal path planning framework. This formulation relies on optimal control theory, dynamic programming, and Hamilton-Jacobi-Bellman equations, and thus provides an interpretable alternative to black-box machine learning algorithms. We briefly discuss grid-based numerical methods used to resolve the solution to the Hamilton-Jacobi-Bellman equation and generate optimal trajectories, and then describe how efficient and scalable algorithms for solutions of high dimensional Hamilton-Jacobi equations can be used to solve similar problems in higher dimensions and in nearly real-time. We demonstrate all of our methods with several examples.

 

Thursday, February 1        
Yang Zhang, University of Washington

Microlocal methods in inverse problems arising in medical imaging 

Abstract:  Microlocal analysis provides a framework to study distributions (generalized functions) and operators from a phase space point of view. It is rooted in Fourier analysis and further developed by functional analysis and symplectic geometry. A fundamental concept in this field, singularities, refer to points in phase space where a distribution is not smooth. In this talk, we will discuss the study of several inverse problems using microlocal analysis, especially from the perspective of singularities. The first inverse problem is to reconstruct a density function of an object from its integral transform over cone surfaces, which arises in Compton camera imaging. Using microlocal analysis, we describe which features (singularities) of the object can be reconstructed in a stable way from local data measurements. Next, we will talk about inverse problems of recovering parameters in partial differential equations from boundary measurements, especially addressing nonlinear wave equations in ultrasound imaging with damping effects. We will explain how the analysis of new singularities, produced by the nonlinear interactions of waves, enables the determination of these parameters. In particular, we will address the challenges in inverse boundary value problems and the techniques to handle them.

 

Tuesday, February 6        
David Smith, Yale-NUS College

Fokas diagonalization

Abstract:  We describe a new form of diagonalization for linear two point constant coefficient differential operators with arbitrary linear boundary conditions. Although the diagonalization is in a weaker sense than that usually employed to solve initial boundary value problems (IBVP), we show that it is sufficient to solve IBVP whose spatial parts are described by such operators. We argue that the method described may be viewed as a reimplementation of the Fokas transform method for linear evolution equations on the finite interval. The results are extended to multipoint and interface operators, including operators defined on networks of finite intervals, in which the coefficients of the differential operator may vary between subintervals, and arbitrary interface and boundary conditions may be imposed; differential operators with piecewise constant coefficients are thus included.

 

Tuesday, February 13        
Jiaxin Jin, Ohio State University

Biochemical reaction networks

Abstract:  I will discuss mathematical models of biochemical reaction networks. First, I will introduce mathematical models of biochemical reaction networks under the classical assumption of mass action kinetics. Then we restrict our attention to toric dynamical systems, which appear naturally as models of reaction networks and have very robust and stable dynamical properties. We then extend these models to disguised toric dynamical systems, which are generated by a reaction network N, such that they have toric realization with respect to some other network N’. This allows us to greatly extend the applicability of the theory of toric systems. Then, by studying input-output networks, I will describe how the network structure can be connected to the property of homeostasis in biology. As the main result, we show all homeostasis patterns supported by a given input-output network in terms of a combinatorial structure associated to the input-output network.

 

Thursday, February 15        
Ke Chen, University of Maryland

Towards efficient deep operator learning for forward and inverse PDEs: theory and algorithms

Abstract:  Deep neural networks (DNNs) have been a successful model across diverse machine learning tasks, increasingly capturing the interest for their potential in scientific computing. This talk delves into efficient training for PDE operator learning in both the forward and inverse PDE settings. Firstly, we address the curse of dimensionality in PDE operator learning, demonstrating that certain PDE structures require fewer training samples through an analysis of learning error estimates. Secondly, we introduce an innovative DNN, the pseudo-differential auto-encoder integral network (pd-IAE net), and compare its numerical performance with baseline models on several inverse problems, including optical tomography and inverse scattering. We will briefly mention some future works at the end, focusing on the regularization of inverse problems in the context of operator learning.

 

Tuesday, February 20         
Colin Defant, Harvard

Bender--Knuth Billiards in Coxeter Groups 

Abstract:  Let (W,S) be a Coxeter system, and write S={$s_i$ : i is in I}, where I is a finite index set. Consider a nonempty finite convex subset L of W. If W is a symmetric group, then L is the set of linear extensions of a poset, and there are important Bender--Knuth involutions $BK_i$ (indexed by I) defined on L.  For arbitrary W and for each i in I, we introduce an operator $\tau_i$ on W that we call a noninvertible Bender--Knuth toggle; this operator restricts to an involution on L that coincides with $BK_i$ when W is a symmetric group. Given an ordering $i_1,...,i_n$ of I and a starting element u_0 of W, we can repeatedly apply the toggles in the order $\tau_{i_1},...,\tau_{i_n},\tau_{i_1},...,\tau_{i_n},....$ This produces a sequence of elements of W that can be viewed in terms of a beam of light that bounces around in an arrangement of transparent windows and one-way mirrors. Our central questions concern whether or not the beam of light eventually ends up in the convex set L. We will discuss several situations where this occurs and several situations where it does not. This is based on joint work with Grant Barkley, Eliot Hodges, Noah Kravitz, and Mitchell Lee. 

 

Tuesday, April 9

*Special Tri-College Colloquium at Concordia

TBD

Title: TBD

Abstract: TBD

 

Tuesday, April 16        
Bartłomiej Zawalski, Kent State.

TBD

Abstract:  TBD

 

Tuesday, April 23

*Special Tri-College Colloquium at NDSU

Ashok Aryal, MSUM

Title: TBD

Abstract: TBD

 

Tuesday, April 30       
Indranil SenGupta, Florida International University

TBD

Abstract:  TBD

 

Top of page