Identifier
Values
[1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => 3
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => ([(0,1),(0,2),(1,3),(2,3)],4) => 4
[1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 4
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => 1
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 4
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 5
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 5
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 5
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6) => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6) => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => ([(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,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6) => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 5
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6) => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 5
[1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 6
[1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 6
[1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 6
[1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 6
[1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
[1,0,1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7) => 1
[1,0,1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0,1,0] => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7) => 1
[1,0,1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,1),(4,5),(5,6)],7) => 1
[1,0,1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,1,0,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0,1,0] => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7) => 2
[1,0,1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,6),(2,6),(3,5),(4,1),(4,2),(4,5),(5,6)],7) => 2
[1,0,1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0,1,0] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7) => 2
[1,0,1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(1,5),(2,6),(3,6),(4,1),(4,6),(6,5)],7) => 2
[1,0,1,1,0,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0,1,0] => ([(0,3),(0,4),(1,6),(2,5),(3,5),(4,1),(4,2),(5,6)],7) => 3
[1,0,1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7) => 2
[1,0,1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,3),(5,1),(5,2),(5,4)],7) => 2
[1,0,1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(4,2),(4,3),(5,1),(5,4)],7) => 3
[1,0,1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,1,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0,1,0] => ([(0,4),(1,6),(2,5),(3,5),(4,1),(4,2),(4,3),(5,6)],7) => 3
[1,0,1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0,1,0] => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 7
[1,0,1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7) => 2
[1,0,1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0,1,0] => ([(0,3),(0,4),(0,5),(1,6),(3,6),(4,6),(5,1),(6,2)],7) => 2
[1,0,1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0,1,0] => ([(0,4),(0,5),(1,6),(2,6),(4,6),(5,1),(5,2),(6,3)],7) => 3
[1,0,1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,6),(3,5),(4,5),(5,6),(6,1)],7) => 3
[1,0,1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0,1,0] => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 7
[1,0,1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2),(5,3)],7) => 3
[1,0,1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 6
[1,0,1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7) => 3
[1,0,1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 6
[1,0,1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => 7
[1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(0,4),(2,6),(3,6),(4,6),(5,1),(6,5)],7) => 3
[1,0,1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 6
[1,0,1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => 7
[1,0,1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 7
[1,0,1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => 7
[1,0,1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 7
[1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => ([(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
inverse promotion
Description
The inverse promotion of a Dyck path.
This is the bijection obtained by applying the inverse of Schützenberger's promotion to the corresponding two rowed standard Young tableau.
Map
Hessenberg poset
Description
The Hessenberg poset of a Dyck path.
Let $D$ be a Dyck path of semilength $n$, regarded as a subdiagonal path from $(0,0)$ to $(n,n)$, and let $\boldsymbol{m}_i$ be the $x$-coordinate of the $i$-th up step.
Then the Hessenberg poset (or natural unit interval order) corresponding to $D$ has elements $\{1,\dots,n\}$ with $i < j$ if $j < \boldsymbol{m}_i$.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.