Processing math: 100%

Identifier
Values
[1] => [1,0] => [1] => [1] => 0
[2] => [1,0,1,0] => [2,1] => [2,1] => 0
[1,1] => [1,1,0,0] => [1,2] => [1,2] => 0
[3] => [1,0,1,0,1,0] => [3,2,1] => [3,2,1] => 1
[2,1] => [1,0,1,1,0,0] => [2,3,1] => [2,3,1] => 0
[1,1,1] => [1,1,0,1,0,0] => [2,1,3] => [2,1,3] => 0
[2,2] => [1,1,1,0,0,0] => [1,2,3] => [1,2,3] => 0
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 edges in the reduced word graph of a signed permutation.
The reduced word graph of a signed permutation π has the reduced words of π as vertices and an edge between two reduced words if they differ by exactly one braid move.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
Map
to signed permutation
Description
The signed permutation with all signs positive.