Related papers: On the discrete logarithmic Minkowski problem in t…

We review and further analyze Penrose's 'light cone at infinity' - the conformal closure of Minkowski space. Examples of a potential confusion in the existing literature about it's geometry and shape are pointed out. It is argued that it is…

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

An explicit solution to the Christoffel-Minkowski problem for convex bodies of revolution is presented. The conditions on the prescribed measure involve only first moments over spherical caps, and the support function of the resulting…

Let X be a complex manifold and c a simple closed curve in X. We address the question: What conditions on c ensure the existence of a 1-dimensional complex subvariety V with boundary c in X. When X = C^n, an answer to this question involves…

For a collection of convex bodies $P_1,\dots,P_n \subset \mathbb{R}^d$ containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as…

We use the generalized Minkowski billiard characterization of the EHZ-capacity of Lagrangian products in order to reprove that the $4$-dimensional Viterbo conjecture holds for the Lagrangian products (any triangle/parallelogram in…

All upper semicontinuous and SL(n) invariant valuations on convex bodies containing the origin in their interiors are completely classified. Each such valuation is shown to be a linear combination of the Euler characteristic, the volume,…

Let $E$ be a $(\mathrm{IV})$-polyhedral Banach space. We show that, for each $\epsilon>0$, $E$ admits an $\epsilon$-equivalent $\mathrm{(V)}$-polyhedral norm such that the corresponding closed unit ball is the closed convex hull of its…

Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in strictly convex normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that,…

We provide quantitative inner and outer bounds for the symmetric quasiconvex hull $Q^e(\mathcal{U})$ on linear strains generated by three-well sets $\mathcal{U}$ in $\mathbb{R}^{2\times 2}_{sym}$. In our study, we consider all possible…

Matrix convexity generalizes convexity to the dimension free setting and has connections to many mathematical and applied pursuits including operator theory, quantum information, noncommutative optimization, and linear control systems. In…

Extensions of the notions of polynomially and rationally convex hulls are introduced. Using these notions, a generalization of a result of Duval and Levenberg on polynomially convex hulls containing no analytic discs is presented. As a…

In this short paper, Kuratowski problem will be investigated in vector space. The highest number of distinct sets that can be generated from one convex set in linear space by repeatedly applying algebraic closure and complement in any order…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

This paper is concerned with superconvergence properties of a class of finite volume methods of arbitrary order over rectangular meshes. Our main result is to prove {\it 2k-conjecture}: at each vertex of the underlying rectangular mesh, the…

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…

We show that for any log-concave measure $\mu$ on $\mathbb{R}^n$, any pair of symmetric convex sets $K$ and $L$, and any $\lambda\in [0,1],$ $$\mu((1-\lambda) K+\lambda L)^{c_n}\geq (1-\lambda) \mu(K)^{c_n}+\lambda\mu(L)^{c_n},$$ where…