[math-fun] corefinement for a muffin subproblem

I found an interesting corefinement family that arises in finding the second smallest piece size for certain muffin problems with r = m/p < 3/2. I'll show how it arises later, and proffer the corefinement problem now in case anyone wants to chew on it. Find the corefinement of { A, B } with maximal lexicographic order of piece sizes, where A = { [1]*(u+v)] } B = { [(u+v)/2v]*v, [(u+v)/2u]*u } This notation means B consists of v parts of size (u+v)/2v and u parts of size (u+v)/2u.