Related papers: New estimates for convex layer numbers

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

A convex lattice set in $\mathbb{Z}^d$ is the intersection of a convex set in $\mathbb{R}^d$ and the integer lattice $\mathbb{Z}^d$. A well-known theorem of Doignon states that the Helly number of $d$-dimensional convex lattice sets equals…

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Results from direct numerical simulations for three dimensional Rayleigh-Benard convection in a cylindrical cell of aspect ratio 1/2 and Pr=0.7 are presented. They span five decades of Ra from $2\times 10^6$ to $2 \times10^{11}$. Good…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

Let X be a normed linear space. We examine if every open, convex and unbounded subset of X is equal to the union of a family of open straight half lines. The answer is affirmative if and only if X is finite dimensional.

Assume $L$ is a $k$-assignment of a graph $G$. An $L$-packing $\phi$ of $G$ is a sequence $\phi=(\phi_1, \ldots, \phi_k)$ of $k$-mappings such that each $\phi_i$ is an $L$-coloring of $G$, and for each vertex $v$ of $G$, $\{\phi_1(v),…

We revisit the classic problem of simplex range searching and related problems in computational geometry. We present a collection of new results which improve previous bounds by multiple logarithmic factors that were caused by the use of…

We give a simple argument showing that the number of edges in the intersection graph $G$ of a family of $n$ sets in the plane with a linear union-complexity is $O(\omega(G)n)$. In particular, we prove $\chi(G)\leq \text{col}(G)<…

Let $X$ be an absolutely irreducible hypersurface of degree $d$ in $\mathbb{A}^n$, defined over a finite field $\mathbb{F}_q$. The Lang-Weil bound gives an interval that contains $#X(\mathbb{F}_q)$. We exhibit explicit intervals, which do…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in…

Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size…

In this paper, we consider a large class of purely discontinuous rotationally symmetric Levy processes. We establish sharp two-sided estimates for the transition densities of such processes killed upon leaving an open set D. When D is a…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

Existing networks directly learn feature representations on 3D point clouds for shape analysis. We argue that 3D point clouds are highly redundant and hold irregular (permutation-invariant) structure, which makes it difficult to achieve…

Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…