Papers
Topics
Authors
Recent
Search
2000 character limit reached

The robustness of equilibria on convex solids

Published 17 Jan 2013 in math.MG, math-ph, math.DS, and math.MP | (1301.4031v1)

Abstract: We examine the minimal magnitude of perturbations necessary to change the number NN of static equilibrium points of a convex solid KK. We call the normalized volume of the minimally necessary truncation robustness and we seek shapes with maximal robustness for fixed values of NN. While the upward robustness (referring to the increase of NN) of smooth, homogeneous convex solids is known to be zero, little is known about their downward robustness. The difficulty of the latter problem is related to the coupling (via integrals) between the geometry of the hull $\bd K$ and the location of the center of gravity GG. Here we first investigate two simpler, decoupled problems by examining truncations of $\bd K$ with GG fixed, and displacements of GG with $\bd K$ fixed, leading to the concept of external \rm and internal \rm robustness, respectively. In dimension 2, we find that for any fixed number N=2SN=2S, the convex solids with both maximal external and maximal internal robustness are regular SS-gons. Based on this result we conjecture that regular polygons have maximal downward robustness also in the original, coupled problem. We also show that in the decoupled problems, 3-dimensional regular polyhedra have maximal internal robustness, however, only under additional constraints. Finally, we prove results for the full problem in case of 3 dimensional solids. These results appear to explain why monostatic pebbles (with either one stable, or one unstable point of equilibrium) are found so rarely in Nature.

Authors (2)
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.