- FindStat

Identifier

Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
Mp00195: Posets —order ideals⟶ Lattices
St001616: Lattices ⟶ ℤ

Values

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

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^{2}$

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

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

$F_{4} = 2\ q^{5} + q^{6} + 2\ q^{7}$

Description

The number of neutral elements in a lattice.
An element

$e$ of the lattice

$L$ is neutral if the sublattice generated by

$e$ ,

$x$ and

$y$ is distributive for all

$x, y \in L$ .

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 skew partition

Description

The partition regarded as a skew partition.

Map

cell poset

Description

The Young diagram of a skew partition regarded as a poset.
This is the poset on the cells of the Young diagram, such that a cell

$d$ is greater than a cell

$c$ if the entry in

$d$ must be larger than the entry of

$c$ in any standard Young tableau on the skew partition.