Related papers: Hollow polytopes with many vertices
We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…
We study the global structure of Lorentzian manifolds with partial sectional curvature bounds. In particular, we prove completeness theorems for homogeneous and isotropic cosmologies as well as static spherically symmetric spacetimes. The…
This paper deals with the three types of regular polytopes which exist in all dimensions -- regular simplices, cubes and regular cross-polytopes -- and their outer and inner radii. While the inner radii of regular simplices are well…
We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…
FFLV polytopes describe monomial bases in irreducible representations of $\mathfrak{sl}_n$ and $\mathfrak{sp}_{2n}$. We study various sets of vertices of FFLV polytopes. First, we consider the special linear case. We prove the locality of…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…
Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…
The uniqueness theorem for static charged higher dimensional black hole containing an asymptotically flat spacelike hypersurface with compact interior and with both degenerate and non-degenerate components of event horizon is proposed. By…
A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…
Recently a simple proof of the generalizations of Hawking's black hole topology theorem and its application to topological black holes for higher dimensional ($n\geq 4$) spacetimes was given \cite{rnew}. By applying the associated new line…
We formulate a conjecture that arithmetic locally symmetric manifolds have simple homotopy type, and prove it for the non-compact case. More precisely, we show that, for any symmetric space S of non-compact type without Euclidean de Rham…
We give a simple construction of new, complete, finite volume manifolds $M$ of bounded, nonpositive curvature. These manifolds have ends that look like a mixture of locally symmetric ends of different ranks and their fundamental groups are…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.