We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by

We derive tight bounds for the maximum number of k-faces, 0 ≤ k ≤ d − 1, of the Minkowski sum, P1 ⊕ P2, of two ddimensional convex polytopes P1 and P2, as a function of the number of vertices of the polytopes. For even dimensions d ≥ 2, the maximum values are attained when P1 and P2 are cyclic d-polytopes with disjoint vertex sets. For odd dimensions d ≥ 3, the maximum values are attained when ...

Let P and Q be finite sets of points in the plane. In this note we consider the largest cardinality of a subset of the Minkowski sum S ⊆ P ⊕ Q which consist of convexly independent points. We show that, if |P | = m and |Q| = n then |S| = O(m2/3n2/3 + m + n).

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let δ(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational framework to determine δ(d, k) for small instances. We show that δ(3, 4) = 7 and δ(3, 5) = 9; that is, we verify for (d, k) = (3, 4) and (3, 5) the conjecture whereby δ(d, ...

In this paper we introduce and investigate similarity measures for convex polyhedra based on Minkowski addition and inequalities for the mixed volume, volume and surface area related to the Brunn-Minkowski theory. All measures considered are invariant under translations; furthermore, they may also be invariant under subgroups of the aane transformation group. For the case of rotation and scale ...

Driven by both technology and market, telecom industry is becoming a part of several converged industries in information society gradually from an independent industry which provides telecom products like voice or data. Under such background, this paper introduces a new value chain model of telecom value-added services in the new environment, providing theoretic support for transformation of te...

Additive Number Theory can be best described as the study of sums of sets of integers. A simple example is given two subsets A and B of a set of integers, what facts can we determine about A + B where A + B := {a + b | a ∈ A and b ∈ B}? We will state a result regarding this example shortly. We note that a very familiar problem in Number Theory, namely Lagrange’s theorem that every nonnegative i...

ABSTRACT: Camel milk contains sufficient levels of insulin and does not form the coagulum in the stomach preventing degradation of insulin and act as an effective vehicle to take the milk insulin unchanged to the intestine. In present study direct spectroscopy and standard addition method, well-known methods in analytical chemistry were used for determining insulin concentration in camel milk. ...