Nonregular extreme points in the set of Minkowski additive selections
نویسندگان
چکیده
منابع مشابه
Density of the Periodic Points in the Interval Set
The dynamical system (f,R) is introduced and some of its properties are investigated. It is proven that there is an invariant set Λ on which the periodic points of f are dense.
متن کاملExtreme eigenvalues of nonregular graphs
Let λ1 be the greatest eigenvalue and λn the least eigenvalue of the adjacency matrix of a connected graph G with n vertices, m edges and diameter D. We prove that if G is nonregular, then Δ− λ1 > nΔ− 2m n(D(nΔ− 2m)+ 1) 1 n(D + 1) , where Δ is the maximum degree of G. The inequality improves previous bounds of Stevanović and of Zhang. It also implies that a lower bound on λn obtained by Alon an...
متن کاملLipschitz selections of the diametric completion mapping in Minkowski spaces
We develop a constructive completion method in general Minkowski spaces, which successfully extends a completion procedure due to Bückner in twoand three-dimensional Euclidean spaces. We prove that this generalized Bückner completion is locally Lipschitz continuous, thus solving the problem of finding a continuous selection of the diametric completion mapping in finite dimensional normed spaces...
متن کاملExtreme Points of Lattice Intervals in the Minkowski-rådström–hörmander Lattice
In this paper we characterize extreme points of any symmetric interval in the Minkowski–R̊adström–Hörmander lattice X̃ over any Hausdorff topological vector space X (Theorem 1). Then we prove that the unit ball in the Minkowski–R̊adström–Hörmander lattice X̃ over any normed space X, dimX ≥ 2, has exactly two extreme points (Theorem 2). Let (G,+,≤) be a commutative lattice-ordered group [1], where x...
متن کاملLattice Points in Minkowski Sums
Fakhruddin has proved that for two lattice polygons P and Q any lattice point in their Minkowski sum can be written as a sum of a lattice point in P and one in Q, provided P is smooth and the normal fan of P is a subdivision of the normal fan of Q. We give a shorter combinatorial proof of this fact that does not need the smoothness assumption on P .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1150653-4