Local parking procedures on the integers
Résumé
We introduce a large class of parking procedures on Z generalizing the classical one. This class is characterized by natural local constraints that the procedures must satisfy. We uncover some nice combinatorics attached to such procedures, including a certain universal enumeration formula.
Domaines
Combinatoire [math.CO]Origine | Fichiers produits par l'(les) auteur(s) |
---|