- FindStat

Identifier

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00257: Permutations —Alexandersson Kebede⟶ Permutations
St000215: Permutations ⟶ ℤ

Values

[1] => [1] => [1] => 1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1546 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 adjacencies of a permutation, zero appended.
An adjacency is a descent of the form $(e+1,e)$ in the word corresponding to the permutation in one-line notation. This statistic, $\operatorname{adj_0}$, counts adjacencies in the word with a zero appended.
$(\operatorname{adj_0}, \operatorname{des})$ and $(\operatorname{fix}, \operatorname{exc})$ are equidistributed, see [1].

Map

Alexandersson Kebede

Description

Sends a permutation to a permutation and it preserves the set of right-to-left minima.
Take a permutation $\pi$ of length $n$. The mapping looks for a smallest odd integer $i\in[n-1]$ such that swapping the entries $\pi(i)$ and $\pi(i+1)$ preserves the set of right-to-left minima. Otherwise, $\pi$ will be a fixed element of the mapping. Note that the map changes the sign of all non-fixed elements.
There are exactly $\binom{\lfloor n/2 \rfloor}{k-\lceil n/2 \rceil}$ elements in $S_n$ fixed under this map, with exactly $k$ right-to-left minima, see Lemma 35 in [1].

Map

cycle-as-one-line notation

Description

Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.