Ben Adenbaum
Howard University
benadenbaummath@gmail.com

Research

My research interests are primarily in algebraic and enumerative combinatorics. Currently I am working on problems in Dynamical Algebraic Combinatorics and Permutation Patterns. I am also especially interested in Coxeter-Catalan Combinatorics as well as parking functions and their generalizations.

Publications

  1. Rowmotion on 321-avoiding permutations (with S. Elizalde), Electronic Journal of Combinatorics 30(3) (2023) #P3.5 arXiv:2212.11347.

  2. Coloring Groups (with A. Wilson), Discrete Math & Theoretical Computer Science vol. 26:2 (2024) arXiv:2312.03092.

  3. On the Order of P-Strict Promotion on V x [l], Electronic Journal of Combinatorics 32(2) (2025) #2.5 arXiv:2308.08757.

  4. Counting Boolean intervals in the weak Bruhat order of a finite Coxeter group (with J. Elder , P. E. Harris, J. C. Martínez Mori), Discrete Mathematics Letters 15(2025) 52--59 arXiv:2403.07989.

Preprints

  1. Dimensions of toggleability spaces (with S. Daugherty, N. Mayers) arXiv:2508.14974

  2. The poset of maximal tubings of the cycle graph is a lattice (with E. Barnard, M. Hlavacek, B. Kagy, N. Lesnevich, G. D. Nasr, K. Waddle) arXiv:2510.09429

  3. Enumerating Pattern Avoiding Parking Functions arXiv:2605.24092

  4. Parking Cascades: From the Simplest Sequence to Motzkin and Catalan (with F. Díaz Morera, J. Elder , P. E. Harris, M. Lynch, J. C. Martínez Mori) arXiv:2608.00735

  5. Invariance of rowmotion for variants of the Tamari lattice (with E. Barnard, C. Ceballos, C. Chenevière, C. Defant, S. Hopkins, M. Müller, M. Rubey, J. Striker) arXiv:2609.12983

home
teaching
research
contact
other
CV