Identifier
Values
0 => 1 => ([(0,1)],2) => 0
1 => 0 => ([(0,1)],2) => 0
00 => 01 => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
01 => 10 => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
10 => 11 => ([(0,2),(2,1)],3) => 0
11 => 00 => ([(0,2),(2,1)],3) => 0
000 => 001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 2
001 => 010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => 2
010 => 101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => 2
011 => 100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 2
100 => 011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 2
101 => 110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 2
110 => 111 => ([(0,3),(2,1),(3,2)],4) => 0
111 => 000 => ([(0,3),(2,1),(3,2)],4) => 0
1110 => 1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
1111 => 0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
11110 => 11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
11111 => 00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 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
click to show known generating functions       
Description
The balance constant multiplied with the number of linear extensions of a poset.
A pair of elements $x,y$ of a poset is $\alpha$-balanced if the proportion $P(x,y)$ of linear extensions where $x$ comes before $y$ is between $\alpha$ and $1-\alpha$. The balance constant of a poset is $\max\min(P(x,y), P(y,x)).$
Kislitsyn [1] conjectured that every poset which is not a chain is $1/3$-balanced. Brightwell, Felsner and Trotter [2] show that it is at least $(1-\sqrt 5)/10$-balanced.
Olson and Sagan [3] exhibit various posets that are $1/2$-balanced.
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
path rowmotion
Description
Return the rowmotion of the binary word, regarded as a lattice path.
Consider the binary word of length $n$ as a lattice path with $n$ steps, where a 1 corresponds to an up step and a 0 corresponds to a down step.
This map returns the path whose peaks are the valleys of the original path with an up step appended.