Identifier
- St000726: Permutations ⟶ ℤ
Values
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 0
[2,1,3] => 2
[2,3,1] => 0
[3,1,2] => 2
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 0
[1,3,2,4] => 3
[1,3,4,2] => 0
[1,4,2,3] => 3
[1,4,3,2] => 0
[2,1,3,4] => 2
[2,1,4,3] => 2
[2,3,1,4] => 3
[2,3,4,1] => 0
[2,4,1,3] => 3
[2,4,3,1] => 0
[3,1,2,4] => 3
[3,1,4,2] => 3
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 2
[3,4,2,1] => 0
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 3
[4,2,3,1] => 3
[4,3,1,2] => 2
[4,3,2,1] => 0
[1,2,3,4,5] => 0
[1,2,3,5,4] => 0
[1,2,4,3,5] => 4
[1,2,4,5,3] => 0
[1,2,5,3,4] => 4
[1,2,5,4,3] => 0
[1,3,2,4,5] => 3
[1,3,2,5,4] => 3
[1,3,4,2,5] => 4
[1,3,4,5,2] => 0
[1,3,5,2,4] => 4
[1,3,5,4,2] => 0
[1,4,2,3,5] => 4
[1,4,2,5,3] => 4
[1,4,3,2,5] => 4
[1,4,3,5,2] => 4
[1,4,5,2,3] => 3
[1,4,5,3,2] => 0
[1,5,2,3,4] => 4
[1,5,2,4,3] => 4
[1,5,3,2,4] => 4
[1,5,3,4,2] => 4
[1,5,4,2,3] => 3
[1,5,4,3,2] => 0
[2,1,3,4,5] => 2
[2,1,3,5,4] => 2
[2,1,4,3,5] => 6
[2,1,4,5,3] => 2
[2,1,5,3,4] => 6
[2,1,5,4,3] => 2
[2,3,1,4,5] => 3
[2,3,1,5,4] => 3
[2,3,4,1,5] => 4
[2,3,4,5,1] => 0
[2,3,5,1,4] => 4
[2,3,5,4,1] => 0
[2,4,1,3,5] => 4
[2,4,1,5,3] => 4
[2,4,3,1,5] => 4
[2,4,3,5,1] => 4
[2,4,5,1,3] => 3
[2,4,5,3,1] => 0
[2,5,1,3,4] => 4
[2,5,1,4,3] => 4
[2,5,3,1,4] => 4
[2,5,3,4,1] => 4
[2,5,4,1,3] => 3
[2,5,4,3,1] => 0
[3,1,2,4,5] => 3
[3,1,2,5,4] => 3
[3,1,4,2,5] => 7
[3,1,4,5,2] => 3
[3,1,5,2,4] => 7
[3,1,5,4,2] => 3
[3,2,1,4,5] => 3
[3,2,1,5,4] => 3
[3,2,4,1,5] => 7
[3,2,4,5,1] => 3
[3,2,5,1,4] => 7
[3,2,5,4,1] => 3
[3,4,1,2,5] => 4
[3,4,1,5,2] => 4
[3,4,2,1,5] => 4
[3,4,2,5,1] => 4
[3,4,5,1,2] => 2
[3,4,5,2,1] => 0
[3,5,1,2,4] => 4
[3,5,1,4,2] => 4
[3,5,2,1,4] => 4
>>> 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 normalized sum of the leaf labels of the increasing binary tree associated to a permutation.
The sum of the leaf labels is at least the size of the permutation, equality is attained for the binary trees that have only one leaf. This statistic is the sum of the leaf labels minus the size of the permutation.
The sum of the leaf labels is at least the size of the permutation, equality is attained for the binary trees that have only one leaf. This statistic is the sum of the leaf labels minus the size of the permutation.
Code
def statistic(pi):
return sum(pi.increasing_tree().leaf_labels())-pi.size()
Created
Mar 28, 2017 at 14:57 by Martin Rubey
Updated
Mar 28, 2017 at 14:57 by Martin Rubey
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!