RightTethers

Large ascents between two rafts.

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

RightTethers(p)Large ascents between two rafts.

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) < 2 else Count(Filter(
                                       Range(1, Length(_x) - 1, 1),
                                       Function((_x[i + 1] == _x[i] + 1 if i >=
                                                                           1 && i <=
                                                                               Length(_x) -
                                                                               1 else False) &&
                                                (_x[i + 1 + 1] > _x[i + 1] + 1 if i + 1 >=
                                                                                  1 &&
                                                                                  i + 1 <=
                                                                                  Length(_x) - 1 else False) &&
                                                (_x[i + 2 + 1] == _x[i + 2] + 1 if i + 2 >=
                                                                                   1 &&
                                                                                   i + 2 <=
                                                                                   Length(_x) - 1 else False), i),
                                     ))

Examples

Basic #

the one-line word $312$

live ↗

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

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

live ↗

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

the one-line word $2413$

live ↗

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

Properties #

FindStat's value for [1]

live ↗

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

Known value · FindStat St000666

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St000666

FindStat's value for [2,1]

live ↗

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

Known value · FindStat St000666

About

Examples	6
Crosswalk	FindStat