Identifier
-
Mp00017:
Binary trees
—to 312-avoiding permutation⟶
Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001879: Posets ⟶ ℤ
Values
[[[.,.],.],.] => [1,2,3] => [1,2,3] => ([(0,2),(2,1)],3) => 2
[[[.,.],[.,.]],.] => [1,3,2,4] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4) => 4
[[[[.,.],.],.],.] => [1,2,3,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 3
[[[.,.],[.,[.,.]]],.] => [1,4,3,2,5] => [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 6
[[[.,.],[[.,.],.]],.] => [1,3,4,2,5] => [1,4,2,3,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => 6
[[[[.,.],.],[.,.]],.] => [1,2,4,3,5] => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 5
[[[[.,.],[.,.]],.],.] => [1,3,2,4,5] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 5
[[[[[.,.],.],.],.],.] => [1,2,3,4,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[[[.,.],[.,[.,[.,.]]]],.] => [1,5,4,3,2,6] => [1,4,3,5,2,6] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 10
[[[.,.],[.,[[.,.],.]]],.] => [1,4,5,3,2,6] => [1,5,2,4,3,6] => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6) => 10
[[[.,.],[[.,.],[.,.]]],.] => [1,3,5,4,2,6] => [1,4,5,2,3,6] => ([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6) => 8
[[[.,.],[[.,[.,.]],.]],.] => [1,4,3,5,2,6] => [1,3,5,2,4,6] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 7
[[[.,.],[[[.,.],.],.]],.] => [1,3,4,5,2,6] => [1,5,2,3,4,6] => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => 8
[[[[.,.],.],[.,[.,.]]],.] => [1,2,5,4,3,6] => [1,2,4,5,3,6] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 7
[[[[.,.],.],[[.,.],.]],.] => [1,2,4,5,3,6] => [1,2,5,3,4,6] => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => 7
[[[[[.,.],.],.],[.,.]],.] => [1,2,3,5,4,6] => [1,2,3,5,4,6] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 6
[[[[.,.],[.,[.,.]]],.],.] => [1,4,3,2,5,6] => [1,3,4,2,5,6] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 7
[[[[.,.],[[.,.],.]],.],.] => [1,3,4,2,5,6] => [1,4,2,3,5,6] => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => 7
[[[[[.,.],.],[.,.]],.],.] => [1,2,4,3,5,6] => [1,2,4,3,5,6] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 6
[[[[[.,.],[.,.]],.],.],.] => [1,3,2,4,5,6] => [1,3,2,4,5,6] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 6
[[[[[[.,.],.],.],.],.],.] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 5
[[[.,.],[.,[.,[.,[.,.]]]]],.] => [1,6,5,4,3,2,7] => [1,4,5,3,6,2,7] => ([(0,2),(0,3),(0,4),(1,5),(2,6),(3,5),(4,1),(5,6)],7) => 13
[[[.,.],[.,[.,[[.,.],.]]]],.] => [1,5,6,4,3,2,7] => [1,4,6,2,5,3,7] => ([(0,3),(0,4),(1,6),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6)],7) => 10
[[[.,.],[.,[[.,.],[.,.]]]],.] => [1,4,6,5,3,2,7] => [1,6,2,4,5,3,7] => ([(0,3),(0,5),(1,6),(2,6),(3,6),(4,2),(5,1),(5,4)],7) => 13
[[[.,.],[.,[[.,[.,.]],.]]],.] => [1,5,4,6,3,2,7] => [1,6,2,5,3,4,7] => ([(0,3),(0,5),(1,6),(2,6),(3,6),(4,2),(5,1),(5,4)],7) => 13
[[[.,.],[.,[[[.,.],.],.]]],.] => [1,4,5,6,3,2,7] => [1,5,3,6,2,4,7] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => 11
[[[.,.],[[.,.],[.,[.,.]]]],.] => [1,3,6,5,4,2,7] => [1,5,4,6,2,3,7] => ([(0,2),(0,3),(0,4),(1,6),(2,5),(3,5),(4,1),(5,6)],7) => 13
[[[.,.],[[.,.],[[.,.],.]]],.] => [1,3,5,6,4,2,7] => [1,6,2,3,5,4,7] => ([(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(5,1),(5,2)],7) => 12
[[[.,.],[[.,[.,.]],[.,.]]],.] => [1,4,3,6,5,2,7] => [1,3,5,6,2,4,7] => ([(0,2),(0,4),(1,6),(2,5),(3,1),(4,3),(4,5),(5,6)],7) => 9
[[[.,.],[[[.,.],.],[.,.]]],.] => [1,3,4,6,5,2,7] => [1,5,6,2,3,4,7] => ([(0,4),(0,5),(1,6),(2,6),(3,2),(4,3),(5,1)],7) => 10
[[[.,.],[[.,[[.,.],.]],.]],.] => [1,4,5,3,6,2,7] => [1,6,2,4,3,5,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,1),(4,2),(5,6)],7) => 11
[[[.,.],[[[.,.],[.,.]],.]],.] => [1,3,5,4,6,2,7] => [1,4,6,2,3,5,7] => ([(0,3),(0,4),(1,6),(2,5),(3,2),(4,1),(4,5),(5,6)],7) => 9
[[[.,.],[[[.,[.,.]],.],.]],.] => [1,4,3,5,6,2,7] => [1,3,6,2,4,5,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,2),(4,6),(6,1)],7) => 9
[[[.,.],[[[[.,.],.],.],.]],.] => [1,3,4,5,6,2,7] => [1,6,2,3,4,5,7] => ([(0,2),(0,5),(1,6),(2,6),(3,4),(4,1),(5,3)],7) => 10
[[[[.,.],.],[.,[.,[.,.]]]],.] => [1,2,6,5,4,3,7] => [1,2,5,4,6,3,7] => ([(0,4),(1,6),(2,5),(3,5),(4,1),(4,2),(4,3),(5,6)],7) => 11
[[[[.,.],.],[.,[[.,.],.]]],.] => [1,2,5,6,4,3,7] => [1,2,6,3,5,4,7] => ([(0,5),(1,6),(2,6),(3,6),(4,2),(4,3),(5,1),(5,4)],7) => 11
[[[[.,.],.],[[.,.],[.,.]]],.] => [1,2,4,6,5,3,7] => [1,2,5,6,3,4,7] => ([(0,5),(1,6),(2,6),(3,2),(4,1),(5,3),(5,4)],7) => 9
[[[[.,.],.],[[.,[.,.]],.]],.] => [1,2,5,4,6,3,7] => [1,2,4,6,3,5,7] => ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7) => 8
[[[[.,.],.],[[[.,.],.],.]],.] => [1,2,4,5,6,3,7] => [1,2,6,3,4,5,7] => ([(0,5),(1,6),(2,6),(3,4),(4,2),(5,1),(5,3)],7) => 9
[[[[[.,.],.],.],[.,[.,.]]],.] => [1,2,3,6,5,4,7] => [1,2,3,5,6,4,7] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 8
[[[[[.,.],.],.],[[.,.],.]],.] => [1,2,3,5,6,4,7] => [1,2,3,6,4,5,7] => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => 8
[[[[[.,.],[.,.]],.],[.,.]],.] => [1,3,2,4,6,5,7] => [1,3,2,4,6,5,7] => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => 8
[[[[[[.,.],.],.],.],[.,.]],.] => [1,2,3,4,6,5,7] => [1,2,3,4,6,5,7] => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => 7
[[[[.,.],[.,[.,[.,.]]]],.],.] => [1,5,4,3,2,6,7] => [1,4,3,5,2,6,7] => ([(0,2),(0,3),(0,4),(2,6),(3,5),(4,5),(5,6),(6,1)],7) => 11
[[[[.,.],[.,[[.,.],.]]],.],.] => [1,4,5,3,2,6,7] => [1,5,2,4,3,6,7] => ([(0,4),(0,5),(1,6),(2,6),(4,6),(5,1),(5,2),(6,3)],7) => 11
[[[[.,.],[[.,.],[.,.]]],.],.] => [1,3,5,4,2,6,7] => [1,4,5,2,3,6,7] => ([(0,4),(0,5),(1,6),(2,6),(4,2),(5,1),(6,3)],7) => 9
[[[[.,.],[[.,[.,.]],.]],.],.] => [1,4,3,5,2,6,7] => [1,3,5,2,4,6,7] => ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7) => 8
[[[[.,.],[[[.,.],.],.]],.],.] => [1,3,4,5,2,6,7] => [1,5,2,3,4,6,7] => ([(0,3),(0,5),(1,6),(3,6),(4,1),(5,4),(6,2)],7) => 9
[[[[[.,.],.],[.,[.,.]]],.],.] => [1,2,5,4,3,6,7] => [1,2,4,5,3,6,7] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 8
[[[[[.,.],.],[[.,.],.]],.],.] => [1,2,4,5,3,6,7] => [1,2,5,3,4,6,7] => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => 8
[[[[[[.,.],.],.],[.,.]],.],.] => [1,2,3,5,4,6,7] => [1,2,3,5,4,6,7] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 7
[[[[[.,.],[.,[.,.]]],.],.],.] => [1,4,3,2,5,6,7] => [1,3,4,2,5,6,7] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 8
[[[[[.,.],[[.,.],.]],.],.],.] => [1,3,4,2,5,6,7] => [1,4,2,3,5,6,7] => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => 8
[[[[[[.,.],.],[.,.]],.],.],.] => [1,2,4,3,5,6,7] => [1,2,4,3,5,6,7] => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => 7
[[[[[[.,.],[.,.]],.],.],.],.] => [1,3,2,4,5,6,7] => [1,3,2,4,5,6,7] => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 7
[[[[[[[.,.],.],.],.],.],.],.] => [1,2,3,4,5,6,7] => [1,2,3,4,5,6,7] => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 6
search for individual values
searching the database for the individual values of this statistic
Description
The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice.
Map
to 312-avoiding permutation
Description
Return a 312-avoiding permutation corresponding to a binary tree.
The linear extensions of a binary tree form an interval of the weak order called the Sylvester class of the tree. This permutation is the minimal element of this Sylvester class.
The linear extensions of a binary tree form an interval of the weak order called the Sylvester class of the tree. This permutation is the minimal element of this Sylvester class.
Map
inverse first fundamental transformation
Description
Let $\sigma = (i_{11}\cdots i_{1k_1})\cdots(i_{\ell 1}\cdots i_{\ell k_\ell})$ be a permutation given by cycle notation such that every cycle starts with its maximal entry, and all cycles are ordered increasingly by these maximal entries.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
Maps $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
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) \}.$$
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!