InvisibleInversions

Pairs i < j with p(i) > p(j) > i.

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

InvisibleInversions(p)Pairs i < j with p(i) > p(j) > i.

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) < 2 else Sum(Map(Function(Sum(Map(
                                                   Function(1, j),
                                                   Filter(
                                                           Range(
                                                                  i + 1,
                                                                  Length(_x),
                                                                ),
                                                           Function(_x[i] >
                                                                    _x[j] && _x[j] >
                                                                        i, j),
                                                         ),
                                                 )), i), Range(1, Length(_x) - 1)))

Examples

Basic #

the one-line word $312$

live ↗

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

the one-line word $2413$

live ↗

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

Properties #

FindStat's value for [1]

live ↗

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

Known value · FindStat St001727

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St001727

FindStat's value for [2,1]

live ↗

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

Known value · FindStat St001727

About

Examples	5
Crosswalk	FindStat