ValleyFillingDegree
The number of times every valley 01 must be swapped for a peak 10, and a trailing 0 made a 1, to leave no zeros.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001721via BinaryWord✓ValleyFillingDegree(word)The number of times every valley 01 must be swapped for a peak 10, and a trailing 0 made a 1, to leave no zeros.Typed signatures
| Type | Package | Applies |
|---|---|---|
(binary_word) -> number | combinatorics | always |
Details
- Defined over
BinaryWordas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
BinaryWordand 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 St001721.
Definition
Epsil, as the implementation runs it.
on BinaryWord, over _x
0 if Length(_x) < 1 else Max(
0,
Fold(Function(
Max(a + 2, b) if _x[Length(_x) + 1 -
b] == 0 else a,
a,
b,
), -1, Range(1, Length(_x))),
)Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |