Related papers: Extended formulations for the multilinear polytope…
We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be…
In this article, we survey the primary research on polyhedral computing methods for constrained linear control systems. Our focus is on the modeling power of convex optimization, featured to design set-based robust and optimal controllers.…
The main goal of this paper is to extend [J. Algebra Appl. 20 (2021), 2150074] to generalized quaternion algebras, even when these algebras are not necessarily division rings. More precisely, in such cases, the image of a multilinear…
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…
An orbitope is the convex hull of an orbit of a compact group acting linearly on a vector space. These highly symmetric convex bodies lie at the crossroads of several fields, in particular convex geometry, optimization, and algebraic…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
We study the polyhedral properties of three problems of constructing an optimal complete bipartite subgraph (a biclique) in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…
Given a finite quiver (directed graph) without loops and multiedges, the convex hull of the column vector of the incidence matrix is called the directed edge polytope and is an interesting example of lattice polytopes. In this paper, we…
The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural networks to solve multidimensional linear optimization problems,…
Given a tree $T$, its path polytope is the convex hull of the edge indicator vectors for the paths between any two distinct leaves in $T$. These polytopes arise naturally in polyhedral geometry and applications, such as phylogenetics,…
We study a simplicial mixed polynomial of cyclic type and its associated weighted homogeneous polynomial. In the present paper, we show that their links are diffeomorphic and their Milnor fibrations are isomorphic.
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…