Identifier
- St000064: Permutations ⟶ ℤ
Values
[1,2] => 2
[2,1] => 2
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 4
[1,2,4,3] => 4
[1,3,2,4] => 2
[1,3,4,2] => 2
[1,4,2,3] => 2
[1,4,3,2] => 3
[2,1,3,4] => 4
[2,1,4,3] => 4
[2,3,1,4] => 2
[2,3,4,1] => 3
[2,4,1,3] => 0
[2,4,3,1] => 2
[3,1,2,4] => 2
[3,1,4,2] => 0
[3,2,1,4] => 3
[3,2,4,1] => 2
[3,4,1,2] => 4
[3,4,2,1] => 4
[4,1,2,3] => 3
[4,1,3,2] => 2
[4,2,1,3] => 2
[4,2,3,1] => 2
[4,3,1,2] => 4
[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] => 4
[1,2,5,3,4] => 4
[1,2,5,4,3] => 5
[1,3,2,4,5] => 4
[1,3,2,5,4] => 4
[1,3,4,2,5] => 2
[1,3,4,5,2] => 3
[1,3,5,2,4] => 0
[1,3,5,4,2] => 2
[1,4,2,3,5] => 2
[1,4,2,5,3] => 0
[1,4,3,2,5] => 3
[1,4,3,5,2] => 2
[1,4,5,2,3] => 4
[1,4,5,3,2] => 4
[1,5,2,3,4] => 3
[1,5,2,4,3] => 2
[1,5,3,2,4] => 2
[1,5,3,4,2] => 2
[1,5,4,2,3] => 4
[1,5,4,3,2] => 4
[2,1,3,4,5] => 5
[2,1,3,5,4] => 4
[2,1,4,3,5] => 4
[2,1,4,5,3] => 4
[2,1,5,3,4] => 4
[2,1,5,4,3] => 5
[2,3,1,4,5] => 4
[2,3,1,5,4] => 4
[2,3,4,1,5] => 3
[2,3,4,5,1] => 4
[2,3,5,1,4] => 2
[2,3,5,4,1] => 4
[2,4,1,3,5] => 0
[2,4,1,5,3] => 0
[2,4,3,1,5] => 2
[2,4,3,5,1] => 2
[2,4,5,1,3] => 2
[2,4,5,3,1] => 2
[2,5,1,3,4] => 2
[2,5,1,4,3] => 2
[2,5,3,1,4] => 0
[2,5,3,4,1] => 2
[2,5,4,1,3] => 2
[2,5,4,3,1] => 3
[3,1,2,4,5] => 4
[3,1,2,5,4] => 4
[3,1,4,2,5] => 0
[3,1,4,5,2] => 2
[3,1,5,2,4] => 0
[3,1,5,4,2] => 2
[3,2,1,4,5] => 5
[3,2,1,5,4] => 5
[3,2,4,1,5] => 2
[3,2,4,5,1] => 4
[3,2,5,1,4] => 2
[3,2,5,4,1] => 4
[3,4,1,2,5] => 4
[3,4,1,5,2] => 2
[3,4,2,1,5] => 4
[3,4,2,5,1] => 2
[3,4,5,1,2] => 5
[3,4,5,2,1] => 5
[3,5,1,2,4] => 2
[3,5,1,4,2] => 0
[3,5,2,1,4] => 2
>>> Load all 872 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 one-box pattern of a permutation.
This is the number of $i$ for which there is a $j$ such that $(i,\sigma_i)$ and $(j,\sigma_j)$ have distance 2 in the taxi metric on the $\mathbb{Z}^2$ grid.
This is the number of $i$ for which there is a $j$ such that $(i,\sigma_i)$ and $(j,\sigma_j)$ have distance 2 in the taxi metric on the $\mathbb{Z}^2$ grid.
References
[1] Kitaev, S., Remmel, J. The 1-box pattern on pattern avoiding permutations arXiv:1305.6970 MathSciNet:3168685
Code
def statistic( pi ):
counter = 0
for i in range(len(pi)):
if i > 0 and abs(pi[i]-pi[i-1]) == 1:
counter += 1
elif i < len(pi)-1 and abs(pi[i]-pi[i+1]) == 1:
counter += 1
return counter
Created
Jun 04, 2013 at 09:21 by Christian Stump
Updated
May 29, 2015 at 16:35 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!