searching the database
Your data matches 58 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000008
Mp00305: Permutations —parking function⟶ Parking functions
Mp00319: Parking functions —to composition⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
St000008: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00319: Parking functions —to composition⟶ Integer compositions
Mp00039: Integer compositions —complement⟶ Integer compositions
St000008: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => [2,1] => 2
[2,1] => [2,1] => [2,1] => [1,2] => 1
[1,2,3] => [1,2,3] => [1,2,3] => [2,2,1,1] => 11
[1,3,2] => [1,3,2] => [1,3,2] => [2,1,2,1] => 10
[2,1,3] => [2,1,3] => [2,1,3] => [1,3,1,1] => 10
[2,3,1] => [2,3,1] => [2,3,1] => [1,2,1,2] => 8
[3,1,2] => [3,1,2] => [3,1,2] => [1,1,3,1] => 8
[3,2,1] => [3,2,1] => [3,2,1] => [1,1,2,2] => 7
Description
The major index of the composition.
The descents of a composition $[c_1,c_2,\dots,c_k]$ are the partial sums $c_1, c_1+c_2,\dots, c_1+\dots+c_{k-1}$, excluding the sum of all parts. The major index of a composition is the sum of its descents.
For details about the major index see [[Permutations/Descents-Major]].
Matching statistic: St000304
Mp00063: Permutations —to alternating sign matrix⟶ Alternating sign matrices
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
St000304: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
St000304: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [[1]]
=> [[1]]
=> [1] => 0
[1,2] => [[1,0],[0,1]]
=> [[1,1],[2]]
=> [3,1,2] => 2
[2,1] => [[0,1],[1,0]]
=> [[1,2],[2]]
=> [2,1,3] => 1
[1,2,3] => [[1,0,0],[0,1,0],[0,0,1]]
=> [[1,1,1],[2,2],[3]]
=> [6,4,5,1,2,3] => 11
[1,3,2] => [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,1,1],[2,3],[3]]
=> [5,4,6,1,2,3] => 10
[2,1,3] => [[0,1,0],[1,0,0],[0,0,1]]
=> [[1,1,2],[2,2],[3]]
=> [6,3,4,1,2,5] => 10
[2,3,1] => [[0,0,1],[1,0,0],[0,1,0]]
=> [[1,1,3],[2,3],[3]]
=> [4,3,5,1,2,6] => 8
[3,1,2] => [[0,1,0],[0,0,1],[1,0,0]]
=> [[1,2,2],[2,3],[3]]
=> [5,2,6,1,3,4] => 8
[3,2,1] => [[0,0,1],[0,1,0],[1,0,0]]
=> [[1,2,3],[2,3],[3]]
=> [4,2,5,1,3,6] => 7
Description
The load of a permutation.
The definition of the load of a finite word in a totally ordered alphabet can be found in [1], for permutations, it is given by the major index [[St000004]] of the reverse [[Mp00064]] of the inverse [[Mp00066]] permutation.
Matching statistic: St001168
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
St001168: Permutations ⟶ ℤResult quality: 86% ●values known / values provided: 89%●distinct values known / distinct values provided: 86%
Values
[1] => ? = 0 + 3
[1,2] => 5 = 2 + 3
[2,1] => 4 = 1 + 3
[1,2,3] => 14 = 11 + 3
[1,3,2] => 13 = 10 + 3
[2,1,3] => 13 = 10 + 3
[2,3,1] => 11 = 8 + 3
[3,1,2] => 11 = 8 + 3
[3,2,1] => 10 = 7 + 3
Description
The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
Matching statistic: St000467
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000467: Graphs ⟶ ℤResult quality: 43% ●values known / values provided: 44%●distinct values known / distinct values provided: 43%
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000467: Graphs ⟶ ℤResult quality: 43% ●values known / values provided: 44%●distinct values known / distinct values provided: 43%
Values
[1] => [1,0]
=> [1] => ([],1)
=> 0
[1,2] => [1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 2
[2,1] => [1,1,0,0]
=> [1,2] => ([],2)
=> ? = 1
[1,2,3] => [1,0,1,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> ? = 11
[1,3,2] => [1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 10
[2,1,3] => [1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 10
[2,3,1] => [1,1,0,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> ? = 8
[3,1,2] => [1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ? = 8
[3,2,1] => [1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ? = 7
Description
The hyper-Wiener index of a connected graph.
This is
$$
\sum_{\{u,v\}\subseteq V} d(u,v)+d(u,v)^2.
$$
Matching statistic: St000706
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000706: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000706: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 6
[1,2] => ([],2)
=> []
=> ? = 2 - 6
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 6
[1,2,3] => ([],3)
=> []
=> ? = 11 - 6
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,3,1] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,1,2] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 7 - 6
Description
The product of the factorials of the multiplicities of an integer partition.
Matching statistic: St000993
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000993: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000993: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 6
[1,2] => ([],2)
=> []
=> ? = 2 - 6
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 6
[1,2,3] => ([],3)
=> []
=> ? = 11 - 6
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,3,1] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,1,2] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 7 - 6
Description
The multiplicity of the largest part of an integer partition.
Matching statistic: St001568
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St001568: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St001568: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 6
[1,2] => ([],2)
=> []
=> ? = 2 - 6
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 6
[1,2,3] => ([],3)
=> []
=> ? = 11 - 6
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 6
[2,3,1] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,1,2] => ([(0,2),(1,2)],3)
=> [1,1]
=> 2 = 8 - 6
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 7 - 6
Description
The smallest positive integer that does not appear twice in the partition.
Matching statistic: St000567
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000567: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000567: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 7
[1,2] => ([],2)
=> []
=> ? = 2 - 7
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 7
[1,2,3] => ([],3)
=> []
=> ? = 11 - 7
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,3,1] => ([(0,2),(1,2)],3)
=> [1,1]
=> 1 = 8 - 7
[3,1,2] => ([(0,2),(1,2)],3)
=> [1,1]
=> 1 = 8 - 7
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0 = 7 - 7
Description
The sum of the products of all pairs of parts.
This is the evaluation of the second elementary symmetric polynomial which is equal to
$$e_2(\lambda) = \binom{n+1}{2} - \sum_{i=1}^\ell\binom{\lambda_i+1}{2}$$
for a partition $\lambda = (\lambda_1,\dots,\lambda_\ell) \vdash n$, see [1].
This is the maximal number of inversions a permutation with the given shape can have, see [2, cor.2.4].
Matching statistic: St000621
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
St000621: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
St000621: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 7
[1,2] => ([],2)
=> []
=> ? = 2 - 7
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 7
[1,2,3] => ([],3)
=> []
=> ? = 11 - 7
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,3,1] => ([(0,2),(1,2)],3)
=> [2]
=> 1 = 8 - 7
[3,1,2] => ([(0,2),(1,2)],3)
=> [2]
=> 1 = 8 - 7
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0 = 7 - 7
Description
The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even.
To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is even.
This notion was used in [1, Proposition 2.3], see also [2, Theorem 1.1].
The case of an odd minimum is [[St000620]].
Matching statistic: St000929
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000929: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000929: Integer partitions ⟶ ℤResult quality: 29% ●values known / values provided: 33%●distinct values known / distinct values provided: 29%
Values
[1] => ([],1)
=> []
=> ? = 0 - 7
[1,2] => ([],2)
=> []
=> ? = 2 - 7
[2,1] => ([(0,1)],2)
=> [1]
=> ? = 1 - 7
[1,2,3] => ([],3)
=> []
=> ? = 11 - 7
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? = 10 - 7
[2,3,1] => ([(0,2),(1,2)],3)
=> [1,1]
=> 1 = 8 - 7
[3,1,2] => ([(0,2),(1,2)],3)
=> [1,1]
=> 1 = 8 - 7
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0 = 7 - 7
Description
The constant term of the character polynomial of an integer partition.
The definition of the character polynomial can be found in [1]. Indeed, this constant term is $0$ for partitions $\lambda \neq 1^n$ and $1$ for $\lambda = 1^n$.
The following 48 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St001060The distinguishing index of a graph. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000464The Schultz index of a connected graph. St001684The reduced word complexity of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000077The number of boxed and circled entries. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000284The Plancherel distribution on integer partitions. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000934The 2-degree of an integer partition. St001875The number of simple modules with projective dimension at most 1. St000937The number of positive values of the symmetric group character corresponding to the partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St000939The number of characters of the symmetric group whose value on the partition is positive. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000379The number of Hamiltonian cycles in a graph. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000928The sum of the coefficients of the character polynomial of an integer partition. St000997The even-odd crank of an integer partition. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras.
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!