Identifier
Values
0 => ([(0,1)],2) => ([(0,1)],2) => 1
1 => ([(0,1)],2) => ([(0,1)],2) => 1
00 => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 1
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(2,1)],3) => 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(2,1)],3) => 1
11 => ([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => 1
000 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 1
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,3),(2,1),(3,2)],4) => 1
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,3),(2,1),(3,2)],4) => 1
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
111 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => 1
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
0101 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
1010 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
01010 => ([(0,1),(0,2),(1,8),(1,9),(2,8),(2,9),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5),(8,6),(8,7),(9,6),(9,7)],10) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
10101 => ([(0,1),(0,2),(1,8),(1,9),(2,8),(2,9),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5),(8,6),(8,7),(9,6),(9,7)],10) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 1
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 1
010101 => ([(0,1),(0,2),(1,10),(1,11),(2,10),(2,11),(4,3),(5,3),(6,8),(6,9),(7,8),(7,9),(8,4),(8,5),(9,4),(9,5),(10,6),(10,7),(11,6),(11,7)],12) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 1
101010 => ([(0,1),(0,2),(1,10),(1,11),(2,10),(2,11),(4,3),(5,3),(6,8),(6,9),(7,8),(7,9),(8,4),(8,5),(9,4),(9,5),(10,6),(10,7),(11,6),(11,7)],12) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 1
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 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 breadth of a lattice.
The breadth of a lattice is the least integer $b$ such that any join $x_1\vee x_2\vee\cdots\vee x_n$, with $n > b$, can be expressed as a join over a proper subset of $\{x_1,x_2,\ldots,x_n\}$.
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
maximal antichains
Description
The lattice of maximal antichains in a poset.
An antichain $A$ in a poset is maximal if there is no antichain of larger cardinality which contains all elements of $A$.
The set of maximal antichains can be ordered by setting $A \leq B \Leftrightarrow \mathop{\downarrow} A \subseteq \mathop{\downarrow}B$, where $\mathop{\downarrow}A$ is the order ideal generated by $A$.