Identifier
-
Mp00020:
Binary trees
—to Tamari-corresponding Dyck path⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001880: Posets ⟶ ℤ
Values
[[[.,.],.],.] => [1,0,1,0,1,0] => [1,2,3] => ([(0,2),(2,1)],3) => 3
[[[.,.],[.,.]],.] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4) => 4
[[[[.,.],.],.],.] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 4
[[[.,.],[.,[.,.]]],.] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 4
[[[.,.],[[.,.],.]],.] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 4
[[[[.,.],.],[.,.]],.] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 5
[[[[.,.],[.,.]],.],.] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 5
[[[[[.,.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[[[.,.],[.,[.,[.,.]]]],.] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,2,3,4,6] => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => 4
[[[.,.],[.,[[.,.],.]]],.] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,2,3,6] => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6) => 4
[[[.,.],[[.,.],[.,.]]],.] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,2,4,6] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 6
[[[.,.],[[.,[.,.]],.]],.] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,2,5,3,6] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 6
[[[.,.],[[[.,.],.],.]],.] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => 4
[[[[.,.],.],[.,[.,.]]],.] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 5
[[[[.,.],.],[[.,.],.]],.] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 5
[[[[[.,.],.],.],[.,.]],.] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 6
[[[[.,.],[.,[.,.]]],.],.] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 5
[[[[.,.],[[.,.],.]],.],.] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 5
[[[[[.,.],.],[.,.]],.],.] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 6
[[[[[.,.],[.,.]],.],.],.] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 6
[[[[[[.,.],.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[[[.,.],[.,[.,[.,[.,.]]]]],.] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,6,2,3,4,5,7] => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7) => 4
[[[.,.],[.,[.,[[.,.],.]]]],.] => [1,0,1,1,1,1,0,1,0,0,0,0,1,0] => [1,5,6,2,3,4,7] => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7) => 4
[[[.,.],[.,[[.,.],[.,.]]]],.] => [1,0,1,1,1,0,1,1,0,0,0,0,1,0] => [1,4,6,2,3,5,7] => ([(0,3),(0,4),(1,6),(2,5),(3,2),(4,1),(4,5),(5,6)],7) => 6
[[[.,.],[.,[[.,[.,.]],.]]],.] => [1,0,1,1,1,1,0,0,1,0,0,0,1,0] => [1,5,2,6,3,4,7] => ([(0,2),(0,4),(1,6),(2,5),(3,1),(4,3),(4,5),(5,6)],7) => 6
[[[.,.],[.,[[[.,.],.],.]]],.] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => [1,4,5,6,2,3,7] => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7) => 4
[[[.,.],[[.,.],[.,[.,.]]]],.] => [1,0,1,1,0,1,1,1,0,0,0,0,1,0] => [1,3,6,2,4,5,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,2),(4,6),(6,1)],7) => 6
[[[.,.],[[.,.],[[.,.],.]]],.] => [1,0,1,1,0,1,1,0,1,0,0,0,1,0] => [1,3,5,6,2,4,7] => ([(0,2),(0,4),(1,6),(2,5),(3,1),(4,3),(4,5),(5,6)],7) => 6
[[[.,.],[[[.,.],.],[.,.]]],.] => [1,0,1,1,0,1,0,1,1,0,0,0,1,0] => [1,3,4,6,2,5,7] => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,5),(4,3),(5,6)],7) => 6
[[[.,.],[[.,[.,[.,.]]],.]],.] => [1,0,1,1,1,1,0,0,0,1,0,0,1,0] => [1,5,2,3,6,4,7] => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,5),(4,3),(5,6)],7) => 6
[[[.,.],[[.,[[.,.],.]],.]],.] => [1,0,1,1,1,0,1,0,0,1,0,0,1,0] => [1,4,5,2,6,3,7] => ([(0,3),(0,4),(1,6),(2,5),(3,2),(4,1),(4,5),(5,6)],7) => 6
[[[.,.],[[[.,[.,.]],.],.]],.] => [1,0,1,1,1,0,0,1,0,1,0,0,1,0] => [1,4,2,5,6,3,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,2),(4,6),(6,1)],7) => 6
[[[.,.],[[[[.,.],.],.],.]],.] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => [1,3,4,5,6,2,7] => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7) => 4
[[[[.,.],.],[.,[.,[.,.]]]],.] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,2,6,3,4,5,7] => ([(0,5),(1,6),(2,6),(3,4),(4,2),(5,1),(5,3)],7) => 5
[[[[.,.],.],[.,[[.,.],.]]],.] => [1,0,1,0,1,1,1,0,1,0,0,0,1,0] => [1,2,5,6,3,4,7] => ([(0,5),(1,6),(2,6),(3,2),(4,1),(5,3),(5,4)],7) => 5
[[[[.,.],.],[[.,.],[.,.]]],.] => [1,0,1,0,1,1,0,1,1,0,0,0,1,0] => [1,2,4,6,3,5,7] => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 7
[[[[.,.],.],[[.,[.,.]],.]],.] => [1,0,1,0,1,1,1,0,0,1,0,0,1,0] => [1,2,5,3,6,4,7] => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 7
[[[[.,.],.],[[[.,.],.],.]],.] => [1,0,1,0,1,1,0,1,0,1,0,0,1,0] => [1,2,4,5,6,3,7] => ([(0,5),(1,6),(2,6),(3,4),(4,2),(5,1),(5,3)],7) => 5
[[[[[.,.],.],.],[.,[.,.]]],.] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,4,5,7] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 6
[[[[[.,.],.],.],[[.,.],.]],.] => [1,0,1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,3,5,6,4,7] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 6
[[[[[.,.],[.,.]],.],[.,.]],.] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,3,2,4,6,5,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => 7
[[[[[[.,.],.],.],.],[.,.]],.] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,4,6,5,7] => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => 7
[[[[.,.],[.,[.,[.,.]]]],.],.] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,5,2,3,4,6,7] => ([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7) => 5
[[[[.,.],[.,[[.,.],.]]],.],.] => [1,0,1,1,1,0,1,0,0,0,1,0,1,0] => [1,4,5,2,3,6,7] => ([(0,4),(0,5),(1,6),(2,6),(4,2),(5,1),(6,3)],7) => 5
[[[[.,.],[[.,.],[.,.]]],.],.] => [1,0,1,1,0,1,1,0,0,0,1,0,1,0] => [1,3,5,2,4,6,7] => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 7
[[[[.,.],[[.,[.,.]],.]],.],.] => [1,0,1,1,1,0,0,1,0,0,1,0,1,0] => [1,4,2,5,3,6,7] => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 7
[[[[.,.],[[[.,.],.],.]],.],.] => [1,0,1,1,0,1,0,1,0,0,1,0,1,0] => [1,3,4,5,2,6,7] => ([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7) => 5
[[[[[.,.],.],[.,[.,.]]],.],.] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,2,5,3,4,6,7] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 6
[[[[[.,.],.],[[.,.],.]],.],.] => [1,0,1,0,1,1,0,1,0,0,1,0,1,0] => [1,2,4,5,3,6,7] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 6
[[[[[[.,.],.],.],[.,.]],.],.] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,3,5,4,6,7] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 7
[[[[[.,.],[.,[.,.]]],.],.],.] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,4,2,3,5,6,7] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 6
[[[[[.,.],[[.,.],.]],.],.],.] => [1,0,1,1,0,1,0,0,1,0,1,0,1,0] => [1,3,4,2,5,6,7] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 6
[[[[[[.,.],.],[.,.]],.],.],.] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,2,4,3,5,6,7] => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => 7
[[[[[[.,.],[.,.]],.],.],.],.] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,2,4,5,6,7] => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 7
[[[[[[[.,.],.],.],.],.],.],.] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 7
search for individual values
searching the database for the individual values of this statistic
Description
The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice.
Map
permutation poset
Description
Sends a permutation to its permutation poset.
For a permutation π of length n, this poset has vertices
{(i,π(i)) : 1≤i≤n}
and the cover relation is given by (w,x)≤(y,z) if w≤y and x≤z.
For example, the permutation [3,1,5,4,2] is mapped to the poset with cover relations
{(2,1)≺(5,2), (2,1)≺(4,4), (2,1)≺(3,5), (1,3)≺(4,4), (1,3)≺(3,5)}.
For a permutation π of length n, this poset has vertices
{(i,π(i)) : 1≤i≤n}
and the cover relation is given by (w,x)≤(y,z) if w≤y and x≤z.
For example, the permutation [3,1,5,4,2] is mapped to the poset with cover relations
{(2,1)≺(5,2), (2,1)≺(4,4), (2,1)≺(3,5), (1,3)≺(4,4), (1,3)≺(3,5)}.
Map
to Tamari-corresponding Dyck path
Description
Return the Dyck path associated with a binary tree in consistency with the Tamari order on Dyck words and binary trees.
The bijection is defined recursively as follows:
The bijection is defined recursively as follows:
- a leaf is associated with an empty Dyck path,
- a tree with children l,r is associated with the Dyck word T(l)1T(r)0 where T(l) and T(r) are the images of this bijection to l and r.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
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!