Related papers: Classification of Convex lattice polytopes

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

We study modular ortholattices in the variety generated by the finite dimensional ones from an equational and geometric point of view. We relate this to coordinatization results.

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

A general theory of topological classification of defects is introduced. We illustrate the application of tools from algebraic topology, including homotopy and cohomology groups, to classify defects including several explicit calculations…

We study lattice point visibility along polynomial lines of sight and prove the Visibility Density Conjecture of Chaubey and Pandey for a large class of polynomials.

This paper is about integral zonotopes. It is proven that large zonotopes in a convex cone have a limit shape, meaning that, after suitable scaling, the overwhelming majority of the zonotopes are very close to a fixed convex set. Several…

A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.

In this paper we discuss the classification rank $3$ lattices preserved by finite orthogonal groups of isometries and derive from it the classification of regular polyhedra in the $3$-dimensional torus. This classification is highly related…

This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…

It is pretty well-known that toric Fano varieties of dimension k with terminal singularities correspond to convex lattice polytopes P in R^k of positive finite volume, such that intersection of P and Z^k consists of the point 0 and vertices…

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…

We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…

We prove that polynomial valuations on vector lattices correspond to orthosymmetric multilinear maps. As a consequence we obtain a concise proof of the equivalence of orthosymmetry and orthogonal additivity.

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…