Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001295: Dyck paths ⟶ ℤ (values match St000012The area of a Dyck path.)
Values
[1,0] => [1] => [.,.] => [1,0] => 0
[1,0,1,0] => [1,2] => [.,[.,.]] => [1,0,1,0] => 0
[1,1,0,0] => [2,1] => [[.,.],.] => [1,1,0,0] => 1
[1,0,1,0,1,0] => [1,2,3] => [.,[.,[.,.]]] => [1,0,1,0,1,0] => 0
[1,0,1,1,0,0] => [1,3,2] => [.,[[.,.],.]] => [1,0,1,1,0,0] => 1
[1,1,0,0,1,0] => [2,1,3] => [[.,.],[.,.]] => [1,1,0,0,1,0] => 1
[1,1,0,1,0,0] => [2,3,1] => [[.,[.,.]],.] => [1,1,0,1,0,0] => 2
[1,1,1,0,0,0] => [3,2,1] => [[[.,.],.],.] => [1,1,1,0,0,0] => 3
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [.,[.,[.,[.,.]]]] => [1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [.,[.,[[.,.],.]]] => [1,0,1,0,1,1,0,0] => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [.,[[.,.],[.,.]]] => [1,0,1,1,0,0,1,0] => 1
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [.,[[.,[.,.]],.]] => [1,0,1,1,0,1,0,0] => 2
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [.,[[[.,.],.],.]] => [1,0,1,1,1,0,0,0] => 3
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [[.,.],[.,[.,.]]] => [1,1,0,0,1,0,1,0] => 1
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [[.,.],[[.,.],.]] => [1,1,0,0,1,1,0,0] => 2
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [[.,[.,.]],[.,.]] => [1,1,0,1,0,0,1,0] => 2
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [[.,[.,[.,.]]],.] => [1,1,0,1,0,1,0,0] => 3
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [[.,[[.,.],.]],.] => [1,1,0,1,1,0,0,0] => 4
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [[[.,.],.],[.,.]] => [1,1,1,0,0,0,1,0] => 3
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [[[.,.],[.,.]],.] => [1,1,1,0,0,1,0,0] => 4
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [[[.,.],[.,.]],.] => [1,1,1,0,0,1,0,0] => 4
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [[[[.,.],.],.],.] => [1,1,1,1,0,0,0,0] => 6
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]] => [1,0,1,0,1,0,1,1,0,0] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]] => [1,0,1,0,1,1,0,0,1,0] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]] => [1,0,1,0,1,1,0,1,0,0] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]] => [1,0,1,1,0,0,1,0,1,0] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]] => [1,0,1,1,0,0,1,1,0,0] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]] => [1,0,1,1,0,1,0,1,0,0] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [.,[[.,[[.,.],.]],.]] => [1,0,1,1,0,1,1,0,0,0] => 4
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]] => [1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [.,[[[.,.],[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 4
[1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [.,[[[.,.],[.,.]],.]] => [1,0,1,1,1,0,0,1,0,0] => 4
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]] => [1,0,1,1,1,1,0,0,0,0] => 6
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]] => [1,1,0,0,1,0,1,0,1,0] => 1
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]] => [1,1,0,0,1,0,1,1,0,0] => 2
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]] => [1,1,0,0,1,1,0,0,1,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]] => [1,1,0,0,1,1,0,1,0,0] => 3
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [[.,.],[[[.,.],.],.]] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]] => [1,1,0,1,0,0,1,0,1,0] => 2
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]] => [1,1,0,1,0,0,1,1,0,0] => 3
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]] => [1,1,0,1,0,1,0,0,1,0] => 3
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.] => [1,1,0,1,0,1,0,1,0,0] => 4
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [[.,[.,[[.,.],.]]],.] => [1,1,0,1,0,1,1,0,0,0] => 5
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [[.,[[.,.],.]],[.,.]] => [1,1,0,1,1,0,0,0,1,0] => 4
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,1,0,0] => 5
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [[.,[[.,.],[.,.]]],.] => [1,1,0,1,1,0,0,1,0,0] => 5
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [[.,[[[.,.],.],.]],.] => [1,1,0,1,1,1,0,0,0,0] => 7
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [[[.,.],.],[.,[.,.]]] => [1,1,1,0,0,0,1,0,1,0] => 3
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [[[.,.],.],[[.,.],.]] => [1,1,1,0,0,0,1,1,0,0] => 4
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [[[.,.],[.,.]],[.,.]] => [1,1,1,0,0,1,0,0,1,0] => 4
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [[[.,.],[.,[.,.]]],.] => [1,1,1,0,0,1,0,1,0,0] => 5
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [[[.,.],[[.,.],.]],.] => [1,1,1,0,0,1,1,0,0,0] => 6
[1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [[[.,.],[.,.]],[.,.]] => [1,1,1,0,0,1,0,0,1,0] => 4
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [[[.,.],[.,[.,.]]],.] => [1,1,1,0,0,1,0,1,0,0] => 5
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.] => [1,1,1,0,0,1,0,1,0,0] => 5
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [[[.,.],[[.,.],.]],.] => [1,1,1,0,0,1,1,0,0,0] => 6
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [[[[.,.],.],.],[.,.]] => [1,1,1,1,0,0,0,0,1,0] => 6
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [[[[.,.],.],[.,.]],.] => [1,1,1,1,0,0,0,1,0,0] => 7
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [[[[.,.],.],[.,.]],.] => [1,1,1,1,0,0,0,1,0,0] => 7
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [[[[.,.],[.,.]],.],.] => [1,1,1,1,0,0,1,0,0,0] => 8
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [[[[[.,.],.],.],.],.] => [1,1,1,1,1,0,0,0,0,0] => 10
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [.,[.,[.,[.,[.,[.,.]]]]]] => [1,0,1,0,1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [.,[.,[.,[.,[[.,.],.]]]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [.,[.,[.,[[.,.],[.,.]]]]] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [.,[.,[.,[[.,[.,.]],.]]]] => [1,0,1,0,1,0,1,1,0,1,0,0] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [.,[.,[.,[[[.,.],.],.]]]] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [.,[.,[[.,.],[.,[.,.]]]]] => [1,0,1,0,1,1,0,0,1,0,1,0] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [.,[.,[[.,.],[[.,.],.]]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [.,[.,[[.,[.,.]],[.,.]]]] => [1,0,1,0,1,1,0,1,0,0,1,0] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [.,[.,[[.,[.,[.,.]]],.]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [.,[.,[[.,[[.,.],.]],.]]] => [1,0,1,0,1,1,0,1,1,0,0,0] => 4
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [.,[.,[[[.,.],.],[.,.]]]] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [.,[.,[[[.,.],[.,.]],.]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => 4
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,6,4,5,3] => [.,[.,[[[.,.],[.,.]],.]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => 4
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [.,[.,[[[[.,.],.],.],.]]] => [1,0,1,0,1,1,1,1,0,0,0,0] => 6
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [.,[[.,.],[.,[.,[.,.]]]]] => [1,0,1,1,0,0,1,0,1,0,1,0] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [.,[[.,.],[.,[[.,.],.]]]] => [1,0,1,1,0,0,1,0,1,1,0,0] => 2
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [.,[[.,.],[[.,.],[.,.]]]] => [1,0,1,1,0,0,1,1,0,0,1,0] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [.,[[.,.],[[.,[.,.]],.]]] => [1,0,1,1,0,0,1,1,0,1,0,0] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [.,[[.,.],[[[.,.],.],.]]] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [.,[[.,[.,.]],[.,[.,.]]]] => [1,0,1,1,0,1,0,0,1,0,1,0] => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [.,[[.,[.,.]],[[.,.],.]]] => [1,0,1,1,0,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [.,[[.,[.,[.,.]]],[.,.]]] => [1,0,1,1,0,1,0,1,0,0,1,0] => 3
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [.,[[.,[.,[.,[.,.]]]],.]] => [1,0,1,1,0,1,0,1,0,1,0,0] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [.,[[.,[.,[[.,.],.]]],.]] => [1,0,1,1,0,1,0,1,1,0,0,0] => 5
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [.,[[.,[[.,.],.]],[.,.]]] => [1,0,1,1,0,1,1,0,0,0,1,0] => 4
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [.,[[.,[[.,.],[.,.]]],.]] => [1,0,1,1,0,1,1,0,0,1,0,0] => 5
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => [.,[[.,[[.,.],[.,.]]],.]] => [1,0,1,1,0,1,1,0,0,1,0,0] => 5
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [.,[[.,[[[.,.],.],.]],.]] => [1,0,1,1,0,1,1,1,0,0,0,0] => 7
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [.,[[[.,.],.],[.,[.,.]]]] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [.,[[[.,.],.],[[.,.],.]]] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [.,[[[.,.],[.,.]],[.,.]]] => [1,0,1,1,1,0,0,1,0,0,1,0] => 4
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [.,[[[.,.],[.,[.,.]]],.]] => [1,0,1,1,1,0,0,1,0,1,0,0] => 5
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [.,[[[.,.],[[.,.],.]],.]] => [1,0,1,1,1,0,0,1,1,0,0,0] => 6
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,5,3,4,2,6] => [.,[[[.,.],[.,.]],[.,.]]] => [1,0,1,1,1,0,0,1,0,0,1,0] => 4
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => [.,[[[.,.],[.,[.,.]]],.]] => [1,0,1,1,1,0,0,1,0,1,0,0] => 5
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => [.,[[[.,.],[.,[.,.]]],.]] => [1,0,1,1,1,0,0,1,0,1,0,0] => 5
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [.,[[[.,.],[[.,.],.]],.]] => [1,0,1,1,1,0,0,1,1,0,0,0] => 6
>>> Load all 196 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
Gives the vector space dimension of the homomorphism space between J^2 and J^2.
Map
to non-crossing permutation
Description
Sends a Dyck path D with valley at positions {(i1,j1),…,(ik,jk)} to the unique non-crossing permutation π having descents {i1,…,ik} and whose inverse has descents {j1,…,jk}.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
to Dyck path: up step, left tree, down step, right tree
Description
Return the associated Dyck path, using the bijection 1L0R.
This is given recursively as follows:
This is given recursively as follows:
- a leaf is associated to the empty Dyck Word
- a tree with children l,r is associated with the Dyck path described by 1L0R where L and R are respectively the Dyck words associated with the trees l and r.
Map
to increasing tree
Description
Sends a permutation to its associated increasing tree.
This tree is recursively obtained by sending the unique permutation of length 0 to the empty tree, and sending a permutation σ of length n≥1 to a root node with two subtrees L and R by splitting σ at the index σ−1(1), normalizing both sides again to permutations and sending the permutations on the left and on the right of σ−1(1) to the trees L and R, respectively.
This tree is recursively obtained by sending the unique permutation of length 0 to the empty tree, and sending a permutation σ of length n≥1 to a root node with two subtrees L and R by splitting σ at the index σ−1(1), normalizing both sides again to permutations and sending the permutations on the left and on the right of σ−1(1) to the trees L and R, respectively.
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!