Related papers: Representation of Polytopes as Polynomial Zonotope…
In formal safety verification, many proposed algorithms use parametric set representations and convert the computation of the relevant sets into an optimization problem; consequently, the choice of parameterization and objective function…
We describe a construction of the modular class associated to a representation up to homotopy of a Lie groupoid. In the case of the adjoint representation up to homotopy, this class is the obstruction to the existence of a volume form, in…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
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…
We show that every multilinear map between Euclidean spaces induces a unique, continuous, Minkowski multilinear map of the corresponding real cones of zonoids. Applied to the wedge product of the exterior algebra of a Euclidean space, this…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
Given an orientable surface with boundary and a free homotopy class, we present a purely combinatorial algorithm which produces a representative of that homotopy class with minimal self intersection.
There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…
Contact representations of graphs have a long history. Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fully-dimensional geometric objects such as spheres or cubes.…
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…
Orthosymplectic Lie superalgebras are fundamental symmetries in modern physics, such as massive supergravity. However, their representations are far from being thoroughly understood. In the present paper, we completely determine the…
The necessity of computing integrals with complex weights over manifolds with a large number of dimensions, e.g., in some field theoretical settings, poses a problem for the use of Monte Carlo techniques. Here it is shown that very general…
A real representation of a finite group naturally determines a polytope, generalizing the well-known Birkhoff polytope. This paper determines the structure of the polytope corresponding to the natural permutation representation of a general…
It is known that solutions of the KZ equations can be written in the form of multidimensional hypergeometric integrals. In 2017 in a joint paper of the author with V. Schechtman the construction of hypergeometric solutions was modified, and…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
A hom-Lie algebroid is a vector bundle together with a Lie algebroid like structure which is twisted by a homomorphism. In this paper we use the idea of representations up to homotopy of Lie algebroids to construct a same structure for…
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…