searching the database
Your data matches 3 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: St001964
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00080: Set partitions —to permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001964: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00069: Permutations —complement⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001964: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
{{1}}
=> [1] => [1] => ([],1)
=> 0
{{1,2}}
=> [2,1] => [1,2] => ([(0,1)],2)
=> 0
{{1},{2}}
=> [1,2] => [2,1] => ([],2)
=> 0
{{1,2,3}}
=> [2,3,1] => [2,1,3] => ([(0,2),(1,2)],3)
=> 0
{{1,3},{2}}
=> [3,2,1] => [1,2,3] => ([(0,2),(2,1)],3)
=> 0
{{1},{2},{3}}
=> [1,2,3] => [3,2,1] => ([],3)
=> 0
{{1,2,3,4}}
=> [2,3,4,1] => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> 1
{{1,2,3},{4}}
=> [2,3,1,4] => [3,2,4,1] => ([(1,3),(2,3)],4)
=> 0
{{1,2,4},{3}}
=> [2,4,3,1] => [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> 0
{{1,3,4},{2}}
=> [3,2,4,1] => [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> 0
{{1,3},{2,4}}
=> [3,4,1,2] => [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
{{1,3},{2},{4}}
=> [3,2,1,4] => [2,3,4,1] => ([(1,2),(2,3)],4)
=> 0
{{1,4},{2,3}}
=> [4,3,2,1] => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 0
{{1},{2,3,4}}
=> [1,3,4,2] => [4,2,1,3] => ([(1,3),(2,3)],4)
=> 0
{{1,4},{2},{3}}
=> [4,2,3,1] => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 0
{{1},{2,4},{3}}
=> [1,4,3,2] => [4,1,2,3] => ([(1,2),(2,3)],4)
=> 0
{{1},{2},{3},{4}}
=> [1,2,3,4] => [4,3,2,1] => ([],4)
=> 0
{{1,2,3,4,5}}
=> [2,3,4,5,1] => [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
{{1,2,3,5},{4}}
=> [2,3,5,4,1] => [4,3,1,2,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
{{1,2,3},{4,5}}
=> [2,3,1,5,4] => [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> 0
{{1,2,3},{4},{5}}
=> [2,3,1,4,5] => [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> 0
{{1,2,4,5},{3}}
=> [2,4,3,5,1] => [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
{{1,2,4},{3,5}}
=> [2,4,5,1,3] => [4,2,1,5,3] => ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
{{1,2,4},{3},{5}}
=> [2,4,3,1,5] => [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> 0
{{1,2,5},{3,4}}
=> [2,5,4,3,1] => [4,1,2,3,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> 0
{{1,2},{3,4,5}}
=> [2,1,4,5,3] => [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> 0
{{1,2,5},{3},{4}}
=> [2,5,3,4,1] => [4,1,3,2,5] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
{{1,2},{3,5},{4}}
=> [2,1,5,4,3] => [4,5,1,2,3] => ([(0,3),(1,4),(4,2)],5)
=> 0
{{1,3,4,5},{2}}
=> [3,2,4,5,1] => [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
{{1,3,4},{2,5}}
=> [3,5,4,1,2] => [3,1,2,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 2
{{1,3,4},{2},{5}}
=> [3,2,4,1,5] => [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> 0
{{1,3,5},{2,4}}
=> [3,4,5,2,1] => [3,2,1,4,5] => ([(0,4),(1,4),(2,4),(4,3)],5)
=> 2
{{1,3},{2,4,5}}
=> [3,4,1,5,2] => [3,2,5,1,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
{{1,3,5},{2},{4}}
=> [3,2,5,4,1] => [3,4,1,2,5] => ([(0,3),(1,2),(2,4),(3,4)],5)
=> 0
{{1,3},{2,5},{4}}
=> [3,5,1,4,2] => [3,1,5,2,4] => ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 2
{{1,3},{2},{4,5}}
=> [3,2,1,5,4] => [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> 0
{{1,3},{2},{4},{5}}
=> [3,2,1,4,5] => [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> 0
{{1,4,5},{2,3}}
=> [4,3,2,5,1] => [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> 0
{{1,4},{2,3,5}}
=> [4,3,5,1,2] => [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 2
{{1,4},{2,3},{5}}
=> [4,3,2,1,5] => [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> 0
{{1,5},{2,3,4}}
=> [5,3,4,2,1] => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
{{1},{2,3,4},{5}}
=> [1,3,4,2,5] => [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> 0
{{1,5},{2,3},{4}}
=> [5,3,2,4,1] => [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 0
{{1},{2,3,5},{4}}
=> [1,3,5,4,2] => [5,3,1,2,4] => ([(1,4),(2,3),(3,4)],5)
=> 0
{{1,4,5},{2},{3}}
=> [4,2,3,5,1] => [2,4,3,1,5] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
{{1,4},{2,5},{3}}
=> [4,5,3,1,2] => [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 2
{{1,4},{2},{3,5}}
=> [4,2,5,1,3] => [2,4,1,5,3] => ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 2
{{1,5},{2,4},{3}}
=> [5,4,3,2,1] => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 0
{{1},{2,4,5},{3}}
=> [1,4,3,5,2] => [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> 0
{{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> 0
Description
The interval resolution global dimension of a poset.
This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Matching statistic: St001882
Mp00080: Set partitions —to permutation⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001882: Signed permutations ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 75%
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001882: Signed permutations ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 75%
Values
{{1}}
=> [1] => [1] => [1] => 0
{{1,2}}
=> [2,1] => [2,1] => [2,1] => 0
{{1},{2}}
=> [1,2] => [1,2] => [1,2] => 0
{{1,2,3}}
=> [2,3,1] => [3,2,1] => [3,2,1] => 0
{{1,3},{2}}
=> [3,2,1] => [3,1,2] => [3,1,2] => 0
{{1},{2},{3}}
=> [1,2,3] => [1,2,3] => [1,2,3] => 0
{{1,2,3,4}}
=> [2,3,4,1] => [4,2,3,1] => [4,2,3,1] => 1
{{1,2,3},{4}}
=> [2,3,1,4] => [3,2,1,4] => [3,2,1,4] => 0
{{1,2,4},{3}}
=> [2,4,3,1] => [4,2,1,3] => [4,2,1,3] => 0
{{1,3,4},{2}}
=> [3,2,4,1] => [4,3,2,1] => [4,3,2,1] => 0
{{1,3},{2,4}}
=> [3,4,1,2] => [2,4,3,1] => [2,4,3,1] => 2
{{1,3},{2},{4}}
=> [3,2,1,4] => [3,1,2,4] => [3,1,2,4] => 0
{{1,4},{2,3}}
=> [4,3,2,1] => [4,1,2,3] => [4,1,2,3] => 0
{{1},{2,3,4}}
=> [1,3,4,2] => [1,4,3,2] => [1,4,3,2] => 0
{{1,4},{2},{3}}
=> [4,2,3,1] => [4,3,1,2] => [4,3,1,2] => 0
{{1},{2,4},{3}}
=> [1,4,3,2] => [1,4,2,3] => [1,4,2,3] => 0
{{1},{2},{3},{4}}
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,3,4,5}}
=> [2,3,4,5,1] => [5,2,3,4,1] => [5,2,3,4,1] => ? = 2
{{1,2,3,5},{4}}
=> [2,3,5,4,1] => [5,2,3,1,4] => [5,2,3,1,4] => ? = 1
{{1,2,3},{4,5}}
=> [2,3,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 0
{{1,2,3},{4},{5}}
=> [2,3,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => ? = 0
{{1,2,4,5},{3}}
=> [2,4,3,5,1] => [5,2,4,3,1] => [5,2,4,3,1] => ? = 1
{{1,2,4},{3,5}}
=> [2,4,5,1,3] => [3,2,5,4,1] => [3,2,5,4,1] => ? = 2
{{1,2,4},{3},{5}}
=> [2,4,3,1,5] => [4,2,1,3,5] => [4,2,1,3,5] => ? = 0
{{1,2,5},{3,4}}
=> [2,5,4,3,1] => [5,2,1,3,4] => [5,2,1,3,4] => ? = 0
{{1,2},{3,4,5}}
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 0
{{1,2,5},{3},{4}}
=> [2,5,3,4,1] => [5,2,4,1,3] => [5,2,4,1,3] => ? = 1
{{1,2},{3,5},{4}}
=> [2,1,5,4,3] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 0
{{1,3,4,5},{2}}
=> [3,2,4,5,1] => [5,3,2,4,1] => [5,3,2,4,1] => ? = 1
{{1,3,4},{2,5}}
=> [3,5,4,1,2] => [2,5,3,1,4] => [2,5,3,1,4] => ? = 2
{{1,3,4},{2},{5}}
=> [3,2,4,1,5] => [4,3,2,1,5] => [4,3,2,1,5] => ? = 0
{{1,3,5},{2,4}}
=> [3,4,5,2,1] => [5,1,3,4,2] => [5,1,3,4,2] => ? = 2
{{1,3},{2,4,5}}
=> [3,4,1,5,2] => [4,5,3,1,2] => [4,5,3,1,2] => ? = 2
{{1,3,5},{2},{4}}
=> [3,2,5,4,1] => [5,3,2,1,4] => [5,3,2,1,4] => ? = 0
{{1,3},{2,5},{4}}
=> [3,5,1,4,2] => [4,5,3,2,1] => [4,5,3,2,1] => ? = 2
{{1,3},{2},{4,5}}
=> [3,2,1,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 0
{{1,3},{2},{4},{5}}
=> [3,2,1,4,5] => [3,1,2,4,5] => [3,1,2,4,5] => ? = 0
{{1,4,5},{2,3}}
=> [4,3,2,5,1] => [5,4,2,3,1] => [5,4,2,3,1] => ? = 0
{{1,4},{2,3,5}}
=> [4,3,5,1,2] => [2,5,4,3,1] => [2,5,4,3,1] => ? = 2
{{1,4},{2,3},{5}}
=> [4,3,2,1,5] => [4,1,2,3,5] => [4,1,2,3,5] => ? = 0
{{1,5},{2,3,4}}
=> [5,3,4,2,1] => [5,1,4,2,3] => [5,1,4,2,3] => ? = 1
{{1},{2,3,4},{5}}
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 0
{{1,5},{2,3},{4}}
=> [5,3,2,4,1] => [5,4,2,1,3] => [5,4,2,1,3] => ? = 0
{{1},{2,3,5},{4}}
=> [1,3,5,4,2] => [1,5,3,2,4] => [1,5,3,2,4] => 0
{{1,4,5},{2},{3}}
=> [4,2,3,5,1] => [5,3,4,2,1] => [5,3,4,2,1] => ? = 1
{{1,4},{2,5},{3}}
=> [4,5,3,1,2] => [2,5,1,4,3] => [2,5,1,4,3] => ? = 2
{{1,4},{2},{3,5}}
=> [4,2,5,1,3] => [3,4,5,2,1] => [3,4,5,2,1] => ? = 2
{{1,5},{2,4},{3}}
=> [5,4,3,2,1] => [5,1,2,3,4] => [5,1,2,3,4] => ? = 0
{{1},{2,4,5},{3}}
=> [1,4,3,5,2] => [1,5,4,3,2] => [1,5,4,3,2] => 0
{{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => [1,4,2,3,5] => [1,4,2,3,5] => 0
{{1,5},{2},{3,4}}
=> [5,2,4,3,1] => [5,4,1,3,2] => [5,4,1,3,2] => ? = 0
{{1},{2,5},{3,4}}
=> [1,5,4,3,2] => [1,5,2,3,4] => [1,5,2,3,4] => 0
{{1},{2},{3,4,5}}
=> [1,2,4,5,3] => [1,2,5,4,3] => [1,2,5,4,3] => 0
{{1,5},{2},{3},{4}}
=> [5,2,3,4,1] => [5,3,4,1,2] => [5,3,4,1,2] => ? = 1
{{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => [1,2,5,3,4] => [1,2,5,3,4] => 0
{{1},{2},{3},{4},{5}}
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
{{1,2,3,4,5,6}}
=> [2,3,4,5,6,1] => [6,2,3,4,5,1] => [6,2,3,4,5,1] => ? = 3
{{1,2,3,4,6},{5}}
=> [2,3,4,6,5,1] => [6,2,3,4,1,5] => [6,2,3,4,1,5] => ? = 2
{{1,2,3,5,6},{4}}
=> [2,3,5,4,6,1] => [6,2,3,5,4,1] => [6,2,3,5,4,1] => ? = 2
{{1,2,3,5},{4},{6}}
=> [2,3,5,4,1,6] => [5,2,3,1,4,6] => [5,2,3,1,4,6] => ? = 1
{{1,2,3,6},{4,5}}
=> [2,3,6,5,4,1] => [6,2,3,1,4,5] => [6,2,3,1,4,5] => ? = 1
{{1,2,3},{4,5,6}}
=> [2,3,1,5,6,4] => [3,2,1,6,5,4] => [3,2,1,6,5,4] => ? = 0
{{1,2,3},{4,5},{6}}
=> [2,3,1,5,4,6] => [3,2,1,5,4,6] => [3,2,1,5,4,6] => ? = 0
{{1,2,3},{4,6},{5}}
=> [2,3,1,6,5,4] => [3,2,1,6,4,5] => [3,2,1,6,4,5] => ? = 0
{{1,2,3},{4},{5,6}}
=> [2,3,1,4,6,5] => [3,2,1,4,6,5] => [3,2,1,4,6,5] => ? = 0
{{1,2,3},{4},{5},{6}}
=> [2,3,1,4,5,6] => [3,2,1,4,5,6] => [3,2,1,4,5,6] => ? = 0
{{1,2,4,5,6},{3}}
=> [2,4,3,5,6,1] => [6,2,4,3,5,1] => [6,2,4,3,5,1] => ? = 2
{{1,2,4,5},{3},{6}}
=> [2,4,3,5,1,6] => [5,2,4,3,1,6] => [5,2,4,3,1,6] => ? = 1
{{1,2,4,6},{3},{5}}
=> [2,4,3,6,5,1] => [6,2,4,3,1,5] => [6,2,4,3,1,5] => ? = 1
{{1,2,4},{3},{5,6}}
=> [2,4,3,1,6,5] => [4,2,1,3,6,5] => [4,2,1,3,6,5] => ? = 0
{{1,2,4},{3},{5},{6}}
=> [2,4,3,1,5,6] => [4,2,1,3,5,6] => [4,2,1,3,5,6] => ? = 0
{{1,2,5,6},{3,4}}
=> [2,5,4,3,6,1] => [6,2,5,3,4,1] => [6,2,5,3,4,1] => ? = 1
{{1,2,5},{3,4},{6}}
=> [2,5,4,3,1,6] => [5,2,1,3,4,6] => [5,2,1,3,4,6] => ? = 0
{{1,2},{3,4,5},{6}}
=> [2,1,4,5,3,6] => [2,1,5,4,3,6] => [2,1,5,4,3,6] => ? = 0
{{1,2},{3,4,6},{5}}
=> [2,1,4,6,5,3] => [2,1,6,4,3,5] => [2,1,6,4,3,5] => ? = 0
Description
The number of occurrences of a type-B 231 pattern in a signed permutation.
For a signed permutation π∈Hn, a triple −n≤i<j<k≤n is an occurrence of the type-B 231 pattern, if 1≤j<k, π(i)<π(j) and π(i) is one larger than π(k), i.e., π(i)=π(k)+1 if π(k)≠−1 and π(i)=1 otherwise.
Matching statistic: St001491
Mp00080: Set partitions —to permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00114: Permutations —connectivity set⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 15% ●values known / values provided: 15%●distinct values known / distinct values provided: 25%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00114: Permutations —connectivity set⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 15% ●values known / values provided: 15%●distinct values known / distinct values provided: 25%
Values
{{1}}
=> [1] => [1] => => ? = 0 + 1
{{1,2}}
=> [2,1] => [2,1] => 0 => ? = 0 + 1
{{1},{2}}
=> [1,2] => [1,2] => 1 => 1 = 0 + 1
{{1,2,3}}
=> [2,3,1] => [2,3,1] => 00 => ? = 0 + 1
{{1,3},{2}}
=> [3,2,1] => [3,2,1] => 00 => ? = 0 + 1
{{1},{2},{3}}
=> [1,2,3] => [1,3,2] => 10 => 1 = 0 + 1
{{1,2,3,4}}
=> [2,3,4,1] => [2,4,3,1] => 000 => ? = 1 + 1
{{1,2,3},{4}}
=> [2,3,1,4] => [2,4,1,3] => 000 => ? = 0 + 1
{{1,2,4},{3}}
=> [2,4,3,1] => [2,4,3,1] => 000 => ? = 0 + 1
{{1,3,4},{2}}
=> [3,2,4,1] => [3,2,4,1] => 000 => ? = 0 + 1
{{1,3},{2,4}}
=> [3,4,1,2] => [3,4,1,2] => 000 => ? = 2 + 1
{{1,3},{2},{4}}
=> [3,2,1,4] => [3,2,1,4] => 001 => 1 = 0 + 1
{{1,4},{2,3}}
=> [4,3,2,1] => [4,3,2,1] => 000 => ? = 0 + 1
{{1},{2,3,4}}
=> [1,3,4,2] => [1,4,3,2] => 100 => 1 = 0 + 1
{{1,4},{2},{3}}
=> [4,2,3,1] => [4,2,3,1] => 000 => ? = 0 + 1
{{1},{2,4},{3}}
=> [1,4,3,2] => [1,4,3,2] => 100 => 1 = 0 + 1
{{1},{2},{3},{4}}
=> [1,2,3,4] => [1,4,3,2] => 100 => 1 = 0 + 1
{{1,2,3,4,5}}
=> [2,3,4,5,1] => [2,5,4,3,1] => 0000 => ? = 2 + 1
{{1,2,3,5},{4}}
=> [2,3,5,4,1] => [2,5,4,3,1] => 0000 => ? = 1 + 1
{{1,2,3},{4,5}}
=> [2,3,1,5,4] => [2,5,1,4,3] => 0000 => ? = 0 + 1
{{1,2,3},{4},{5}}
=> [2,3,1,4,5] => [2,5,1,4,3] => 0000 => ? = 0 + 1
{{1,2,4,5},{3}}
=> [2,4,3,5,1] => [2,5,4,3,1] => 0000 => ? = 1 + 1
{{1,2,4},{3,5}}
=> [2,4,5,1,3] => [2,5,4,1,3] => 0000 => ? = 2 + 1
{{1,2,4},{3},{5}}
=> [2,4,3,1,5] => [2,5,4,1,3] => 0000 => ? = 0 + 1
{{1,2,5},{3,4}}
=> [2,5,4,3,1] => [2,5,4,3,1] => 0000 => ? = 0 + 1
{{1,2},{3,4,5}}
=> [2,1,4,5,3] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
{{1,2,5},{3},{4}}
=> [2,5,3,4,1] => [2,5,4,3,1] => 0000 => ? = 1 + 1
{{1,2},{3,5},{4}}
=> [2,1,5,4,3] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
{{1,3,4,5},{2}}
=> [3,2,4,5,1] => [3,2,5,4,1] => 0000 => ? = 1 + 1
{{1,3,4},{2,5}}
=> [3,5,4,1,2] => [3,5,4,1,2] => 0000 => ? = 2 + 1
{{1,3,4},{2},{5}}
=> [3,2,4,1,5] => [3,2,5,1,4] => 0000 => ? = 0 + 1
{{1,3,5},{2,4}}
=> [3,4,5,2,1] => [3,5,4,2,1] => 0000 => ? = 2 + 1
{{1,3},{2,4,5}}
=> [3,4,1,5,2] => [3,5,1,4,2] => 0000 => ? = 2 + 1
{{1,3,5},{2},{4}}
=> [3,2,5,4,1] => [3,2,5,4,1] => 0000 => ? = 0 + 1
{{1,3},{2,5},{4}}
=> [3,5,1,4,2] => [3,5,1,4,2] => 0000 => ? = 2 + 1
{{1,3},{2},{4,5}}
=> [3,2,1,5,4] => [3,2,1,5,4] => 0010 => 1 = 0 + 1
{{1,3},{2},{4},{5}}
=> [3,2,1,4,5] => [3,2,1,5,4] => 0010 => 1 = 0 + 1
{{1,4,5},{2,3}}
=> [4,3,2,5,1] => [4,3,2,5,1] => 0000 => ? = 0 + 1
{{1,4},{2,3,5}}
=> [4,3,5,1,2] => [4,3,5,1,2] => 0000 => ? = 2 + 1
{{1,4},{2,3},{5}}
=> [4,3,2,1,5] => [4,3,2,1,5] => 0001 => 1 = 0 + 1
{{1,5},{2,3,4}}
=> [5,3,4,2,1] => [5,3,4,2,1] => 0000 => ? = 1 + 1
{{1},{2,3,4},{5}}
=> [1,3,4,2,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1,5},{2,3},{4}}
=> [5,3,2,4,1] => [5,3,2,4,1] => 0000 => ? = 0 + 1
{{1},{2,3,5},{4}}
=> [1,3,5,4,2] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1,4,5},{2},{3}}
=> [4,2,3,5,1] => [4,2,5,3,1] => 0000 => ? = 1 + 1
{{1,4},{2,5},{3}}
=> [4,5,3,1,2] => [4,5,3,1,2] => 0000 => ? = 2 + 1
{{1,4},{2},{3,5}}
=> [4,2,5,1,3] => [4,2,5,1,3] => 0000 => ? = 2 + 1
{{1,5},{2,4},{3}}
=> [5,4,3,2,1] => [5,4,3,2,1] => 0000 => ? = 0 + 1
{{1},{2,4,5},{3}}
=> [1,4,3,5,2] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1,5},{2},{3,4}}
=> [5,2,4,3,1] => [5,2,4,3,1] => 0000 => ? = 0 + 1
{{1},{2,5},{3,4}}
=> [1,5,4,3,2] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1},{2},{3,4,5}}
=> [1,2,4,5,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1,5},{2},{3},{4}}
=> [5,2,3,4,1] => [5,2,4,3,1] => 0000 => ? = 1 + 1
{{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1},{2},{3},{4},{5}}
=> [1,2,3,4,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
{{1,2,3,4,5,6}}
=> [2,3,4,5,6,1] => [2,6,5,4,3,1] => 00000 => ? = 3 + 1
{{1,2,3,4,6},{5}}
=> [2,3,4,6,5,1] => [2,6,5,4,3,1] => 00000 => ? = 2 + 1
{{1,2,3,5,6},{4}}
=> [2,3,5,4,6,1] => [2,6,5,4,3,1] => 00000 => ? = 2 + 1
{{1,2,3,5},{4},{6}}
=> [2,3,5,4,1,6] => [2,6,5,4,1,3] => 00000 => ? = 1 + 1
{{1,2,3,6},{4,5}}
=> [2,3,6,5,4,1] => [2,6,5,4,3,1] => 00000 => ? = 1 + 1
{{1,2,3},{4,5,6}}
=> [2,3,1,5,6,4] => [2,6,1,5,4,3] => 00000 => ? = 0 + 1
{{1,2,3},{4,5},{6}}
=> [2,3,1,5,4,6] => [2,6,1,5,4,3] => 00000 => ? = 0 + 1
{{1,2,3},{4,6},{5}}
=> [2,3,1,6,5,4] => [2,6,1,5,4,3] => 00000 => ? = 0 + 1
{{1,2,3},{4},{5,6}}
=> [2,3,1,4,6,5] => [2,6,1,5,4,3] => 00000 => ? = 0 + 1
{{1,2,3},{4},{5},{6}}
=> [2,3,1,4,5,6] => [2,6,1,5,4,3] => 00000 => ? = 0 + 1
{{1,2,4,5,6},{3}}
=> [2,4,3,5,6,1] => [2,6,5,4,3,1] => 00000 => ? = 2 + 1
{{1,2,4,5},{3},{6}}
=> [2,4,3,5,1,6] => [2,6,5,4,1,3] => 00000 => ? = 1 + 1
{{1,2,4,6},{3},{5}}
=> [2,4,3,6,5,1] => [2,6,5,4,3,1] => 00000 => ? = 1 + 1
Description
The number of indecomposable projective-injective modules in the algebra corresponding to a subset.
Let An=K[x]/(xn).
We associate to a nonempty subset S of an (n-1)-set the module MS, which is the direct sum of An-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 MS. 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.
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!