Past Events

Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis algorithm, are designed to converge to complicated high-dimensional target distributions, to facilitate sampling. The speed of this convergence is essential for practical use. In this...

Reconstructing simplicial complexes from partial information has been a problem of interest for decades. A triangulation of a d-dimensional sphere is obtained by gluing a collection of d-dimensional simplices (“higher dimensional triangles”) along...

Canonical Correlation Analysis (CCA) is a method for analyzing pairs of random vectors; it learns a sequence of paired linear transformations such that the resultant canonical variates are maximally correlated within pairs while uncorrelated across...

In recognition of Rod Edwards’ remarkable contributions to the field of Mathematical Modeling, we are inviting Rod’s current and former students, postdocs, close collaborators, friends and colleagues to attend this event, scheduled to take place on...

I will be presenting a frame approach for computing solutions of differential equations inspired by recent progress in frame theory and sparse spectral methods. The primary case study for our method will be a very general family of equations...

A colorful diagrammatic language for the 2-category of categories has been exposited in a recent monograph by Dan Marsden and Ralf Hinze. In this tutorial, we will demonstrate how to use the language, and we will emphasize its benefits for the study...

The Direct Summand Theorem states that if $R$ is a commutative Noetherian ring, then any finite extension $R\to S$ splits as a map of $R$-modules. This suggests the notion of a splinter as a class of singularities, where we say a scheme $X$ is a...

In this talk, we will discuss an estimate for a discrete mean value of the Riemann zeta function and its derivatives multiplied by Dirichlet polynomials. Assuming the Riemann Hypothesis, we obtain a lower bound for the 2kth moment of all the...

In Graph Theory, the well-known problems of packing and independence are generalized by broadcast packing and broadcast independence. As an analogy, placing cell towers (of various powers) in a network so that the signals do not interfere is a...

Moshe’s Insanity is a fascinating puzzle based on the game Instant Insanity. It was created for the ACM ICPC competition in 1994. The premise of the puzzle is relatively straightforward: you are given eight cubes, and your task is to arrange these...