Related papers: Orthant polyhedra

Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…

We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

The topic of the paper are developments of $n$-dimensional Coxeter polyhedra. We show that the surface of such polyhedron admits a canonical cutting such that each piece can be covered by a Coxeter $(n-1)$-dimensional domain.

We complete the classification of B-facets of a 4-dimensional Newton polyhedron, filling a gap in the classification of arXiv:1309.0630, found by the authors of arXiv:2209.03553.

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are…

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

We calculate bounds for orthant probabilities for the equicorrelated multivariate normal distribution and use these bounds to show the following: for degree $k>4$, the probability that a $k$-homogeneous polynomial in $n$ variables attains a…

We introduce the multi-width of a lattice polytope and use this to classify and count all lattice tetrahedra with multi-width $(1,w_2,w_3)$. The approach used in this classification can be extended into a computer algorithm to classify…

A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in…

This note introduces the class of basic $r$-ball polyhedra in the $d$-dimensional Euclidean space $\mathbb{E}^{d}$ for $d>1$ and $r>0$. We investigate their face structure and, for given integers $0\leq i\leq d-1$, $n\geq d+1\geq 3$…

We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).