A bound on local minima of arrangements that implies the upper bound theorem
نویسندگان
چکیده
منابع مشابه
A Bound on Local Minima of Arrangements that implies the Upper Bound Theorem
Clarkson Local Minima of Arrangements 6 Next to show that if v has outdegree i then v 0 is an i-minimum. Since v 0 j < 0 if and only if v 0 is below h j , we need to show that a coordinate v 0 j 6 = 0 corresponds to an oriented edge (v; q) where wv ? wq = w(v ? q) has the same sign as v 0 j. Suppose (v; q) is an edge of P. Then ^ Av = ^ b ^ Aq, with one strict inequality a j v = b j > a j q, an...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملan investigation in the deformation zone of the ecae process by the upper bound theorem
in the present paper, the deformation zone of the ecae (equal channel angular extrusion) process was investigated using the upper bound theorem. for this purpose, the shape of the streamlines in the deformation zone was assumed to be cubic bezier curves. then, the force required for the ecae process was optimized with regard to the parameters defining the shape of streamlines by the upper bound...
متن کاملThe Upper Bound Conjecture for Arrangements of Halfspaces
Let A be an arrangement of n open halfspaces in R. In [2], Linhart proved that for r ≤ 5, the numbers of vertices ofA contained in at most k halfspaces are bounded from above by the corresponding numbers of C(n, r), where C(n, r) is an arrangement realizing the alternating oriented matroid of rank r on n elements. In the present paper Linhart’s result is generalized to faces of dimension s− 1 f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1993
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02573988