Related papers: Finding a largest empty convex subset in space is …
The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…
We establish a general criterion for the existence of convex sets of fixed shape as, e.g., balls of a given radius, of maximal probability on Banach spaces. We also provide counterexamples showing that their existence my fail even in some…
In this paper, we propose the study of a conjecture whose affirmative solution would provide an example of a non-convex Chebyshev set in an infinite-dimensional real Hilbert space.
The problem of shadow is solved. It is equivalent to condition for point is in generalized convex hull of a family of compact sets.
For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…
We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, different proofs exist that the complexity of this problem in the…
The complex Busemann-Petty problem asks whether origin symmetric convex bodies in $\C^n$ with smaller central hyperplane sections necessarily have smaller volume. We prove that the answer is affirmative if $n\le 3$ and negative if $n\ge 4.$
This paper is dedicated to the study of a one-dimensional congestion model, consisting of two different phases. In the congested phase, the pressure is free and the dynamics is incompressible, whereas in the non-congested phase, the fluid…
The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…
We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…
In this paper, it is shown that for any two non-empty closed (resp., open) and spherical convex subsets $\mathcal{W}_1, \mathcal{W}_2$ of $S^n$, the intersection $\mathcal{W}_1\cap \mathcal{W}_2$ is empty if and only if the subset $\{P\in…
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…
We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…
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…
Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is formed by the points that appear on $P$'s convex hull. In general, a point belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus…
We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density $> 1$ and also to quantum sampling subset sum solutions. We examine a…
In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also…
Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…