6 papers
Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
Steffen Borgwardt, MacKenzie Carr, Ce Chen +4
Fomin, Kratochvíl, Lokshtanov, Mancini, and Telle showed that every -free graph is reconstructible from the \emph{multiset} of closed neighborhoods. We strengthen their resu…
Two combinatorial puzzles arising from the theory of Kohnert polynomials
Theo Koss, Nicholas Mayers, Alex Moon
Motivated by recent work of Hanser and Mayers, we study two combinatorial puzzles arising from the theory of Kohnert polynomials. Such polynomials are defined as generating polynom…
Kohnert posets and polynomials of northeast diagrams
Aram Bingham, Beth Anne Castellano, Kimberly P. Hadaway +4
Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and t…
The Defective Parking Space and Defective Kreweras Numbers
Rebecca E. Garcia, Pamela E. Harris, Alex Moon +5
A defective -parking function with defect is a parking function with cars attempting to park on a street with parking spots in which exactly cars fail to par…
Which shapes can appear in a Curve Shortening Flow Singularity?
Sigurd Angenent, Evan Patrick Davis, Ellie DeCleene +7
We study possible tangles that can occur in singularities of solutions to plane Curve Shortening Flow. We exhibit solutions in which more complicated tangles with more than one sel…
On some discrete statistics of parking functions
Ari Cruz, Pamela E. Harris, Kimberly J. Harry +5
Recall that is a parking function if its nondecreasing rearrangement satisfies for all . In thi…