- FindStat

Identifier

Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000310: Graphs ⟶ ℤ

Values

[1] => [1,0] => [1] => ([],1) => 0
[1,1] => [1,0,1,0] => [1,2] => ([],2) => 0
[2] => [1,1,0,0] => [2,1] => ([(0,1)],2) => 1
[1,1,1] => [1,0,1,0,1,0] => [1,2,3] => ([],3) => 0
[1,2] => [1,0,1,1,0,0] => [1,3,2] => ([(1,2)],3) => 0
[2,1] => [1,1,0,0,1,0] => [2,1,3] => ([(1,2)],3) => 0
[3] => [1,1,1,0,0,0] => [3,2,1] => ([(0,1),(0,2),(1,2)],3) => 2
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => ([],4) => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => ([(2,3)],4) => 0
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => ([(2,3)],4) => 0
[1,3] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4) => 0
[2,1,1] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => ([(2,3)],4) => 0
[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => ([(0,3),(1,2)],4) => 1
[3,1] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4) => 0
[4] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => ([],5) => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => ([(3,4)],5) => 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => ([(3,4)],5) => 0
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5) => 0
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => ([(3,4)],5) => 0
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => ([(1,4),(2,3)],5) => 0
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5) => 0
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => ([(3,4)],5) => 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => ([(1,4),(2,3)],5) => 0
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => ([(1,4),(2,3)],5) => 0
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5) => 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5) => 0
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5) => 1
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
[5] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 4
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => ([],6) => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => ([(4,5)],6) => 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => ([(4,5)],6) => 0
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => ([(3,4),(3,5),(4,5)],6) => 0
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => ([(4,5)],6) => 0
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => ([(2,5),(3,4)],6) => 0
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => ([(3,4),(3,5),(4,5)],6) => 0
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => ([(4,5)],6) => 0
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => ([(2,5),(3,4)],6) => 0
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => ([(2,5),(3,4)],6) => 0
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => ([(3,4),(3,5),(4,5)],6) => 0
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => ([(4,5)],6) => 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => ([(2,5),(3,4)],6) => 0
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => ([(2,5),(3,4)],6) => 0
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => ([(2,5),(3,4)],6) => 0
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => ([(0,5),(1,4),(2,3)],6) => 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6) => 0
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,2,1,4,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,2,1,5,4,6] => ([(1,2),(3,4),(3,5),(4,5)],6) => 0
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => 2
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 5

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} = 1$

$F_{2} = 1 + q$

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

$F_{4} = 6 + q + q^{3}$

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

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

Description

The minimal degree of a vertex of a graph.

Map

bounce path

Description

The bounce path determined by an integer composition.

Map

to non-crossing permutation

Description

Sends a Dyck path

$D$ with valley at positions

$\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation

$\pi$ having descents

$\{i_1,\ldots,i_k\}$ and whose inverse has descents

$\{j_1,\ldots,j_k\}$ .
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to

$n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..

Map

graph of inversions

Description

The graph of inversions of a permutation.
For a permutation of

$\{1,\dots,n\}$ , this is the graph with vertices

$\{1,\dots,n\}$ , where

$(i,j)$ is an edge if and only if it is an inversion of the permutation.