InitialIncreasingSegmentLength
The length of the initial strictly increasing segment.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001904via ParkingFunction✓InitialIncreasingSegmentLength(parkingFunction)The length of the initial strictly increasing segment.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 St001904. The first i + 1 entries increase exactly when none of the first i neighboring pairs fails to rise.
Definition
Epsil, as the implementation runs it.
on ParkingFunction, over _x
Length(_x) if Length(_x) < 2 else 1 + Max(Sum(Map(
Function(1 if Max(Sum(Map(
Function(1 if j <= i &&
_x[j] >=
_x[j + 1] else 0, j),
Range(1, Length(_x) - 1),
)), 0) ==
0 else 0, i),
Range(1, Length(_x) - 1),
)), 0)Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |