8.30-8.50 |
Jack Love Vertices of $\hom(P, Q)$ |
XiaoLin Shi Projections on Parabolic Quotients of Affine Weyl Groups |
Hayato Mwesigwa A set of tournaments with many Hamiltonian cycles |
John Engbers Extremal $H$-colorings of forests and trees |
9.00-9.20 |
Jose Alejandro Samper Combinatorics of polytopes that approximate smooth convex bodies |
David B Rush On Orbits of Order Ideals of Minuscule Posets |
Radoslav Marinov An application of Stein's Method to convergent statistics in the Neighborhood Attack and Mercurial Voter-type models |
Ruidong Wang Incidence Posets and Cover Graphs |
9.25-10.25 |
Adriano Garsia, Parking Functions and Diagonal Harmonics |
10.25-10.45 |
Coffee |
10.50-11.10 |
Robert Davis Unimodality of $h^*$-vectors for lattice polytopes |
Nick Teff Hessenberg Representations and the Chromatic Symmetric Functions |
Jed Yang Undecidability of tileability |
Lauren Keough Minimizing Matchings in Graphs |
11.15-11.35 |
Frederico Castillo Computing Arithmetic Tutte Polynomials |
Michael Chmutov A-molecules are of Kazhdan-Lusztig type |
Michelle Delcourt Discrete Bernoulli Convolutions |
Michael Krul Algebraic Characterization of Hypergraph Colorings |
11.40-12.00 |
Pat Devlin Integer Subsets with High Volume and Low Perimeter |
Shirley Law The Hopf Algebra of Sashes |
Yi Su Electrical Networks, Electrical Lie Group and Lie Algebra |
Chris Pryby Sets of Rich Lines in General Position |
12.05-1.15 | Lunch |
1.20-1.40 |
Emily Leven A Refinement of the Shuffle Conjecture for $t=1/q$ and cars of two sizes |
Shanshan Ding A representation-theoretic analysis of a Markov chain |
Mark Kempton Eigenvalues of Vectorized Laplacians for Connection Graphs |
James M. Carraher Rainbow spanning trees in edge-colored complete graphs |
1.45-2.05 |
Maria Monks Extending the Foata bijection to Young diagram fillings |
John Pike Random Walks on Hyperplane Arrangements |
Caitlin Phifer The Cycle Intersection Matrix and Applications to Planar Graphs |
Angela Hicks
A special family of recursive polynomials and their connection to parking function theory |
2.10-2.30 |
Avinash Dalal On Atom Expansions of Macdonald Polynomials |
Umit Islak On the longest alternating subsequence problem |
Tanmay Deshpande Cones, Lattices and Hilbert Bases of Cuts |
Benjamin Stucky An Algorithmic Approach to Raising the Lower Bound of $R(5,5)$ |
2.35-2.55 | Coffee |
3.00-4.00 | Adriano Garsia, Polyominos and Diagonal Harmonics |