Re: [math-fun] muffin problem

One might view Mike Reid's "T(m,n)" version of the muffin problem in the broader context of finding the coarsest common refinement of two partitions of the number 1, where "coarsest" means "with smallest part as large as possible". However, David Eppstein tells me that even deciding whether one partition is a refinement of another partition is NP-hard; it has bin packing (or 3-partition) as a special case. Jim Propp