Related papers: Finite variations on the isoperimetric problem
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
This paper is concerned with the convergence of the solution of general elliptic boundary value problems in cylindrical domain, when some directions of the domain go to infinity.
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
Equivalent conditions that make the normal cone maximal monotone are investigated in the general settings of locally convex spaces. Some consequences such as Bishop Phelps and sum representability results are presented in the last part.
We prove weighted isoperimetric inequalities for smooth, bounded, and simply connected domains. More precisely, we show that the moment of inertia of inner parallel curves for domains with fixed perimeter attains its maximum for a disk.…
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…
We prove several inequalities estimating the distance between volumes of two bodies in terms of the maximal or minimal difference between areas of sections or projections of these bodies. We also provide extensions in which volume is…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
In this work we address the question of the existence of nonradial domains inside a nonconvex cone for which a mixed boundary overdetermined problem admits a solution. Our approach is variational, and consists in proving the existence of…
We study the problem of computing a convex region with bounded area and diameter that contains the maximum number of points from a given point set $P$. We show that this problem can be solved in $O(n^6k)$ time and $O(n^3k)$ space, where $n$…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We discuss solutions of several questions concerning the geometry of conformal planes.
The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order-$s$ principal submatrix of an order-$n$ covariance…
The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…
Recently W. Lao and M. Mayer [6], [7], [9] considered $U$-max - statistics, where instead of sum appears the maximum over the same set of indices. Such statistics often appear in stochastic geometry. The examples are given by the largest…
Polygon inclusion problems have been studied extensively in geometric optimization. In this paper, we consider the variant of computing the maximum area parallelograms (MAPs) and all the locally maximal area parallelograms (LMAPs) in a…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…
We study infinitesimal conformal deformations of a triangulated surface in Euclidean space and investigate the change in its extrinsic geometry. A deformation of vertices is conformal if it preserves length cross-ratios. On one hand,…