David Futer & Andrei Gnepp & David McMath & Brian A. Munson & Ting Ng & Sang-Hyoun Pahk & Cara Yoder
Abstract
We model interfaces between immiscible
fluids as cost-minimizing networks, where
“cost” is a weighted length. We consider conjectured
necessary and suficient conditions for when a planar cone
is minimizing. In some cases we give a proof; in other cases we
provide a counterexample.