searching the database
Your data matches 22 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: St000007
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3
[2]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => 3
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => 2
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => 2
[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] => 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => 3
[2,2,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] => 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => 2
[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]
=> [2,6,7,1,3,4,5] => 2
[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]
=> [5,6,1,2,3,7,4] => 2
[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]
=> [7,6,1,2,3,4,5] => 3
[4,4,3,2]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [2,6,7,1,3,4,8,5] => 2
[5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,7,1,2,3,4,5,6] => 3
[]
=> []
=> [1,0]
=> [2,1] => 2
[6,5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,9,1,2,3,4,5,6,7] => 2
[7,6,5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [10,9,1,2,3,4,5,6,7,8] => 3
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Matching statistic: St000282
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000282: Posets ⟶ ℤResult quality: 57% ●values known / values provided: 57%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000282: Posets ⟶ ℤResult quality: 57% ●values known / values provided: 57%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => ([],1)
=> ? = 3 - 2
[2]
=> [[1,2]]
=> [1,2] => ([(0,1)],2)
=> 1 = 3 - 2
[1,1]
=> [[1],[2]]
=> [2,1] => ([],2)
=> 0 = 2 - 2
[3]
=> [[1,2,3]]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 3 - 2
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> 1 = 3 - 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => ([],3)
=> 0 = 2 - 2
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> 1 = 3 - 2
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> 0 = 2 - 2
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 3 - 2
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => ([(0,3),(1,2),(2,4),(3,4)],5)
=> 1 = 3 - 2
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1 = 3 - 2
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 0 = 2 - 2
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 0 = 2 - 2
[4,3,2]
=> [[1,2,5,9],[3,4,8],[6,7]]
=> [6,7,3,4,8,1,2,5,9] => ([(0,4),(1,3),(2,5),(3,7),(4,8),(5,7),(5,8),(7,6),(8,6)],9)
=> ? = 2 - 2
[3,3,2,1]
=> [[1,3,6],[2,5,9],[4,8],[7]]
=> [7,4,8,2,5,9,1,3,6] => ([(0,7),(1,6),(2,6),(2,8),(3,7),(3,8),(6,4),(7,5),(8,4),(8,5)],9)
=> ? = 2 - 2
[4,3,2,1]
=> [[1,3,6,10],[2,5,9],[4,8],[7]]
=> [7,4,8,2,5,9,1,3,6,10] => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ? = 3 - 2
[4,4,3,2]
=> [[1,2,5,9],[3,4,8,13],[6,7,12],[10,11]]
=> [10,11,6,7,12,3,4,8,13,1,2,5,9] => ?
=> ? = 2 - 2
[5,4,3,2,1]
=> [[1,3,6,10,15],[2,5,9,14],[4,8,13],[7,12],[11]]
=> [11,7,12,4,8,13,2,5,9,14,1,3,6,10,15] => ?
=> ? = 3 - 2
[]
=> []
=> [] => ([],0)
=> ? = 2 - 2
[6,5,4,3,2,1]
=> [[1,3,6,10,15,21],[2,5,9,14,20],[4,8,13,19],[7,12,18],[11,17],[16]]
=> ? => ?
=> ? = 2 - 2
[7,6,5,4,3,2,1]
=> [[1,3,6,10,15,21,28],[2,5,9,14,20,27],[4,8,13,19,26],[7,12,18,25],[11,17,24],[16,23],[22]]
=> ? => ?
=> ? = 3 - 2
Description
The size of the preimage of the map 'to poset' from Ordered trees to Posets.
Matching statistic: St000326
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00200: Binary words —twist⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 52% ●values known / values provided: 52%●distinct values known / distinct values provided: 100%
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00200: Binary words —twist⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 52% ●values known / values provided: 52%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 10 => 00 => 3
[2]
=> [1,0,1,0]
=> 1010 => 0010 => 3
[1,1]
=> [1,1,0,0]
=> 1100 => 0100 => 2
[3]
=> [1,0,1,0,1,0]
=> 101010 => 001010 => 3
[2,1]
=> [1,0,1,1,0,0]
=> 101100 => 001100 => 3
[1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 010100 => 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 00101100 => 3
[2,2]
=> [1,1,1,0,0,0]
=> 111000 => 011000 => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 00110100 => 3
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 00111000 => 3
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => 0010110100 => ? = 3
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 01100100 => 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => 0011100100 => ? = 2
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 101110110000 => 001110110000 => ? = 2
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => 011011000100 => ? = 2
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 10111011000100 => 00111011000100 => ? = 3
[4,4,3,2]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> 11101110010000 => 01101110010000 => ? = 2
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> 101110111001000100 => ? => ? = 3
[]
=> []
=> => ? => ? = 2
[6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ? => ? = 2
[7,6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ? => ? = 3
Description
The position of the first one in a binary word after appending a 1 at the end.
Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
Matching statistic: St000990
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
Mp00283: Perfect matchings —non-nesting-exceedence permutation⟶ Permutations
St000990: Permutations ⟶ ℤResult quality: 33% ●values known / values provided: 33%●distinct values known / distinct values provided: 100%
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
Mp00283: Perfect matchings —non-nesting-exceedence permutation⟶ Permutations
St000990: Permutations ⟶ ℤResult quality: 33% ●values known / values provided: 33%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [(1,2)]
=> [2,1] => 2 = 3 - 1
[2]
=> [1,0,1,0]
=> [(1,2),(3,4)]
=> [2,1,4,3] => 2 = 3 - 1
[1,1]
=> [1,1,0,0]
=> [(1,4),(2,3)]
=> [3,4,2,1] => 1 = 2 - 1
[3]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> [2,1,4,3,6,5] => 2 = 3 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> [2,1,5,6,4,3] => 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> [3,5,2,6,4,1] => 1 = 2 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> [2,1,4,3,7,8,6,5] => ? = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> [4,5,6,3,2,1] => 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> [2,1,5,7,4,8,6,3] => ? = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> [2,1,6,7,8,5,4,3] => ? = 3 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> [2,1,4,3,7,9,6,10,8,5] => ? = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> [4,5,7,3,2,8,6,1] => ? = 2 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> [2,1,6,7,9,5,4,10,8,3] => ? = 2 - 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [(1,2),(3,12),(4,11),(5,6),(7,10),(8,9)]
=> [2,1,6,9,10,5,11,12,8,7,4,3] => ? = 2 - 1
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [(1,12),(2,9),(3,4),(5,8),(6,7),(10,11)]
=> [4,7,8,3,9,11,6,5,2,12,10,1] => ? = 2 - 1
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [(1,2),(3,14),(4,11),(5,6),(7,10),(8,9),(12,13)]
=> [2,1,6,9,10,5,11,13,8,7,4,14,12,3] => ? = 3 - 1
[4,4,3,2]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [(1,14),(2,13),(3,4),(5,12),(6,9),(7,8),(10,11)]
=> [4,8,9,3,11,12,13,7,6,14,10,5,2,1] => ? = 2 - 1
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [(1,2),(3,18),(4,15),(5,6),(7,14),(8,11),(9,10),(12,13),(16,17)]
=> ? => ? = 3 - 1
[]
=> []
=> []
=> ? => ? = 2 - 1
[6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,1,0,0]
=> ?
=> ? => ? = 2 - 1
[7,6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0]
=> ?
=> ? => ? = 3 - 1
Description
The first ascent of a permutation.
For a permutation $\pi$, this is the smallest index such that $\pi(i) < \pi(i+1)$.
For the first descent, see [[St000654]].
Matching statistic: St000239
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000239: Permutations ⟶ ℤResult quality: 33% ●values known / values provided: 33%●distinct values known / distinct values provided: 100%
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000239: Permutations ⟶ ℤResult quality: 33% ●values known / values provided: 33%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [[1],[2]]
=> [2,1] => 1 = 3 - 2
[2]
=> [1,0,1,0]
=> [[1,3],[2,4]]
=> [2,4,1,3] => 1 = 3 - 2
[1,1]
=> [1,1,0,0]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 0 = 2 - 2
[3]
=> [1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,4,6,1,3,5] => 1 = 3 - 2
[2,1]
=> [1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => 1 = 3 - 2
[1,1,1]
=> [1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => 0 = 2 - 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,4,7,8,1,3,5,6] => ? = 3 - 2
[2,2]
=> [1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => 0 = 2 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,5,7,8,1,3,4,6] => ? = 3 - 2
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,6,7,8,1,3,4,5] => ? = 3 - 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> [2,4,7,9,10,1,3,5,6,8] => ? = 3 - 2
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [4,5,7,8,1,2,3,6] => ? = 2 - 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[1,3,4,5,8],[2,6,7,9,10]]
=> [2,6,7,9,10,1,3,4,5,8] => ? = 2 - 2
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [[1,3,4,5,7,8],[2,6,9,10,11,12]]
=> [2,6,9,10,11,12,1,3,4,5,7,8] => ? = 2 - 2
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [[1,2,3,5,6,10],[4,7,8,9,11,12]]
=> [4,7,8,9,11,12,1,2,3,5,6,10] => ? = 2 - 2
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [[1,3,4,5,7,8,12],[2,6,9,10,11,13,14]]
=> [2,6,9,10,11,13,14,1,3,4,5,7,8,12] => ? = 3 - 2
[4,4,3,2]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [[1,2,3,5,6,7,10],[4,8,9,11,12,13,14]]
=> [4,8,9,11,12,13,14,1,2,3,5,6,7,10] => ? = 2 - 2
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [[1,3,4,5,7,8,9,12,16],[2,6,10,11,13,14,15,17,18]]
=> ? => ? = 3 - 2
[]
=> []
=> ?
=> ? => ? = 2 - 2
[6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,1,0,0]
=> ?
=> ? => ? = 2 - 2
[7,6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0]
=> ?
=> ? => ? = 3 - 2
Description
The number of small weak excedances.
A small weak excedance is an index $i$ such that $\pi_i \in \{i,i+1\}$.
This is the sum of [[St000022]] and [[St000237]].
Matching statistic: St001195
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00312: Integer partitions —Glaisher-Franklin⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001195: Dyck paths ⟶ ℤResult quality: 24% ●values known / values provided: 24%●distinct values known / distinct values provided: 50%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001195: Dyck paths ⟶ ℤResult quality: 24% ●values known / values provided: 24%●distinct values known / distinct values provided: 50%
Values
[1]
=> [1]
=> []
=> []
=> ? = 3 - 1
[2]
=> [1,1]
=> [1]
=> [1,0]
=> ? = 3 - 1
[1,1]
=> [2]
=> []
=> []
=> ? = 2 - 1
[3]
=> [3]
=> []
=> []
=> ? = 3 - 1
[2,1]
=> [1,1,1]
=> [1,1]
=> [1,1,0,0]
=> ? = 3 - 1
[1,1,1]
=> [2,1]
=> [1]
=> [1,0]
=> ? = 2 - 1
[3,1]
=> [3,1]
=> [1]
=> [1,0]
=> ? = 3 - 1
[2,2]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[2,1,1]
=> [2,1,1]
=> [1,1]
=> [1,1,0,0]
=> ? = 3 - 1
[3,2]
=> [3,1,1]
=> [1,1]
=> [1,1,0,0]
=> ? = 3 - 1
[3,1,1]
=> [3,2]
=> [2]
=> [1,0,1,0]
=> ? = 3 - 1
[2,2,1]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[3,2,1]
=> [3,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[4,3,2]
=> [3,2,2,1,1]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[3,3,2,1]
=> [6,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[4,3,2,1]
=> [3,2,2,1,1,1]
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> ? = 3 - 1
[4,4,3,2]
=> [3,2,2,2,2,1,1]
=> [2,2,2,2,1,1]
=> [1,1,1,1,0,1,0,0,0,1,0,1,0,0]
=> ? = 2 - 1
[5,4,3,2,1]
=> [5,3,2,2,1,1,1]
=> [3,2,2,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> ? = 3 - 1
[]
=> ?
=> ?
=> ?
=> ? = 2 - 1
[6,5,4,3,2,1]
=> ?
=> ?
=> ?
=> ? = 2 - 1
[7,6,5,4,3,2,1]
=> ?
=> ?
=> ?
=> ? = 3 - 1
Description
The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$.
Matching statistic: St001632
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001632: Posets ⟶ ℤResult quality: 24% ●values known / values provided: 24%●distinct values known / distinct values provided: 50%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001632: Posets ⟶ ℤResult quality: 24% ●values known / values provided: 24%●distinct values known / distinct values provided: 50%
Values
[1]
=> [1,0]
=> [1] => ([],1)
=> ? = 3 - 1
[2]
=> [1,0,1,0]
=> [2,1] => ([],2)
=> ? = 3 - 1
[1,1]
=> [1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> 1 = 2 - 1
[3]
=> [1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ? = 3 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ? = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ? = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ? = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ? = 3 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ? = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ? = 2 - 1
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,6,1] => ([(1,5),(2,3),(3,5),(5,4)],6)
=> ? = 2 - 1
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [5,2,3,1,4,6] => ([(0,5),(1,4),(2,3),(3,5),(5,4)],6)
=> 1 = 2 - 1
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [6,3,4,2,5,7,1] => ([(1,6),(2,5),(3,4),(4,6),(6,5)],7)
=> ? = 3 - 1
[4,4,3,2]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [4,2,3,5,1,6,7] => ([(0,6),(1,5),(2,3),(3,6),(5,4),(6,5)],7)
=> ? = 2 - 1
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [8,5,3,4,6,2,7,9,1] => ?
=> ? = 3 - 1
[]
=> []
=> [] => ([],0)
=> ? = 2 - 1
[6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ?
=> ? = 2 - 1
[7,6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ?
=> ? = 3 - 1
Description
The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset.
Matching statistic: St001545
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001545: Graphs ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 50%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001545: Graphs ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 50%
Values
[1]
=> [1,0]
=> [1] => ([],1)
=> ? = 3
[2]
=> [1,0,1,0]
=> [1,2] => ([],2)
=> ? = 3
[1,1]
=> [1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> ? = 3
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> ? = 3
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> ? = 3
[2,2]
=> [1,1,1,0,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> ? = 3
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> ? = 3
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ? = 3
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> ? = 2
[4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,4,6,2,3,5] => ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 2
[3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,5,1,2,6,4] => ([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ? = 2
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,4,6,2,3,7,5] => ([(1,5),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> ? = 3
[4,4,3,2]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [3,6,1,7,2,4,5] => ([(0,1),(0,6),(1,5),(2,4),(2,6),(3,4),(3,6),(4,5),(5,6)],7)
=> ? = 2
[5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0]
=> [1,4,7,2,8,3,5,9,6] => ?
=> ? = 3
[]
=> []
=> [] => ([],0)
=> ? = 2
[6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ?
=> ? = 2
[7,6,5,4,3,2,1]
=> [1,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0]
=> ? => ?
=> ? = 3
Description
The second Elser number of a connected graph.
For a connected graph $G$ the $k$-th Elser number is
$$
els_k(G) = (-1)^{|V(G)|+1} \sum_N (-1)^{|E(N)|} |V(N)|^k
$$
where the sum is over all nuclei of $G$, that is, the connected subgraphs of $G$ whose vertex set is a vertex cover of $G$.
It is clear that this number is even. It was shown in [1] that it is non-negative.
Matching statistic: St001050
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00284: Standard tableaux —rows⟶ Set partitions
St001050: Set partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 100%
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00284: Standard tableaux —rows⟶ Set partitions
St001050: Set partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [[1,3],[2,4]]
=> {{1,3},{2,4}}
=> 2 = 3 - 1
[2]
=> [1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> {{1,2,5},{3,4,6}}
=> 2 = 3 - 1
[1,1]
=> [1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> {{1,3,4},{2,5,6}}
=> 1 = 2 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> {{1,2,3,7},{4,5,6,8}}
=> ? = 3 - 1
[2,1]
=> [1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> {{1,3,5},{2,4,6}}
=> 2 = 3 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> {{1,3,4,5},{2,6,7,8}}
=> ? = 2 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> {{1,2,4,7},{3,5,6,8}}
=> ? = 3 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> {{1,2,5,6},{3,4,7,8}}
=> ? = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> {{1,3,4,6},{2,5,7,8}}
=> ? = 3 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> {{1,2,5,7},{3,4,6,8}}
=> ? = 3 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> {{1,3,4,7},{2,5,6,8}}
=> ? = 3 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> {{1,3,5,6},{2,4,7,8}}
=> ? = 2 - 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> {{1,3,5,7},{2,4,6,8}}
=> ? = 2 - 1
[4,3,2]
=> [1,1,0,0,1,0,1,0,1,0]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> {{1,2,5,7,9},{3,4,6,8,10}}
=> ? = 2 - 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]]
=> {{1,3,5,7,8},{2,4,6,9,10}}
=> ? = 2 - 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]]
=> {{1,3,5,7,9},{2,4,6,8,10}}
=> ? = 3 - 1
[4,4,3,2]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [[1,2,5,7,9,10],[3,4,6,8,11,12]]
=> {{1,2,5,7,9,10},{3,4,6,8,11,12}}
=> ? = 2 - 1
[5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9,11],[2,4,6,8,10,12]]
=> {{1,3,5,7,9,11},{2,4,6,8,10,12}}
=> ? = 3 - 1
[]
=> []
=> ?
=> ?
=> ? = 2 - 1
[6,5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9,11,13],[2,4,6,8,10,12,14]]
=> {{1,3,5,7,9,11,13},{2,4,6,8,10,12,14}}
=> ? = 2 - 1
[7,6,5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9,11,13,15],[2,4,6,8,10,12,14,16]]
=> {{1,3,5,7,9,11,13,15},{2,4,6,8,10,12,14,16}}
=> ? = 3 - 1
Description
The number of terminal closers of a set partition.
A closer of a set partition is a number that is maximal in its block. In particular, a singleton is a closer. This statistic counts the number of terminal closers. In other words, this is the number of closers such that all larger elements are also closers.
Matching statistic: St001491
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00273: Binary words —Gray previous⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 100%
Mp00273: Binary words —Gray previous⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 100%
Values
[1]
=> 10 => 00 => 00 => ? = 3 - 1
[2]
=> 100 => 000 => 000 => ? = 3 - 1
[1,1]
=> 110 => 100 => 010 => 1 = 2 - 1
[3]
=> 1000 => 0000 => 0000 => ? = 3 - 1
[2,1]
=> 1010 => 1110 => 1110 => 2 = 3 - 1
[1,1,1]
=> 1110 => 0110 => 1100 => 1 = 2 - 1
[3,1]
=> 10010 => 11010 => 10110 => ? = 3 - 1
[2,2]
=> 1100 => 1000 => 0010 => 1 = 2 - 1
[2,1,1]
=> 10110 => 00110 => 11000 => ? = 3 - 1
[3,2]
=> 10100 => 11100 => 11010 => ? = 3 - 1
[3,1,1]
=> 100110 => 000110 => 110000 => ? = 3 - 1
[2,2,1]
=> 11010 => 01010 => 01100 => ? = 2 - 1
[3,2,1]
=> 101010 => 001010 => 011000 => ? = 2 - 1
[4,3,2]
=> 1010100 => 0010100 => 1001000 => ? = 2 - 1
[3,3,2,1]
=> 1101010 => 1001010 => 1000110 => ? = 2 - 1
[4,3,2,1]
=> 10101010 => 11101010 => 10110110 => ? = 3 - 1
[4,4,3,2]
=> 11010100 => 10010100 => 01100010 => ? = 2 - 1
[5,4,3,2,1]
=> 1010101010 => 0010101010 => ? => ? = 3 - 1
[]
=> => ? => ? => ? = 2 - 1
[6,5,4,3,2,1]
=> 101010101010 => 111010101010 => ? => ? = 2 - 1
[7,6,5,4,3,2,1]
=> 10101010101010 => ? => ? => ? = 3 - 1
Description
The number of indecomposable projective-injective modules in the algebra corresponding to a subset.
Let $A_n=K[x]/(x^n)$.
We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.
The following 12 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001722The number of minimal chains with small intervals between a binary word and the top element. St000461The rix statistic of a permutation. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000782The indicator function of whether a given perfect matching is an L & P matching. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000090The variation of a composition. St000264The girth of a graph, which is not a tree. St001399The distinguishing number of a poset. St001568The smallest positive integer that does not appear twice in the partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000929The constant term of the character polynomial of an integer partition. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone.
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!