NonSmallWeakExcedances

Positions with p(i) not in {i, i + 1}.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000238via Permutation✓↗

NonSmallWeakExcedances(p)Positions with p(i) not in {i, i + 1}.

Typed signatures

Type	Package	Applies
(permutation) -> number	combinatorics	always

Domain: Permutation statistics

Details

• Defined over Permutation as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a Permutation and 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) < 1 else Length(_x) - Count(Filter(
                                                    Range(1, Length(_x)),
                                                    Function(_x[i] == i || _x[i] ==
                                                                           i + 1, i),
                                                  ))

Examples

Basic #

the one-line word $312$

live ↗

In$\mathrm{NonSmallWeakExcedances}({\operatorname{Permutation}}([3, 1, 2]))$Out$3$

the one-line word $2413$

live ↗

In$\mathrm{NonSmallWeakExcedances}({\operatorname{Permutation}}([2, 4, 1, 3]))$Out$3$

Properties #

FindStat's value for [1]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{Permutation}}([1]), \text{NonSmallWeakExcedances})$Out$0$

Known value · FindStat St000238

FindStat's value for [1,2]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{Permutation}}([1, 2]), \text{NonSmallWeakExcedances})$Out$0$

Known value · FindStat St000238

FindStat's value for [2,1]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{Permutation}}([2, 1]), \text{NonSmallWeakExcedances})$Out$1$

Known value · FindStat St000238

About

Examples	5
Crosswalk	FindStat