Bilateral parking procedures

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Nadeau, Philippe
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918345128804352
author Nadeau, Philippe
author_facet Nadeau, Philippe
contents We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest available spot to their left. We show that for a natural subclass of local procedures, the number of corresponding parking functions of length $r$ is always equal to $(r+1)^{r-1}$. The setting can be extended to probabilistic procedures, in which the decision to park left or right is random. We finally describe how bilateral procedures can naturally be encoded by certain labeled binary forests, whose combinatorics shed light on several results from the literature.
format Preprint
id arxiv_https___arxiv_org_abs_2602_17210
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Bilateral parking procedures
Nadeau, Philippe
Combinatorics
05A19
We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest available spot to their left. We show that for a natural subclass of local procedures, the number of corresponding parking functions of length $r$ is always equal to $(r+1)^{r-1}$. The setting can be extended to probabilistic procedures, in which the decision to park left or right is random. We finally describe how bilateral procedures can naturally be encoded by certain labeled binary forests, whose combinatorics shed light on several results from the literature.
title Bilateral parking procedures
topic Combinatorics
05A19
url https://arxiv.org/abs/2602.17210