BargraphUpStepCount
Up steps of the bargraph.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000808via IntegerComposition✓BargraphUpStepCount(composition)Up steps of the bargraph.Typed signatures
| Type | Package | Applies |
|---|---|---|
(composition) -> number | combinatorics | always |
Details
- Defined over
IntegerCompositionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
IntegerCompositionand 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. - Deutsch and Elizalde, A bijection between bargraphs and Dyck paths.
Definition
Epsil, as the implementation runs it.
on IntegerComposition, over _x
0 if Length(_x) < 1 else _x[1] + (0 if Length(_x) < 2 else Sum(Map(
Function(_x[i + 1] -
_x[i] if _x[i + 1] >
_x[i] else 0, i),
Range(
1,
Length(_x) -
1,
),
)))Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |