Identifier
- St001558: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 2
[1,4,2,3] => 2
[1,4,3,2] => 3
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 2
[2,3,4,1] => 3
[2,4,1,3] => 3
[2,4,3,1] => 4
[3,1,2,4] => 2
[3,1,4,2] => 3
[3,2,1,4] => 3
[3,2,4,1] => 4
[3,4,1,2] => 5
[3,4,2,1] => 5
[4,1,2,3] => 3
[4,1,3,2] => 4
[4,2,1,3] => 4
[4,2,3,1] => 6
[4,3,1,2] => 5
[4,3,2,1] => 6
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 2
[1,2,5,3,4] => 2
[1,2,5,4,3] => 3
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 2
[1,3,4,5,2] => 3
[1,3,5,2,4] => 3
[1,3,5,4,2] => 4
[1,4,2,3,5] => 2
[1,4,2,5,3] => 3
[1,4,3,2,5] => 3
[1,4,3,5,2] => 4
[1,4,5,2,3] => 5
[1,4,5,3,2] => 5
[1,5,2,3,4] => 3
[1,5,2,4,3] => 4
[1,5,3,2,4] => 4
[1,5,3,4,2] => 6
[1,5,4,2,3] => 5
[1,5,4,3,2] => 6
[2,1,3,4,5] => 1
[2,1,3,5,4] => 2
[2,1,4,3,5] => 2
[2,1,4,5,3] => 3
[2,1,5,3,4] => 3
[2,1,5,4,3] => 4
[2,3,1,4,5] => 2
[2,3,1,5,4] => 3
[2,3,4,1,5] => 3
[2,3,4,5,1] => 4
[2,3,5,1,4] => 4
[2,3,5,4,1] => 5
[2,4,1,3,5] => 3
[2,4,1,5,3] => 4
[2,4,3,1,5] => 4
[2,4,3,5,1] => 5
[2,4,5,1,3] => 6
[2,4,5,3,1] => 6
[2,5,1,3,4] => 4
[2,5,1,4,3] => 5
[2,5,3,1,4] => 5
[2,5,3,4,1] => 7
[2,5,4,1,3] => 6
[2,5,4,3,1] => 7
[3,1,2,4,5] => 2
[3,1,2,5,4] => 3
[3,1,4,2,5] => 3
[3,1,4,5,2] => 4
[3,1,5,2,4] => 4
[3,1,5,4,2] => 5
[3,2,1,4,5] => 3
[3,2,1,5,4] => 4
[3,2,4,1,5] => 4
[3,2,4,5,1] => 5
[3,2,5,1,4] => 5
[3,2,5,4,1] => 6
[3,4,1,2,5] => 5
[3,4,1,5,2] => 6
[3,4,2,1,5] => 5
[3,4,2,5,1] => 6
[3,4,5,1,2] => 7
[3,4,5,2,1] => 7
[3,5,1,2,4] => 6
[3,5,1,4,2] => 8
>>> 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 transpositions that are smaller or equal to a permutation in Bruhat order.
A statistic is known to be smooth if and only if this number coincides with the number of inversions. This is also equivalent for a permutation to avoid the two pattern $4231$ and $3412$.
A statistic is known to be smooth if and only if this number coincides with the number of inversions. This is also equivalent for a permutation to avoid the two pattern $4231$ and $3412$.
Code
def statistic(pi):
n = len(pi)
B = Permutations(n).bruhat_poset(facade=True)
return sum(Integer(1) for tau in B.principal_order_ideal(pi) if len(tau.fixed_points()) == n-2)
Created
Jul 07, 2020 at 09:53 by Christian Stump
Updated
Jul 07, 2020 at 09:53 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!