Identifier
-
Mp00208:
Permutations
—lattice of intervals⟶
Lattices
St001625: Lattices ⟶ ℤ
Values
=>
Cc0029;cc-rep
[1]=>([(0,1)],2)=>-1
[1,2]=>([(0,1),(0,2),(1,3),(2,3)],4)=>1
[2,1]=>([(0,1),(0,2),(1,3),(2,3)],4)=>1
[1,2,3]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7)=>0
[1,3,2]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)=>1
[2,1,3]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)=>1
[2,3,1]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)=>1
[3,1,2]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)=>1
[3,2,1]=>([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7)=>0
[2,4,1,3]=>([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)=>3
[3,1,4,2]=>([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)=>3
[2,4,1,5,3]=>([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)=>4
[2,5,3,1,4]=>([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)=>4
[3,1,5,2,4]=>([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)=>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)=>4
[4,1,3,5,2]=>([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)=>4
[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)=>4
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 Möbius invariant of a lattice.
The Möbius invariant of a lattice $L$ is the value of the Möbius function applied to least and greatest element, that is $\mu(L)=\mu_L(\hat{0},\hat{1})$, where $\hat{0}$ is the least element of $L$ and $\hat{1}$ is the greatest element of $L$.
For the definition of the Möbius function, see St000914The sum of the values of the Möbius function of a poset..
The Möbius invariant of a lattice $L$ is the value of the Möbius function applied to least and greatest element, that is $\mu(L)=\mu_L(\hat{0},\hat{1})$, where $\hat{0}$ is the least element of $L$ and $\hat{1}$ is the greatest element of $L$.
For the definition of the Möbius function, see St000914The sum of the values of the Möbius function of a poset..
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.
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!