Related papers: On the convex hull of integer points above the hyp…

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…

A cascade of dihedral symmetries is hidden in Young's lattice of integer partitions. In fact, for each integer N>2 the Hasse graph of the subposet consisting of the partitions with maximal hook length strictly less than N has the dihedral…

It is well known that the convex hull of $\{(x,y,xy)\}$, where $(x,y)$ is constrained to lie in a box, is given by the Reformulation-Linearization Technique (RLT) constraints. Belotti {\em et al.\,}(2010) and Miller {\em et al.\,}(2011)…

Considering $n\times n\times n$ stochastic tensors $(a_{ijk})$ (i.e., nonnegative hypermatrices in which every sum over one index $i$, $j$, or $k$, is 1), we study the polytope ($\Omega_{n}$) of all these tensors, the convex set ($L_n$) of…

We review several results related to the characterization of polyhedra in hyperbolic 3-space. In particular we present Rivin's theorem that gives a characterization of compact convex hyperbolic polyhedra, and Hodgson's proof of the Adreev's…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

In this paper we prove a conjecture stated by the first two authors establishing the closure of the numerical range of a certain class of $n+1$-periodic tridiagonal operators as the convex hull of the numerical ranges of two tridiagonal…

For a finite set of points $X$ on the unit hypersphere in $\mathbb{R}^d$ we consider the iteration $u_{i+1}=u_i+\chi_i$, where $\chi_i$ is the point of $X$ farthest from $u_i$. Restricting to the case where the origin is contained in the…

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lower bounds have emerged for many central problems and…

A closed connected hyperbolic $n$-manifold bounds geometrically if it is isometric to the geodesic boundary of a compact hyperbolic $(n+1)$-manifold. A. Reid and D. Long have shown by arithmetic methods the existence of infinitely many…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…

This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diameter of a convex polytope defined by an integer matrix to a…

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…