相关论文: Geometric structure of sumsets

A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

We study convex subsets of buildings, discuss some structural features and derive several characterizations of buildings.

We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using harmonic means and completely partitioned weighted geometric means. Our result…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of…

We study amoebas of exponential sums as functions of the support set $A$. To any amoeba, we associate a set of approximating sections of amoebas, which we call caissons. We show that a bounded modular lattice of subspaces of a certain…

Given n convex bodies in the real space of dimension d, we consider the set of homogeneous polynomials of degree d in n variables that can be represented as their volume polynomial. This set is a subset of the set of Lorentzian polynomials.…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending our previously developed methods. As an application we realize the…

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

We study higher-degree generalizations of symplectic groupoids, referred to as {\em multisymplectic groupoids}. Recalling that Poisson structures may be viewed as infinitesimal counterparts of symplectic groupoids, we describe "higher''…