Skip to main content
College of Sciences
Department of Mathematics

Events

Events Search and Views Navigation

Event Views Navigation

Today

Algebra and Combinatorics Seminar: Adam Daniel Gregory, University of Florida,Vexillary double Edelman–Greene coefficients are Graham positive

SAS 4201

Lam, Lee, and Shimozono (LLS) recently introduced backstable double Schubert polynomials to represent classes in the cohomology ring of the infinite flag variety. Using these polynomials, they introduce double Stanley symmetric functions, which expand into double Schur functions with polynomial coefficients called double Edelman--Greene coefficients. They prove that double Edelman--Greene coefficients are Graham positive. For…

Differential Equations and Nonlinear Analysis Seminar: Benjamin Seeger, University of Texas at Austin, Weak solutions of nonlinear, nonconservative transport systems

SAS 4201

I will discuss certain systems of transport type whose coefficients depend nonlinearly on the solution. Applications of such systems range from the modeling of pressure-less gases to the study of mean field games in a discrete state space. I will identify a notion of weak solution within the class of coordinate-wise decreasing functions, a condition…

Stochastics Seminar: Khai Nguyen, NC State, Differential Game Models of Optimal Debt Management

SAS 4201

In this talk, I will present recent results on game theoretical formulation of optimal debt management problems in an infinite time horizon with exponential discount, modeled as a noncooperative interaction between a borrower and a pool of risk-neutral lenders. Here, the yearly income of the borrower is governed by a stochastic process and bankruptcy instantly occurs…

Applied Math Graduate Student Seminar: John Darges, NC State, Randomized Function Approximation

SAS 4201

Two of the most popular approaches to supervised learning are kernels and artificial neural networks (ANN).The ability to emulate complicated nonlinear behavior makes them powerful tools for function approximation.Randomization schemes, which have been successfully deployed to improve efficiency for many algorithms, havealso been developed for kernel methods and ANNs. These are random weight neural networks…

Geometry Topology Seminar: Paweł Dłotko, DIOSCURI Centre for Topological Data Analysis, Warsaw, Poland, From Euer number to statistics and back. Tangential approach to Topological Data Analysis.

SAS 4201

In this talk, I will give a brief and intuitive overview of the methods of Topological Data Analysis we developed in my Discuri Centre. Starting from Euler numbers and its generalization we will get to the regime of statistical goodness of fit test. We will explore alternative methods of constructing graph based visualization of data.…

Biomath Seminar: Siting Liu, UCLA, An inverse problem in mean field game from partial boundary measurement

Cox 306

Mean-field game (MFG) systems provide a powerful framework for modeling the collective behavior of multi-agent systems with diverse applications, including those in biological populations. However, unknown parameters pose challenges. In this work, we tackle an inverse problem, recovering MFG parameters from limited, noisy boundary observations. Despite the problem's ill-posed nature, we aim to efficiently retrieve…

Algebra and Combinatorics Seminar: Michael Hull, UNC Greensboro, Highly transitive groups, hyperbolicity, and random walks

SAS 4201

A group is highly transitive if it admits a faithful, highly transitive action, that is an action which is k-transitive for all k>0. We will discuss some algebraic properties of these groups, as well as constructions of highly transitive actions for hyperbolic groups (and a wide array of generalizations of hyperbolic groups) using random walks.…

Computational and Applied Mathematics: Jingwei Hu, University of Washington, Structure-Preserving Particle Method for the Vlasov-Maxwell-Landau Equation

SAS 4201

The Vlasov-Maxwell-Landau equation is often regarded as the first-principle physics model for plasmas. We introduce a novel particle method for this equation that collectively models particle transport, electromagnetic field effects, and particle collisions. The method arises from a regularization of the variational formulation of the Landau collision operator, leading to a discretization of the operator…

Geometry and Topology Seminar: Ao Sun, Lehigh University, Interpolation method in mean curvature flow

Zoom

The interpolation method is a very powerful tool to construct special solutions in geometric analysis. I will present two applications in mean curvature flow: one is constructing a new genus one self-shrinking mean curvature flow, and another one is constructing immortal mean curvature flow with higher multiplicity convergence. The talk is based on joint work…

Algebra and Combinatorics Seminar: Yairon Cid-Ruiz, NC State, Duality and blow-up algebras

SAS 4201

We provide a generalization of Jouanolou duality that is applicable to a plethora of situations. The environment where this generalized duality takes place is a new class of rings, that we introduce and call weakly Gorenstein. As a main consequence, we obtain a new general framework to investigate blowup algebras. We use our results to…

Differential Equations and Nonlinear Analysis Seminar: Nicolás García Trillos, University of Wisconsin Madison

SAS 4201

Despite the success of deep learning-based algorithms, it is widely known that neural networks may fail to be robust to adversarial perturbations of data. In response to this, a popular paradigm that has been developed to enforce robustness of learning models is adversarial training (AT), but this paradigm introduces many computational and theoretical difficulties. Recent…

Kwangil Koh Lecture on Mathematics in Our Time: Robert Ghrist, University of Pennsylvania, Information Dynamics on Social Networks

SAS 2203

Abstract: Social networks play a crucial role in how we share and discuss ideas. This talk delves into the mathematics behind the spread of information (such as opinions or beliefs) on these networks. Imagine a network as a complex web, where each node represents an individual and the connections represent interactions. Opinions, beliefs, arguments, and other…