Skip to main content
College of Sciences
Department of Mathematics

Events

Events Search and Views Navigation

Event Views Navigation

Today

Numerical Analysis Seminar: Jamie Haddock, Harvey Mudd College, Connections between Iterative Methods for Linear Systems and Consensus Dynamics on Networks

Zoom

There is a well-established linear algebraic lens for studying consensus dynamics on networks, which has yielded significant theoretical results in areas like distributed computing, modeling of opinion dynamics, and ranking methods.  Recently, strong connections have been made between problems of consensus dynamics on networks and classical iterative methods in numerical linear algebra.  This talk will…

SIAM Bootcamp Series #2 – MATLAB

Poe Hall 211

We are excited to announce that SIAM is hosting another bootcamp: a two-part series that introduces you to MATLAB. Both graduate and undergrads are welcome, so please spread the word! You’re encouraged to have Matlab installed, which is free for NCSU students. For a detailed instruction on how to download and install Matlab to your computer,…

Biomath Seminar: Zixuan Cang, NC State, Spatiotemporal analysis of single-cell and spatial genomics data

Cox 306

The emerging single-cell and spatial genomics techniques allow us to elucidate the governing rules of multicellular systems with unprecedented resolution and depth. These datasets are often high-dimensional, complex, and heterogeneous. Mathematical tools are needed to extract biological insights from such data. In this talk, we will discuss several mathematical and machine learning methods for exploring…

Geometry and Topology Seminar: Ian Zemke, Princeton, Bordered aspects of the Heegaard Floer surgery formulas

Zoom

In this talk, we will discuss bordered aspects of the Heegaard Floer surgery formulas of  Ozsvath--Szabo and Ozsvath--Manolescu. In particular, we will explain how their theories naturally define bordered invariants for manifolds with toroidal boundary components. Time permitting, we will discuss applications of the theory. One application is a proof of the equivalence of lattice…

Differential Equations/Nonlinear Analysis Seminar: Maria Teresa Chiri, Queen’s University, Controlling the spread of invasive biological species

Zoom

We consider a controlled reaction-diffusion equation, modeling the spreading of an invasive population. Our goal is to derive a simpler model, describing the controlled evolution of a contaminated set. We first analyze the optimal control of 1-dimensional traveling wave profiles. Using Stokes’ formula, explicit solutions are obtained, which in some cases require measure-valued optimal controls.…

Applied Math Graduate Student Seminar: William Anderson, NC State, Efficient computation of reduced-order nonlinear solutions for PDEs

SAS 4201

In this talk we develop a method for efficient computation of reduced-order nonlinear solutions (RONS). RONS is a framework to create reduced-order models for time-dependent partial differential equations (PDEs) where the reduced-order solution has nonlinear dependence on time-varying parameters. With RONS we obtain an explicit set of ordinary differential equations (ODEs) to evolve the parameters.…

Pure Math Grad Student Seminar: Emily McGovern, NC State, Module categories for \text{Tilt}(SL_{2k+1}) from \tilde{A}_{n-1}-buildings

SAS 2235

We show that the category of vector bundles over the vertices of a locally finite \tilde{A}_{n-1} building \Delta, Vec(\Delta), has the structure of a Tilt(SL_{2k+1}) module category. This module category is the q-analogue of the Tilt(SL_{2k+1}) action on vector bundles over the sl_n weight lattice. Our construction of the Tilt(SL_{2k+1}) action on Vec(\Delta) extends to…

Numerical Analysis Seminar: Themis Sapsis, MIT, Likelihood-weighted active learning with application to Bayesian optimization, uncertainty quantification, and decision making in high dimensions

Zoom

Analysis of physical and engineering systems is characterized by unique computational challenges associated with high dimensionality of parameter spaces, large cost of simulations or experiments, as well as existence of uncertainty. For a wide range of these problems the goal is to either quantify uncertainty and compute risk for critical events, optimize parameters or control…

Biomath Seminar: Dr. Archana Timsina and Evan Curcio, NC State, Identifiability and optimal control analysis of HIV infection and opioid addiction model / How do tension ratios determine morphometry in physical models of notochord cell packing?

Cox 306

Dr. Timsina's Talk: Identifiability and optimal control analysis of HIV infection and opioid addiction model. Abstract: In a compartmental model of HIV infection and opioid addiction, dynamics such as equilibria, basic reproduction number, and invasion numbers are presented. Identifiability and estimation of the parameters of the model are highlighted. Moreover, the effect of four distinct controls such…

Geometry and Topology Seminar: Jiahua Zou, Brown University, Free boundary minimal surfaces in the Euclidean three-ball close to boundary

SAS 4201

I will talk about the new construction of genus-zero free boundary minimal surfaces embedded in the unit ball in the Euclidean three-space which are compact and lie arbitrarily close to the boundary unit sphere with an arbitrarily large number of connected boundary components. The construction is by PDE gluing methods and the surfaces are desingularizations…

Algebra and Combinatorics Seminar: Jianping Pan, NC State, A bijection between K-Kohnert diagrams and reverse set-valued tableaux

SAS 2225

Lascoux polynomials are K-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux (RSVT) rule for Lascoux polynomials and reverse semistandard Young tableaux (RSSYT) rule for key polynomials. Besides, key polynomials have a simple algorithmic model in terms of Kohnert diagrams, which are in bijection with RSSYT. Ross and…

Differential Equations/Nonlinear Analysis Seminar: Ryan Murray, NC State, Adversarially robust classification, non-local perimeters, and geometric flows

SAS 4201

Classification is a fundamental task in data science and machine learning, and in the past ten years there have been significant improvements on classification tasks (e.g. via deep learning). However, recently there have been a number of works demonstrating that these improved algorithms can be “fooled” using specially constructed adversarial examples. In turn, there has been increased…

Applied Math Graduate Student Seminar: Abhijit Chowdhary, NC State, Computing Eigenvalue Sensitivities for Sensitivity Analysis of the Information Gain in Bayesian Linear Inverse Problems

SAS 4201

We consider sensitivity analysis of Bayesian inverse problems with respect to modeling uncertainties. To this end, we consider sensitivity analysis of the information gain, as measured by the Kullback-Leibler divergence from the posterior to the prior. This choice provides a principled approach that leverages key structures within the Bayesian inverse problem. Also, the information gain…

Numerical Analysis Seminar: Wuchen Li, University of South Carolina, Mean-Field Games for Scalable Computation and Diverse Applications

SAS 4201

Mean field games (MFGs) study strategic decision-making in large populations where individual players  interact via specific mean-field quantities. They have recently gained enormous popularity as powerful research tools with vast applications. For example, the Nash equilibrium of MFGs forms a pair of PDEs, which connects and extends variational optimal transport problems. This talk will present…

Algebra and Combinatorics Seminar: Nicholas Russoniello, Willam & Mary,

SAS 2225

Jointly in person and virtually on Zoom. SAS 2225 for in-person participation. The Zoom link is sent out to the Algebra and Combinatorics mailing list, please contact Corey Jones at cmjones6@ncsu.edu to be added.   Speaker’s webpage: https://www.wm.edu/as/mathematics/faculty-directory/russoniello_n.php

Pure Math Graduate Student Seminar: Ashley Tharp, NC State, Arcs and shards

SAS 2235

The group of permutations is the canonical example of a finite Coxeter group, and each permutation can be represented visually by a noncrossing arc diagram. Each diagram encodes the canonical join representation of its permutation, and diagrams can be used to understand lattice congruences on the weak order of type A, equivalence relations that respect the…