BoxedOccurrencesOf132

Occurrences of 132 with no other entry positioned between the first and last and valued between the least and greatest.

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

BoxedOccurrencesOf132(p)Occurrences of 132 with no other entry positioned between the first and last and valued between the least and greatest.

Typed signatures

Type	Package	Applies
(list<integer> | 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 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) < 3 else Sum(Map(Function(Sum(Map(
                                                   Function(Count(Filter(
                                                                          Range(
                                                                                 j + 1,
                                                                                 Length(_x),
                                                                               ),
                                                                          Function(_x[i] < _x[k] &&
                                                                                   _x[k] < _x[j] &&
                                                                                   Count(Filter(
                                                                                                 Range(1, Length(_x)),
                                                                                                 Function(m > i &&
                                                                                                          m < k &&
                                                                                                          m != j &&
                                                                                                          _x[m] > _x[i] &&
                                                                                                          _x[m] < _x[j], m),
                                                                                               )) ==
                                                                                   0, k),
                                                                        )), j),
                                                   Range(i + 1, Length(_x)),
                                                 )), i), Range(1, Length(_x))))

Examples

Basic #

the one-line word $312$

live ↗

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

the one-line word $312$, as a plain list

live ↗

In$\mathrm{BoxedOccurrencesOf132}(\bigl\lbrack3, 1, 2\bigr\rbrack)$Out$0$

the one-line word $2413$

live ↗

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

Properties #

FindStat's value for [1]

live ↗

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

Known value · FindStat St001083

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St001083

FindStat's value for [2,1]

live ↗

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

Known value · FindStat St001083

About

Examples	6
Crosswalk	FindStat