BicoloredMotzkinHeight
The height of the bicolored Motzkin path made by reading the steps in pairs: two up steps rise, two down steps fall.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001031via DyckPath✓BicoloredMotzkinHeight(path)The height of the bicolored Motzkin path made by reading the steps in pairs: two up steps rise, two down steps fall.Typed signatures
| Type | Package | Applies |
|---|---|---|
(dyck_path) -> number | combinatorics | always |
Details
- Defined over
DyckPathas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
DyckPathand 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.
Definition
Epsil, as the implementation runs it.
on DyckPath, over _x
0 if Length(_x) < 1 else Max(Map(
Function(Sum(Map(
Function(2 * _x[k] - 1, k),
Range(1, 2i),
)), i),
Range(1, Length(_x) / 2),
)) / 2Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |