Your data matches 230 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
St001728: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [3,1,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [2,4,1,3] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [3,1,4,2] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [4,1,2,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => 0
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => 0
[]
=> []
=> [1] => 0
Description
The number of invisible descents of a permutation. A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$. Thus, an invisible descent satisfies $\pi(i) > \pi(i+1) > i$.
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00124: Dyck paths Adin-Bagno-Roichman transformationDyck paths
Mp00031: Dyck paths to 312-avoiding permutationPermutations
St001086: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,3,2,1] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,3,5,2,1] => 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,4,5,2,1] => 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,4,2,5,1] => 0
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[]
=> []
=> []
=> [] => 0
Description
The number of occurrences of the consecutive pattern 132 in a permutation. This is the number of occurrences of the pattern $132$, where the matched entries are all adjacent.
Matching statistic: St000629
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00093: Dyck paths to binary wordBinary words
Mp00280: Binary words path rowmotionBinary words
St000629: Binary words ⟶ ℤResult quality: 38% values known / values provided: 38%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 10 => 11 => 0
[2]
=> [1,0,1,0]
=> 1010 => 1101 => 0
[1,1]
=> [1,1,0,0]
=> 1100 => 0111 => 0
[3]
=> [1,0,1,0,1,0]
=> 101010 => 110101 => 0
[2,1]
=> [1,0,1,1,0,0]
=> 101100 => 110011 => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 111001 => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> 10101010 => 11010101 => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 11010011 => 1
[2,2]
=> [1,1,1,0,0,0]
=> 111000 => 001111 => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 11011001 => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 11101001 => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => 1101010011 => ? = 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 11000111 => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => 1101011001 => ? = 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 01111001 => 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 1101101001 => ? = 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => 1101000111 => ? = 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 101010110100 => 110101011001 => ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 11110001 => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => 1100111001 => ? = 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => 110101101001 => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 00011111 => 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => 0111101001 => 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => 1101110001 => ? = 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 101011100100 => 110100111001 => ? = 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 10101011010100 => 11010101101001 => ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => 1111001001 => ? = 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => 1100001111 => ? = 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => 110011101001 => ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => 0011111001 => ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 101110100100 => 110111001001 => ? = 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 101011110000 => 110100001111 => ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 10101110010100 => 11010011101001 => ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => 1111000011 => ? = 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => 111100101001 => ? = 0
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => 110001111001 => ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 101110110000 => 110111000011 => ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> 10111010010100 => 11011100101001 => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> 10101111000100 => 11010001111001 => ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => 111100011001 => ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 10111011000100 => 11011100011001 => ? = 0
[]
=> []
=> => => ? = 0
Description
The defect of a binary word. The defect of a finite word $w$ is given by the difference between the maximum possible number and the actual number of palindromic factors contained in $w$. The maximum possible number of palindromic factors in a word $w$ is $|w|+1$.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
St000664: Permutations ⟶ ℤResult quality: 38% values known / values provided: 38%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,1,0,0]
=> [2,3,1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 0
[1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [5,6,1,2,3,7,4] => ? = 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [5,7,1,2,6,3,4] => ? = 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => 0
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [6,7,1,5,2,3,4] => ? = 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [5,4,1,2,6,7,3] => ? = 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [8,6,1,2,3,7,4,5] => ? = 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [7,3,1,5,6,2,4] => ? = 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [8,7,1,2,6,3,4,5] => ? = 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => 0
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [2,7,6,5,1,3,4] => ? = 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [7,4,1,5,6,2,3] => ? = 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> [8,4,1,2,6,7,3,5] => ? = 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [9,8,1,2,3,7,4,5,6] => ? = 0
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [7,3,6,5,1,2,4] => ? = 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [4,3,1,5,6,7,2] => ? = 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [8,3,1,7,6,2,4,5] => ? = 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [2,3,7,5,6,1,4] => ? = 0
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [8,4,1,7,6,2,3,5] => ? = 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> [5,4,1,2,6,7,8,3] => ? = 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> [9,4,1,2,8,7,3,5,6] => ? = 0
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [6,3,4,5,1,7,2] => ? = 0
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [7,3,8,6,1,2,4,5] => ? = 0
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> [4,3,1,8,6,7,2,5] => ? = 0
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> [7,4,1,5,6,2,8,3] => ? = 0
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [8,4,1,9,7,2,3,5,6] => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> [5,4,1,2,9,7,8,3,6] => ? = 0
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [8,3,4,6,1,7,2,5] => ? = 0
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [9,4,1,5,7,2,8,3,6] => ? = 0
[]
=> []
=> [1,0]
=> [2,1] => 0
Description
The number of right ropes of a permutation. Let $\pi$ be a permutation of length $n$. A raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents, [[St000441]], and a right rope is a large ascent after a raft of $\pi$. See Definition 3.10 and Example 3.11 in [1].
Matching statistic: St001578
Mp00095: Integer partitions to binary wordBinary words
Mp00178: Binary words to compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St001578: Graphs ⟶ ℤResult quality: 38% values known / values provided: 38%distinct values known / distinct values provided: 100%
Values
[1]
=> 10 => [1,2] => ([(1,2)],3)
=> 0
[2]
=> 100 => [1,3] => ([(2,3)],4)
=> 0
[1,1]
=> 110 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0
[3]
=> 1000 => [1,4] => ([(3,4)],5)
=> 0
[2,1]
=> 1010 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,1]
=> 1110 => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[4]
=> 10000 => [1,5] => ([(4,5)],6)
=> 0
[3,1]
=> 10010 => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,2]
=> 1100 => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[2,1,1]
=> 10110 => [1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,1]
=> 11110 => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[4,1]
=> 100010 => [1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[3,2]
=> 10100 => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[3,1,1]
=> 100110 => [1,3,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[2,2,1]
=> 11010 => [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[2,1,1,1]
=> 101110 => [1,2,1,1,2] => ([(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)
=> ? = 0
[4,2]
=> 100100 => [1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[4,1,1]
=> 1000110 => [1,4,1,2] => ([(1,6),(1,7),(2,6),(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
[3,3]
=> 11000 => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 0
[3,2,1]
=> 101010 => [1,2,2,2] => ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[3,1,1,1]
=> 1001110 => [1,3,1,1,2] => ([(1,5),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
[2,2,2]
=> 11100 => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[2,2,1,1]
=> 110110 => [1,1,2,1,2] => ([(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)
=> ? = 0
[4,3]
=> 101000 => [1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[4,2,1]
=> 1001010 => [1,3,2,2] => ([(1,7),(2,6),(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
[4,1,1,1]
=> 10001110 => [1,4,1,1,2] => ([(1,6),(1,7),(1,8),(2,6),(2,7),(2,8),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
[3,3,1]
=> 110010 => [1,1,3,2] => ([(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 1
[3,2,2]
=> 101100 => [1,2,1,3] => ([(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[3,2,1,1]
=> 1010110 => [1,2,2,1,2] => ([(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[2,2,2,1]
=> 111010 => [1,1,1,2,2] => ([(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[4,3,1]
=> 1010010 => [1,2,3,2] => ([(1,7),(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 1
[4,2,2]
=> 1001100 => [1,3,1,3] => ([(2,6),(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[4,2,1,1]
=> 10010110 => [1,3,2,1,2] => ([(1,7),(1,8),(2,6),(2,7),(2,8),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
[3,3,2]
=> 110100 => [1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
[3,3,1,1]
=> 1100110 => [1,1,3,1,2] => ([(1,6),(1,7),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[3,2,2,1]
=> 1011010 => [1,2,1,2,2] => ([(1,7),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[4,3,2]
=> 1010100 => [1,2,2,3] => ([(2,7),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[4,3,1,1]
=> 10100110 => [1,2,3,1,2] => ([(1,7),(1,8),(2,7),(2,8),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
[4,2,2,1]
=> 10011010 => [1,3,1,2,2] => ([(1,8),(2,6),(2,7),(2,8),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
[3,3,2,1]
=> 1101010 => [1,1,2,2,2] => ([(1,7),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7),(5,6),(5,7),(6,7)],8)
=> ? = 0
[4,3,2,1]
=> 10101010 => [1,2,2,2,2] => ([(1,8),(2,7),(2,8),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
[]
=> => [1] => ([],1)
=> 0
Description
The minimal number of edges to add or remove to make a graph a line graph.
Matching statistic: St001001
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00132: Dyck paths switch returns and last double riseDyck paths
St001001: Dyck paths ⟶ ℤResult quality: 33% values known / values provided: 33%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[2]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> ? = 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> ? = 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> ? = 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> ? = 0
[3,2,1]
=> [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,1,0,0]
=> 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> ? = 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> ? = 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> ? = 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> ? = 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> ? = 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> ? = 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> ? = 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> ? = 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> ? = 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> ? = 0
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> ? = 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> ? = 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> ? = 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 0
[]
=> []
=> [1,0]
=> [1,0]
=> 0
Description
The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path.
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00025: Dyck paths to 132-avoiding permutationPermutations
Mp00170: Permutations to signed permutationSigned permutations
St001867: Signed permutations ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [2,1] => [2,1] => 0
[2]
=> [1,1,0,0,1,0]
=> [3,1,2] => [3,1,2] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => [2,3,1] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [4,1,2,3] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [3,2,1] => [3,2,1] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [2,3,4,1] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => [5,1,2,3,4] => ? = 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [4,2,1,3] => 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [3,4,1,2] => 0
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => ? = 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => [5,2,1,3,4] => ? = 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [4,3,1,2] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [4,2,3,1] => 0
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [3,4,2,1] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [3,2,4,5,1] => ? = 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => [5,3,1,2,4] => ? = 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [5,2,3,1,4] => ? = 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => [4,5,1,2,3] => ? = 0
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [4,3,2,1] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [4,2,3,5,1] => ? = 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [3,4,5,1,2] => ? = 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [3,4,2,5,1] => ? = 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => [5,4,1,2,3] => ? = 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [5,3,2,1,4] => ? = 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [5,2,3,4,1] => ? = 0
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [4,5,2,1,3] => ? = 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [4,3,5,1,2] => ? = 0
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [4,3,2,5,1] => ? = 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [3,4,5,2,1] => ? = 0
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [5,4,2,1,3] => ? = 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [5,3,4,1,2] => ? = 0
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [5,3,2,4,1] => ? = 0
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [4,5,3,1,2] => ? = 0
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [4,5,2,3,1] => ? = 0
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [4,3,5,2,1] => ? = 0
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [5,4,3,1,2] => ? = 0
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [5,4,2,3,1] => ? = 0
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [5,3,4,2,1] => ? = 0
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [4,5,3,2,1] => ? = 0
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [5,4,3,2,1] => ? = 0
[]
=> []
=> [] => [] => ? = 0
Description
The number of alignments of type EN of a signed permutation. An alignment of type EN of a signed permutation π∈Hn is a pair −n≤i≤j≤n, i,j≠0, such that one of the following conditions hold: * $-i < 0 < -\pi(i) < \pi(j) < j$ * $i \leq\pi(i) < \pi(j) < j$.
Matching statistic: St000805
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00033: Dyck paths to two-row standard tableauStandard tableaux
Mp00295: Standard tableaux valley compositionInteger compositions
St000805: Integer compositions ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [[1,3],[2,4]]
=> [2,2] => 1 = 0 + 1
[2]
=> [1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> [3,3] => 1 = 0 + 1
[1,1]
=> [1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,3,1] => 1 = 0 + 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> [4,4] => 1 = 0 + 1
[2,1]
=> [1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,2,2] => 1 = 0 + 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,4,2] => 1 = 0 + 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [[1,2,3,4,9],[5,6,7,8,10]]
=> [5,5] => ? = 0 + 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> [3,2,3] => 2 = 1 + 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> [3,4,1] => 1 = 0 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,3,2,1] => 1 = 0 + 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[1,3,4,5,6],[2,7,8,9,10]]
=> [2,5,3] => ? = 0 + 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [[1,2,3,5,9],[4,6,7,8,10]]
=> [4,2,4] => ? = 1 + 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> [3,3,2] => 1 = 0 + 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> [2,3,3] => 1 = 0 + 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,2,3,1] => 1 = 0 + 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [[1,3,4,5,7],[2,6,8,9,10]]
=> [2,4,2,2] => ? = 0 + 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [[1,2,3,6,9],[4,5,7,8,10]]
=> [4,3,3] => ? = 1 + 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [[1,2,4,5,9],[3,6,7,8,10]]
=> [3,3,4] => ? = 1 + 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [[1,2,3,7,8],[4,5,6,9,10]]
=> [4,5,1] => ? = 0 + 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [2,2,2,2] => 1 = 0 + 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[1,3,4,5,8],[2,6,7,9,10]]
=> [2,4,3,1] => ? = 1 + 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [[1,2,5,6,7],[3,4,8,9,10]]
=> [3,5,2] => ? = 0 + 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [[1,3,4,6,7],[2,5,8,9,10]]
=> [2,3,3,2] => ? = 0 + 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [[1,2,3,7,9],[4,5,6,8,10]]
=> [4,4,2] => ? = 0 + 1
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [[1,2,4,6,9],[3,5,7,8,10]]
=> [3,2,2,3] => ? = 1 + 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[1,3,4,5,9],[2,6,7,8,10]]
=> [2,4,4] => ? = 0 + 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [[1,2,4,7,8],[3,5,6,9,10]]
=> [3,2,4,1] => ? = 1 + 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [[1,2,5,6,8],[3,4,7,9,10]]
=> [3,4,2,1] => ? = 0 + 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> [2,3,2,2,1] => ? = 0 + 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[1,3,5,6,7],[2,4,8,9,10]]
=> [2,2,4,2] => ? = 0 + 1
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [[1,2,4,7,9],[3,5,6,8,10]]
=> [3,2,3,2] => ? = 1 + 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [[1,2,5,6,9],[3,4,7,8,10]]
=> [3,4,3] => ? = 0 + 1
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [[1,3,4,6,9],[2,5,7,8,10]]
=> [2,3,2,3] => ? = 0 + 1
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [[1,2,5,7,8],[3,4,6,9,10]]
=> [3,3,3,1] => ? = 0 + 1
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[1,3,4,7,8],[2,5,6,9,10]]
=> [2,3,4,1] => ? = 0 + 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> [2,2,3,2,1] => ? = 0 + 1
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> [3,3,2,2] => ? = 0 + 1
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[1,3,4,7,9],[2,5,6,8,10]]
=> [2,3,3,2] => ? = 0 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [[1,3,5,6,9],[2,4,7,8,10]]
=> [2,2,3,3] => ? = 0 + 1
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> [2,2,2,3,1] => ? = 0 + 1
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [2,2,2,2,2] => ? = 0 + 1
[]
=> []
=> ?
=> ? => ? = 0 + 1
Description
The number of peaks of the associated bargraph. Interpret the composition as the sequence of heights of the bars of a bargraph. This statistic is the number of contiguous subsequences consisting of an up step, a sequence of horizontal steps, and a down step.
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00031: Dyck paths to 312-avoiding permutationPermutations
Mp00068: Permutations Simion-Schmidt mapPermutations
St001582: Permutations ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,2] => [1,2] => 1 = 0 + 1
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 1 = 0 + 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 1 = 0 + 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => 1 = 0 + 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,3,2] => 1 = 0 + 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,4,3,2] => 1 = 0 + 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [4,3,2,1,5] => ? = 0 + 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,4,1,3] => 2 = 1 + 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 1 = 0 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1 = 0 + 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,5,4,3,2] => ? = 0 + 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => [3,5,2,1,4] => ? = 1 + 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,4,3] => 1 = 0 + 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,4,3,2] => 1 = 0 + 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,4,3,2] => 1 = 0 + 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [1,5,4,3,2] => ? = 0 + 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [3,2,5,1,4] => ? = 1 + 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [2,5,4,1,3] => ? = 1 + 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [3,2,1,5,4] => ? = 0 + 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,4,3,2] => 1 = 0 + 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,5,4,3,2] => ? = 1 + 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,5,4,3] => ? = 0 + 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,5,4,3,2] => ? = 0 + 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [3,2,1,5,4] => ? = 0 + 1
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,5,4,1,3] => ? = 1 + 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,5,4,3,2] => ? = 0 + 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,5,1,4,3] => ? = 1 + 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => ? = 0 + 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => ? = 0 + 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,5,4,3,2] => ? = 0 + 1
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,5,1,4,3] => ? = 1 + 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,5,4,3] => ? = 0 + 1
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,5,4,3,2] => ? = 0 + 1
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,5,4,3] => ? = 0 + 1
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,5,4,3,2] => ? = 0 + 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,5,4,3,2] => ? = 0 + 1
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,5,4,3] => ? = 0 + 1
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,5,4,3,2] => ? = 0 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,5,4,3,2] => ? = 0 + 1
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,5,4,3,2] => ? = 0 + 1
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,5,4,3,2] => ? = 0 + 1
[]
=> []
=> [] => [] => ? = 0 + 1
Description
The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order.
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00327: Dyck paths inverse Kreweras complementDyck paths
Mp00093: Dyck paths to binary wordBinary words
St001884: Binary words ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1100 => 1 = 0 + 1
[2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 101100 => 1 = 0 + 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 110100 => 1 = 0 + 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 1 = 0 + 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 111000 => 1 = 0 + 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 1 = 0 + 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => ? = 0 + 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 11001100 => 2 = 1 + 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 1 = 0 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 1 = 0 + 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => ? = 0 + 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => ? = 1 + 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 1 = 0 + 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 11011000 => 1 = 0 + 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 1 = 0 + 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1101100100 => ? = 0 + 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1101001100 => ? = 1 + 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1100101100 => ? = 1 + 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => ? = 0 + 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 1 = 0 + 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => ? = 1 + 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => ? = 0 + 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => ? = 0 + 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => ? = 0 + 1
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1110001100 => ? = 1 + 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1101011000 => ? = 0 + 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1100110100 => ? = 1 + 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => ? = 0 + 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => ? = 0 + 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => ? = 0 + 1
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1100111000 => ? = 1 + 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1011011000 => ? = 0 + 1
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1110011000 => ? = 0 + 1
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => ? = 0 + 1
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1101101000 => ? = 0 + 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1111001000 => ? = 0 + 1
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => ? = 0 + 1
[4,3,1,1]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => ? = 0 + 1
[4,2,2,1]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => ? = 0 + 1
[3,3,2,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1111010000 => ? = 0 + 1
[4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1111100000 => ? = 0 + 1
[]
=> []
=> ?
=> ? => ? = 0 + 1
Description
The number of borders of a binary word. A border of a binary word $w$ is a word which is both a prefix and a suffix of $w$.
The following 220 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000068The number of minimal elements in a poset. St000455The second largest eigenvalue of a graph if it is integral. St001498The normalised height of a Nakayama algebra with magnitude 1. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000022The number of fixed points of a permutation. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000295The length of the border of a binary word. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000731The number of double exceedences of a permutation. St000943The number of spots the most unlucky car had to go further in a parking function. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001371The length of the longest Yamanouchi prefix of a binary word. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001730The number of times the path corresponding to a binary word crosses the base line. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001462The number of factors of a standard tableaux under concatenation. St001490The number of connected components of a skew partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001889The size of the connectivity set of a signed permutation. St000039The number of crossings of a permutation. St000091The descent variation of a composition. St000221The number of strong fixed points of a permutation. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000317The cycle descent number of a permutation. St000355The number of occurrences of the pattern 21-3. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000462The major index minus the number of excedences of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000496The rcs statistic of a set partition. St000516The number of stretching pairs of a permutation. St000534The number of 2-rises of a permutation. St000546The number of global descents of a permutation. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000623The number of occurrences of the pattern 52341 in a permutation. St000666The number of right tethers of a permutation. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000962The 3-shifted major index of a permutation. St000989The number of final rises of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001381The fertility of a permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000021The number of descents of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000056The decomposition (or block) number of a permutation. St000154The sum of the descent bottoms of a permutation. St000210Minimum over maximum difference of elements in cycles. St000253The crossing number of a set partition. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000570The Edelman-Greene number of a permutation. St000654The first descent of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000729The minimal arc length of a set partition. St000864The number of circled entries of the shifted recording tableau of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001162The minimum jump of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001344The neighbouring number of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001461The number of topologically connected components of the chord diagram of a permutation. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001665The number of pure excedances of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001806The upper middle entry of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001928The number of non-overlapping descents in a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000451The length of the longest pattern of the form k 1 2. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000823The number of unsplittable factors of the set partition. St000842The breadth of a permutation. St000862The number of parts of the shifted shape of a permutation. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000879The number of long braid edges in the graph of braid moves of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St000264The girth of a graph, which is not a tree. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001866The nesting alignments of a signed permutation. St000782The indicator function of whether a given perfect matching is an L & P matching. St000217The number of occurrences of the pattern 312 in a permutation. St000219The number of occurrences of the pattern 231 in a permutation. St000338The number of pixed points of a permutation. St000358The number of occurrences of the pattern 31-2. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000488The number of cycles of a permutation of length at most 2. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000649The number of 3-excedences of a permutation. St000779The tier of a permutation. St000850The number of 1/2-balanced pairs in a poset. St000872The number of very big descents of a permutation. St000961The shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001850The number of Hecke atoms of a permutation. St000023The number of inner peaks of a permutation. St000353The number of inner valleys of a permutation. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000633The size of the automorphism group of a poset. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000886The number of permutations with the same antidiagonal sums. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St000925The number of topologically connected components of a set partition. St000990The first ascent of a permutation. St001399The distinguishing number of a poset. St001472The permanent of the Coxeter matrix of the poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001839The number of excedances of a set partition. St000058The order of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000251The number of nonsingleton blocks of a set partition. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal and 2 a maximal element. St000619The number of cyclic descents of a permutation. St000679The pruning number of an ordered tree. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000836The number of descents of distance 2 of a permutation. St001624The breadth of a lattice. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001735The number of permutations with the same set of runs. St001741The largest integer such that all patterns of this size are contained in the permutation. St000495The number of inversions of distance at most 2 of a permutation. St000638The number of up-down runs of a permutation. St000831The number of indices that are either descents or recoils.