Monotonicity of leaf counts for large multiplicity

Prove that the number of leaf numerical semigroups of multiplicity m and genus k is at most the number with the same multiplicity and genus k+1 whenever k≥m−1 and m≥6.

Background

The computations show that leaf counts are not universally monotone for small multiplicity. The authors propose monotonicity under the restriction m≥6.