When Soap Bubbles Collide
classification
🧮 math.DG
keywords
bubblessoapboundedcollideconjecturescoveringdiameterfill
read the original abstract
Can you fill R^n with a froth of "soap bubbles" that meet at most n at a time? Not if they have bounded diameter, as follows from Lebesgue's Covering Theorem. We provide some related results and conjectures.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.