- FindStat

Identifier

Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
Mp00047: Ordered trees —to poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001720: Lattices ⟶ ℤ

Values

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

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} = q^{3}$

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

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

Description

The minimal length of a chain of small intervals in a lattice.
An interval

$[a, b]$ is small if

$b$ is a join of elements covering

$a$ .

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

to ordered tree

Description

Sends a Dyck path to the ordered tree encoding the heights of the path.
This map is recursively defined as follows: A Dyck path

$D$ of semilength

$n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths

$D_1,\dots,D_k$ of respective semilengths

$n_1,\dots,n_k$ (so one has

$n = n_1 + \dots n_k$ ) each of which has no returns.
Denote by

$\tilde D_i$ the path of semilength

$n_i-1$ obtained from

$D_i$ by removing the initial up- and the final down-step.
This map then sends

$D$ to the tree

$T$ having a root note with ordered children

$T_1,\dots,T_k$ which are again ordered trees computed from

$D_1,\dots,D_k$ respectively.
The unique path of semilength

$1$ is sent to the tree consisting of a single node.

Map

to poset

Description

Return the poset obtained by interpreting the tree as the Hasse diagram of a graph.