Processing math: 50%

Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001398
Mapping
St001398: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 0
([],2)
 => 0
([(0,1)],2)
 => 0
([],3)
 => 0
([(1,2)],3)
 => 0
([(0,1),(0,2)],3)
 => 1
([(0,2),(2,1)],3)
 => 0
([(0,2),(1,2)],3)
 => 0
([],4)
 => 0
([(2,3)],4)
 => 0
([(1,2),(1,3)],4)
 => 1
([(0,1),(0,2),(0,3)],4)
 => 3
([(0,2),(0,3),(3,1)],4)
 => 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => 1
([(1,2),(2,3)],4)
 => 0
([(0,3),(3,1),(3,2)],4)
 => 2
([(1,3),(2,3)],4)
 => 0
([(0,3),(1,3),(3,2)],4)
 => 0
([(0,3),(1,3),(2,3)],4)
 => 0
([(0,3),(1,2)],4)
 => 0
([(0,3),(1,2),(1,3)],4)
 => 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => 2
([(0,3),(2,1),(3,2)],4)
 => 0
([(0,3),(1,2),(2,3)],4)
 => 0
([],5)
 => 0
([(3,4)],5)
 => 0
([(2,3),(2,4)],5)
 => 1
([(1,2),(1,3),(1,4)],5)
 => 3
([(0,1),(0,2),(0,3),(0,4)],5)
 => 6
([(0,2),(0,3),(0,4),(4,1)],5)
 => 5
([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => 4
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(4,2)],5)
 => 2
([(0,3),(0,4),(4,1),(4,2)],5)
 => 5
([(1,2),(1,3),(2,4),(3,4)],5)
 => 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 1
([(0,3),(0,4),(3,2),(4,1)],5)
 => 4
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => 4
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 4
([(2,3),(3,4)],5)
 => 0
([(1,4),(4,2),(4,3)],5)
 => 2
([(0,4),(4,1),(4,2),(4,3)],5)
 => 6
([(2,4),(3,4)],5)
 => 0
([(1,4),(2,4),(4,3)],5)
 => 0
([(0,4),(1,4),(4,2),(4,3)],5)
 => 3
([(1,4),(2,4),(3,4)],5)
 => 0
([(0,4),(1,4),(2,4),(4,3)],5)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => 0
([(0,4),(1,4),(2,3)],5)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => 1
Description
Number of subsets of size 3 of elements in a poset that form a "v". For a finite poset (P,≤), this is the number of sets \{x,y,z\} \in \binom{P}{3} that form a "v"-subposet (i.e., a subposet consisting of a bottom element covered by two incomparable elements).