Resumen de Local parking procedures on the integers
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. Weuncover some nice combinatorics attached to such procedures, including a certain universalenumeration formula.
