Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
Mp00171: Set partitions —intertwining number to dual major index⟶ Set partitions
St000491: Set partitions ⟶ ℤ
Values
[2] => [1,0,1,0] => {{1},{2}} => {{1},{2}} => 0
[1,1] => [1,1,0,0] => {{1,2}} => {{1,2}} => 0
[3] => [1,0,1,0,1,0] => {{1},{2},{3}} => {{1},{2},{3}} => 0
[2,1] => [1,0,1,1,0,0] => {{1},{2,3}} => {{1,3},{2}} => 1
[1,1,1] => [1,1,0,1,0,0] => {{1,3},{2}} => {{1},{2,3}} => 0
[4] => [1,0,1,0,1,0,1,0] => {{1},{2},{3},{4}} => {{1},{2},{3},{4}} => 0
[3,1] => [1,0,1,0,1,1,0,0] => {{1},{2},{3,4}} => {{1,4},{2},{3}} => 2
[2,2] => [1,1,1,0,0,0] => {{1,2,3}} => {{1,2,3}} => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => {{1},{2,4},{3}} => {{1},{2,4},{3}} => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => {{1,4},{2},{3}} => {{1},{2},{3,4}} => 0
[5] => [1,0,1,0,1,0,1,0,1,0] => {{1},{2},{3},{4},{5}} => {{1},{2},{3},{4},{5}} => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => {{1},{2},{3},{4,5}} => {{1,5},{2},{3},{4}} => 3
[3,2] => [1,0,1,1,1,0,0,0] => {{1},{2,3,4}} => {{1,3,4},{2}} => 2
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => {{1},{2},{3,5},{4}} => {{1},{2,5},{3},{4}} => 2
[2,2,1] => [1,1,1,0,0,1,0,0] => {{1,4},{2,3}} => {{1,3},{2,4}} => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => {{1},{2,5},{3},{4}} => {{1},{2},{3,5},{4}} => 1
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => {{1,5},{2},{3},{4}} => {{1},{2},{3},{4,5}} => 0
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => {{1},{2},{3},{4},{5},{6}} => {{1},{2},{3},{4},{5},{6}} => 0
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => {{1},{2},{3},{4},{5,6}} => {{1,6},{2},{3},{4},{5}} => 4
[4,2] => [1,0,1,0,1,1,1,0,0,0] => {{1},{2},{3,4,5}} => {{1,4,5},{2},{3}} => 4
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => {{1},{2},{3},{4,6},{5}} => {{1},{2,6},{3},{4},{5}} => 3
[3,3] => [1,1,1,0,1,0,0,0] => {{1,2,4},{3}} => {{1,2},{3,4}} => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => {{1},{2,5},{3,4}} => {{1,4},{2,5},{3}} => 3
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => {{1},{2},{3,6},{4},{5}} => {{1},{2},{3,6},{4},{5}} => 2
[2,2,2] => [1,1,1,1,0,0,0,0] => {{1,2,3,4}} => {{1,2,3,4}} => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => {{1,5},{2,3},{4}} => {{1,3},{2},{4,5}} => 1
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => {{1},{2,6},{3},{4},{5}} => {{1},{2},{3},{4,6},{5}} => 1
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => {{1,6},{2},{3},{4},{5}} => {{1},{2},{3},{4},{5,6}} => 0
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => {{1},{2},{3},{4},{5},{6},{7}} => {{1},{2},{3},{4},{5},{6},{7}} => 0
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => {{1},{2},{3},{4},{5},{6,7}} => {{1,7},{2},{3},{4},{5},{6}} => 5
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => {{1},{2},{3},{4,5,6}} => {{1,5,6},{2},{3},{4}} => 6
[5,1,1] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => {{1},{2},{3},{4},{5,7},{6}} => {{1},{2,7},{3},{4},{5},{6}} => 4
[4,3] => [1,0,1,1,1,0,1,0,0,0] => {{1},{2,3,5},{4}} => {{1,3},{2,5},{4}} => 2
[4,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => {{1},{2},{3,6},{4,5}} => {{1,5},{2,6},{3},{4}} => 5
[4,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => {{1},{2},{3},{4,7},{5},{6}} => {{1},{2},{3,7},{4},{5},{6}} => 3
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => {{1,5},{2,4},{3}} => {{1},{2,4},{3,5}} => 1
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => {{1},{2,3,4,5}} => {{1,3,4,5},{2}} => 3
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => {{1},{2,6},{3,4},{5}} => {{1,4},{2},{3,6},{5}} => 3
[3,1,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => {{1},{2},{3,7},{4},{5},{6}} => {{1},{2},{3},{4,7},{5},{6}} => 2
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => {{1,5},{2,3,4}} => {{1,3,4},{2,5}} => 2
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => {{1,6},{2,3},{4},{5}} => {{1,3},{2},{4},{5,6}} => 1
[2,1,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => {{1},{2,7},{3},{4},{5},{6}} => {{1},{2},{3},{4},{5,7},{6}} => 1
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => {{1,7},{2},{3},{4},{5},{6}} => {{1},{2},{3},{4},{5},{6,7}} => 0
[6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => {{1},{2},{3},{4},{5,6,7}} => {{1,6,7},{2},{3},{4},{5}} => 8
[5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => {{1},{2},{3,4,6},{5}} => {{1,4},{2,6},{3},{5}} => 4
[5,2,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,0] => {{1},{2},{3},{4,7},{5,6}} => {{1,6},{2,7},{3},{4},{5}} => 7
[4,4] => [1,1,1,0,1,0,1,0,0,0] => {{1,2,5},{3},{4}} => {{1,2},{3},{4,5}} => 0
[4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => {{1},{2,6},{3,5},{4}} => {{1},{2,5},{3,6},{4}} => 3
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => {{1},{2},{3,4,5,6}} => {{1,4,5,6},{2},{3}} => 6
[4,2,1,1] => [1,0,1,0,1,1,1,0,0,1,0,1,0,0] => {{1},{2},{3,7},{4,5},{6}} => {{1,5},{2},{3,7},{4},{6}} => 5
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => {{1,2,4,5},{3}} => {{1,2,5},{3,4}} => 1
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => {{1,6},{2,4},{3},{5}} => {{1},{2,4},{3},{5,6}} => 1
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => {{1},{2,6},{3,4,5}} => {{1,4,5},{2,6},{3}} => 5
[3,2,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,1,0,0] => {{1},{2,7},{3,4},{5},{6}} => {{1,4},{2},{3},{5,7},{6}} => 3
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => {{1,2,3,5},{4}} => {{1,2,3},{4,5}} => 0
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => {{1,6},{2,3,4},{5}} => {{1,3,4},{2},{5,6}} => 2
[2,2,1,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,1,0,0] => {{1,7},{2,3},{4},{5},{6}} => {{1,3},{2},{4},{5},{6,7}} => 1
[6,3] => [1,0,1,0,1,0,1,1,1,0,1,0,0,0] => {{1},{2},{3},{4,5,7},{6}} => {{1,5},{2,7},{3},{4},{6}} => 6
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => {{1},{2,3,6},{4},{5}} => {{1,3},{2},{4,6},{5}} => 2
[5,3,1] => [1,0,1,0,1,1,1,0,1,0,0,1,0,0] => {{1},{2},{3,7},{4,6},{5}} => {{1},{2,6},{3,7},{4},{5}} => 5
[5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => {{1},{2},{3},{4,5,6,7}} => {{1,5,6,7},{2},{3},{4}} => 9
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => {{1,6},{2,5},{3},{4}} => {{1},{2},{3,5},{4,6}} => 1
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => {{1},{2,3,5,6},{4}} => {{1,3,6},{2,5},{4}} => 4
[4,3,1,1] => [1,0,1,1,1,0,1,0,0,1,0,1,0,0] => {{1},{2,7},{3,5},{4},{6}} => {{1},{2,5},{3},{4,7},{6}} => 3
[4,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,1,0,0] => {{1},{2},{3,7},{4,5,6}} => {{1,5,6},{2,7},{3},{4}} => 8
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => {{1,2,3,4,5}} => {{1,2,3,4,5}} => 0
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => {{1,6},{2,4,5},{3}} => {{1,5},{2,4},{3,6}} => 3
[3,3,1,1,1] => [1,1,1,0,1,0,0,1,0,1,0,1,0,0] => {{1,7},{2,4},{3},{5},{6}} => {{1},{2,4},{3},{5},{6,7}} => 1
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => {{1},{2,3,4,6},{5}} => {{1,3,4},{2,6},{5}} => 3
[3,2,2,1,1] => [1,0,1,1,1,1,0,0,0,1,0,1,0,0] => {{1},{2,7},{3,4,5},{6}} => {{1,4,5},{2},{3,7},{6}} => 5
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => {{1,6},{2,3,5},{4}} => {{1,3},{2,5},{4,6}} => 2
[2,2,2,1,1,1] => [1,1,1,1,0,0,0,1,0,1,0,1,0,0] => {{1,7},{2,3,4},{5},{6}} => {{1,3,4},{2},{5},{6,7}} => 2
[6,4] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => {{1},{2},{3,4,7},{5},{6}} => {{1,4},{2},{3,7},{5},{6}} => 4
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => {{1,2,6},{3},{4},{5}} => {{1,2},{3},{4},{5,6}} => 0
[5,4,1] => [1,0,1,1,1,0,1,0,1,0,0,1,0,0] => {{1},{2,7},{3,6},{4},{5}} => {{1},{2},{3,6},{4,7},{5}} => 3
[5,3,2] => [1,0,1,0,1,1,1,0,1,1,0,0,0,0] => {{1},{2},{3,4,6,7},{5}} => {{1,4,7},{2,6},{3},{5}} => 7
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => {{1,2,5,6},{3},{4}} => {{1,2,6},{3},{4,5}} => 2
[4,4,1,1] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => {{1,7},{2,5},{3},{4},{6}} => {{1},{2},{3,5},{4},{6,7}} => 1
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => {{1},{2,3,4,5,6}} => {{1,3,4,5,6},{2}} => 4
[4,3,2,1] => [1,0,1,1,1,0,1,1,0,0,0,1,0,0] => {{1},{2,7},{3,5,6},{4}} => {{1,6},{2,5},{3,7},{4}} => 6
[4,2,2,2] => [1,0,1,0,1,1,1,1,0,1,0,0,0,0] => {{1},{2},{3,4,5,7},{6}} => {{1,4,5},{2,7},{3},{6}} => 6
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => {{1,6},{2,3,4,5}} => {{1,3,4,5},{2,6}} => 3
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => {{1,2,4,6},{3},{5}} => {{1,2},{3,4,6},{5}} => 1
[3,3,2,1,1] => [1,1,1,0,1,1,0,0,0,1,0,1,0,0] => {{1,7},{2,4,5},{3},{6}} => {{1,5},{2,4},{3},{6,7}} => 3
[3,2,2,2,1] => [1,0,1,1,1,1,0,1,0,0,0,1,0,0] => {{1},{2,7},{3,4,6},{5}} => {{1,4},{2,6},{3,7},{5}} => 5
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => {{1,2,3,6},{4},{5}} => {{1,2,3},{4},{5,6}} => 0
[2,2,2,2,1,1] => [1,1,1,1,0,1,0,0,0,1,0,1,0,0] => {{1,7},{2,3,5},{4},{6}} => {{1,3},{2,5},{4},{6,7}} => 2
[6,5] => [1,0,1,1,1,0,1,0,1,0,1,0,0,0] => {{1},{2,3,7},{4},{5},{6}} => {{1,3},{2},{4},{5,7},{6}} => 2
[5,5,1] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => {{1,7},{2,6},{3},{4},{5}} => {{1},{2},{3},{4,6},{5,7}} => 1
[5,4,2] => [1,0,1,1,1,0,1,0,1,1,0,0,0,0] => {{1},{2,3,6,7},{4},{5}} => {{1,3,7},{2},{4,6},{5}} => 5
[5,3,3] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => {{1},{2},{3,4,5,6,7}} => {{1,4,5,6,7},{2},{3}} => 8
[4,4,3] => [1,1,1,0,1,1,1,0,0,0,0,0] => {{1,2,4,5,6},{3}} => {{1,2,5,6},{3,4}} => 2
[4,4,2,1] => [1,1,1,0,1,0,1,1,0,0,0,1,0,0] => {{1,7},{2,5,6},{3},{4}} => {{1,6},{2},{3,5},{4,7}} => 4
[4,3,3,1] => [1,0,1,1,1,1,1,0,0,0,0,1,0,0] => {{1},{2,7},{3,4,5,6}} => {{1,4,5,6},{2,7},{3}} => 7
[4,3,2,2] => [1,0,1,1,1,0,1,1,0,1,0,0,0,0] => {{1},{2,3,5,7},{4},{6}} => {{1,3},{2,5,7},{4},{6}} => 4
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => {{1,2,3,6},{4,5}} => {{1,2,3,5},{4,6}} => 1
[3,3,3,1,1] => [1,1,1,1,1,0,0,0,0,1,0,1,0,0] => {{1,7},{2,3,4,5},{6}} => {{1,3,4,5},{2},{6,7}} => 3
[3,3,2,2,1] => [1,1,1,0,1,1,0,1,0,0,0,1,0,0] => {{1,7},{2,4,6},{3},{5}} => {{1},{2,4,6},{3},{5,7}} => 3
[3,2,2,2,2] => [1,0,1,1,1,1,0,1,0,1,0,0,0,0] => {{1},{2,3,4,7},{5},{6}} => {{1,3,4},{2},{5,7},{6}} => 3
[2,2,2,2,2,1] => [1,1,1,1,0,1,0,1,0,0,0,1,0,0] => {{1,7},{2,3,6},{4},{5}} => {{1,3},{2},{4,6},{5,7}} => 2
[6,6] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => {{1,2,7},{3},{4},{5},{6}} => {{1,2},{3},{4},{5},{6,7}} => 0
>>> Load all 132 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 inversions of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1], see also [2,3], an inversion of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a < b$.
This statistic is called ros in [1, Definition 3] for "right, opener, smaller".
This is also the number of occurrences of the pattern {{1, 3}, {2}} such that 1 and 2 are minimal elements of blocks.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1], see also [2,3], an inversion of $S$ is given by a pair $i > j$ such that $j = \operatorname{min} B_b$ and $i \in B_a$ for $a < b$.
This statistic is called ros in [1, Definition 3] for "right, opener, smaller".
This is also the number of occurrences of the pattern {{1, 3}, {2}} such that 1 and 2 are minimal elements of blocks.
Map
to noncrossing partition
Description
Biane's map to noncrossing set partitions.
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.
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
intertwining number to dual major index
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!