Runs
Maximal increasing runs — one more than the number of descents.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
PermutationPermutationMathWorldPermutationRunPermutationWikidataQ161519Encyclopedia of MathematicsPermutationnLabpermutationBritannicatopic/permutationFindStatSt000325via Permutation✓St000470via Permutation✓Runs(p)Maximal increasing runs — one more than the number of descents.Combinatorica
Length[Runs[p]]SageMathenumeratio_stat("Permutation", p, "Runs")Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer> | permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else (0 if Length(_x) < 2 else Count(Filter(
Range(
1,
Length(_x) -
1,
),
Function(_x[i] >
_x[i +
1], i),
))) + 1Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Checked against | Combinatorica 3 agreeSageMath 6 agree |
| Crosswalk | Wikipedia ×2MathWorld ×2WikidataEncyclopedia of MathematicsnLabBritannicaFindStat ×2CombinatoricaSageMath |
Implementation
mapped
combinatoricapackages/oracle/src/mappings.tsCombinatorica's Runs returns the runs themselves; ours is their count.
mapped
sagepackages/oracle/src/mappings.ts