Skip to main content

Events

Stochastics Seminar: Nick Cook, Duke, Branching Brownian motion and the Road-Field Model

SAS 4201

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…

Applied Math Graduate Student Seminar: Walker Powell, Sensitivity Analysis of Attracting Dynamical Systems via Optimal Transport of Invariant Measures

SAS 4201

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…

Colloquium: Nikolaos Kapouleas, Brown University, Minimal Surface Doublings and Their Geometry

SAS 4201

Minimal surfaces are fundamental geometric objects which have been studied intensively since the 1700's. Classes of minimal surfaces of particular interest are the complete embedded ones in Euclidean space, closed (compact boundaryless) embedded in the round three-sphere, free boundary compact embedded ones in the unit Euclidean three-ball, and self-shrinkers of the mean curvature flow. Since…

Symbolic Computation Seminar: Sriram Gopalakrishnan, Sorbonne Université, The arithmetic complexity of computing Grobner bases of determinantal systems

SAS 4201

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.…

Geometry and Topology Seminar: Irina Kogan, NC State, An Introduction to Computational Invariant Theory (Part I)

SAS 4201

 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…

Algebra and Combinatorics Seminar: Greg Muller, University of Oklahoma, Friezes of Dynkin type

SAS 4201

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…

Special Event: Staff Awards for Excellence

Witherspoon Student Center

It is with great enthusiasm that I have the opportunity to announce to the College this year's nominees for the Staff Awards for Excellence.  Your colleagues, listed below, have been nominated by supervisors and peers for the most prestigious honor bestowed upon non-faculty employees.  This award recognizes the outstanding accomplishments and contributions of individual employees, above…

Differential Equations and Nonlinear Analysis Seminar: Aris Daniilidis, TU Wien, Slope determination: from convex to Lipschitz continuous functions

Zoom

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

Computational and Applied Mathematics Seminar: Jian-Guo Liu, Duke University, Optimal Control for Transition Path Problems in Markov Jump Processes

SAS 4201

 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…

Math Honors Presentation Session: Kelsey Hanser, Mathew Kushelman and Logan Martyn

SAS 2203

1. Kelsey Hanser Title : Greedy Kohnert Posets  Abstract : K-Kohnert polynomials form a large family of polynomials which generalize Lascoux polynomials. Each K-Kohnert polynomial encodes a certain collection of diagrams which is formed from an initial seed diagram by applying what are called “Kohnert" and “ghost moves." In particular, Kohnert polynomials are the restrictions…

Geometry and Topology Seminar: Irina Kogan, NC State, An Introduction to Computational Invariant Theory (Part II)

SAS 4201

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…

Mathematics Department Commencement Ceremony

McKimmon Center, Raleigh NC

Please save the date for the Department of Mathematics Spring 2024 Graduation Ceremony. Commencement starts at 5:30PM, with guest seating starting at 5:00PM.

GAMMA (Games in Applied Math, Modeling, and Analysis)

SAS 2235

Discover the beauty of mathematics and its wide applicability and power in everyday life! Grade Level: High School Students   Schedule of Events: 11-11:15 am Drop Off 11:15-11:30 am Introductions 11:30-12:30 pm Applied Math and Math Modeling 12:30-1:15 pm Lunch 1:15-2:15 pm Control and Optimization in Biomedicine 2:15-2:45 pm Closing Remarks and Snacks 2:45-3 pm…

Algebra and Combinatorics Seminar: Apoorva Khare, Indian Institute of Science (Bangalore, India), Schur polynomials: from smooth functions to symmetric function identities

SAS 1102

Cauchy's determinantal identity (1840s) expands via Schur polynomials the determinant of the matrix f, where f(t) = 1/(1-t) is applied entrywise to the rank-one matrix u v^T = (u_i v_j). This theme has resurfaced in the 2010s in analysis (following a 1960s computation by Loewner), in the quest to find polynomials p(t) with a negative coefficient that entrywise preserve…

Biomathematics Seminar: Orlando Arguello-Miranda, Department of Plant and Microbial Biology at NC State, Deep learning and the yet-to-be-discovered mathematical principles of biology

Cox 306

Biology is defined by non-linear reactions caused by numerous molecular components interacting inside living cells. The complexity of such systems has limited classical experimental approaches in their capacity to measure living biological networks. This talk will explore how new computational tools derived from artificial intelligence are currently applied to study complex biological networks in living…

Geometry and Topology: Teemu Saksala, NC State, Hyperbolic inverse problems with time dependent and time independent coefficients

SAS 4201

In this talk we will discuss the differences in the methodology of determining time-dependent and time-independent coefficients appearing in a hyperbolic equation in a Riemannian manifold. The talk is based on two recent research projects: 1) We will prove that a local source-to-solution map of a hyperbolic partial differential operator on a complete Riemannian manifold (no…

Computational and Applied Mathematics: Daniel Serino, Los Alamos National Lab, Structure-Preserving Machine Learning for Dynamical Systems

Zoom

Developing robust and accurate data-based models for dynamical systems originating from plasma physics and hydrodynamics is of paramount importance. These applications pose several challenges, including the presence of multiple scales in time and space and a limited number of data, which is often noisy or inconsistent. The aim of structure-preserving ML is to strongly enforce…