Related papers: A note on non-commutative polytopes and polyhedra
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…
We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…
It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
The cone-volume measure of a polytope with centroid at the origin is proved to satisfy the subspace concentration condition. As a consequence a conjectured (a dozen years ago) fundamental sharp affine isoperimetric inequality for the…
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…
An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant $\mathbb{R}^{n}_{\geq 0}$. The cone of copositive matrices contains the cone of matrices which are the sum of a…
We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
We give two characterizations of cones over ellipsoids in real normed vector spaces. Let $C$ be a closed convex cone with nonempty interior such that $C$ has a bounded section of codimension $1$. We show that $C$ is a cone over an ellipsoid…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
We address a problem posed in [1] by demonstrating through an example that, in the absence of separability, the property of sequential cone compactness does not generally imply cone compactness.
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…
We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…
An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Tropical polyhedra are known to be representable externally, as intersections of finitely many tropical half-spaces. However, unlike in the classical case, the extreme rays of their polar cones provide external representations containing in…