Related papers: Width deviation of convex polygons

In the first part we study deviation of a polynomial from its mathematical expectation. This deviation can be estimated from above by Carbery--Wright inequality, so we investigate estimates of the deviation from below. We obtain such…

Let $\{X_t\}_{t\geq 0 }$ be a $d$-dimensional supercritical super-Brownian motion started from the origin with branching mechanism $\psi$. Denote by $R_t:=\inf\{r>0:X_s(\{x\in \mathbb{R}^d:|x|\geq r\})=0,~\forall~0\leq s\leq t\}$ the radius…

We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs…

Let $Y$ be a subset of a metric space $X.$ We say that $Y$ is $\eta $-Gromov provided $Y$ is $\eta $-separated and not properly contained in any other $\eta $-separated subset of $X.$ In this paper, we review a result of Chew which says…

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…

A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of…

We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Given two pants decompositions of a compact orientable surface $S$, we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection number and polynomially on the Euler characteristic of $S$.…

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

Let $K(=K_{n,\theta})$ be a positive integer-valued random variable whose distribution is given by ${\rm P}(K = x) = \bar{s}(n,x) \theta^x/(\theta)_n$ $(x=1,\ldots,n) $, where $\theta$ is a positive number, $n$ is a positive integer,…

We introduce the notion of approximate numerical radius (Birkhoff) orthogonality and investigate its significant properties. Let $T, S\in \mathbb{B}(\mathscr{H})$ and $\varepsilon \in [0, 1)$. We say that $T$ is approximate numerical radius…

We give an exponential upper bound on the probabilitywith which the denominator of the $n$th convergent in the regular continued fraction expansion stays away from the mean $\frac{n\pi^2}{12\log2}$. The exponential rate is best possible,…

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

Let $G = (V,w)$ be a weighted undirected graph with $m$ edges. The cut dimension of $G$ is the dimension of the span of the characteristic vectors of the minimum cuts of $G$, viewed as vectors in $\{0,1\}^m$. For every $n \ge 2$ we show…

The paper is devoted to some extremal problems for convex polygons on the Euclidean plane, related to the concept of self Chebyshev radius for the polygon boundary. We consider a general problem of minimization of the perimeter among all…

The purpose of this paper is twofold. First, we provide an optimal $\Omega(\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's…

We consider the complex case of the so-called S-inequality. It concerns the behaviour of the Gaussian measures of dilations of convex and rotationally symmetric sets in C^n (rotational symmetry is invariance under the multiplication by…

We propose an efficient $\epsilon$-differentially private algorithm, that given a simple {\em weighted} $n$-vertex, $m$-edge graph $G$ with a \emph{maximum unweighted} degree $\Delta(G) \leq n-1$, outputs a synthetic graph which…