We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other objects of study are bodies obtained as intersections of finitely many balls of the same radius, called ball-polyhedra. We find analogues of several results on convex polyhedral sets for ball-polyhedra.

Abstract. In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean n-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are translates, or reflected copies of each other about a common point or a hyperplane containing it. In particular, we give a proof of a related conjecture of Rogers and Shephard.

Abstract. The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M C of Morse-Smale functions on S 2 . Here we show that even M C exhibits the complexity known for general Morse-Smale functions on S 2 by exhausting all combinatorial possibilities: every 2-colored quadrangulation of the sphere is isomorphic to a suitably represented Morse-Smale complex associated with a function in M C (and vice versa). We prove our claim by an inductive algorithm, starting from the path graph P 2 and generating convex bodies corresponding to quadrangulations with increasing number of vertices by performing each combinatorially possible vertex splitting by a convexity-preserving local manipulation of the surface. Since convex bodies carrying Morse-Smale complexes isomorphic to P 2 exist, this algorithm not only proves our claim but also generalizes the known classification scheme in [36]. Our expansion algorithm is essentially the dual procedure to the algorithm presented by Edelsbrunner et al. in [21], producing a hierarchy of increasingly coarse Morse-Smale complexes. We point out applications to pebble shapes.

Abstract. In our earlier work [7] we identified the types and numbers of static equilibrium points of solids arising from fine, equidistant n-discretrizations of smooth, convex surfaces. We showed that such discretizations carry equilibrium points on two scales: the local scale corresponds to the discretization, the global scale to the original, smooth surface. In [7] we showed that as n approaches infinity, the number of local equilibria fluctuate around specific values which we call the imaginary equilibrium indices associated with the approximated smooth surface. Here we show how the number of global equilibria can be interpreted, defined and computed on such discretizations. Our results are relevant from the point of view of natural pebble surfaces, they admit a comparison between field data based on hand measurements and laboratory data based on 3D scans.

We define the mechanical complexity C(P) of a 3-dimensional convex polyhedron P , interpreted as a homogeneous solid, as the difference between the total number of its faces, edges and vertices and the number of its static equilibria; and the mechanical complexity C(S, U) of primary equilibrium classes (S, U) E with S stable and U unstable equilibria as the infimum of the mechanical complexity of all polyhedra in that class. We prove that the mechanical complexity of a class (S, U) E with S, U > 1 is the minimum of 2(f + v − S − U) over all polyhedral pairs (f, v), where a pair of integers is called a polyhedral * The authors acknowledge the support of the NKFIH Hungarian Research Fund grant 119245 and of grant BME FIKP-VÍZ by EMMI. The authors thank Mr. Otto Albrecht for backing the prize for the complexity of the Gömböc-class. Any solution should be sent to the corresponding author as an accepted publication in a mathematics journal of worldwide reputation and it must also have general acceptance in the mathematics community two years after. The authors are indebted to Dr. Norbert Krisztián Kovács for his invaluable advice and help in printing the 9 tetrahedra and 7 pentahedra, and the two referees for their valuable comments and one of them for posing Problems 5.2 and 5.4. † Corresponding author. The author has been supported by the Bolyai Fellowship of the Hungarian Academy of Sciences and partially supported by the UNKP-19-4 New National Excellence Program of the Ministry of Human Capacities.

In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the d-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with d + 2 vertices in every dimension, and for polytopes with d + 3 vertices in odd dimensions. For polytopes with d + 3 vertices in even dimensions we give a partial solution.2010 Mathematics Subject Classification. 52B60, 52A40, 52A38.

We show that under the Eikonal abrasion model, prescribing uniform normal speed in the direction of the inward surface normal, the isoperimetric quotient of a convex shape is decreasing monotonically.2010 Mathematics Subject Classification. 35Q85, 35Q86, 52A39.

Let C ⊂ R n be a convex body. We introduce two notions of convexity associated to C. A set K is C-ball convex if it is the intersection of translates of C, or it is either ∅, or R n . The C-ball convex hull of two points is called a C-spindle. K is C-spindle convex if it contains the C-spindle of any pair of its points. We investigate how some fundamental properties of conventional convex sets can be adapted to C-spindle convex and C-ball convex sets. We study separation properties and Carathéodory numbers of these two convexity structures. We investigate the basic properties of arc-distance, a quantity defined by a centrally symmetric planar disc C, which is the length of an arc of a translate of C, measured in the C-norm, that connects two points. Then we characterize those n-dimensional convex bodies C for which every Cball convex set is the C-ball convex hull of finitely many points. Finally, we obtain a stability result concerning covering numbers of some C-ball convex sets, and diametrically maximal sets in n-dimensional Minkowski spaces.Mathematics Subject Classification (2010). 52A30; 52A35; 52C17.