- FindStat

Identifier

Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000349: Graphs ⟶ ℤ

Values

[1] => [[1]] => [1] => ([],1) => 1
[2] => [[1,2]] => [1,2] => ([],2) => 1
[1,1] => [[1],[2]] => [2,1] => ([(0,1)],2) => 1
[3] => [[1,2,3]] => [1,2,3] => ([],3) => 1
[2,1] => [[1,2],[3]] => [3,1,2] => ([(0,2),(1,2)],3) => 3
[1,1,1] => [[1],[2],[3]] => [3,2,1] => ([(0,1),(0,2),(1,2)],3) => 1
[4] => [[1,2,3,4]] => [1,2,3,4] => ([],4) => 1
[3,1] => [[1,2,3],[4]] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4) => 4
[2,2] => [[1,2],[3,4]] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4) => 3
[2,1,1] => [[1,2],[3],[4]] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
[1,1,1,1] => [[1],[2],[3],[4]] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[5] => [[1,2,3,4,5]] => [1,2,3,4,5] => ([],5) => 1
[4,1] => [[1,2,3,4],[5]] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5) => 5
[3,2] => [[1,2,3],[4,5]] => [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => 10
[3,1,1] => [[1,2,3],[4],[5]] => [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 10
[2,2,1] => [[1,2],[3,4],[5]] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 15
[2,1,1,1] => [[1,2],[3],[4],[5]] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 10
[1,1,1,1,1] => [[1],[2],[3],[4],[5]] => [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) => 1
[6] => [[1,2,3,4,5,6]] => [1,2,3,4,5,6] => ([],6) => 1
[5,1] => [[1,2,3,4,5],[6]] => [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 6
[4,2] => [[1,2,3,4],[5,6]] => [5,6,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 15
[4,1,1] => [[1,2,3,4],[5],[6]] => [6,5,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 15
[3,3] => [[1,2,3],[4,5,6]] => [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6) => 10
[3,2,1] => [[1,2,3],[4,5],[6]] => [6,4,5,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => 60
[3,1,1,1] => [[1,2,3],[4],[5],[6]] => [6,5,4,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 20
[2,2,2] => [[1,2],[3,4],[5,6]] => [5,6,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 15
[2,2,1,1] => [[1,2],[3,4],[5],[6]] => [6,5,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 45
[2,1,1,1,1] => [[1,2],[3],[4],[5],[6]] => [6,5,4,3,1,2] => ([(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) => 15
[1,1,1,1,1,1] => [[1],[2],[3],[4],[5],[6]] => [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) => 1
[7] => [[1,2,3,4,5,6,7]] => [1,2,3,4,5,6,7] => ([],7) => 1
[6,1] => [[1,2,3,4,5,6],[7]] => [7,1,2,3,4,5,6] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 7
[5,2] => [[1,2,3,4,5],[6,7]] => [6,7,1,2,3,4,5] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7) => 21
[5,1,1] => [[1,2,3,4,5],[6],[7]] => [7,6,1,2,3,4,5] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 21
[4,3] => [[1,2,3,4],[5,6,7]] => [5,6,7,1,2,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)],7) => 35
[4,2,1] => [[1,2,3,4],[5,6],[7]] => [7,5,6,1,2,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7) => 105
[4,1,1,1] => [[1,2,3,4],[5],[6],[7]] => [7,6,5,1,2,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 35
[3,3,1] => [[1,2,3],[4,5,6],[7]] => [7,4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,6),(4,6),(5,6)],7) => 70
[3,2,2] => [[1,2,3],[4,5],[6,7]] => [6,7,4,5,1,2,3] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7) => 105
[3,2,1,1] => [[1,2,3],[4,5],[6],[7]] => [7,6,4,5,1,2,3] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 210
[3,1,1,1,1] => [[1,2,3],[4],[5],[6],[7]] => [7,6,5,4,1,2,3] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 35
[2,2,2,1] => [[1,2],[3,4],[5,6],[7]] => [7,5,6,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7) => 105
[2,2,1,1,1] => [[1,2],[3,4],[5],[6],[7]] => [7,6,5,3,4,1,2] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 105
[2,1,1,1,1,1] => [[1,2],[3],[4],[5],[6],[7]] => [7,6,5,4,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 21
[1,1,1,1,1,1,1] => [[1],[2],[3],[4],[5],[6],[7]] => [7,6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(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

click to show known generating functions

$F_{1} = q$

$F_{2} = 2\ q$

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

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

$F_{5} = 2\ q + q^{5} + 3\ q^{10} + q^{15}$

$F_{6} = 2\ q + q^{6} + q^{10} + 4\ q^{15} + q^{20} + q^{45} + q^{60}$

$F_{7} = 2\ q + q^{7} + 3\ q^{21} + 3\ q^{35} + q^{70} + 4\ q^{105} + q^{210}$

Description

The number of different adjacency matrices of a graph.
This is the number of different labellings of the graph, or

$\frac{|G|!}{|\operatorname{Aut}(G)|}$ .

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.

Map

initial tableau

Description

Sends an integer partition to the standard tableau obtained by filling the numbers

$1$ through

$n$ row by row.

Map

reading word permutation

Description

Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.