Sciweavers

39 search results - page 4 / 8
» On the Diameter of Lattice Polytopes
Sort
View
DCG
2008
132views more  DCG 2008»
13 years 5 months ago
Ehrhart Series and Lattice Triangulations
Abstract We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials o...
Sam Payne
JCT
2006
75views more  JCT 2006»
13 years 5 months ago
New polytopes from products
We construct a new 2-parameter family Emn, m, n 3, of self-dual 2-simple and 2-simplicial 4-polytopes, with flexible geometric realisations. E44 is the 24-cell. For large m, n the...
Andreas Paffenholz
ORDER
2008
100views more  ORDER 2008»
13 years 5 months ago
Orthogonal Surfaces and Their CP-Orders
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
Stefan Felsner, Sarah Kappes
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
13 years 5 months ago
Geometrically Constructed Bases for Homology of Partition Lattices
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
Anders Björner, Michelle L. Wachs
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 7 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson