3 citations · 7 across the 10 of their papers we have counts for
9 papers · 1 filter
The Stable Tamari Lattice
Herman Chau, Spencer Daugherty, Sean Grate +3
We introduce the stable Tamari lattice , an infinite lattice on . The -Tamari lattices on -Dyck paths of height occur as a nested family o…
Parking Cascades: From the Simplest Sequence to Motzkin and Catalan
Ben Adenbaum, Néstor F. Díaz Morera, Jennifer Elder +3
We introduce -cascading parking functions, a parametrized variant of parking functions in which cars form bumping cascades of up to cars. Setting recovers cla…
Boolean intervals in the weak Bruhat order of a finite Coxeter group
Ben Adenbaum, Jennifer Elder, Pamela E. Harris +1
Given a Coxeter group with Coxeter system , where is finite. We provide a complete characterization of Boolean intervals in the weak order of uniformly for all C…
Interval and -interval Rational Parking Functions
Tomás Aguilar-Fraga, Jennifer Elder, Rebecca E. Garcia +12
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions…
Cost-sharing in Parking Games
Jennifer Elder, Pamela E. Harris, Jan Kretschmann +1
In this paper, we study the total displacement statistic of parking functions from the perspective of cooperative game theory. We introduce parking games, which are coalitional cos…
Lucky Cars and the Quicksort Algorithm
Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori
Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of comparisons on an array of size ordered uniform…
Parking functions, Fubini rankings, and Boolean intervals in the weak order of
Jennifer Elder, Pamela E. Harris, Jan Kretschmann +1
Let denote the symmetric group and let denote the weak order of . Through a surprising connection to a subset of parking functi…
Permutation Invariant Parking Assortments
Douglas M. Chen, Pamela E. Harris, J. Carlos Martínez Mori +2
We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are cars of lengths $\mathbf{y}=(y_1,…
On the Outcome Map of MVP Parking Functions: Permutations Avoiding 321 and 3412, and Motzkin Paths
Pamela E. Harris, Brian M. Kamau, J. Carlos Martínez Mori +1
We introduce a new parking procedure called MVP parking in which cars sequentially enter a one-way street with a preferred parking spot from the parking spots on the street…