Events
Pure Math Graduate Student Seminar: Reeshad Arian, Geometry over \mathbb{F}_1
SAS 2102Even though the field with one element, , is a meaningless concept, shadows of it have been apparent in multiple categorical analogies. More immediately, one can generalize multiple constructions from algebraic…
Seminar: Di Fang, UC Berkeley, Quantum algorithms for Hamiltonian simulation with unbounded operators
SAS 4201Recent years have witnessed tremendous progress in developing and analyzing quantum computing algorithms for quantum dynamics simulation of bounded operators (Hamiltonian simulation). However, many scientific and engineering problems require the…
Seminar: Robert Baraldi, Sandia National Labs, An Inexact Trust Region Algorithm for Nonsmooth, Nonconvex Optimization
SAS 4201Many problems in scientific computing require minimizing nonsmooth optimization problems. In many applications, it is common to minimize the sum of a smooth nonconvex function and a nonsmooth convex function.…
Seminar: Michael DiPasquale, University of South Alabama, A bridge between the algebra and geometry of hyperplane arrangements
SAS 4201A hyperplane arrangement is a union of codimension one linear spaces. These simple objects provide fertile ground for interactions between combinatorics, algebra, algebraic geometry, topology, and group actions. The combinatorics…
Seminar: Dominykas Norgilas, University of Michigan, Model-free price bounds of derivative contracts
SAS 4201What is the cheapest way to superhedge a path-dependent derivative security? If liquid European calls and the underlying risky stock can be used for hedging, then the lowest superhedging price corresponds…
Seminar: Chao Chen, UT Texas, Fast, Robust, and Scalable Linear Solvers for Scientific Computing and Data Analytics
SAS 4201The solution of large sparse linear systems is an essential building block in many science and engineering applications. It is also often the main computational bottleneck. For large problems, direct…
Seminar: Papri Dey, Georgia Institute of Technology, Hyperbolic Polynomials in Combinatorics and Optimization
SAS 4201Hyperbolic polynomials are coordinate free generalization to the notion of real rooted polynomials. A special class of hyperbolic polynomials are determinantal polynomials and they bound spectrahedra, feasible sets of semidefinite…
Seminar: Nadejda Drenska, Johns Hopkins University, A PDE Interpretation of Prediction with Expert Advice
SAS 4201We study the problem of prediction of binary sequences with expert advice in the online setting, which is a classic example of online machine learning. We interpret the binary sequence as the price history of…
Seminar: Anna Weigandt, MIT, Combinatorial Aspects of Determinantal Varieties
SAS 4201Schubert calculus has its origins in enumerative questions asked by the geometers of the 19th century, such as “how many lines meet four fixed lines in three-space?” These problems can…
Seminar: Jacob Matherne, University of Bonn and Max Planck Institute for Mathematics, Germany, Polynomials in combinatorics and representation theory
SAS 4201Many polynomials in combinatorics (and in other areas of mathematics) have nice properties such as having all of their roots being real numbers, or having all of their coefficients being…
Financial Mathematics Seminar: Jean-Perre Fouque, University of California, Santa Barbara, Reinforcement Learning Algorithm for Mixed Mean Field Control Games
Park Shops 200We present a new combined Mean Field Control Game (MFCG) problem which can be interpreted as a competitive game between collaborating groups and its solution as a Nash equilibrium between…
Pure Math Graduate Student Seminar: Jack Reever, A 2-parameter family of helicoidal surfaces
SAS 2102Of course, anybody can deform a surface in whatever way they want. However, is there a way to deform a surface of revolution into a helicoid while preserving an isometry?…
Pure Math Graduate Student Math Seminar: Andrew Shedlock, A smooth two Parameter Family of Geodesically Equivalent Metrics
SAS 2102In Riemannian geometry, given a Riemannian manifold (M,g) one can use geodesics associated with (M,g) to determine information about the shortest distance between points, curvature, triangles on a manifold and…
Applied Mathematics Graduate Student Association Seminar: William Anderson, Fast and Scalable Computation of Reduced-Order Nonlinear Solutions for PDEs, Abhijit Chowdhary, Sensitivity Analysis of the Information Gain in Infinite-Dimensional Bayesian Linear Inverse Problems
SAS 4201- Presenter: William Anderson - Title: Fast and Scalable Computation of Reduced-Order Nonlinear Solutions for PDEs - Abstract: We develop a method for fast and scalable computation of reduced-order nonlinear solutions…
Doctoral Exam: Sabina Rich, NC State, Combining mixed effects modeling with sparse regression for model selection using biological time series data
Advisor Kevin Flores, contact for Zoom access.
Doctoral Exam: Dave White, NC State, Symplectic instanton homology of knots and links in three-manifolds
SAS 3134Advisor is Tye Lidman.
Pure Math Graduate Student Seminar: Daniel Profili, NC State, Eigenvalue configurations for real symmetric matrices
SAS 2102Real symmetric matrices appear in a wide range of disciplines. One geometric problem that can be asked of two real symmetric matrices is: how are their eigenvalues arranged on the…
Doctoral Exam: Robin Morillo, NC State, Sensitivity Analysis of Biochemical Models
ZoomPierre Gremaud, contact for Zoom access
Doctoral Exam: Joe Johnson, NC State, Problem in Dynamical Algebraic Combinatorics and Algebraic Statistics
ZoomRicky Liu, contact for zoom access.