Related papers: A note on the affine-invariant plank problem

A set of points a 1 ,. .. , a n fixes a planar convex body K if the points are on bdK, the boundary of K, and if any small move of K brings some point of the set in intK, the interior of K. The points a 1 ,. .. , a n $\in$ bdK almost fix K…

Let $\mathcal{C}=\{C_1,\ldots,C_n\}$ be a set of $n$ pairwise-disjoint convex sets of constant description complexity, and let $\pi$ be a probability density function (pdf for short) over the non-negative reals. For each $i$, let $K_i$ be…

We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

We formulate a novel characterization of a family of invertible maps between two-dimensional domains. Our work follows two classic results: The Rad\'o-Kneser-Choquet (RKC) theorem, which establishes the invertibility of harmonic maps into a…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

A finite subset $K$ of $\mathbb{Z}^d$ is said to be lattice-convex if $K$ is the intersection of $\mathbb{Z}^d$ with a convex set. The covariogram $g_K$ of $K\subseteq \mathbb{Z}^d$ is the function associating to each $u \in \integer^d$ the…

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present…

Our main theorem states that the complement of a compact holomorphically convex set in a Stein manifold with the density property is an Oka manifold. This gives a positive answer to the well-known long-standing problem in Oka theory whether…

Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

We define a class of $L$-convex-concave subsets of $\mathbb{R}P^3$, where $L$ is a projective line in $\mathbb{R}P^3$. These are sets whose sections by any plane containing $L$ are convex and concavely depend on this plane. We prove a…

The classical Besicovitch projection theorem states that if a planar set $E$ with finite length is purely unrectifiable, then almost all orthogonal projections of $E$ have zero length. We prove a quantitative version of this result: if…