Related papers: Convex hulls of polyominoes

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

Quasifuchsian hyperbolic manifolds, or more generally convex co-compact hyperbolic manifolds, have infinite volume, but they have a well-defined ``renormalized'' volume. We outline some relations between this renormalized volume and the…

Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty…

We show that the conjectural cusped complex hyperbolic 2-orbifolds of minimal volume are the two smallest arithmetic complex hyperbolic 2-orbifolds. We then show that every arithmetic cusped complex hyperbolic 2-manifold of minimal volume…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

In this note, we show that the strong Viterbo conjecture holds true on any convex toric domain, and that the Viterbo's volume-capacity conjecture holds for the product of a $1$-unconditional convex body $A\subset\mathbb{R}^{n}$ and its…

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

A formula due to Sudakov relates the first intrinsic volume of a convex set in a Hilbert space to the maximum of the isonormal Gaussian process over this set. Using this formula we compute the first intrinsic volumes of infinite-dimensional…

Given a 2-sheeted torus over the circle with winding number 1, we prove that its polynomial hull is a union of 2-sheeted holomorphic discs. Moreover when the hull is non degenerate its boundary is a Levi-flat solid torus foliated by such…

We study some particular cases of the $n$-well problem in two-dimensional linear elasticity. Assuming that every well in $\mathcal{U}\subset\mathbb{R}^{2\times 2}_\text{sym}$ belong to the same two-dimensional affine subspace, we…

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

We consider ensembles of planar maps with two marked vertices at distance k from each other and look at the closed line separating these vertices and lying at distance d from the first one (d<k). This line divides the map into two…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…

As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…