Related papers: Finite variations on the isoperimetric problem
It is well known that among all closed bounded curves in the plane with the given perimeter, the circle encloses the maximum area. There are many proofs in the literature. In this article we have given a new proof using some ideas of Demar.
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of…
We study a specific convex maximization problem in the space of continuous functions defined on a semi-infinite interval. An unexplained connection to the discrete version of this problem is investigated.
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
In the present manuscript we address and solve for the first time a nonlocal discrete isoperimetric problem. We consider indeed a generalization of the classical perimeter, what we call a nonlocal bi-axial discrete perimeter, where, not…
In this paper, the isoperimetric problem in Randers planes, $(\mathbb{R}^2,F=\alpha +\beta)$, which are slight deformation of the Euclidean plane $(\mathbb{R}^2,\alpha)$ by suitable one forms $\beta$, have been studied. We prove that the…
The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…
The reverse isoperimetric problem asks for existence and properties of bounded convex sets in a Riemannian manifold which maximise the perimeter under all those sets of fixed volume which roll freely in a ball of some given radius. If the…
T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular…
Applications such as political redistricting demand quantitative measures of geometric compactness to distinguish between simple and contorted shapes. While the isoperimetric quotient, or ratio of area to perimeter squared, is commonly used…
We prove the existence of isoperimetric regions in $\R^n$ with density under various hypotheses on the growth of the density. Along the way we prove results on the boundedness of isoperimetric regions.
In this paper, we study a second order variational problem for locally convex hypersurfaces, which is the affine invariant analogue of the classical Plateau problem for minimal surfaces. We prove existence, regularity and uniqueness results…
We consider the volume-constrained minimization of the sum of the perimeter and the Riesz potential. We add an external potential of the form $\|x\|^{\beta}$ that provides the existence of a minimizer for any volume constraint, and we study…
We study the slicing inequality for the surface area instead of volume. This is the question whether there exists a constant $\alpha_n$ depending (or not) on the dimension $n$ so that $$S(K)\leq\alpha_n|K|^{\frac{1}{n}}\max_{\xi\in…
Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…
In this work we investigate the following isoperimetric problem: to find the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the area of the part of the boundary contained in…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
In this paper we study two different weighted isoperimetric inequalities. In the first part of the paper we prove a sharp stability result for the isoperimetric inequality with a log-convex weight. In the second part we analize the behavior…
Locally isoperimetric $N$-partitions are partitions of the space $\mathbb R^d$ into $N$ regions with prescribed, finite or infinite measure, which have minimal perimeter (which is the $(d-1)$-dimensional measure of the interfaces between…