Identifier
- St000724: Permutations ⟶ ℤ
Values
[1,2] => 2
[2,1] => 2
[1,2,3] => 3
[1,3,2] => 3
[2,1,3] => 2
[2,3,1] => 3
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 4
[1,2,4,3] => 4
[1,3,2,4] => 3
[1,3,4,2] => 4
[1,4,2,3] => 3
[1,4,3,2] => 4
[2,1,3,4] => 2
[2,1,4,3] => 2
[2,3,1,4] => 3
[2,3,4,1] => 4
[2,4,1,3] => 4
[2,4,3,1] => 4
[3,1,2,4] => 4
[3,1,4,2] => 4
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 2
[3,4,2,1] => 4
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 4
[4,2,3,1] => 3
[4,3,1,2] => 2
[4,3,2,1] => 4
[1,2,3,4,5] => 5
[1,2,3,5,4] => 5
[1,2,4,3,5] => 4
[1,2,4,5,3] => 5
[1,2,5,3,4] => 4
[1,2,5,4,3] => 5
[1,3,2,4,5] => 3
[1,3,2,5,4] => 3
[1,3,4,2,5] => 4
[1,3,4,5,2] => 5
[1,3,5,2,4] => 5
[1,3,5,4,2] => 5
[1,4,2,3,5] => 5
[1,4,2,5,3] => 5
[1,4,3,2,5] => 4
[1,4,3,5,2] => 4
[1,4,5,2,3] => 3
[1,4,5,3,2] => 5
[1,5,2,3,4] => 4
[1,5,2,4,3] => 4
[1,5,3,2,4] => 5
[1,5,3,4,2] => 4
[1,5,4,2,3] => 3
[1,5,4,3,2] => 5
[2,1,3,4,5] => 2
[2,1,3,5,4] => 2
[2,1,4,3,5] => 2
[2,1,4,5,3] => 2
[2,1,5,3,4] => 2
[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] => 5
[2,3,5,1,4] => 5
[2,3,5,4,1] => 5
[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] => 5
[2,4,5,3,1] => 5
[2,5,1,3,4] => 5
[2,5,1,4,3] => 5
[2,5,3,1,4] => 5
[2,5,3,4,1] => 4
[2,5,4,1,3] => 5
[2,5,4,3,1] => 5
[3,1,2,4,5] => 5
[3,1,2,5,4] => 5
[3,1,4,2,5] => 4
[3,1,4,5,2] => 5
[3,1,5,2,4] => 4
[3,1,5,4,2] => 5
[3,2,1,4,5] => 3
[3,2,1,5,4] => 3
[3,2,4,1,5] => 3
[3,2,4,5,1] => 3
[3,2,5,1,4] => 3
[3,2,5,4,1] => 3
[3,4,1,2,5] => 5
[3,4,1,5,2] => 5
[3,4,2,1,5] => 4
[3,4,2,5,1] => 4
[3,4,5,1,2] => 2
[3,4,5,2,1] => 5
[3,5,1,2,4] => 4
[3,5,1,4,2] => 4
[3,5,2,1,4] => 5
>>> 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 label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation.
Associate an increasing binary tree to the permutation using Mp00061to increasing tree. Then follow the path starting at the root which always selects the child with the smaller label. This statistic is the label of the leaf in the path, see [1].
Han [2] showed that this statistic is (up to a shift) equidistributed on zigzag permutations (permutations π such that π(1)<π(2)>π(3)⋯) with the greater neighbor of the maximum (St000060The greater neighbor of the maximum.), see also [3].
Associate an increasing binary tree to the permutation using Mp00061to increasing tree. Then follow the path starting at the root which always selects the child with the smaller label. This statistic is the label of the leaf in the path, see [1].
Han [2] showed that this statistic is (up to a shift) equidistributed on zigzag permutations (permutations π such that π(1)<π(2)>π(3)⋯) with the greater neighbor of the maximum (St000060The greater neighbor of the maximum.), see also [3].
References
[1] Poupard, C. Deux propriétés des arbres binaires ordonnés stricts MathSciNet:1005843
[2] https://www.emis.de/journals/SLC/wpapers/s74vortrag/han.pdf
[3] Foata, D., Han, G.-N. Finite difference calculus for alternating permutations MathSciNet:3173528 arXiv:1304.2483
[2] https://www.emis.de/journals/SLC/wpapers/s74vortrag/han.pdf
[3] Foata, D., Han, G.-N. Finite difference calculus for alternating permutations MathSciNet:3173528 arXiv:1304.2483
Code
def statistic(pi):
pi = list(pi)
if len(pi) == 1:
return pi[0]
else:
a = min(pi)
j = pi.index(a)
b = min( x for x in pi if x != a )
if pi.index(b) < j:
return statistic(pi[:j])
else:
return statistic(pi[j+1:])
Created
Mar 28, 2017 at 11:20 by Christian Stump
Updated
Mar 28, 2017 at 11:47 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!