Identifier
- St000727: Permutations ⟶ ℤ
Values
[1,2] => 2
[2,1] => 1
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 3
[2,3,1] => 3
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 4
[1,3,4,2] => 4
[1,4,2,3] => 3
[1,4,3,2] => 2
[2,1,3,4] => 4
[2,1,4,3] => 3
[2,3,1,4] => 4
[2,3,4,1] => 4
[2,4,1,3] => 3
[2,4,3,1] => 3
[3,1,2,4] => 4
[3,1,4,2] => 4
[3,2,1,4] => 4
[3,2,4,1] => 4
[3,4,1,2] => 4
[3,4,2,1] => 4
[4,1,2,3] => 3
[4,1,3,2] => 2
[4,2,1,3] => 3
[4,2,3,1] => 3
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 5
[1,2,4,5,3] => 5
[1,2,5,3,4] => 4
[1,2,5,4,3] => 3
[1,3,2,4,5] => 5
[1,3,2,5,4] => 4
[1,3,4,2,5] => 5
[1,3,4,5,2] => 5
[1,3,5,2,4] => 4
[1,3,5,4,2] => 4
[1,4,2,3,5] => 5
[1,4,2,5,3] => 5
[1,4,3,2,5] => 5
[1,4,3,5,2] => 5
[1,4,5,2,3] => 5
[1,4,5,3,2] => 5
[1,5,2,3,4] => 4
[1,5,2,4,3] => 3
[1,5,3,2,4] => 4
[1,5,3,4,2] => 4
[1,5,4,2,3] => 3
[1,5,4,3,2] => 2
[2,1,3,4,5] => 5
[2,1,3,5,4] => 4
[2,1,4,3,5] => 5
[2,1,4,5,3] => 5
[2,1,5,3,4] => 4
[2,1,5,4,3] => 3
[2,3,1,4,5] => 5
[2,3,1,5,4] => 4
[2,3,4,1,5] => 5
[2,3,4,5,1] => 5
[2,3,5,1,4] => 4
[2,3,5,4,1] => 4
[2,4,1,3,5] => 5
[2,4,1,5,3] => 5
[2,4,3,1,5] => 5
[2,4,3,5,1] => 5
[2,4,5,1,3] => 5
[2,4,5,3,1] => 5
[2,5,1,3,4] => 4
[2,5,1,4,3] => 3
[2,5,3,1,4] => 4
[2,5,3,4,1] => 4
[2,5,4,1,3] => 3
[2,5,4,3,1] => 3
[3,1,2,4,5] => 5
[3,1,2,5,4] => 4
[3,1,4,2,5] => 5
[3,1,4,5,2] => 5
[3,1,5,2,4] => 4
[3,1,5,4,2] => 4
[3,2,1,4,5] => 5
[3,2,1,5,4] => 4
[3,2,4,1,5] => 5
[3,2,4,5,1] => 5
[3,2,5,1,4] => 4
[3,2,5,4,1] => 4
[3,4,1,2,5] => 5
[3,4,1,5,2] => 5
[3,4,2,1,5] => 5
[3,4,2,5,1] => 5
[3,4,5,1,2] => 5
[3,4,5,2,1] => 5
[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 largest label of a leaf in the binary search tree associated with the permutation.
Alternatively, this is 1 plus the position of the last descent of the inverse of the reversal of the permutation, and 1 if there is no descent.
Alternatively, this is 1 plus the position of the last descent of the inverse of the reversal of the permutation, and 1 if there is no descent.
Code
def statistic(pi):
return max(pi.binary_search_tree().leaf_labels())
Created
Mar 28, 2017 at 16:06 by Martin Rubey
Updated
Mar 28, 2017 at 16:06 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!