相关论文: An arithmetic measure of width for convex bodies

In this article we define and study convex bodies associated to linear series of adelic divisors over quasi-projective varieties that have been introduced recently by Xinyi Yuan and Shou-Wu Zhang. Restricting our attention to big adelic…

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

We investigate robust optimization problems defined for maximizing convex functions. For finite uncertainty set, we develop a geometric branch-and-bound algorithmic approach to solve this problem. The geometric branch-and-bound algorithm…

The lattice size $\operatorname{ls}_{\Delta}(P)$ of a lattice polygon $P$ with respect to the standard simplex $\Delta$ was introduced and studied by Castryck and Cools in the context of simplification of the defining equation of an…

We investigate geometrical properties and inequalities satisfied by the complex difference body, in the sense of studying which of the classical ones for the difference body have an analog in the complex framework. Among others we give an…

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

In this paper, we establish mean width inequalities of sections and projections of convex bodies for isotropic measures with complete equality conditions, which extends the recent work of Alonso-Guti\'{e}rrez and Brazitikos. Different from…

In 2021, Ordentlich, Regev and Weiss made a breakthrough that the lattice covering density of any $n$-dimensional convex body is upper bounded by $cn^{2}$, improving on the best previous bound established by Rogers in 1959. However, for the…

We consider the number of configurations of a surface in two dimensions that has a prescribed length and encloses a prescribed perimeter with respect to a baseline. An approximate analytical treatment in a semi--continuum compares…

We establish new geometric inequalities comparing the volumes of sections and projections of a convex body, whose barycenter or Santal\'o point is at the origin, with those of its inner and outer regularizations. We also provide functional…

Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…

We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments,…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…

We estimate convex polytopes and general convex sets in $\mathbb R^d,d\geq 2$ in the regression framework. We measure the risk of our estimators using a $L^1$-type loss function and prove upper bounds on these risks. We show that, in the…

We define floating bodies in the class of $n$-dimensional ball-convex bodies. A right derivative of volume of these floating bodies leads to a surface area measure for ball-convex bodies which we call relative affine surface area. We show…

We present bounds on the maximal gain of adaptive and randomized algorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For…