Processing math: 100%

Your data matches 16 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000241: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 0
[2,1] => 2
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 3
[3,1,2] => 0
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 2
[1,4,2,3] => 0
[1,4,3,2] => 0
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 2
[2,3,4,1] => 4
[2,4,1,3] => 1
[2,4,3,1] => 2
[3,1,2,4] => 0
[3,1,4,2] => 1
[3,2,1,4] => 0
[3,2,4,1] => 2
[3,4,1,2] => 0
[3,4,2,1] => 1
[4,1,2,3] => 0
[4,1,3,2] => 0
[4,2,1,3] => 0
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 2
Description
The number of cyclical small excedances. A cyclical small excedance is an index i such that πi=i+1 considered cyclically.
Mp00089: Permutations Inverse Kreweras complementPermutations
St000022: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,2] => [2,1] => 0
[2,1] => [1,2] => 2
[1,2,3] => [2,3,1] => 0
[1,3,2] => [3,2,1] => 1
[2,1,3] => [1,3,2] => 1
[2,3,1] => [1,2,3] => 3
[3,1,2] => [3,1,2] => 0
[3,2,1] => [2,1,3] => 1
[1,2,3,4] => [2,3,4,1] => 0
[1,2,4,3] => [2,4,3,1] => 1
[1,3,2,4] => [3,2,4,1] => 1
[1,3,4,2] => [4,2,3,1] => 2
[1,4,2,3] => [3,4,2,1] => 0
[1,4,3,2] => [4,3,2,1] => 0
[2,1,3,4] => [1,3,4,2] => 1
[2,1,4,3] => [1,4,3,2] => 2
[2,3,1,4] => [1,2,4,3] => 2
[2,3,4,1] => [1,2,3,4] => 4
[2,4,1,3] => [1,4,2,3] => 1
[2,4,3,1] => [1,3,2,4] => 2
[3,1,2,4] => [3,1,4,2] => 0
[3,1,4,2] => [4,1,3,2] => 1
[3,2,1,4] => [2,1,4,3] => 0
[3,2,4,1] => [2,1,3,4] => 2
[3,4,1,2] => [4,1,2,3] => 0
[3,4,2,1] => [3,1,2,4] => 1
[4,1,2,3] => [3,4,1,2] => 0
[4,1,3,2] => [4,3,1,2] => 0
[4,2,1,3] => [2,4,1,3] => 0
[4,2,3,1] => [2,3,1,4] => 1
[4,3,1,2] => [4,2,1,3] => 1
[4,3,2,1] => [3,2,1,4] => 2
Description
The number of fixed points of a permutation.
Mp00066: Permutations inversePermutations
Mp00087: Permutations inverse first fundamental transformationPermutations
St000215: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => 1
[1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => 2
[1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => [2,1,3] => 1
[2,3,1] => [3,1,2] => [3,2,1] => 3
[3,1,2] => [2,3,1] => [3,1,2] => 0
[3,2,1] => [3,2,1] => [2,3,1] => 1
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,4,2,3] => [1,4,3,2] => 2
[1,4,2,3] => [1,3,4,2] => [1,4,2,3] => 0
[1,4,3,2] => [1,4,3,2] => [1,3,4,2] => 0
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[2,3,1,4] => [3,1,2,4] => [3,2,1,4] => 2
[2,3,4,1] => [4,1,2,3] => [4,3,2,1] => 4
[2,4,1,3] => [3,1,4,2] => [4,2,1,3] => 1
[2,4,3,1] => [4,1,3,2] => [3,4,2,1] => 2
[3,1,2,4] => [2,3,1,4] => [3,1,2,4] => 0
[3,1,4,2] => [2,4,1,3] => [4,3,1,2] => 1
[3,2,1,4] => [3,2,1,4] => [2,3,1,4] => 0
[3,2,4,1] => [4,2,1,3] => [2,4,3,1] => 2
[3,4,1,2] => [3,4,1,2] => [3,1,4,2] => 0
[3,4,2,1] => [4,3,1,2] => [4,2,3,1] => 1
[4,1,2,3] => [2,3,4,1] => [4,1,2,3] => 0
[4,1,3,2] => [2,4,3,1] => [3,4,1,2] => 0
[4,2,1,3] => [3,2,4,1] => [2,4,1,3] => 0
[4,2,3,1] => [4,2,3,1] => [2,3,4,1] => 1
[4,3,1,2] => [3,4,2,1] => [4,1,3,2] => 1
[4,3,2,1] => [4,3,2,1] => [3,2,4,1] => 2
Description
The number of adjacencies of a permutation, zero appended. An adjacency is a descent of the form (e+1,e) in the word corresponding to the permutation in one-line notation. This statistic, adj0, counts adjacencies in the word with a zero appended. (adj0,des) and (fix,exc) are equidistributed, see [1].
Matching statistic: St000475
Mp00088: Permutations Kreweras complementPermutations
Mp00108: Permutations cycle typeInteger partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1]
=> 1
[1,2] => [2,1] => [2]
=> 0
[2,1] => [1,2] => [1,1]
=> 2
[1,2,3] => [2,3,1] => [3]
=> 0
[1,3,2] => [2,1,3] => [2,1]
=> 1
[2,1,3] => [3,2,1] => [2,1]
=> 1
[2,3,1] => [1,2,3] => [1,1,1]
=> 3
[3,1,2] => [3,1,2] => [3]
=> 0
[3,2,1] => [1,3,2] => [2,1]
=> 1
[1,2,3,4] => [2,3,4,1] => [4]
=> 0
[1,2,4,3] => [2,3,1,4] => [3,1]
=> 1
[1,3,2,4] => [2,4,3,1] => [3,1]
=> 1
[1,3,4,2] => [2,1,3,4] => [2,1,1]
=> 2
[1,4,2,3] => [2,4,1,3] => [4]
=> 0
[1,4,3,2] => [2,1,4,3] => [2,2]
=> 0
[2,1,3,4] => [3,2,4,1] => [3,1]
=> 1
[2,1,4,3] => [3,2,1,4] => [2,1,1]
=> 2
[2,3,1,4] => [4,2,3,1] => [2,1,1]
=> 2
[2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 4
[2,4,1,3] => [4,2,1,3] => [3,1]
=> 1
[2,4,3,1] => [1,2,4,3] => [2,1,1]
=> 2
[3,1,2,4] => [3,4,2,1] => [4]
=> 0
[3,1,4,2] => [3,1,2,4] => [3,1]
=> 1
[3,2,1,4] => [4,3,2,1] => [2,2]
=> 0
[3,2,4,1] => [1,3,2,4] => [2,1,1]
=> 2
[3,4,1,2] => [4,1,2,3] => [4]
=> 0
[3,4,2,1] => [1,4,2,3] => [3,1]
=> 1
[4,1,2,3] => [3,4,1,2] => [2,2]
=> 0
[4,1,3,2] => [3,1,4,2] => [4]
=> 0
[4,2,1,3] => [4,3,1,2] => [4]
=> 0
[4,2,3,1] => [1,3,4,2] => [3,1]
=> 1
[4,3,1,2] => [4,1,3,2] => [3,1]
=> 1
[4,3,2,1] => [1,4,3,2] => [2,1,1]
=> 2
Description
The number of parts equal to 1 in a partition.
Mp00088: Permutations Kreweras complementPermutations
Mp00063: Permutations to alternating sign matrixAlternating sign matrices
St000895: Alternating sign matrices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [[1]]
=> 1
[1,2] => [2,1] => [[0,1],[1,0]]
=> 0
[2,1] => [1,2] => [[1,0],[0,1]]
=> 2
[1,2,3] => [2,3,1] => [[0,0,1],[1,0,0],[0,1,0]]
=> 0
[1,3,2] => [2,1,3] => [[0,1,0],[1,0,0],[0,0,1]]
=> 1
[2,1,3] => [3,2,1] => [[0,0,1],[0,1,0],[1,0,0]]
=> 1
[2,3,1] => [1,2,3] => [[1,0,0],[0,1,0],[0,0,1]]
=> 3
[3,1,2] => [3,1,2] => [[0,1,0],[0,0,1],[1,0,0]]
=> 0
[3,2,1] => [1,3,2] => [[1,0,0],[0,0,1],[0,1,0]]
=> 1
[1,2,3,4] => [2,3,4,1] => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 0
[1,2,4,3] => [2,3,1,4] => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> 1
[1,3,2,4] => [2,4,3,1] => [[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]]
=> 1
[1,3,4,2] => [2,1,3,4] => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 2
[1,4,2,3] => [2,4,1,3] => [[0,0,1,0],[1,0,0,0],[0,0,0,1],[0,1,0,0]]
=> 0
[1,4,3,2] => [2,1,4,3] => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 0
[2,1,3,4] => [3,2,4,1] => [[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]]
=> 1
[2,1,4,3] => [3,2,1,4] => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 2
[2,3,1,4] => [4,2,3,1] => [[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]]
=> 2
[2,3,4,1] => [1,2,3,4] => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> 4
[2,4,1,3] => [4,2,1,3] => [[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]]
=> 1
[2,4,3,1] => [1,2,4,3] => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> 2
[3,1,2,4] => [3,4,2,1] => [[0,0,0,1],[0,0,1,0],[1,0,0,0],[0,1,0,0]]
=> 0
[3,1,4,2] => [3,1,2,4] => [[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]]
=> 1
[3,2,1,4] => [4,3,2,1] => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> 0
[3,2,4,1] => [1,3,2,4] => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 2
[3,4,1,2] => [4,1,2,3] => [[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> 0
[3,4,2,1] => [1,4,2,3] => [[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]]
=> 1
[4,1,2,3] => [3,4,1,2] => [[0,0,1,0],[0,0,0,1],[1,0,0,0],[0,1,0,0]]
=> 0
[4,1,3,2] => [3,1,4,2] => [[0,1,0,0],[0,0,0,1],[1,0,0,0],[0,0,1,0]]
=> 0
[4,2,1,3] => [4,3,1,2] => [[0,0,1,0],[0,0,0,1],[0,1,0,0],[1,0,0,0]]
=> 0
[4,2,3,1] => [1,3,4,2] => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 1
[4,3,1,2] => [4,1,3,2] => [[0,1,0,0],[0,0,0,1],[0,0,1,0],[1,0,0,0]]
=> 1
[4,3,2,1] => [1,4,3,2] => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> 2
Description
The number of ones on the main diagonal of an alternating sign matrix.
Mp00089: Permutations Inverse Kreweras complementPermutations
Mp00305: Permutations parking functionParking functions
St001903: Parking functions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => 1
[1,2] => [2,1] => [2,1] => 0
[2,1] => [1,2] => [1,2] => 2
[1,2,3] => [2,3,1] => [2,3,1] => 0
[1,3,2] => [3,2,1] => [3,2,1] => 1
[2,1,3] => [1,3,2] => [1,3,2] => 1
[2,3,1] => [1,2,3] => [1,2,3] => 3
[3,1,2] => [3,1,2] => [3,1,2] => 0
[3,2,1] => [2,1,3] => [2,1,3] => 1
[1,2,3,4] => [2,3,4,1] => [2,3,4,1] => 0
[1,2,4,3] => [2,4,3,1] => [2,4,3,1] => 1
[1,3,2,4] => [3,2,4,1] => [3,2,4,1] => 1
[1,3,4,2] => [4,2,3,1] => [4,2,3,1] => 2
[1,4,2,3] => [3,4,2,1] => [3,4,2,1] => 0
[1,4,3,2] => [4,3,2,1] => [4,3,2,1] => 0
[2,1,3,4] => [1,3,4,2] => [1,3,4,2] => 1
[2,1,4,3] => [1,4,3,2] => [1,4,3,2] => 2
[2,3,1,4] => [1,2,4,3] => [1,2,4,3] => 2
[2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 4
[2,4,1,3] => [1,4,2,3] => [1,4,2,3] => 1
[2,4,3,1] => [1,3,2,4] => [1,3,2,4] => 2
[3,1,2,4] => [3,1,4,2] => [3,1,4,2] => 0
[3,1,4,2] => [4,1,3,2] => [4,1,3,2] => 1
[3,2,1,4] => [2,1,4,3] => [2,1,4,3] => 0
[3,2,4,1] => [2,1,3,4] => [2,1,3,4] => 2
[3,4,1,2] => [4,1,2,3] => [4,1,2,3] => 0
[3,4,2,1] => [3,1,2,4] => [3,1,2,4] => 1
[4,1,2,3] => [3,4,1,2] => [3,4,1,2] => 0
[4,1,3,2] => [4,3,1,2] => [4,3,1,2] => 0
[4,2,1,3] => [2,4,1,3] => [2,4,1,3] => 0
[4,2,3,1] => [2,3,1,4] => [2,3,1,4] => 1
[4,3,1,2] => [4,2,1,3] => [4,2,1,3] => 1
[4,3,2,1] => [3,2,1,4] => [3,2,1,4] => 2
Description
The number of fixed points of a parking function. If (a1,,an) is a parking function, a fixed point is an index i such that ai=i. It can be shown [1] that the generating function for parking functions with respect to this statistic is 1(n+1)2((q+n)n+1(q1)n+1).
Mp00088: Permutations Kreweras complementPermutations
Mp00151: Permutations to cycle typeSet partitions
St000247: Set partitions ⟶ ℤResult quality: 97% values known / values provided: 97%distinct values known / distinct values provided: 100%
Values
[1] => [1] => {{1}}
=> ? = 1
[1,2] => [2,1] => {{1,2}}
=> 0
[2,1] => [1,2] => {{1},{2}}
=> 2
[1,2,3] => [2,3,1] => {{1,2,3}}
=> 0
[1,3,2] => [2,1,3] => {{1,2},{3}}
=> 1
[2,1,3] => [3,2,1] => {{1,3},{2}}
=> 1
[2,3,1] => [1,2,3] => {{1},{2},{3}}
=> 3
[3,1,2] => [3,1,2] => {{1,2,3}}
=> 0
[3,2,1] => [1,3,2] => {{1},{2,3}}
=> 1
[1,2,3,4] => [2,3,4,1] => {{1,2,3,4}}
=> 0
[1,2,4,3] => [2,3,1,4] => {{1,2,3},{4}}
=> 1
[1,3,2,4] => [2,4,3,1] => {{1,2,4},{3}}
=> 1
[1,3,4,2] => [2,1,3,4] => {{1,2},{3},{4}}
=> 2
[1,4,2,3] => [2,4,1,3] => {{1,2,3,4}}
=> 0
[1,4,3,2] => [2,1,4,3] => {{1,2},{3,4}}
=> 0
[2,1,3,4] => [3,2,4,1] => {{1,3,4},{2}}
=> 1
[2,1,4,3] => [3,2,1,4] => {{1,3},{2},{4}}
=> 2
[2,3,1,4] => [4,2,3,1] => {{1,4},{2},{3}}
=> 2
[2,3,4,1] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 4
[2,4,1,3] => [4,2,1,3] => {{1,3,4},{2}}
=> 1
[2,4,3,1] => [1,2,4,3] => {{1},{2},{3,4}}
=> 2
[3,1,2,4] => [3,4,2,1] => {{1,2,3,4}}
=> 0
[3,1,4,2] => [3,1,2,4] => {{1,2,3},{4}}
=> 1
[3,2,1,4] => [4,3,2,1] => {{1,4},{2,3}}
=> 0
[3,2,4,1] => [1,3,2,4] => {{1},{2,3},{4}}
=> 2
[3,4,1,2] => [4,1,2,3] => {{1,2,3,4}}
=> 0
[3,4,2,1] => [1,4,2,3] => {{1},{2,3,4}}
=> 1
[4,1,2,3] => [3,4,1,2] => {{1,3},{2,4}}
=> 0
[4,1,3,2] => [3,1,4,2] => {{1,2,3,4}}
=> 0
[4,2,1,3] => [4,3,1,2] => {{1,2,3,4}}
=> 0
[4,2,3,1] => [1,3,4,2] => {{1},{2,3,4}}
=> 1
[4,3,1,2] => [4,1,3,2] => {{1,2,4},{3}}
=> 1
[4,3,2,1] => [1,4,3,2] => {{1},{2,4},{3}}
=> 2
Description
The number of singleton blocks of a set partition.
Mp00088: Permutations Kreweras complementPermutations
Mp00063: Permutations to alternating sign matrixAlternating sign matrices
St000894: Alternating sign matrices ⟶ ℤResult quality: 97% values known / values provided: 97%distinct values known / distinct values provided: 100%
Values
[1] => [1] => [[1]]
=> ? = 1
[1,2] => [2,1] => [[0,1],[1,0]]
=> 0
[2,1] => [1,2] => [[1,0],[0,1]]
=> 2
[1,2,3] => [2,3,1] => [[0,0,1],[1,0,0],[0,1,0]]
=> 0
[1,3,2] => [2,1,3] => [[0,1,0],[1,0,0],[0,0,1]]
=> 1
[2,1,3] => [3,2,1] => [[0,0,1],[0,1,0],[1,0,0]]
=> 1
[2,3,1] => [1,2,3] => [[1,0,0],[0,1,0],[0,0,1]]
=> 3
[3,1,2] => [3,1,2] => [[0,1,0],[0,0,1],[1,0,0]]
=> 0
[3,2,1] => [1,3,2] => [[1,0,0],[0,0,1],[0,1,0]]
=> 1
[1,2,3,4] => [2,3,4,1] => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 0
[1,2,4,3] => [2,3,1,4] => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> 1
[1,3,2,4] => [2,4,3,1] => [[0,0,0,1],[1,0,0,0],[0,0,1,0],[0,1,0,0]]
=> 1
[1,3,4,2] => [2,1,3,4] => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 2
[1,4,2,3] => [2,4,1,3] => [[0,0,1,0],[1,0,0,0],[0,0,0,1],[0,1,0,0]]
=> 0
[1,4,3,2] => [2,1,4,3] => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 0
[2,1,3,4] => [3,2,4,1] => [[0,0,0,1],[0,1,0,0],[1,0,0,0],[0,0,1,0]]
=> 1
[2,1,4,3] => [3,2,1,4] => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 2
[2,3,1,4] => [4,2,3,1] => [[0,0,0,1],[0,1,0,0],[0,0,1,0],[1,0,0,0]]
=> 2
[2,3,4,1] => [1,2,3,4] => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> 4
[2,4,1,3] => [4,2,1,3] => [[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]]
=> 1
[2,4,3,1] => [1,2,4,3] => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> 2
[3,1,2,4] => [3,4,2,1] => [[0,0,0,1],[0,0,1,0],[1,0,0,0],[0,1,0,0]]
=> 0
[3,1,4,2] => [3,1,2,4] => [[0,1,0,0],[0,0,1,0],[1,0,0,0],[0,0,0,1]]
=> 1
[3,2,1,4] => [4,3,2,1] => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> 0
[3,2,4,1] => [1,3,2,4] => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 2
[3,4,1,2] => [4,1,2,3] => [[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> 0
[3,4,2,1] => [1,4,2,3] => [[1,0,0,0],[0,0,1,0],[0,0,0,1],[0,1,0,0]]
=> 1
[4,1,2,3] => [3,4,1,2] => [[0,0,1,0],[0,0,0,1],[1,0,0,0],[0,1,0,0]]
=> 0
[4,1,3,2] => [3,1,4,2] => [[0,1,0,0],[0,0,0,1],[1,0,0,0],[0,0,1,0]]
=> 0
[4,2,1,3] => [4,3,1,2] => [[0,0,1,0],[0,0,0,1],[0,1,0,0],[1,0,0,0]]
=> 0
[4,2,3,1] => [1,3,4,2] => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 1
[4,3,1,2] => [4,1,3,2] => [[0,1,0,0],[0,0,0,1],[0,0,1,0],[1,0,0,0]]
=> 1
[4,3,2,1] => [1,4,3,2] => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> 2
Description
The trace of an alternating sign matrix.
Mp00088: Permutations Kreweras complementPermutations
Mp00151: Permutations to cycle typeSet partitions
Mp00221: Set partitions conjugateSet partitions
St000248: Set partitions ⟶ ℤResult quality: 97% values known / values provided: 97%distinct values known / distinct values provided: 100%
Values
[1] => [1] => {{1}}
=> {{1}}
=> ? = 1
[1,2] => [2,1] => {{1,2}}
=> {{1},{2}}
=> 0
[2,1] => [1,2] => {{1},{2}}
=> {{1,2}}
=> 2
[1,2,3] => [2,3,1] => {{1,2,3}}
=> {{1},{2},{3}}
=> 0
[1,3,2] => [2,1,3] => {{1,2},{3}}
=> {{1,2},{3}}
=> 1
[2,1,3] => [3,2,1] => {{1,3},{2}}
=> {{1},{2,3}}
=> 1
[2,3,1] => [1,2,3] => {{1},{2},{3}}
=> {{1,2,3}}
=> 3
[3,1,2] => [3,1,2] => {{1,2,3}}
=> {{1},{2},{3}}
=> 0
[3,2,1] => [1,3,2] => {{1},{2,3}}
=> {{1,3},{2}}
=> 1
[1,2,3,4] => [2,3,4,1] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[1,2,4,3] => [2,3,1,4] => {{1,2,3},{4}}
=> {{1,2},{3},{4}}
=> 1
[1,3,2,4] => [2,4,3,1] => {{1,2,4},{3}}
=> {{1},{2,3},{4}}
=> 1
[1,3,4,2] => [2,1,3,4] => {{1,2},{3},{4}}
=> {{1,2,3},{4}}
=> 2
[1,4,2,3] => [2,4,1,3] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[1,4,3,2] => [2,1,4,3] => {{1,2},{3,4}}
=> {{1,3},{2},{4}}
=> 0
[2,1,3,4] => [3,2,4,1] => {{1,3,4},{2}}
=> {{1},{2},{3,4}}
=> 1
[2,1,4,3] => [3,2,1,4] => {{1,3},{2},{4}}
=> {{1,2},{3,4}}
=> 2
[2,3,1,4] => [4,2,3,1] => {{1,4},{2},{3}}
=> {{1},{2,3,4}}
=> 2
[2,3,4,1] => [1,2,3,4] => {{1},{2},{3},{4}}
=> {{1,2,3,4}}
=> 4
[2,4,1,3] => [4,2,1,3] => {{1,3,4},{2}}
=> {{1},{2},{3,4}}
=> 1
[2,4,3,1] => [1,2,4,3] => {{1},{2},{3,4}}
=> {{1,3,4},{2}}
=> 2
[3,1,2,4] => [3,4,2,1] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[3,1,4,2] => [3,1,2,4] => {{1,2,3},{4}}
=> {{1,2},{3},{4}}
=> 1
[3,2,1,4] => [4,3,2,1] => {{1,4},{2,3}}
=> {{1},{2,4},{3}}
=> 0
[3,2,4,1] => [1,3,2,4] => {{1},{2,3},{4}}
=> {{1,2,4},{3}}
=> 2
[3,4,1,2] => [4,1,2,3] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[3,4,2,1] => [1,4,2,3] => {{1},{2,3,4}}
=> {{1,4},{2},{3}}
=> 1
[4,1,2,3] => [3,4,1,2] => {{1,3},{2,4}}
=> {{1,3},{2,4}}
=> 0
[4,1,3,2] => [3,1,4,2] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[4,2,1,3] => [4,3,1,2] => {{1,2,3,4}}
=> {{1},{2},{3},{4}}
=> 0
[4,2,3,1] => [1,3,4,2] => {{1},{2,3,4}}
=> {{1,4},{2},{3}}
=> 1
[4,3,1,2] => [4,1,3,2] => {{1,2,4},{3}}
=> {{1},{2,3},{4}}
=> 1
[4,3,2,1] => [1,4,3,2] => {{1},{2,4},{3}}
=> {{1,4},{2,3}}
=> 2
Description
The number of anti-singletons of a set partition. An anti-singleton of a set partition S is an index i such that i and i+1 (considered cyclically) are both in the same block of S. For noncrossing set partitions, this is also the number of singletons of the image of S under the Kreweras complement.
Matching statistic: St001232
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St001232: Dyck paths ⟶ ℤResult quality: 12% values known / values provided: 12%distinct values known / distinct values provided: 80%
Values
[1] => [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,2] => [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> ? = 0
[2,1] => [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> ? = 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 0
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ? = 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ? = 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> ? = 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ? = 0
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ? = 0
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ? = 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 1
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 0
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ? = 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 0
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ? = 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 0
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 1
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 0
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 0
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 0
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 2
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
The following 6 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice.