相关论文: Planar Soap Bubbles
A computer study of clusters of up to 200,000 equal-area bubbles shows for the first time that rounding conjectured optimal hexagonal planar soap bubble clusters reduces perimeter.
Soap bubbles and foams have been extensively studied by scientists, engineers, and mathematicians as models for organisms and materials, with applications ranging from extinguishing fires to mining to baking bread. Here we provide some…
Soap bubbles are thin liquid films enclosing a fixed volume of air. Since the surface tension is typically assumed to be the only responsible for conforming the soap bubble shape, the realized bubble surfaces are always minimal area ones.…
The classic double bubble theorem says that the least-perimeter way to enclose and separate two prescribed volumes in $\mathbb{R}^N$ is the standard double bubble. We seek the optimal double bubble in $\mathbb{R}^N$ with density, which we…
We present a conjecture, based on computational results, on the area minimizing way to enclose and separate two arbitrary volumes in the flat cubic 3-torus. For comparable small volumes, we prove that an area minimizing double bubble in the…
The classical isoperimetric inequality in R^3 states that the surface of smallest area enclosing a given volume is a sphere. We show that the least area surface enclosing two equal volumes is a double bubble, a surface made of two pieces of…
We prove that the standard double bubble provides the least-area way to enclose and separate two regions of prescribed volume in \Bbb R^3.
We study the soap film capillarity problem, in which soap films are modeled as sets of least perimeter among those having prescribed (small) volume and satisfying a topological spanning condition. When the given boundary is the closed…
In the last two centuries and more particularly in the last decades, the geometry of foams has become an important research domain, in mathematics, physics, material sciences and biology. Most of the simplest geometrical observations of…
We study the double bubble problem where the perimeter is taken with respect to the hexagonal norm, i.e. the norm whose unit circle in $\mathbb{R}^2$ is the regular hexagon. We provide an elementary proof for the existence of minimizing…
In 1993 Foisy et al. proved that the optimal Euclidean planar double bubble---the least-perimeter way to enclose and separate two given areas---is three circular arcs meeting at 120 degrees. We consider the plane with density $r^p$, joining…
The least-area hypersurface enclosing and separating two given volumes in R^n is the standard double bubble.
Plateau's soap film problem is to find a surface of least area spanning a given boundary. We begin with a compact orientable $(n-2)$-dimensional submanifold $M$ of $\R^n$. If $M$ is connected, we say a compact set $X$ "spans" $M$ if $X$…
All children enjoy blowing soap bubbles that also show up in our bath and when we wash dishes. We analyze the thinning and breaking of soap bubble neck when it is stretched. To contrast with the more widely studied film whose boundaries are…
It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…
We prove that for a symmetric, strictly log-convex density on the real line, there are four possible types of perimeter-minimizing triple bubbles. This extends the work of Bongiovanni et al., which shows that there are two possible types of…
We characterize the graphs formed by two-dimensional soap bubbles as being exactly the 3-regular bridgeless planar multigraphs. Our characterization combines a local characterization of soap bubble graphs in terms of the curvatures of arcs…
We investigate the optimal arrangements of two planar sets of given volume which are minimizing the $\ell_1$ double-bubble interaction functional. The latter features a competition between the minimization of the $\ell_1$ perimeters of the…
We study the regularity of minimizers for a variant of the soap bubble cluster problem: \begin{align*} \min \sum_{\ell=0}^N c_{\ell} P( S_\ell)\,, \end{align*} where $c_\ell>0$, among partitions $\{S_0,\dots,S_N,G\}$ of $\mathbb{R}^2$…
We prove that the optimal way to enclose and separate four planar regions with equal area using the less possible perimeter requires all regions to be connected. Moreover, the topology of such optimal clusters is uniquely determined.