Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00065: Permutations —permutation poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001719: Lattices ⟶ ℤ
Values
[1,0] => [1] => ([],1) => ([(0,1)],2) => 1
[1,0,1,0] => [1,2] => ([(0,1)],2) => ([(0,2),(2,1)],3) => 1
[1,1,0,0] => [2,1] => ([],2) => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
[1,0,1,0,1,0] => [1,2,3] => ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 1
[1,0,1,1,0,0] => [1,3,2] => ([(0,1),(0,2)],3) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 1
[1,1,0,0,1,0] => [2,1,3] => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 1
[1,1,0,1,0,0] => [2,3,1] => ([(1,2)],3) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 2
[1,1,1,0,0,0] => [3,2,1] => ([],3) => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8) => 1
[1,0,1,0,1,0,1,0] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[1,0,1,0,1,1,0,0] => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4) => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 1
[1,0,1,1,0,1,0,0] => [1,3,4,2] => ([(0,2),(0,3),(3,1)],4) => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 2
[1,0,1,1,1,0,0,0] => [1,4,3,2] => ([(0,1),(0,2),(0,3)],4) => ([(0,4),(1,6),(1,7),(2,5),(2,7),(3,5),(3,6),(4,1),(4,2),(4,3),(5,8),(6,8),(7,8)],9) => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => ([(0,3),(1,3),(3,2)],4) => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 1
[1,1,0,0,1,1,0,0] => [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => 1
[1,1,0,1,0,0,1,0] => [2,3,1,4] => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 2
[1,1,0,1,0,1,0,0] => [2,3,4,1] => ([(1,2),(2,3)],4) => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8) => 3
[1,1,1,0,0,0,1,0] => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4) => ([(0,2),(0,3),(0,4),(2,6),(2,7),(3,5),(3,7),(4,5),(4,6),(5,8),(6,8),(7,8),(8,1)],9) => 1
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5) => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => 1
[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) => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 1
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => ([(0,4),(3,2),(4,1),(4,3)],5) => ([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8) => 2
[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) => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => 1
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5) => ([(0,5),(1,7),(2,7),(3,6),(4,6),(5,1),(5,2),(7,3),(7,4)],8) => 1
[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) => ([(0,5),(2,7),(3,6),(4,2),(4,6),(5,3),(5,4),(6,7),(7,1)],8) => 2
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => ([(0,2),(0,4),(3,1),(4,3)],5) => ([(0,5),(1,6),(2,7),(3,4),(3,6),(4,2),(4,8),(5,1),(5,3),(6,8),(8,7)],9) => 3
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => ([(0,4),(1,4),(2,3),(4,2)],5) => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 1
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5) => ([(0,3),(0,4),(1,6),(2,6),(3,7),(4,7),(5,1),(5,2),(7,5)],8) => 1
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5) => ([(0,4),(0,5),(1,6),(2,6),(4,7),(5,7),(6,3),(7,1),(7,2)],8) => 1
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5) => ([(0,3),(0,4),(1,7),(2,6),(3,8),(4,8),(5,1),(5,6),(6,7),(8,2),(8,5)],9) => 2
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5) => ([(0,3),(0,5),(1,7),(3,6),(4,2),(5,1),(5,6),(6,7),(7,4)],8) => 2
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5) => ([(0,4),(0,5),(1,8),(2,6),(3,6),(4,7),(5,1),(5,7),(7,8),(8,2),(8,3)],9) => 2
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5) => ([(0,3),(0,5),(2,8),(3,6),(4,2),(4,7),(5,4),(5,6),(6,7),(7,8),(8,1)],9) => 3
[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) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => ([(0,4),(3,5),(4,3),(5,1),(5,2)],6) => ([(0,5),(1,7),(2,7),(3,4),(4,6),(5,3),(6,1),(6,2)],8) => 1
[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) => ([(0,5),(1,7),(2,7),(4,6),(5,4),(6,1),(6,2),(7,3)],8) => 1
[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) => ([(0,5),(2,7),(3,7),(4,1),(5,6),(6,2),(6,3),(7,4)],8) => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,1),(3,2)],6) => ([(0,5),(1,8),(2,8),(3,7),(4,7),(5,6),(6,1),(6,2),(8,3),(8,4)],9) => 1
[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) => ([(0,5),(2,8),(3,7),(4,2),(4,7),(5,6),(6,3),(6,4),(7,8),(8,1)],9) => 2
[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) => ([(0,6),(2,7),(3,7),(4,1),(5,4),(6,2),(6,3),(7,5)],8) => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => ([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6) => ([(0,6),(1,8),(2,8),(3,7),(4,7),(5,3),(5,4),(6,1),(6,2),(8,5)],9) => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,6),(1,8),(2,8),(3,7),(4,7),(6,1),(6,2),(7,5),(8,3),(8,4)],9) => 1
[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) => ([(0,6),(2,8),(3,7),(4,2),(4,7),(5,1),(6,3),(6,4),(7,8),(8,5)],9) => 2
[1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(0,2),(0,3),(2,7),(3,7),(4,5),(5,1),(6,4),(7,6)],8) => 1
[1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => ([(0,5),(1,5),(4,2),(4,3),(5,4)],6) => ([(0,3),(0,4),(1,7),(2,7),(3,8),(4,8),(5,6),(6,1),(6,2),(8,5)],9) => 1
[1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => ([(0,4),(1,4),(2,5),(3,5),(4,2),(4,3)],6) => ([(0,4),(0,5),(2,8),(3,8),(4,7),(5,7),(6,2),(6,3),(7,6),(8,1)],9) => 1
[1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => ([(0,4),(0,5),(1,4),(1,5),(3,2),(4,3),(5,3)],6) => ([(0,4),(0,5),(2,7),(3,7),(4,8),(5,8),(6,1),(7,6),(8,2),(8,3)],9) => 1
[1,1,0,1,0,0,1,0,1,0,1,0] => [2,3,1,4,5,6] => ([(0,5),(1,3),(3,5),(4,2),(5,4)],6) => ([(0,3),(0,6),(1,8),(3,7),(4,2),(5,4),(6,1),(6,7),(7,8),(8,5)],9) => 2
[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) => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => 1
[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) => ([(0,6),(2,8),(3,8),(4,7),(5,1),(6,4),(7,2),(7,3),(8,5)],9) => 1
[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) => ([(0,7),(2,8),(3,8),(4,5),(5,1),(6,4),(7,2),(7,3),(8,6)],9) => 1
[1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6,7] => ([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7) => ([(0,2),(0,3),(2,8),(3,8),(4,6),(5,4),(6,1),(7,5),(8,7)],9) => 1
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 shortest chains of small intervals from the bottom to the top in a lattice.
An interval $[a, b]$ in a lattice is small if $b$ is a join of elements covering $a$.
An interval $[a, b]$ in a lattice is small if $b$ is a join of elements covering $a$.
Map
permutation poset
Description
Sends a permutation to its permutation poset.
For a permutation $\pi$ of length $n$, this poset has vertices
$$\{ (i,\pi(i))\ :\ 1 \leq i \leq n \}$$
and the cover relation is given by $(w, x) \leq (y, z)$ if $w \leq y$ and $x \leq z$.
For example, the permutation $[3,1,5,4,2]$ is mapped to the poset with cover relations
$$\{ (2, 1) \prec (5, 2),\ (2, 1) \prec (4, 4),\ (2, 1) \prec (3, 5),\ (1, 3) \prec (4, 4),\ (1, 3) \prec (3, 5) \}.$$
For a permutation $\pi$ of length $n$, this poset has vertices
$$\{ (i,\pi(i))\ :\ 1 \leq i \leq n \}$$
and the cover relation is given by $(w, x) \leq (y, z)$ if $w \leq y$ and $x \leq z$.
For example, the permutation $[3,1,5,4,2]$ is mapped to the poset with cover relations
$$\{ (2, 1) \prec (5, 2),\ (2, 1) \prec (4, 4),\ (2, 1) \prec (3, 5),\ (1, 3) \prec (4, 4),\ (1, 3) \prec (3, 5) \}.$$
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
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
order ideals
Description
The lattice of order ideals of a poset.
An order ideal $\mathcal I$ in a poset $P$ is a downward closed set, i.e., $a \in \mathcal I$ and $b \leq a$ implies $b \in \mathcal I$. This map sends a poset to the lattice of all order ideals sorted by inclusion with meet being intersection and join being union.
An order ideal $\mathcal I$ in a poset $P$ is a downward closed set, i.e., $a \in \mathcal I$ and $b \leq a$ implies $b \in \mathcal I$. This map sends a poset to the lattice of all order ideals sorted by inclusion with meet being intersection and join being union.
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!