Related papers: Numerically computed Double, Triple, and Quadruple…

Using Brakke's Evolver, we numerically verify previous conjectures for optimal double bubbles for density $r^p$ in $R^3$ and our own new conjectures for triple bubbles.

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…

In this paper we address the global stability problem for double-bubbles in the plane. This is accomplished by combining the "improved convergence theorem" for planar clusters developed in arXiv:1409.6652 with an ad hoc analysis of the…

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 characterize the critical points of the double bubble problem in $\mathbb{R}^n$ and the triple bubble problem in $\mathbb{R}^3$, in the case the bubbles are convex.

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 consider three-dimensional clusters of identical bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for…

The generalized soap bubble problem seeks the least perimeter way to enclose and separate n given volumes in R^m. We study the possible configurations for perimeter minimizing bubble complexes enclosing more than two regions. We prove that…

We describe a quantitative construction of almost-normal diffeomorphisms between embedded orientable manifolds with boundary to be used in the study of geometric variational problems with stratified singular sets. We then apply this…

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…

Sullivan's multi-bubble isoperimetric conjectures in $n$-dimensional Euclidean and spherical spaces assert that standard bubbles uniquely minimize total perimeter among all $q-1$ bubbles enclosing prescribed volume, for any $q \leq n+2$.…

In this report we discuss and propose a correction to a convergence and stability issue occurring in the work of Da et al.[2015], in which they proposed a numerical model to simulate soap bubbles.

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 use symplectic techniques to obtain partial results on Mahler's conjecture about the product of the volume of a convex body and the volume of its polar. We confirm the conjecture for hyperplane sections or projections of $\ell_p$-balls…

Let $\Delta_n$ and $Q_n$ denote the regular $n$-simplex of side length $\sqrt{2}$ embedded in $\mathbb{R}^{n+1}$ and the volume one cube in $\mathbb{R}^n$, respectively. We derive a closed-form formula for the hyperplane volume projections…

We consider the cosmology of a 3-brane universe, in a five dimensional space time (Bulk). We present some solutions to the five-dimensional Einstein equation, where a perfect fluid is confined to the 3-brane. We investigate the evolution of…

The least-area hypersurface enclosing and separating two given volumes in R^n is the standard double bubble.

A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.

We present a unified numerical method to determine the shapes of multiple Hele-Shaw bubbles in steady motion, and in the absence of surface tension, in three planar domains: free space, the upper half-plane, and an infinite channel. Our…

We present numerical simulations that allow us to compute the number of ways in which $N$ particles can pack into a given volume $V$. Our technique modifies the method of Xu et al. (Phys. Rev. Lett. 106, 245502 (2011)) and outperforms…