- FindStat

Identifier

Mp00159: Permutations —Demazure product with inverse⟶ Permutations
St000018: Permutations ⟶ ℤ

Values

[1] => [1] => 0

[1,2] => [1,2] => 0

[2,1] => [2,1] => 1

[1,2,3] => [1,2,3] => 0

[1,3,2] => [1,3,2] => 1

[2,1,3] => [2,1,3] => 1

[2,3,1] => [3,2,1] => 3

[3,1,2] => [3,2,1] => 3

[3,2,1] => [3,2,1] => 3

[1,2,3,4] => [1,2,3,4] => 0

[1,2,4,3] => [1,2,4,3] => 1

[1,3,2,4] => [1,3,2,4] => 1

[1,3,4,2] => [1,4,3,2] => 3

[1,4,2,3] => [1,4,3,2] => 3

[1,4,3,2] => [1,4,3,2] => 3

[2,1,3,4] => [2,1,3,4] => 1

[2,1,4,3] => [2,1,4,3] => 2

[2,3,1,4] => [3,2,1,4] => 3

[2,3,4,1] => [4,2,3,1] => 5

[2,4,1,3] => [3,4,1,2] => 4

[2,4,3,1] => [4,3,2,1] => 6

[3,1,2,4] => [3,2,1,4] => 3

[3,1,4,2] => [4,2,3,1] => 5

[3,2,1,4] => [3,2,1,4] => 3

[3,2,4,1] => [4,2,3,1] => 5

[3,4,1,2] => [4,3,2,1] => 6

[3,4,2,1] => [4,3,2,1] => 6

[4,1,2,3] => [4,2,3,1] => 5

[4,1,3,2] => [4,2,3,1] => 5

[4,2,1,3] => [4,3,2,1] => 6

[4,2,3,1] => [4,3,2,1] => 6

[4,3,1,2] => [4,3,2,1] => 6

[4,3,2,1] => [4,3,2,1] => 6

[1,2,3,4,5] => [1,2,3,4,5] => 0

[1,2,3,5,4] => [1,2,3,5,4] => 1

[1,2,4,3,5] => [1,2,4,3,5] => 1

[1,2,4,5,3] => [1,2,5,4,3] => 3

[1,2,5,3,4] => [1,2,5,4,3] => 3

[1,2,5,4,3] => [1,2,5,4,3] => 3

[1,3,2,4,5] => [1,3,2,4,5] => 1

[1,3,2,5,4] => [1,3,2,5,4] => 2

[1,3,4,2,5] => [1,4,3,2,5] => 3

[1,3,4,5,2] => [1,5,3,4,2] => 5

[1,3,5,2,4] => [1,4,5,2,3] => 4

[1,3,5,4,2] => [1,5,4,3,2] => 6

[1,4,2,3,5] => [1,4,3,2,5] => 3

[1,4,2,5,3] => [1,5,3,4,2] => 5

[1,4,3,2,5] => [1,4,3,2,5] => 3

[1,4,3,5,2] => [1,5,3,4,2] => 5

[1,4,5,2,3] => [1,5,4,3,2] => 6

[1,4,5,3,2] => [1,5,4,3,2] => 6

[1,5,2,3,4] => [1,5,3,4,2] => 5

[1,5,2,4,3] => [1,5,3,4,2] => 5

[1,5,3,2,4] => [1,5,4,3,2] => 6

[1,5,3,4,2] => [1,5,4,3,2] => 6

[1,5,4,2,3] => [1,5,4,3,2] => 6

[1,5,4,3,2] => [1,5,4,3,2] => 6

[2,1,3,4,5] => [2,1,3,4,5] => 1

[2,1,3,5,4] => [2,1,3,5,4] => 2

[2,1,4,3,5] => [2,1,4,3,5] => 2

[2,1,4,5,3] => [2,1,5,4,3] => 4

[2,1,5,3,4] => [2,1,5,4,3] => 4

[2,1,5,4,3] => [2,1,5,4,3] => 4

[2,3,1,4,5] => [3,2,1,4,5] => 3

[2,3,1,5,4] => [3,2,1,5,4] => 4

[2,3,4,1,5] => [4,2,3,1,5] => 5

[2,3,4,5,1] => [5,2,3,4,1] => 7

[2,3,5,1,4] => [4,2,5,1,3] => 6

[2,3,5,4,1] => [5,2,4,3,1] => 8

[2,4,1,3,5] => [3,4,1,2,5] => 4

[2,4,1,5,3] => [3,5,1,4,2] => 6

[2,4,3,1,5] => [4,3,2,1,5] => 6

[2,4,3,5,1] => [5,3,2,4,1] => 8

[2,4,5,1,3] => [4,5,3,1,2] => 8

[2,4,5,3,1] => [5,4,3,2,1] => 10

[2,5,1,3,4] => [3,5,1,4,2] => 6

[2,5,1,4,3] => [3,5,1,4,2] => 6

[2,5,3,1,4] => [4,5,3,1,2] => 8

[2,5,3,4,1] => [5,4,3,2,1] => 10

[2,5,4,1,3] => [4,5,3,1,2] => 8

[2,5,4,3,1] => [5,4,3,2,1] => 10

[3,1,2,4,5] => [3,2,1,4,5] => 3

[3,1,2,5,4] => [3,2,1,5,4] => 4

[3,1,4,2,5] => [4,2,3,1,5] => 5

[3,1,4,5,2] => [5,2,3,4,1] => 7

[3,1,5,2,4] => [4,2,5,1,3] => 6

[3,1,5,4,2] => [5,2,4,3,1] => 8

[3,2,1,4,5] => [3,2,1,4,5] => 3

[3,2,1,5,4] => [3,2,1,5,4] => 4

[3,2,4,1,5] => [4,2,3,1,5] => 5

[3,2,4,5,1] => [5,2,3,4,1] => 7

[3,2,5,1,4] => [4,2,5,1,3] => 6

[3,2,5,4,1] => [5,2,4,3,1] => 8

[3,4,1,2,5] => [4,3,2,1,5] => 6

[3,4,1,5,2] => [5,3,2,4,1] => 8

[3,4,2,1,5] => [4,3,2,1,5] => 6

[3,4,2,5,1] => [5,3,2,4,1] => 8

[3,4,5,1,2] => [5,4,3,2,1] => 10

[3,4,5,2,1] => [5,4,3,2,1] => 10

[3,5,1,2,4] => [4,5,3,1,2] => 8

[3,5,1,4,2] => [5,4,3,2,1] => 10

>>> Load all 15853 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

click to show known generating functions

Description

The number of inversions of a permutation.
This equals the minimal number of simple transpositions $(i,i+1)$ needed to write $\pi$. Thus, it is also the Coxeter length of $\pi$.

Map

Demazure product with inverse

Description

This map sends a permutation $\pi$ to $\pi^{-1} \star \pi$ where $\star$ denotes the Demazure product on permutations.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.