- FindStat

Identifier

Mp00262: Binary words —poset of factors⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001617: Lattices ⟶ ℤ

Values

=> ([(0,1)],2) => ([(0,2),(2,1)],3) => 2
=> ([(0,1)],2) => ([(0,2),(2,1)],3) => 2
=> ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 3
=> ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 4
=> ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 4
=> ([(0,2),(2,1)],3) => ([(0,3),(2,1),(3,2)],4) => 3
=> ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
=> ([(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) => 6
=> ([(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) => 6
=> ([(0,3),(2,1),(3,2)],4) => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
=> ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 5
=> ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 5
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 6
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => 6
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) => 7
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) => 7

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

$F_{1} = 2\ q^{2}$

$F_{2} = 2\ q^{3} + 2\ q^{4}$

Description

The dimension of the space of valuations of a lattice.
A valuation, or modular function, on a lattice

$L$ is a function

$v:L\mapsto\mathbb R$ satisfying

$v(a\vee b) + v(a\wedge b) = v(a) + v(b).$
It was shown by Birkhoff [1, thm. X.2], that a lattice with a positive valuation must be modular. This was sharpened by Fleischer and Traynor [2, thm. 1], which states that the modular functions on an arbitrary lattice are in bijection with the modular functions on its modular quotient Mp00196The modular quotient of a lattice..
Moreover, Birkhoff [1, thm. X.2] showed that the dimension of the space of modular functions equals the number of subsets of projective prime intervals.

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$ .