Identifier
-
Mp00193:
Lattices
—to poset⟶
Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000320: Integer partitions ⟶ ℤ (values match St000319The spin of an integer partition.)
Values
([],1) => ([],1) => [2] => 1
([(0,1)],2) => ([(0,1)],2) => [3] => 2
([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => [4] => 3
([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => [4,2] => 3
([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => [5] => 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => [4,2,2,2] => 3
([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => [8] => 7
([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => [5,2] => 4
([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => [6] => 5
([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => [5,2] => 4
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6) => [9] => 8
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => [6,2] => 5
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => ([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6) => [6,4] => 7
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => [6,2] => 5
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => [6,2] => 5
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => [5,5] => 7
([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => [7] => 6
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => ([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6) => [9] => 8
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7) => [7,2] => 6
([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7) => [6,2,2] => 5
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => [7,2] => 6
([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => ([(0,5),(1,6),(2,6),(4,2),(5,1),(5,4),(6,3)],7) => [10] => 9
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7) => [7,2] => 6
([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => ([(0,3),(0,5),(2,6),(3,6),(4,1),(5,2),(6,4)],7) => [10] => 9
([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => ([(0,4),(1,6),(2,6),(3,2),(4,5),(5,1),(5,3)],7) => [10] => 9
([(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) => [8] => 7
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => [7,2] => 6
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 dinv adjustment of an integer partition.
The Ferrers shape of an integer partition $\lambda = (\lambda_1,\ldots,\lambda_k)$ can be decomposed into border strips. For $0 \leq j < \lambda_1$ let $n_j$ be the length of the border strip starting at $(\lambda_1-j,0)$.
The dinv adjustment is then defined by
$$\sum_{j:n_j > 0}(\lambda_1-1-j).$$
The following example is taken from Appendix B in [2]: Let $\lambda=(5,5,4,4,2,1)$. Removing the border strips successively yields the sequence of partitions
$$(5,5,4,4,2,1),(4,3,3,1),(2,2),(1),(),$$
and we obtain $(n_0,\ldots,n_4) = (10,7,0,3,1)$.
The dinv adjustment is thus $4+3+1+0 = 8$.
The Ferrers shape of an integer partition $\lambda = (\lambda_1,\ldots,\lambda_k)$ can be decomposed into border strips. For $0 \leq j < \lambda_1$ let $n_j$ be the length of the border strip starting at $(\lambda_1-j,0)$.
The dinv adjustment is then defined by
$$\sum_{j:n_j > 0}(\lambda_1-1-j).$$
The following example is taken from Appendix B in [2]: Let $\lambda=(5,5,4,4,2,1)$. Removing the border strips successively yields the sequence of partitions
$$(5,5,4,4,2,1),(4,3,3,1),(2,2),(1),(),$$
and we obtain $(n_0,\ldots,n_4) = (10,7,0,3,1)$.
The dinv adjustment is thus $4+3+1+0 = 8$.
Map
rowmotion cycle type
Description
The cycle type of rowmotion on the order ideals of a poset.
Map
to poset
Description
Return the poset corresponding to the lattice.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!