Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userProof of the Double Bubble Conjecture in R^n
203
0
0.0
(
0
)
Authors
Ben W. Reichardt
Ask ChatGPT about the research
No Arabic abstract
The least-area hypersurface enclosing and separating two given volumes in R^n is the standard double bubble.
rate research
Read More
A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all 5-distance sets in $mathbb{R}^3$ is 20, and every $5$-distance set in $mathbb{R}^3$ with $20$ points is similar to the vertex set of a regular dodecahedron.
In 1969, Fejes Toth conjectured that in Euclidean 3-space any packing of equal balls such that each ball is touched by twelve others consists of hexagonal layers. This article verifies this conjecture.
For a compact convex set F in R^n, with the origin in its interior, we present a formula to compute the curvature at a fixed point on its boundary, in the direction of any tangent vector. This formula is equivalent to the existing ones, but it is easier to apply.
An $n$-correct node set $mathcal{X}$ is called $GC_n$ set if the fundamental polynomial of each node is a product of $n$ linear factors. In 1982 Gasca and Maeztu conjectured that for every $GC_n$ set there is a line passing through $n+1$ of its nodes.So far, this conjecture has been confirmed only for $nle 5.$ The case $n = 4,$ was first proved by J. R. Bush in 1990. Several other proofs have been published since then. For the case $n=5$ there is only one proof: by H. Hakopian, K. Jetter and G. Zimmermann (Numer Math $127,685-713, 2014$). Here we present a second, much shorter and easier proof.
We show that a jammed packing of disks with generic radii, in a generic container, is such that the minimal number of contacts occurs and there is only one dimension of equilibrium stresses. We also point out some connections to packings with different radii and results in the theory of circle packings whose graph forms a triangulation of a given topological surface. We also point out a counterexample, due to F. Nazarov, to a previous conjecture that that triangulated packings with fixed numbers of disks with fixed numbers of disks for each radius claiming that such packings were the most dense.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
