TotalParkingDisplacement
The sum, over the cars, of the spots they drive past: the sum of i - p(i).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000188via ParkingFunction✓TotalParkingDisplacement(parkingFunction)The sum, over the cars, of the spots they drive past: the sum of i - p(i).Typed signatures
| Type | Package | Applies |
|---|---|---|
(parking_function) -> number | combinatorics | always |
Details
- Defined over
ParkingFunctionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
ParkingFunctionand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer. - FindStat's St000188, which is also the area of the Dyck path of the parking function. Each car's displacement is its spot less its preference and the spots are 1 .. n, so the total is n (n + 1) / 2 less the preferences' sum.
Definition
Epsil, as the implementation runs it.
on ParkingFunction, over _x
0 if Length(_x) < 1 else Max(Sum(Map(
Function(i - _x[i], i),
Range(1, Length(_x)),
)), 0)Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |