Estimating B(4,3)
B(4,3) = 11 after searching all 16 possibilities.
Reorgnizing dichotomies of B(4,3)
Check for B(3,3)
α+β : # of different x1,x2,x3 combinations, ignoring x4 , must not shatter these 3 points, then α+β≤B(3,3)
Check for B(3,2)
α
: # of different
x1,x2,x3
combinations with
x4
pairing. So if any 2 points of
x1,x2,x3
are shatterd, when adding
x4
, it will shatter 3 points, so we cannot let any 2 points be shattered, meaning that we must have
α≤B(3,2)
Now we can get the upper bound.
Theorem
B(N,k)≤∑k−1i=0(Ni) (highest term is Nk−1 )
Then we have that m(N) is bounded by a poly(N) whose highest order is Nk−1 .
It can also be proved that the ≤ is acutally a = <script type="math/tex" id="MathJax-Element-2951">=</script>