Speakers
Plenary Speakers
Bruce Sagan
Michigan State University
Bruce Sagan specializes in enumerative, algebraic, and topological combinatorics. His book The Symmetric Group has become the standard text and he has recently published a new book Combinatorics: The Art of Counting. He has written over 100 papers and given over 250 talks, including invited addresses FPSAC, Permutation Patterns, and the British Combinatorial Conference. For more information on him, see the article about him in Wikpedia, his inteview in the journal Enumerative Combinatorics and Applications 1: 3 (2022), or his home page www.math.msu.edu/ ̃sagan. He is also a folk musician and his musical web site is www.brucesagan.com.
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko
Sandra Kingan
Brooklyn College, CUNY
Sandra Kingan is an Associate Professor at Brooklyn College of the City University of New York. Her research lies at the intersection of combinatorics and geometry. She has published papers in matroid theory, graph theory, and combinatorial algorithms. Her book "Graphs and Networks" blends classical graph theory with modern network science and is available for preorder. She is a co-organizer of the Women in Graph Theory Research Network, a Math Alliance mentor and an International Mathematical Union's Committee for Women ambassador for North America.
Minimal and maximal 3-connected families in excluded minor classes of matroids
A 3-connected graph is one in which at least three vertices must be removed to disconnect it and a minimally 3- connected graph is a 3-connected graph in which removal of any edge destroys 3-connectivity. Analogous concepts can be defined for matroids. A minimally 3-connected family in an excluded minor class of matroids naturally gives rise to a maximal 3-connected family in the class by adding as many edges as possible. The focus in understanding the structure of excluded minor classes has traditionally been on finding the maximal families. However, we will see that the minimal families are just as important. I will present some structural results for analyzing minimally 3-connected matroids and show how they give rise to structural characterizations of excluded minor classes.
Chassidy Bozeman
Mount Holyoke College
Chassidy Bozeman is a Clare Boothe Luce Assistant Professor of Mathematics at Mount Holyoke College. Her research area is Combinatorial Matrix Theory, the branch of mathematics that combines combinatorics, graph theory, and linear algebra. Much of her research consists of using graph parameters to gain information about the eigenvalues of symmetric matrices associated with a given graph. Recently, her interests have expanded to purely graph theoretical problems.
Zero forcing and its variants
Stephan Garcia
Pomona College
Stephan Ramon Garcia is W.M. Keck Distinguished Service Professor at Pomona College. He is the author of four books and over 100 research articles in operator theory, complex analysis, matrix analysis, number theory, discrete geometry, combinatorics, and other fields. He has served on the editorial boards of the Proceedings of the American Mathematical Society, Notices of the American Mathematical Society, Involve, and The American Mathematical Monthly. He has received four NSF research grants as principal investigator, and six teaching awards from three different institutions. In 2019, he earned the inaugural Dolciani Prize for Excellence in Research and was elected a Fellow of the American Mathematical Society.
Factorization lengths in numerical semigroups
Numerical semigroups are simple combinatorial objects that lead to deep and subtle questions. We answer in one fell swoop virtually all asymptotic questions about factorization lengths in numerical semigroups. Surprisingly, this uses tools from complex, harmonic, and functional analysis, probability theory, algebraic combinatorics, and computer-aided design! Our results yield uncannily accurate predictions that agree with numerical computations, along with some totally unexpected byproducts.
Contributed Talk Speakers
Four sessions will run in parallel and will have four speakers.
Each talk will take approximately 15 minutes.
Session 1
Quadratic Spanning Forest Identities, Melanie Fraser (Southern New Hampshire University)
Oriented Hypergraphs and Hadamard's Conjecture, Lucas Rusnak (Texas State University)
On Fibonacci graphs, Boris Brimkov (Slippery Rock University)
The Threshold Strong Dimension of a Graph, Nadia Benkali (New York City College of Technology)
Session 2
A proof for enumerating admissible pinnacle sets, Quinn Minnich (Michigan State University)
Parking Functions and Posets, Shreya Ahirwar, Parikshita Gya, Aurora Vo (Mount Holyoke College)
Integrating combinatorics in high school: A discourse, Chonilo Saldon (Zamboanga del Norte National High School)
Online interactive vs regular textbook approaches to teaching Discrete Math Melkana Brakalova (Fordham University)
Session 3
On the Newton Polytopes of Chromatic Symmetric Functions, Jesse Selover (University of Massachusetts, Amherst)
On discrete gradient vector fields and Laplacians of simplicial complexes, Andrew Tawfeek (University of Washington)
Rainbow solutions to the Sidon equation in cyclic groups and the interval, Zhanar Berikkyzy (Fairfield University)
Naruse Hook Formula for Linear Extensions of Mobile Posets, GaYee Park (University of Massachusetts, Amherst)
Session 4
Infinite-Speed Cops and Robbers on Grid Graphs, Nikolas Townsend (University of Rhode Island)
A Higher-Dimensional Sandpile Multijection, Alex McDonough (Brown University)
Maximizing the nullity of some graphs with fixed inertia, Shaun Fallat (University of Regina)
Expressing graphs as symmetric differences of cliques, Calum Buchanan (University of Vermont)