On quantum and stochastic confinement Dr. Irina Nenciu Professor of Mathematics, Statistics, and Computer Science University of Illinois Chicago Our goal in this talk is to explore the broad question of confinement of particles to spatial domains. The first part... Read More
Hyperbolic groups and local connectivity In the 1980s Gromov introduced the family of hyperbolic groups, a family of finitely generated groups that are “negatively curved” in a certain sense. Hyperbolic groups share many features with the classical hyperbolic plane. The... Read More
Synchronization and Aggregation Dr. Tilmann Glimm Professor of Mathematics Western Washington University The phenomenon of spontaneous synchronization in networks of interacting oscillators ('clocks') has fascinated mathematical modelers since the 1980s. Examples include flashing of fireflies, synchronous firing of neurons, or... Read More
Ropes, fractions, and moduli spaces Dr. Nick Salter Assistant Professor of Mathematics University of Notre Dame This will be a discussion of the only actually cool math magic trick that I know of - John Conway’s tangle trick. Even schoolchildren... Read More
Primer on Persistent Homology and Persistent Diagrams Mr. Joe Paulson Graduate Teaching Assistant University of Wisconsin – Milwaukee Persistent diagrams are powerful mathematical tools used in the field of topological data analysis (TDA). These diagrams provide a concise and intuitive... Read More
Optimizing Gravitational Wave Detection Using Topological Data Analysis Ms. Jillian Cervantes Undergraduate University of Wisconsin – Milwaukee The interactions between black holes create decaying periodic "chirp'' signals known as gravitational waves (GW). The detection of GW is an important problem... Read More
From sphere packings to extremal problems on hyperbolic surfaces Dr. Maxine Fortier Bourque Professor of Mathematics Université de Montréal What proportion of space can be occupied by balls of radius 1 that do not overlap? How many such balls can... Read More
Pinnacles on Graphs Mr. Stephen Lasinis Undergraduate University of Wisconsin – Milwaukee We consider graphs that are simple, finite, connected, and undirected, and a bijective labeling on the vertices of the graph with the integers 1, 2, ..., n where... Read More
A variation of zero forcing: leaky forcing Dr. Ryan Moruzzi Jr Assistant Professor of Mathematics California State University, East Bay Zero forcing on a graph is an iterative graph coloring process where, starting with an initial set of blue vertices,... Read More