Related papers: Normal forms of convex lattice polytopes

The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

In a previous paper [11] we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D, and converge to limit…

The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…

We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…

We obtain the list of automorphism groups for smooth plane sextic curves over an algebraically closed field K of characteristic p=0 or p>21. Moreover, we assign to each group a geometrically complete family over K describing its…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

This paper is about the study of F-transforms based on overlap and grouping maps, residual and co-residual implicator over complete lattice from both constructive and axiomatic approaches. Further, the duality, basic properties, and the…

In this work we study a class of random convex sets that "interpolate" between polytopes and zonotopes. These sets arise from considering a $q^{th}$-moment ($q\geq 1$) of an average of order statistics of $1$-dimensional marginals of a…

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…

We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…

We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Consider a semi-infinite skew-symmetric moment matrix, $m_{\iy}$ evolving according to the vector fields $\pl m / \pl t_k=\Lb^k m+m \Lb^{\top k} ,$ where $\Lb$ is the shift matrix. Then the skew-Borel decomposition $ m_{\iy}:= Q^{-1} J…