Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00208: Permutations —lattice of intervals⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
St000068: Posets ⟶ ℤ
Values
{{1}} => [1] => ([(0,1)],2) => ([(0,1)],2) => 1
{{1,2}} => [2,1] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
{{1},{2}} => [1,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
{{1,2,3}} => [2,3,1] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 1
{{1,2},{3}} => [2,1,3] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 1
{{1,3},{2}} => [3,2,1] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => 1
{{1},{2,3}} => [1,3,2] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6) => 1
{{1},{2},{3}} => [1,2,3] => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => 1
{{1,2,3,4}} => [2,3,4,1] => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => 1
{{1,2,3},{4}} => [2,3,1,4] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => 1
{{1,2,4},{3}} => [2,4,3,1] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => 1
{{1,2},{3,4}} => [2,1,4,3] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,7),(6,7)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,7),(6,7)],8) => 1
{{1,3,4},{2}} => [3,2,4,1] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => 1
{{1,3},{2,4}} => [3,4,1,2] => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,7),(6,7)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,7),(6,7)],8) => 1
{{1,3},{2},{4}} => [3,2,1,4] => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => 1
{{1},{2,3,4}} => [1,3,4,2] => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,6),(4,7),(5,7),(7,6)],8) => 1
{{1},{2,4},{3}} => [1,4,3,2] => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => ([(0,1),(0,2),(0,3),(0,4),(1,7),(2,6),(3,5),(4,5),(4,6),(5,8),(6,8),(8,7)],9) => 1
{{1,2,4},{3,5}} => [2,4,5,1,3] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8) => 1
{{1,3},{2,4,5}} => [3,4,1,5,2] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8) => 1
{{1,3},{2,5},{4}} => [3,5,1,4,2] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
{{1,4},{2},{3,5}} => [4,2,5,1,3] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
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 number of minimal elements in a poset.
Map
to poset
Description
Return the poset corresponding to the lattice.
Map
lattice of intervals
Description
The lattice of intervals of a permutation.
An interval of a permutation $\pi$ is a possibly empty interval of values that appear in consecutive positions of $\pi$. The lattice of intervals of $\pi$ has as elements the intervals of $\pi$, ordered by set inclusion.
An interval of a permutation $\pi$ is a possibly empty interval of values that appear in consecutive positions of $\pi$. The lattice of intervals of $\pi$ has as elements the intervals of $\pi$, ordered by set inclusion.
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
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!