Identifier
Values
[[1,2]] => 0 => 0 => ([(0,1)],2) => 1
[[1],[2]] => 1 => 1 => ([(0,1)],2) => 1
[[1,2,3]] => 00 => 01 => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
[[1,3],[2]] => 10 => 11 => ([(0,2),(2,1)],3) => 1
[[1,2],[3]] => 01 => 00 => ([(0,2),(2,1)],3) => 1
[[1],[2],[3]] => 11 => 10 => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
[[1,2,4],[3]] => 010 => 000 => ([(0,3),(2,1),(3,2)],4) => 1
[[1,3],[2,4]] => 101 => 111 => ([(0,3),(2,1),(3,2)],4) => 1
[[1,2],[3,4]] => 010 => 000 => ([(0,3),(2,1),(3,2)],4) => 1
[[1,3],[2],[4]] => 101 => 111 => ([(0,3),(2,1),(3,2)],4) => 1
[[1,3,5],[2,4]] => 1010 => 1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[1,2,4],[3,5]] => 0101 => 0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[1,3,5],[2],[4]] => 1010 => 1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[1,2,4],[3],[5]] => 0101 => 0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[1,3],[2,5],[4]] => 1010 => 1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[1,2],[3,4],[5]] => 0101 => 0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => 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 connected components of the Hasse diagram for the poset.
Map
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.
Map
descent word
Description
The descent word of a standard Young tableau.
For a standard Young tableau of size $n$ we set $w_i=1$ if $i+1$ is in a lower row than $i$, and $0$ otherwise, for $1\leq i < n$.
Map
alternating inverse
Description
Sends a binary word $w_1\cdots w_m$ to the binary word $v_1 \cdots v_m$ with $v_i = w_i$ if $i$ is odd and $v_i = 1 - w_i$ if $i$ is even.
This map is used in [1], see Definitions 3.2 and 5.1.