Identifier
Values
[(1,2)] => [2,1] => [2,1] => 1
[(1,2),(3,4)] => [2,1,4,3] => [3,2,4,1] => 3
[(1,3),(2,4)] => [3,4,1,2] => [1,4,2,3] => 4
[(1,4),(2,3)] => [3,4,2,1] => [4,1,2,3] => 4
[(1,2),(3,4),(5,6)] => [2,1,4,3,6,5] => [3,5,4,2,1,6] => 5
[(1,3),(2,4),(5,6)] => [3,4,1,2,6,5] => [1,4,5,3,2,6] => 6
[(1,4),(2,3),(5,6)] => [3,4,2,1,6,5] => [4,5,3,2,6,1] => 5
[(1,5),(2,3),(4,6)] => [3,5,2,6,1,4] => [4,6,1,3,2,5] => 6
[(1,6),(2,3),(4,5)] => [3,5,2,6,4,1] => [4,6,3,1,2,5] => 6
[(1,6),(2,4),(3,5)] => [4,5,6,2,3,1] => [5,6,1,2,3,4] => 6
[(1,5),(2,4),(3,6)] => [4,5,6,2,1,3] => [5,6,2,3,4,1] => 6
[(1,4),(2,5),(3,6)] => [4,5,6,1,2,3] => [1,5,6,2,3,4] => 6
[(1,3),(2,5),(4,6)] => [3,5,1,6,2,4] => [4,6,2,3,1,5] => 6
[(1,2),(3,5),(4,6)] => [2,1,5,6,3,4] => [3,6,2,1,4,5] => 6
[(1,2),(3,6),(4,5)] => [2,1,5,6,4,3] => [3,6,2,1,5,4] => 6
[(1,3),(2,6),(4,5)] => [3,5,1,6,4,2] => [4,6,2,5,3,1] => 5
[(1,4),(2,6),(3,5)] => [4,5,6,1,3,2] => [1,5,6,2,4,3] => 6
[(1,5),(2,6),(3,4)] => [4,5,6,3,1,2] => [5,6,1,2,4,3] => 6
[(1,6),(2,5),(3,4)] => [4,5,6,3,2,1] => [5,6,2,4,1,3] => 6
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The number of indices that are not small excedances.
A small excedance is an index $i$ for which $\pi_i = i+1$.
Map
inverse toric promotion
Description
Toric promotion of a permutation.
Let $\sigma\in\mathfrak S_n$ be a permutation and let
$ \tau_{i, j}(\sigma) = \begin{cases} \sigma & \text{if $|\sigma^{-1}(i) - \sigma^{-1}(j)| = 1$}\\ (i, j)\circ\sigma & \text{otherwise}. \end{cases} $
The toric promotion operator is the product $\tau_{n,1}\tau_{n-1,n}\dots\tau_{1,2}$.
This is the special case of toric promotion on graphs for the path graph. Its order is $n-1$.
Map
non-nesting-exceedence permutation
Description
The fixed-point-free permutation with deficiencies given by the perfect matching, no alignments and no inversions between exceedences.
Put differently, the exceedences form the unique non-nesting perfect matching whose openers coincide with those of the given perfect matching.