Related papers: Classification of Convex lattice polytopes
We study the relation between the lattice points of a stacky polytope and a prequantisation of the stack associated to the stacky polytope. We introduce a prequantisation of a Deligne--Mumford stack and discuss the uniqueness and the…
The main purpose of this paper is to study the lattice structure of variable precision rough sets. The notion of variation in precision of rough sets have been further extended to variable precision rough set with variable classification…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
All simple translation-invariant valuations on polytopes are classified. As a direct consequence the well-known conditions for translative-equidecomposability are recovered. Furthermore, a simplified proof of the classification of…
We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
We address the problem of classifying discrete differential-geometric Poisson brackets (dDGPBs) of any fixed order on target space of dimension 1. It is proved that these Poisson brackets (PBs) are in one-to-one correspondence with the…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…
We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…
The simulations of the light scalar mesons on the lattice are presented at the introductory level. The methods for determining the scalar meson masses are described. The problems related to some of these methods are presented and their…
In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…
We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss…
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…
Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
We present a new geometric proof of Stanley's monotonicity theorem for lattice polytopes, using an interpretation of $\delta$-polynomials of lattice polytopes in terms of orbifold Chow rings.