Identifier
-
Mp00146:
Dyck paths
—to tunnel matching⟶
Perfect matchings
Mp00092: Perfect matchings —to set partition⟶ Set partitions
Mp00171: Set partitions —intertwining number to dual major index⟶ Set partitions
St000558: Set partitions ⟶ ℤ
Values
[1,0] => [(1,2)] => {{1,2}} => {{1,2}} => 1
[1,0,1,0] => [(1,2),(3,4)] => {{1,2},{3,4}} => {{1,2,4},{3}} => 3
[1,1,0,0] => [(1,4),(2,3)] => {{1,4},{2,3}} => {{1,3},{2,4}} => 2
[1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => {{1,2},{3,4},{5,6}} => {{1,2,4,6},{3},{5}} => 6
[1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => {{1,2},{3,6},{4,5}} => {{1,2,5},{3,6},{4}} => 4
[1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => {{1,4},{2,3},{5,6}} => {{1,3,6},{2,4},{5}} => 4
[1,1,0,1,0,0] => [(1,6),(2,3),(4,5)] => {{1,6},{2,3},{4,5}} => {{1,3,5},{2},{4,6}} => 4
[1,1,1,0,0,0] => [(1,6),(2,5),(3,4)] => {{1,6},{2,5},{3,4}} => {{1,4},{2,5},{3,6}} => 3
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 occurrences of the pattern {{1,2}} in a set partition.
Map
intertwining number to dual major index
Description
Map
to tunnel matching
Description
Sends a Dyck path of semilength n to the noncrossing perfect matching given by matching an up-step with the corresponding down-step.
This is, for a Dyck path D of semilength n, the perfect matching of {1,…,2n} with i<j being matched if Di is an up-step and Dj is the down-step connected to Di by a tunnel.
This is, for a Dyck path D of semilength n, the perfect matching of {1,…,2n} with i<j being matched if Di is an up-step and Dj is the down-step connected to Di by a tunnel.
Map
to set partition
Description
Return the set partition corresponding to the perfect matching.
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!