Identifier
Values
[1,0,1,0] => [2,1] => ([(0,1)],2) => ([(0,1)],2) => 1
[1,1,0,0] => [1,2] => ([(0,1)],2) => ([(0,1)],2) => 1
[1,0,1,0,1,0] => [3,2,1] => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 1
[1,0,1,1,0,0] => [2,3,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 2
[1,1,0,0,1,0] => [3,1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 2
[1,1,0,1,0,0] => [2,1,3] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 2
[1,1,1,0,0,0] => [1,2,3] => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 1
[1,0,1,0,1,0,1,0] => [4,3,2,1] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 1
[1,0,1,0,1,1,0,0] => [3,4,2,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,0,1,1,1,0,0,0] => [2,3,4,1] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,1,0,0,1,0,1,0] => [4,3,1,2] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,1,0,0,1,1,0,0] => [3,4,1,2] => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => 4
[1,1,0,1,0,1,0,0] => [3,2,1,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,1,1,0,0,0,1,0] => [4,1,2,3] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,1,1,0,1,0,0,0] => [2,1,3,4] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 3
[1,1,1,1,0,0,0,0] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 1
[1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [6,5,4,3,2,1] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 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 supergreedy linear extensions of a poset.
A linear extension of a poset P with elements $\{x_1,\dots,x_n\}$ is supergreedy, if it can be obtained by the following algorithm:
  • Step 1. Choose a minimal element $x_1$.
  • Step 2. Suppose $X=\{x_1,\dots,x_i\}$ have been chosen, let $M$ be the set of minimal elements of $P\setminus X$. If there is an element of $M$ which covers an element $x_j$ in $X$, then let $x_{i+1}$ be one of these such that $j$ is maximal; otherwise, choose $x_{i+1}$ to be any element of $M$.
This statistic records the number of supergreedy linear extensions.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
Map
pattern poset
Description
The pattern poset of a permutation.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
Map
dual poset
Description
The dual of a poset.
The dual (or opposite) of a poset $(\mathcal P,\leq)$ is the poset $(\mathcal P^d,\leq_d)$ with $x \leq_d y$ if $y \leq x$.