Research Highlights

A Second-Order Correction Method For A Parabolic-Parabolic Interface Problem

ICERM - September 2024

Fluid-structure interaction (FSI) problems involve the study of how fluids and solid structures behave when they come into contact with each other. These problems are important in many engineering and scientific applications, such as aeronautics, aeroelasticity, aerodynamics, biomechanics, civil engineering, and mechanical engineering. Sijing Liu introduces a second-order correction method for a parabolic-parabolic interface problem, a simplified version of FSI.

A Second-Order Correction Method For A Parabolic-Parabolic Interface Problem Thumbnail Image

Grothendieck Shenanigans: Permutons From Pipe Dreams via Integrable Probability

IPAM - August 2024

If Alice and Bob each take a walk, a random one, what is the chance they will meet? If n people walk randomly in Manhattan from the Upper East Side going south or west, how often will two of them meet until they reach the Hudson? If they do not want to see each other more than once, in what relative order will they most likely arrive at the Hudson shore? If we make a rhombus like an Aztec diamond from 2 by 1 dominoes, what would it most likely look like? If water molecules arrange themselves on a square grid, what angles between the hydrogen atoms will be formed near the boundaries? And if ribosomes are transcribing the mRNA, how do they hop between the sites (codons)?

Grothendieck Shenanigans: Permutons From Pipe Dreams via Integrable Probability Thumbnail Image

Algorithms, Fairness, and Equity

SLMath - August 2024

Political districting is an important and mathematically challenging problem. In fall 2023, the Simons Laufer Mathematical Sciences Institute (SLMath) hosted a semester program on algorithms, fairness, and equity, focusing on the intersection of computational tools and the many notions of fairness that arise in different mathematical and societal contexts, such as political districting.

Algorithms, Fairness, and Equity Thumbnail Image

Exploiting Combinatorial Regularity for Topological and Morse Measures of ReLU Neural Networks

ICERM - July 2024

Identifying the capabilities of a machine learning model before applying it is a key goal in neural architecture search. Too small of a model, and the network will never successfully perform its task. Too large of a model, and computational energy is wasted and the cost of model training may become unbearably high. While universal approximation theorems and even dynamics are available for various limiting forms of ReLU neural networks, there are still many questions about the limitations of what small neural networks of this form can accomplish. Marissa Masden seeks to understand ReLU neural networks through a combinatorial, discrete structure that enables capturing topological invariants of structures like the decision boundary.

Exploiting Combinatorial Regularity for Topological and Morse Measures of ReLU Neural Networks Thumbnail Image

Our Changing World: Algebraic Statistics for Evolutionary Biology and Ecology

IMSI - June 2024

Understanding the evolutionary history of a collection of species, through fields such as phylogenomics and comparative phylogenetics, is crucial as we consider the future effects of climate change. Algebraic statistics provides algebraic and geometric tools to study the models commonly used in evolutionary biology. The Institute for Mathematical and Statistical Innovation (IMSI), hosted a workshop, “Algebraic Statistics for Ecological and Biological Systems,” as part of a Long Program on “Algebraic Statistics and Our Changing World,” which highlighted these connections.

Our Changing World: Algebraic Statistics for Evolutionary Biology and Ecology Thumbnail Image

Improving Newton’s Method Near Singular Points with Anderson Acceleration

ICERM - May 2024

Nonlinear equations are ubiquitous in the sciences, a famous example being the Navier-Stokes equations in fluid mechanics. To compute a numerical solution for a given nonlinear equation, one often employs an iterative scheme such as Newton’s method. Recent works by Matt Dallas, Sara Pollock, and Leo Rebholz analyze Anderson accelerated Newton’s method applied to singular problems.

Improving Newton’s Method Near Singular Points with Anderson Acceleration Thumbnail Image

Euler Systems

SLMath - April 2024

In the mid-19th century, while attempting to prove Fermat’s last theorem, German mathematician Ernst Kummer started investigating arithmetic on novel number systems.

Euler Systems Thumbnail Image

Traffic and Theory: Waves on Roads and Blackboards

IAS - April 2024

The largest live autonomous vehicle traffic experiment ever conducted began the week of November 18, 2022, in Nashville, Tennessee. It involved 100 cars and a workforce of more than 250, around 70 of whom were researchers. One of the goals of the experiment was to analyze how level two autonomous vehicles (think cruise control with a couple added functions, like speed adjustment that uses LIDAR) can impact traffic waves, specifically those representing frustrating “stop and go” conditions...

Higher uniformity of bounded multiplicative functions

AIM - February 2024

Kaisa Matomäki, Maksym Radziwill, Terence Tao, Joni Teräväinen, and Tamar Ziegler make progress on the conjectures of Sarnak and Chowla with their paper “Higher uniformity of bounded multiplicative functions in short intervals on average” published in the Annals of Mathematics in 2023. The work originated in a working group at the AIM workshop “Sarnak's conjecture” in December 2018.

Giving a Quadratic Solution to the Word Problem in 3-free Artin Groups

ICERM - January 2024

Artin groups emerged in the 1960s as generalizations of braid groups and modifications of Coxeter reflection groups involving the removal of the involution relation inherent in reflections, thus creating groups that project onto Coxeter groups. For example, braid groups with n strands project onto the symmetric group of n elements. Therefore, Artin groups have a very simple presentation: they are groups generated by a finite set of generators S and relations written as sts · · · = tst . . . for s, t ∈ S, where both words in the equality have the same length. However, groups so simple to define do not admit many common techniques that allow obtaining global results for any Artin group, making them highly enigmatic groups.

Giving a Quadratic Solution to the Word Problem in 3-free Artin Groups Thumbnail Image