Skip to main content

Events

Erik Bates, University of Wisconsin-Madison, Making sense of disordered systems: what if Euclid, Newton, and Maxwell did probability?

Zoom

Disordered systems are mathematical models (typically of the physical world) that are governed by random variables.  These models have offered insights into a diverse array of research problems, and have also brought about a great number of powerful mathematical tools.  The through line to the subject is the essential role played by probability theory, a…

Brian Adams, Sandia National Lab, Make a Difference: Mathematical Sciences R&D Careers at Sandia National Laboratories

Zoom

 Brian Adams (NCSU PhD 2005) will conduct a mathematics and statistics-specific information session including a brief overview of SNL’s mission, R&D areas, and opportunities in mathematics, statistics, and computational science. Staff and project profiles will demonstrate the ways you can contribute to high-impact problems in the national interest through fundamental math and computational science R&D, software/hardware development,…

Cain Edie-Michell, UC San Diego, Algebras in tensor categories

Zoom

It is a classical result that the simple algebras in the category of finite dimensional vector spaces are precisely the n x n matrix algebras. The notion of algebras in more general tensor categories is easy to formulate, and we can ask for classification results in these categories. Such classification results have broad applications to conformal field…

Robin Morillo, NC State, Model Simplification Through Component Removal

Zoom

When dealing with large compartment models it can often be challenging to track how a small component of the model affects the overall system. This is an issue when trying to determine if a model is in its "simplest form" or if there are components that can be removed without significantly affecting the model's behavior.…

Jordan Almeter, NC State, P-graph Associahedra

Zoom

Graph associahedra are simple polytopes dual to tubing complexes based on graphs, where a tubing consists of compatible connected subgraphs of a graph G. Graph associahedra can be realized by repeatedly truncating faces of a simplex. We generalize graph associahedra to define P-graph associahedra, which can be realized by repeatedly truncating faces of a simple polyhedron P. When P is…

Evgeni Dimitrov, Columbia University, Gibbsian line ensembles and beta-corners processes

Zoom

Gibbs measures are ubiquitous in statistical mechanics and probability theory. In this talk I will discuss two types of classes of Gibbs measures – random line ensembles and triangular particle arrays, which have received considerable attention due, in part, to their occurrence in integrable probability. Gibbsian line ensembles can be thought of as collections of…

Dr. Olivia Walch, the CEO of Arcascope, From simulations to subscriptions: Putting research math biology into the App Store

Zoom

In this talk, Dr. Olivia Walch, the CEO of Arcascope, will discuss her research into the mathematics of sleep and circadian rhythms modeling, and large scale analysis of wearable data. She will also discuss her journey from being a post-doc to forming her own start-up, as well as the challenges and opportunities in taking these mathematical…

Yimin Zhong, Duke University, Fast numerical algorithm for radiative transfer

Zoom

Constructing efficient numerical solution methods for the equation of radiative transfer (ERT)remains as a challenging task in scientific computing despite of the tremendous development on the subject in recent years. We present in this work a simple fast computational algorithm for solving the ERT in isotropic media in steady state setting and time-dependent setting. The algorithm we developed has two steps. In the first step, we solve a volume integral equation for the angularly-averaged ERT solution using iterative schemes such as the GMRES method.The computation in this step is accelerated with a fast multipole method (FMM). In the second step, we solve a scattering-free transport equation to recover the angular dependence of the ERT solution. The algorithm does not require the underlying medium be homogeneous. We present numerical  simulations under various scenarios to demonstrate the performance of the proposed numerical algorithm for both homogeneous and heterogeneous media. Then we will…

Chao Li, NYU, Stable minimal hypersurfaces in R^4.

Zoom

In this talk, I will discuss the Bernstein problem for minimal surfaces, and the recent solution to the stable Bernstein problem for minimal hypersurfaces in R^4. Precisely, we show that a complete, two-sided, stable minimal hypersurface in R^4 is flat. Corollaries include curvature estimates for stable minimal hypersurfaces in 4-dimensional Riemannian manifolds, and a structural…

Lucas Benigni, University of Chicago, Delocalization of eigenvectors for large random matrices

Zoom

In the study of disordered quantum systems, it is believed that a strong dichotomy should occur between two phases: a delocalized (or conducting) phase and a localized (or insulating) phase. While this is far from being proved in all generality, the study of large symmetric random matrices, which model simple systems, allows us to describe…

Yeor Hafouta, Ohio State University, A Berry-Esseen theorem and Edgeworth expansions for uniformly elliptic inhomogeneous Markov chains

Zoom

A classical result due to Dobrushin (1956) yields the central limit theorem for partial sums of functionals of inhomogeneous ("sufficiently contracting'') Markov chains. In the talk we will restrict to bounded functionals of uniformly elliptic inhomogeneous Markov chains, for which we can obtain: A Berry-Esseen theorem (optimal rates in the Central limit theorem); Correction terms of…

Walker Powell, NC State, Sparse Bayesian Identification of Nonlinear Dynamics

SAS 1108

Many inference problems relate to the dynamical system, x'=f(x). One primary problem in applications is that of system identification, i.e., how should the user accurately and efficiently identify the model f(x), including its functional family or parameter values, from discrete time-series data? One of the most successful algorithms to this end is the Sparse Identification of…

Joe Johnson, NC State, Birational Labelings of the Rectangle and Trapezoid Posets

Zoom

The rectangle poset and the action of rowmotion on it are two well studied objects in dynamical algebraic combinatorics, but work involving the trapezoid poset has proven more difficult. In 1983 Proctor showed that the number of reverse plane partitions of the rectangle poset and its associated trapezoid are the same. Since then it has…

Marina Chugunova, Claremont Graduate University, Motion of Liquid Films in the Gas Channels

Zoom

Catalysts are usually made of a dense but porous material such as activated carbon, zeolites, etc. that provide a large surface area. Liquids that are produced as a by-product of a gas reaction at the catalyst site transport to the surface of the porous material, slowing down transport of the gaseous reactants to the catalyst…

Nantel Bergeron, York University, From P-partitions to bounded P-partitions

Zoom

The theory of P-partitions was developed by Stanley to understand/solve several enumerations problems and representations theory problems. Together with the work of Gessel, this led to the development of the space of quasisymmetric functions. Schur functions are naturally understood in the world of quasisymmetric functions as a sum over standard tableaux of Gessel fundamental functions.…

Oliver Hinder, University of Pittsburgh, Practical Primal-Dual Hybrid Gradient for Large-Scale Linear Programming using Restarts and Other Enhancements

Zoom

Traditionally, linear programming (LP) is solved using Simplex or Interior Point Method whose core computational operation is factorization. Recently, there has been a push in the optimization community towards developing methods whose core computational operation is instead matrix-vector multiplications. Compared with factorization, matrix-vector multiplications are less likely to run out of memory on large-scale problems…

Tracey Balehosky, University of Calgary, Determining a Riemannian Metric from Least-Area Data

Zoom

Broadly speaking, there are two classes of inverse problems — those that are concerned with the analysis of PDEs, and those that are geometric in nature. In this talk, I will introduce the audience to these classes by highlighting two classical examples: Calderón’s problem for the PDE setting, and the boundary rigidity problem in the…