activity
20222026
most citedOn the Outcome Map of MVP Parking Functions: Permutations Avoiding 321 and 3412, and Motzkin Paths

3 citations · 7 across the 10 of their papers we have counts for

collaborators

10 papers

math.CO2026

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…

math.PR2025

A Probabilistic Parking Process and Labeled IDLA

Pamela E. Harris, Thiago Holleben, J. Carlos Martínez Mori +3

In 1966, Konheim and Weiss [33] introduced a now classical parking protocol. The deterministic process and its resultant objects, known as parking functions, have since become a fa…

math.HO2024

What is a Parking Function?

J. Carlos Martínez Mori

In this expository article I describe classical results in the combinatorics of parking functions. Its English-Spanish translation is included. -- -- En este artículo de difusión m…

math.CO2024

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…

math.CO2023

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…

math.CO2023

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…

math.CO2023★ 1 cited

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…

math.CO2023★ 1 cited

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…

math.CO2022★ 2 cited

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,…

math.CO2022★ 3 cited

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…