Consider a finite set whose elements are associated with vectors of common dimension. A partition of such a set is associated with a matrix whose columns are the sums of the vectors corresponding to each part. The partition polytope associated with a class of partitions (that share the number of parts) is then the convex hull of the corresponding matrices. We derive representations and characterizations of these polytopes and thei
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
AbstractWe study the vertices and facets of the polytopes of partitions of numbers. The partition po...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
AbstractLet S be a finite set with m elements in a real linear space and let JS be a set of m interv...
AbstractLet M ⊂ E2 be an open, connected and bounded polygonal region with polygonal holes of dimens...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
In this paper we consider the following basic problem in polyhedral computation: Given two polyhedra...
AbstractIn this paper we lay the foundations for the study of permutation polytopes: the convex hull...
In this paper, we provide three different ways to partition the polytope of doubly substochastic mat...
The profile vector f(U) ∈ Rn+1 of a family U of subspaces of an n-dimensional vector space V over G...
SIGLETIB: RN 3492 (128) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
AbstractWe study the vertices and facets of the polytopes of partitions of numbers. The partition po...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
AbstractLet S be a finite set with m elements in a real linear space and let JS be a set of m interv...
AbstractLet M ⊂ E2 be an open, connected and bounded polygonal region with polygonal holes of dimens...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
In this paper we consider the following basic problem in polyhedral computation: Given two polyhedra...
AbstractIn this paper we lay the foundations for the study of permutation polytopes: the convex hull...
In this paper, we provide three different ways to partition the polytope of doubly substochastic mat...
The profile vector f(U) ∈ Rn+1 of a family U of subspaces of an n-dimensional vector space V over G...
SIGLETIB: RN 3492 (128) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...
AbstractIn this paper we consider the following basic problem in polyhedral computation: Given two p...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
AbstractWe study the vertices and facets of the polytopes of partitions of numbers. The partition po...