Identifier
Values
[1] => [1] => [1] => ([],1) => 0
[1,2] => [1,2] => [1,2] => ([(0,1)],2) => 0
[2,1] => [2,1] => [1,2] => ([(0,1)],2) => 0
[1,2,3] => [1,2,3] => [1,2,3] => ([(0,2),(2,1)],3) => 0
[1,3,2] => [1,3,2] => [1,2,3] => ([(0,2),(2,1)],3) => 0
[2,1,3] => [2,1,3] => [1,2,3] => ([(0,2),(2,1)],3) => 0
[2,3,1] => [3,2,1] => [1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,1,2] => [3,1,2] => [1,3,2] => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[3,2,1] => [2,3,1] => [1,2,3] => ([(0,2),(2,1)],3) => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[1,2,4,3] => [1,2,4,3] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[1,3,2,4] => [1,3,2,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[1,4,3,2] => [1,3,4,2] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[2,1,3,4] => [2,1,3,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[2,1,4,3] => [2,1,4,3] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[3,2,1,4] => [2,3,1,4] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[4,3,2,1] => [2,3,4,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4) => 0
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,2,4,3,5] => [1,2,4,3,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,2,5,4,3] => [1,2,4,5,3] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,3,2,4,5] => [1,3,2,4,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,3,2,5,4] => [1,3,2,5,4] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,4,3,2,5] => [1,3,4,2,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,5,4,3,2] => [1,3,4,5,2] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,1,3,4,5] => [2,1,3,4,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,1,3,5,4] => [2,1,3,5,4] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,1,4,3,5] => [2,1,4,3,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,1,5,4,3] => [2,1,4,5,3] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[3,2,1,4,5] => [2,3,1,4,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[3,2,1,5,4] => [2,3,1,5,4] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[4,3,2,1,5] => [2,3,4,1,5] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[5,4,3,2,1] => [2,3,4,5,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,3,4,6,5] => [1,2,3,4,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,3,5,4,6] => [1,2,3,5,4,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,3,6,5,4] => [1,2,3,5,6,4] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,4,3,5,6] => [1,2,4,3,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,4,3,6,5] => [1,2,4,3,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,5,4,3,6] => [1,2,4,5,3,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,2,6,5,4,3] => [1,2,4,5,6,3] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,3,2,4,5,6] => [1,3,2,4,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,3,2,4,6,5] => [1,3,2,4,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,3,2,5,4,6] => [1,3,2,5,4,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,3,2,6,5,4] => [1,3,2,5,6,4] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,4,3,2,5,6] => [1,3,4,2,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,4,3,2,6,5] => [1,3,4,2,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,5,4,3,2,6] => [1,3,4,5,2,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[1,6,5,4,3,2] => [1,3,4,5,6,2] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,3,4,5,6] => [2,1,3,4,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,3,4,6,5] => [2,1,3,4,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,3,5,4,6] => [2,1,3,5,4,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,3,6,5,4] => [2,1,3,5,6,4] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,4,3,5,6] => [2,1,4,3,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,4,3,6,5] => [2,1,4,3,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,5,4,3,6] => [2,1,4,5,3,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[2,1,6,5,4,3] => [2,1,4,5,6,3] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,2,1,4,5,6] => [2,3,1,4,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,2,1,4,6,5] => [2,3,1,4,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,2,1,5,4,6] => [2,3,1,5,4,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,2,1,6,5,4] => [2,3,1,5,6,4] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,3,2,1,5,6] => [2,3,4,1,5,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,3,2,1,6,5] => [2,3,4,1,6,5] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,4,3,2,1,6] => [2,3,4,5,1,6] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[6,5,4,3,2,1] => [2,3,4,5,6,1] => [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
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 interval resolution global dimension of a poset.
This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
Map
pattern poset
Description
The pattern poset of a permutation.
This is the poset of all non-empty permutations that occur in the given permutation as a pattern, ordered by pattern containment.
Map
descent views to invisible inversion bottoms
Description
Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
  • the multiset of descent views in $\pi$ is the multiset of invisible inversion bottoms in $\chi(\pi)$,
  • the set of left-to-right maxima of $\pi$ is the set of maximal elements in the cycles of $\chi(\pi)$,
  • the set of global ascent of $\pi$ is the set of global ascent of $\chi(\pi)$,
  • the set of maximal elements in the decreasing runs of $\pi$ is the set of weak deficiency positions of $\chi(\pi)$, and
  • the set of minimal elements in the decreasing runs of $\pi$ is the set of weak deficiency values of $\chi(\pi)$.