Reaping Numbers of Boolean Algebras

A subset A of a Boolean algebra B is said to be (n,m)-reapedif there is a partition of unity p B of size n such that |{b p:b a 0}| m for all a A. The reaping number r_n,m (B) ofa Boolean algebra B is the minimum cardinality of a set A B{0}which cannot be (n,m)-reaped. It is shown that for each n, thereis a Boolean algebra B such that r_n+1,2(B) r_n,2(B). Also, {r_n,m(B):mn } consists of at most two consecutive cardinals. The existenceof a Boolean algebra B such that r_n,m (B) r_n',m' (B) is equivalentto a statement in finite combinatorics which is also discussed.