Related papers: Around Sylvester's question in the plane

We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number…

The classical Busemann-Petty problem (1956) asks, whether origin-symmetric convex bodies in $\mathbb {R}^n$ with smaller hyperplane central sections necessarily have smaller volumes. It is known, that the answer is affirmative if $n\le 4$…

Given a convex polygon $P$ with $k$ vertices and a polygonal domain $Q$ consisting of polygonal obstacles with total size $n$ in the plane, we study the optimization problem of finding a largest similar copy of $P$ that can be placed in $Q$…

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

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…

Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…

The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

The Busemann-Petty problem asks whether origin-symmetric convex bodies in $\mathbb{R}^n$ with smaller central hyperplane sections necessarily have smaller $n$-dimensional volume. It is known that the answer is affirmative if $n\le 4$ and…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…

Inspired by a fundamental theorem of Bernstein, Kushnirenko, and Khovanskii we study the following Bezout type inequality for mixed volumes $$ V(L_1,\dots,L_{n})V_n(K)\leq V(L_1,K[{n-1}])V(L_2,\dots, L_{n},K). $$ We show that the above…

An old conjecture states that among all simplices inscribed in the unit sphere the regular one has the maximal mean width. An equivalent formulation is that for any centered Gaussian vector $(\xi_1,\dots,\xi_n)$ satisfying $\mathbb…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…

Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree four in…

In the 1970s, Fathi, having proven that the group of compactly supported volume-preserving homeomorphisms of the $n$-ball is simple for $n \ge 3$, asked if the same statement holds in dimension $2$. We show that the group of compactly…

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an…

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

In this paper we will examine unions of oriented and non-oriented unit squares in same plane and measure the ratio of perimeter to area of these unions. In 1998, T. Keleti published the conjecture that this ratio never exceeds 4. We outline…