Applications of convex geometry to Minkowski sums of m ellipsoids in ℝN: Closed-form parametric equations and volume bounds

2021 ◽  
pp. 2140009
Author(s):  
Gregory S. Chirikjian ◽  
Bernard Shiffman
Keyword(s):  
Closed Form ◽  
Convex Geometry ◽  
Convex Bodies ◽  
Minkowski Inequality ◽  
Dimensional Euclidean Space ◽  
Minkowski Sum ◽  
Principal Curvatures ◽  
Reverse Isoperimetric Inequality ◽  
Lower Volume ◽  
Minkowski Sums

General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of [Formula: see text] arbitrary ellipsoids in [Formula: see text]-dimensional Euclidean space. Expressions for the principal curvatures of these Minkowski sums are also derived. These results are then used to obtain upper and lower volume bounds for the Minkowski sum of ellipsoids in terms of their defining matrices; the lower bounds are sharper than the Brunn–Minkowski inequality. A reverse isoperimetric inequality for convex bodies is also given.

scholarly journals (Symplectic) leaves and (5d Higgs) branches in the Poly(go)nesian Tropical Rain Forest

2020 ◽  
Vol 2020 (11) ◽  
Author(s):  
Marieke van Beest ◽  
Antoine Bourget ◽  
Julius Eckhard ◽  
Sakura Schäfer-Nameki
Keyword(s):  
Rain Forest ◽  
Tropical Rain Forest ◽  
Gauge Theories ◽  
Edge Coloring ◽  
Field Theories ◽  
Minkowski Sum ◽  
Coulomb Branch ◽  
Superconformal Field Theories ◽  
Minkowski Sums ◽  
Symplectic Leaves

Abstract We derive the structure of the Higgs branch of 5d superconformal field theories or gauge theories from their realization as a generalized toric polygon (or dot diagram). This approach is motivated by a dual, tropical curve decomposition of the (p, q) 5-brane-web system. We define an edge coloring, which provides a decomposition of the generalized toric polygon into a refined Minkowski sum of sub-polygons, from which we compute the magnetic quiver. The Coulomb branch of the magnetic quiver is then conjecturally identified with the 5d Higgs branch. Furthermore, from partial resolutions, we identify the symplectic leaves of the Higgs branch and thereby the entire foliation structure. In the case of strictly toric polygons, this approach reduces to the description of deformations of the Calabi-Yau singularities in terms of Minkowski sums.

Prescribing Centro-Affine Curvature From One Convex Body to Another

2020 ◽  
Author(s):  
Alina Stancu
Keyword(s):  
Convex Body ◽  
Convex Bodies ◽  
Minkowski Inequality ◽  
Curvature Flow ◽  
Constant Volume ◽  
Convex Hypersurface ◽  
Strictly Convex ◽  
Initial Hypersurface ◽  
Affine Curvature ◽  
Convex Hypersurfaces

Abstract We study a curvature flow on smooth, closed, strictly convex hypersurfaces in $\mathbb{R}^n$, which commutes with the action of $SL(n)$. The flow shrinks the initial hypersurface to a point that, if rescaled to enclose a domain of constant volume, is a smooth, closed, strictly convex hypersurface in $\mathbb{R}^n$ with centro-affine curvature proportional, but not always equal, to the centro-affine curvature of a fixed hypersurface. We outline some consequences of this result for the geometry of convex bodies and the logarithmic Minkowski inequality.

A Note on Covering by Convex Bodies

2009 ◽  
Vol 52 (3) ◽  
pp. 361-365 ◽  
Author(s):  
Fejes Tóth Gábor
Keyword(s):  
Convex Body ◽  
Euclidean Space ◽  
Convex Bodies ◽  
Dimensional Euclidean Space ◽  
Classical Theorem ◽  
Lattice Arrangement

AbstractA classical theorem of Rogers states that for any convex body K in n-dimensional Euclidean space there exists a covering of the space by translates of K with density not exceeding n log n + n log log n + 5n. Rogers’ theorem does not say anything about the structure of such a covering. We show that for sufficiently large values of n the same bound can be attained by a covering which is the union of O(log n) translates of a lattice arrangement of K.

A conditional limit theorem for high-dimensional ℓᵖ-spheres

2018 ◽  
Vol 55 (4) ◽  
pp. 1060-1077 ◽  
Author(s):  
Steven S. Kim ◽  
Kavita Ramanan
Keyword(s):  
Limit Theorem ◽  
Large Deviation ◽  
Convex Geometry ◽  
Rare Event ◽  
High Dimensional ◽  
Random Projections ◽  
Dimensional Euclidean Space ◽  
High Dimensions ◽  
Geometric Setting ◽  
Conditional Limit

Abstract The study of high-dimensional distributions is of interest in probability theory, statistics, and asymptotic convex geometry, where the object of interest is the uniform distribution on a convex set in high dimensions. The ℓp-spaces and norms are of particular interest in this setting. In this paper we establish a limit theorem for distributions on ℓp-spheres, conditioned on a rare event, in a high-dimensional geometric setting. As part of our proof, we establish a certain large deviation principle that is also relevant to the study of the tail behavior of random projections of ℓp-balls in a high-dimensional Euclidean space.

The anomaly of convex bodies

1953 ◽  
Vol 49 (1) ◽  
pp. 54-58 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Euclidean Space ◽  
Real Number ◽  
Convex Bodies ◽  
Dimensional Euclidean Space ◽  
Real Numbers

I write X for the point (x1, x2, …, xn) of n-dimensional Euclidean space Rn. The coordinates x1, x2, …, xn are real numbers. The origin (0, 0,…, 0) is denoted by O. If t is a real number, tX denotes the point (tx1, tx2, …, txn); in particular, − X is the point (−x1, −x2,…, −xn). Also X + Y denotes the point {x1 + y1, x2 + y2, …, xn + yn).

scholarly journals Bézout-Type Inequality in Convex Geometry

2017 ◽  
Vol 2019 (16) ◽  
pp. 4950-4965 ◽  
Author(s):  
Jian Xiao
Keyword(s):  
Complex Geometry ◽  
Convex Geometry ◽  
Convex Bodies ◽  
Type Inequality ◽  
Mixed Volumes

Abstract Inspired by a result of Soprunov and Zvavitch, we present a Bézout type inequality for mixed volumes, which holds true for any convex bodies and improves the previous result. The key ingredient is the reverse Khovanskii–Teissier inequality for convex bodies, which was obtained in our previous work and inspired by its correspondence in complex geometry.

scholarly journals A characterisation of the ellipsoid

1970 ◽  
Vol 11 (4) ◽  
pp. 385-394 ◽  
Author(s):  
P. W. Aitchison
Keyword(s):  
Euclidean Space ◽  
Quadratic Forms ◽  
Convex Bodies ◽  
Positive Definite ◽  
Dimensional Euclidean Space ◽  
Major Result

The ellipsoid is characterised among all convex bodies in n-dimensional Euclidean space, Rn, by many different properties. In this paper we give a characterisation which generalizes a number of previous results mentioned in [2], p. 142. The major result will be used, in a paper yet to be published, to prove some results concerning generalizations of the Minkowski theory of reduction of positive definite quadratic forms.

COMPUTING MINKOWSKI SUMS OF PLANE CURVES

1995 ◽  
Vol 05 (04) ◽  
pp. 413-432 ◽  
Author(s):  
ANIL KAUL ◽  
RIDA T. FAROUKI
Keyword(s):  
Algebraic Curve ◽  
Numerical Procedure ◽  
The Other ◽  
Minkowski Sum ◽  
Plane Curves ◽  
Parametric Curves ◽  
Implicit Equation ◽  
Minkowski Sums ◽  
High Degree ◽  
The Given

The Minkowski sum of two plane curves can be regarded as the area generated by sweeping one curve along the other. The boundary of the Minkowski sum consists of translated portions of the given curves and/or portions of a more complicated curve, the “envelope” of translates of the swept curve. We show that the Minkowski-sum boundary is describable as an algebraic curve (or subset thereof) when the given curves are algebraic, and illustrate the computation of its implicit equation. However, such equations are typically of high degree and do not offer a practical basis for tracing the boundary. For the case of polynomial parametric curves, we formulate a simple numerical procedure to address the latter problem, based on constructing the Gauss maps of the given curves and using them to identifying “corresponding” curve segments that are to be summed. This yields a set of discretely-sampled arcs that constitutes a superset of the Minkowski-sum boundary, and can be regarded as a planar graph. To extract the true boundary, we present a method for identifying and “trimming” away extraneous arcs by systematically traversing this graph.

scholarly journals A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets

10.37236/484 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Ondřej Bílka ◽  
Kevin Buchin ◽  
Radoslav Fulek ◽  
Masashi Kiyomi ◽  
Yoshio Okamoto ◽  
...  
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Minkowski Sum ◽  
Independent Subset ◽  
Point Sets ◽  
Planar Point ◽  
Minkowski Sums

Recently, Eisenbrand, Pach, Rothvoß, and Sopher studied the function $M(m, n)$, which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets $P$ and $Q$ with $|P| = m$ and $|Q| = n$. They proved that $M(m,n)=O(m^{2/3}n^{2/3}+m+n)$, and asked whether a superlinear lower bound exists for $M(n,n)$. In this note, we show that their upper bound is the best possible apart from constant factors.

Sign in / Sign up

Export Citation Format

Share Document