Let κ < λ be regular uncountable cardinals. Using a finite support iteration (in fact a matrix iteration) of ccc posets we obtain the consistency of 𝔟=𝔞=κ < 𝔰=λ. If μ is a measurable cardinal and μ < κ <λ, then using similar techniques we obtain the consistency of 𝔟=κ < 𝔞=𝔰=λ.
"Mad families, splitting families and large continuum." J. Symbolic Logic 76 (1) 198 - 208, March 2011. https://doi.org/10.2178/jsl/1294170995