StackSortable
1 when p avoids the pattern 231, 0 otherwise — exactly the stack-sortable permutations.
StackSortable(p)1 when p avoids the pattern 231, 0 otherwise — exactly the stack-sortable permutations.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
1 if Length(_x) < 3 else 1 if Sum(Map(Function(Sum(Map(
Function(Count(Filter(
Range(j + 1, Length(_x)),
Function(_x[k] < _x[i] &&
_x[i] < _x[j], k),
)), j),
Range(i + 1, Length(_x)),
)), i), Range(
1,
Length(_x),
))) == 0 else 0