- FindStat

Identifier

Mp00114: Permutations —connectivity set⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

$F_{1} = q$

$F_{2} = q + q^{2}$

$F_{3} = 2\ q + q^{2} + 3\ q^{3}$

$F_{4} = 6\ q + 2\ q^{2} + 3\ q^{3} + 13\ q^{4}$

$F_{5} = 24\ q + 6\ q^{2} + 6\ q^{3} + 13\ q^{4} + 71\ q^{5}$

$F_{6} = 120\ q + 24\ q^{2} + 18\ q^{3} + 26\ q^{4} + 71\ q^{5} + 461\ q^{6}$

$F_{7} = 720\ q + 120\ q^{2} + 72\ q^{3} + 78\ q^{4} + 142\ q^{5} + 461\ q^{6} + 3447\ q^{7}$

Description

The last part of an integer composition.

Map

reverse

Description

Return the reversal of a binary word.

Map

connectivity set

Description

The connectivity set of a permutation as a binary word.
According to [2], also known as the global ascent set.
The connectivity set is

$C(\pi)=\{i\in [n-1] | \forall 1 \leq j \leq i < k \leq n : \pi(j) < \pi(k)\}.$
For

$n > 1$ it can also be described as the set of occurrences of the mesh pattern

$([1,2], \{(0,2),(1,0),(1,1),(2,0),(2,1) \})$
or equivalently

$([1,2], \{(0,1),(0,2),(1,1),(1,2),(2,0) \}),$
see [3].
The permutation is connected, when the connectivity set is empty.

Map

to composition

Description

The composition corresponding to a binary word.
Prepending

$1$ to a binary word

$w$ , the

$i$ -th part of the composition equals

$1$ plus the number of zeros after the

$i$ -th

$1$ in

$w$ .
This map is not surjective, since the empty composition does not have a preimage.