Identifier
- St001074: Permutations ⟶ ℤ
Values
[1,2] => 2
[2,1] => 2
[1,2,3] => 3
[1,3,2] => 5
[2,1,3] => 3
[2,3,1] => 5
[3,1,2] => 3
[3,2,1] => 3
[1,2,3,4] => 4
[1,2,4,3] => 6
[1,3,2,4] => 6
[1,3,4,2] => 8
[1,4,2,3] => 8
[1,4,3,2] => 8
[2,1,3,4] => 4
[2,1,4,3] => 6
[2,3,1,4] => 6
[2,3,4,1] => 8
[2,4,1,3] => 6
[2,4,3,1] => 8
[3,1,2,4] => 4
[3,1,4,2] => 6
[3,2,1,4] => 4
[3,2,4,1] => 8
[3,4,1,2] => 6
[3,4,2,1] => 6
[4,1,2,3] => 4
[4,1,3,2] => 6
[4,2,1,3] => 4
[4,2,3,1] => 6
[4,3,1,2] => 4
[4,3,2,1] => 4
[1,2,3,4,5] => 5
[1,2,3,5,4] => 7
[1,2,4,3,5] => 7
[1,2,4,5,3] => 9
[1,2,5,3,4] => 9
[1,2,5,4,3] => 9
[1,3,2,4,5] => 7
[1,3,2,5,4] => 9
[1,3,4,2,5] => 9
[1,3,4,5,2] => 11
[1,3,5,2,4] => 9
[1,3,5,4,2] => 11
[1,4,2,3,5] => 9
[1,4,2,5,3] => 11
[1,4,3,2,5] => 9
[1,4,3,5,2] => 13
[1,4,5,2,3] => 11
[1,4,5,3,2] => 11
[1,5,2,3,4] => 11
[1,5,2,4,3] => 13
[1,5,3,2,4] => 11
[1,5,3,4,2] => 13
[1,5,4,2,3] => 11
[1,5,4,3,2] => 11
[2,1,3,4,5] => 5
[2,1,3,5,4] => 7
[2,1,4,3,5] => 7
[2,1,4,5,3] => 9
[2,1,5,3,4] => 9
[2,1,5,4,3] => 9
[2,3,1,4,5] => 7
[2,3,1,5,4] => 9
[2,3,4,1,5] => 9
[2,3,4,5,1] => 11
[2,3,5,1,4] => 9
[2,3,5,4,1] => 11
[2,4,1,3,5] => 7
[2,4,1,5,3] => 11
[2,4,3,1,5] => 9
[2,4,3,5,1] => 13
[2,4,5,1,3] => 9
[2,4,5,3,1] => 11
[2,5,1,3,4] => 9
[2,5,1,4,3] => 11
[2,5,3,1,4] => 9
[2,5,3,4,1] => 13
[2,5,4,1,3] => 9
[2,5,4,3,1] => 11
[3,1,2,4,5] => 5
[3,1,2,5,4] => 7
[3,1,4,2,5] => 7
[3,1,4,5,2] => 9
[3,1,5,2,4] => 9
[3,1,5,4,2] => 9
[3,2,1,4,5] => 5
[3,2,1,5,4] => 7
[3,2,4,1,5] => 9
[3,2,4,5,1] => 11
[3,2,5,1,4] => 9
[3,2,5,4,1] => 11
[3,4,1,2,5] => 7
[3,4,1,5,2] => 11
[3,4,2,1,5] => 7
[3,4,2,5,1] => 13
[3,4,5,1,2] => 9
[3,4,5,2,1] => 9
[3,5,1,2,4] => 7
[3,5,1,4,2] => 11
[3,5,2,1,4] => 7
>>> Load all 1200 entries. <<<
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
Description
The number of inversions of the cyclic embedding of a permutation.
The cyclic embedding of a permutation $\pi$ of length $n$ is given by the permutation of length $n+1$ represented in cycle notation by $(\pi_1,\ldots,\pi_n,n+1)$.
This reflects in particular the fact that the number of long cycles of length $n+1$ equals $n!$.
This statistic counts the number of inversions of this embedding, see [1]. As shown in [2], the sum of this statistic on all permutations of length $n$ equals $n!\cdot(3n-1)/12$.
The cyclic embedding of a permutation $\pi$ of length $n$ is given by the permutation of length $n+1$ represented in cycle notation by $(\pi_1,\ldots,\pi_n,n+1)$.
This reflects in particular the fact that the number of long cycles of length $n+1$ equals $n!$.
This statistic counts the number of inversions of this embedding, see [1]. As shown in [2], the sum of this statistic on all permutations of length $n$ equals $n!\cdot(3n-1)/12$.
References
[1] The number of inversions over all n-permutations consisting only of a single cycle. OEIS:A227404
[2] Palcoux, S. Examples of integer sequences coincidences MathOverflow:289976
[2] Palcoux, S. Examples of integer sequences coincidences MathOverflow:289976
Code
def statistic(pi):
n = len(pi)+Integer(1)
pi = tuple(list(pi)+[n])
return Permutation(pi).number_of_inversions()
Created
Jan 05, 2018 at 15:58 by Christian Stump
Updated
Jan 05, 2018 at 18:38 by Christian Stump
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!