Talk Slides and Upcoming talks:
Here are slides from a talk I gave about maximal chain descent orders in the University of Washington Combinatorics and Geometry Seminar in October 2022. They are a good introduction to my recent work defining a new partial order on the maximal chains of lexicographically shellable posets. UW Combinatorics Seminar slides

Preprints:                                                                                                                            6.  Maximal chain descent orders: A tool for studying the structure of lexicographic shellings; Submitted.

5. Maximal chain descent orders; also available at arXiv:2209.15142.

Publications:                                                                                                                   4. (with Tamás Keleti, Changshuo Liu, Mengzhen Liu, and José Ramón Tuirán Rangel) Tiling of rectangles with squares and related problems via Diophantine approximation; freely available at https://authors.elsevier.com/sd/article/S0012365X23001280, also available at arXiv:2201.11545. Discrete Mathematics 346 (2023), Issue 9, Paper No. 113442.

3. Poset topology of s-weak order via SB-labelings; also available at arXiv:2009.02389
Journal of Combinatorics 13 (2022) no. 3, 357-395

2. Poset topology of s-weak order via SB-labelings
Seminaire Lotharingien de Combinatoire 84B (2020), Art. 28

Undergrad Publications:
1. (with Nikki Carter, Brittany Dygert, Collin Litterell, Austin Stromme, and Andrew You) Frog model wake up time on the complete graph
Rose-Hulman Undergraduate Mathematics Journal 17 (2016) no. 2, Art. 9, 157-169