SimsunDoubleDescents
Double descents in the restrictions of p to the values 1..k, over all k, counted with multiplicity.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000367via Permutation✓SimsunDoubleDescents(p)Double descents in the restrictions of p to the values 1..k, over all k, counted with multiplicity.Typed signatures
| Type | Package | Applies |
|---|---|---|
(permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutationand 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 Permutation, over _x
0 if Length(_x) < 3 else Sum(Map(Function(Sum(Map(
Function(Sum(Map(
Function(Max(
0,
Min(Join(
[Length(_x) + 1],
Map(
Function(_x[m], m),
Filter(
Range(1, Length(_x)),
Function(m > i &&
m < k &&
m != j, m),
),
),
)) -
_x[i],
) if _x[i] > _x[j] &&
_x[j] > _x[k] else 0, k),
Filter(
Range(1, Length(_x)),
Function(k > j, k),
),
)), j),
Filter(
Range(1, Length(_x)),
Function(j > i, j),
),
)), i), Range(1, Length(_x))))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |