English
Related papers

Related papers: On a normed version of a Rogers-Shephard type prob…

200 papers

In 3-dimensional hyperbolic geometry, the classical Schlafli formula expresses the variation of the volume of a hyperbolic polyhedron in terms of the length of its edges and of the variation of its dihedral angles. We prove a similar…

dg-ga · Mathematics 2008-02-03 Francis Bonahon

The Busemann-Petty problem asks whether origin-symmetric convex bodies in $\mathbb{R}^n$ with smaller central hyperplane sections necessarily have smaller $n$-dimensional volume. It is known that the answer to this problem is affirmative if…

Functional Analysis · Mathematics 2007-05-23 V. Yaskin

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Computational Geometry · Computer Science 2023-03-16 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

In 1944, Santal\'o asked about the average number of normals through a point of a given convex body. Since then, numerous results appeared in the literature about this problem. The aim of this paper is to give a concise summary of these…

Metric Geometry · Mathematics 2014-06-04 Gábor Domokos , Zsolt Lángi

We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…

Metric Geometry · Mathematics 2021-11-16 Debsoumya Chakraborti , Tomasz Tkocz , Beatrice-Helen Vritsiou

Motivated by a problem on the 67th William Lowell Putnam Mathematical Competition, we will summarize three different solutions found on a website. This Putman problem is a special case of Sylvester's four point problem! Suppose four points…

Metric Geometry · Mathematics 2021-09-14 Sheree Sharpe

We show that the mixed volumes of arbitrary convex bodies are equal to mixed multiplicities of graded families of monomial ideals, and to normalized limits of mixed multiplicities of monomial ideals. This result evinces the close relation…

Commutative Algebra · Mathematics 2021-02-18 Yairon Cid-Ruiz , Jonathan Montaño

The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…

Metric Geometry · Mathematics 2022-02-04 Yair Shenfeld , Ramon van Handel

In this work we present a theorem regarding two convex bodies $K_1, K_2\subset \mathbb{R}^{n}$, $n\geq 3$, and two families of sections of them, given by two families of tangent planes of two spheres $S_i\subset \textrm{int}\textrm{ } K_i$,…

Metric Geometry · Mathematics 2025-08-21 Efren Morales-Amaya

The classical Busemann-Petty problem asks whether smaller central hyperplane sections of origin-symmetric convex bodies necessarily imply smaller total volume. Zvavitch studied this question for arbitrary measures with continuous even…

Metric Geometry · Mathematics 2026-01-06 Daniel Galicer , Julián Haddad , Joaquín Singer

Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…

Optimization and Control · Mathematics 2019-10-08 Emily Speakman , Gennadiy Averkov

The complex Busemann-Petty problem asks whether origin symmetric convex bodies in $\C^n$ with smaller central hyperplane sections necessarily have smaller volume. We prove that the answer is affirmative if $n\le 3$ and negative if $n\ge 4.$

Functional Analysis · Mathematics 2007-07-27 A. Koldobsky , H. König , M. Zymonopoulou

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

The Busemann-Petty problem asks whether origin-symmetric convex bodies in real Euclidean n-space with smaller central hyperplane sections necessarily have smaller volume. The answer is affirmative for n less or equal to 4 and negative if n…

Classical Analysis and ODEs · Mathematics 2012-09-07 Susanna Dann

Examples are given of solutions of the planar N-body problem which remain the same for at least two systems of masses with the same sum and same center of mass. The least value of N achieved up to now with this property is 474, a number…

Dynamical Systems · Mathematics 2025-07-18 Dominique Bang , Alain Chenciner , Carles Simó

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

Computational Geometry · Computer Science 2023-07-04 Hyuk Jun Kweon , Honglin Zhu

A two-dimensional body moves through a rarefied medium; the collisions of the medium particles with the body are absolutely elastic. The body performs both translational and slow rotational motion. It is required to select the body, from a…

Optimization and Control · Mathematics 2007-05-23 Alexander Plakhov , Paulo D. F. Gouveia

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

Metric Geometry · Mathematics 2020-02-20 Viktória Földvári

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy