Lattice polytopes with distinct pair-sums

Details Lattice polytopes with distinct pair-sums Lattice polytopes with distinct pair-sums

2000-11-10

arxiv.org/abs/math/0011068v1

Mathematics

Combinatorics

8 pages. Submitted to the Special Issue on Geometric Combinatorics of the journal "Discrete and Computational Geometry"

Scientific paper

Let P be a lattice polytope in R^n, and let P \cap Z^n = {v_1,...,v_N}. If the N + \binom N2 points 2v_1,...,2v_N; v_1+v_2,...v_{N-1}+v_N are distinct, we say that P is a "distinct pair-sum" or "dps" polytope. We show that, if P is a dsp polytope in R^n, then N \le 2^n, and, for every n, we construct dps polytopes in R^n which contain 2^n lattice points. We also discuss the relation between dps polytopes and the study of sums of squares of real polynomials.

Affiliated with

Also associated with

No associations

Rating

Lattice polytopes with distinct pair-sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice polytopes with distinct pair-sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice polytopes with distinct pair-sums will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452647