RunsOfLengthOne
Maximal runs of equal steps that are a single step.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001669via DyckPath✓RunsOfLengthOne(path)Maximal runs of equal steps that are a single step.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. - Counts runs of both kinds of step, up and down; FindStat's title, "single rises", is misleading.
Definition
Epsil, as the implementation runs it.
on DyckPath, over _x
0 if Length(_x) < 2 else Sum(Map(Function((1 if i == 1 else 1 if _x[i - 1] +
_x[i] == 1 else 0) *
(1 if i == Length(_x) else 1 if _x[i] +
_x[i +
1] == 1 else 0), i), Range(1, Length(_x))))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |