Identifier
Values
0 => ([(0,1)],2) => ([(0,2),(2,1)],3) => 0
1 => ([(0,1)],2) => ([(0,2),(2,1)],3) => 0
00 => ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 0
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 1
11 => ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 0
000 => ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
010 => ([(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) => 2
101 => ([(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) => 2
111 => ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 0
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 0
000000 => ([(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) => 0
111111 => ([(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) => 0
0000000 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => ([(0,8),(2,3),(3,5),(4,2),(5,7),(6,4),(7,1),(8,6)],9) => 0
1111111 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => ([(0,8),(2,3),(3,5),(4,2),(5,7),(6,4),(7,1),(8,6)],9) => 0
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 2-regular simple modules in the incidence algebra of the lattice.
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.
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$.