P. McMullen, The maximum number of faces of a convex polytope, Mathematika, 17 (1970), 179--184.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....author was partially funded by NSF Grant 98 00910 and the second author was an H. C. Wang Assistant Professor at Cornell University. f vector) two linearly equivalent derived invariants are considered, the h polynomial and the g polynomial. These were introduced in this context by McMullen [22], who showed by means of a shelling argument that the h polynomial of a simplicial polytope always has nonnegative coefficients and it is maximized, over all simplicial d dimensional polytopes with n vertices, by the cyclic polytope C(n, d) the convex hull of n points on the moment curve (t, t ....

....d) where C(n, d) is the cyclic polytope in d dimensions and with n vertices. Proof. We can pull each of the vertices of the polytope P until we obtain a simplicial polytope Q with the same number of vertices. By Proposition 6. 4 we have that #(P ) #(Q) Among simplicial polytopes McMullen [22, 23] proved that the cyclic polytope maximizes the h vector. Since the cd polynomials # d,i are nonnegative, it follows that #(Q) #(C(n, d) Since the flag h vector is a nonnegative linear combination of the coefficients of the cd index, and the flag f vector a nonnegative linear combination ....

McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179--184 (1970)

....and Seidel [1] Since Problem 2 is strongly polynomially equivalent to Problem 3 as well, Vertex Enumeration is also strongly polynomially equivalent to Problem 2. For xed d, Chazelle [12] found an O m polynomial time algorithm, which is optimal by the Upper Bound Theorem of McMullen [43]. There exist algorithms which are faster than Chazelle s algorithm for small n, e.g. an O m log n (mn) 1 1= bd=2c 1) polylog m algorithm of Chan [9] For general d, the reverse search method of Avis and Fukuda [2] solves the problem for simple polyhedra in polynomial total time, using ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970), pp. 179-184.

....set of conditions characterize the face vectors of simplicial polytopes. Various techniques were used to prove the necessity of certain subsets or weakenings of these conditions. The milestones were the Dehn Sommerville equations (Sommerville, 1927 [15] the Upper Bound Theorem (McMullen, 1970 [13], Stanley, 1975 [16] and the Lower Bound Theorem (Barnette, 1973 [1] Finally, in 1980, Stanley [18] proved the necessity of the McMullen conditions; the suciency was proved at the same time by Billera and Lee [3] The various advances towards the proof of the McMullen conditions for ....

.... various advances towards the proof of the McMullen conditions for simplicial polytopes proceeded from the discoveries of combinatorial interpretations for the h vector (the image of the face vector under a certain linear transformation) The h vector counts something in a shelling of the polytope [13], in the Stanley Reisner ring of the polytope [16] and, nally, in the homology ring of the toric variety of the polytope [18] In 1983 the ane span of the ag vectors of arbitrary polytopes was determined [2] At about the same time Stanley introduced to combinatorists a formula for the ....

P. McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179-184.

....Introduction In his paper [12] on face numbers of simplicial polytopes, Sommerville found a transformation of the f vector that puts the linear relations on f vectors into a simple form. Fifty years later the transformed vector, now called the h vector, proved crucial in the Upper Bound Theorem [11] and, finally, the characterization of f vectors of simplicial polytopes [6, 13] The h vector can be interpreted in several ways, in particular, as the Betti numbers of the toric variety associated with a simplicial polytope. This can be generalized to define a toric h vector for every ....

Peter McMullen, The maximum number of faces of a convex polytope,Mathematika17 (1970), 179--184. MR 44:921

....d is accounted for, the construction given here stabs #( n #d 2#) #d 2# ) tetrahedra. There is an asymptotic gap between this stabbing number and the upper bound of O(d 1 2 (en #d 2#) #d 2# ) where e is the base of the natural logarithm) provided by McMullen s upper bound theorem for polytopes [4] (assuming d o( # n) A well known transformation called the lifting map of Edelsbrunner and Seidel [3] can be used to map each vertex onto a paraboloid in a space one dimension greater, so that the Delaunay triangulation of the vertices is a projection of the lower convex hull of the mapped ....

Peter McMullen. The Maximum Number of Faces of a Convex Polytope. Mathematika 17:179--184, 1970.

....shellability was introduced by Bruggesser Mani [5] who showed the shellability of the boundary complexes of polytopes. Shellability is important both in combinatorial and computational geometry, for example, it was essential for the proof of the upper bound of the number of faces of polytopes [11], or has been used for efficient convex hull construction of polytopes [14] Shellability has also been studied from algebra through the Stanley Reisner ring of simplicial complexes [8] 15] A pure simplicial complex is extendably shellable if any sequence of a subset of facets satisfying the ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970) 179--184.

....polyhedral fans are signable (Theorem 4.5) which stands in contrast with the common belief that they are not shellable in general. Also in Section 4, we show that if a signable simplicial complex is moreover totally signable, then it satisfies McMullen s Upper Bound Theorem on the face numbers [13]. Thus, Theorem 4.4 provides a rather general sufficient condition for a simplicial complex to satisfy this theorem. In Section 5, we use the framework of signed families once more to prove that (Las Vergnas face lattices of) oriented matroid polytopes are signable (Theorem 5.11) again in ....

....to the f vector via the 3 invertible pair of linear transformations given by h j and h i = Gamma1) f j : In many situations, the h vector is more suitable for the enumerative study of a simplicial complex than the f vector itself. For example, McMullen s upper bound theorem [13] asserts, in terms of the h vector, that for a simplicial polytope h i Gamma h 1 i Gamma1 holds for all positive i. A simplicial complex for which these inequalities hold will be said to possess the upper bound property. In the case of a partitionable complex, the h vector has the ....

[Article contains additional citation context not shown here]

P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika, 17:179--184, 1970.

.... ) to contain the origin. For that we borrowed the seminal concept of h vectors from polytope theory, and introduced their continuous counterparts, h functions. Note, however, that our proof of the upper bound on h(y) is not merely a translation of McMullen s proof in the discrete setting [4]. Rather, when employed directly to the polytope set up (via the duality discussed in [7] it would also give a proof by induction of the UBT, but with the induction step going from d 1 d and base case d = n 1. Here is a challenging related open question. For on R 2 given, consider a( ....

Peter McMullen. The maximum numbers of faces of a convex polytope. Mathematika, London, 17:179--184, 1970.

....been applied to bimatrix games. The number of vertices of a polytope is in general exponential in the dimension. The maximal number is described in the following theorem, where btc for a real number t denotes the largest integer not exceeding t. Theorem 2.12. Upper bound theorem for polytopes, McMullen, 1970. The maximum number of vertices of a d dimensional polytope with k facets is Phi(d; k) k Gamma b d Gamma1 2 c Gamma 1 b d 2 c k Gamma b d 2 c Gamma 1 b d Gamma1 2 c : For a self contained proof of this theorem see Mulmuley (1994) This result shows that P ....

P. McMullen (1970), The maximum number of faces of a convex polytope. Mathematika 17, 179--184.

....n 7n n (m) 6 log(1 ff) 3 log n) n Gamma1 : From Theorem 2 it follows that jN(A; b)j c n m bn=2c log n Gamma1 (1 ff) where c n is some quantity depending only on n. In Sect. 3 we show that for any fixed n this estimate can not be improved with respect to order. Note 1 It is known [5] that the number of facets of a polyhedron P in R n with v vertices is at most n (v) From this and estimates above it follows that for any fixed n the number of facets in P I is bounded above by some polynomial in m and log(1 ff) This result and Lenstra s algorithm [4] allowed Shevchenko ....

.... large number of vertices in P I are known only for few values of m. In particular, for n 1 and for any positive c n no sequence of knapsack polyhedrons with at least c 0 n log n Gamma1 ff vertices is known. From the upper bound (12) on the number of vertices in P I and from the inequality [5], estimating the number of facets in a polyhedron with v vertices, follows that the number of facets in P I is at most c n m bn=2c 2 log (n Gamma1)bn=2c (1 ff) The problem of an attainability of this bound is open. ....

McMullen P. The maximum numbers of faces of a convex polytope. Mathematika, #. 171970 C. 179--184.

....inductions. The combinatorial theory of convex polytopes forms the basis of the combinatorial theory of triangulations. The most important theorem in combinatorics of polytopes is the upper bound theorem stating the maximal possible number of faces of polytopes with given number of vertices 12 [73]. This theorem on size was first proved using shelling [18] a total order for incremental construction of the boundary of a polytope. Triangulations are similar to boundaries of polytopes in that they form simplicial complexes. However, theorems on (boundaries of) polytopes do not automatically ....

....[57] 4. 1 Introduction A total order of the facets of a polytope is a shelling if it satisfies some topological condition (defined below at (3) Shellings have many applications both in combinatorial and computational geometry: for example, they are crucial for the upper bound theorem [18] [73], and are used in convex hull construction [91] A total order of the facets of a polytope corresponds to a total order of the vertices of the polar polytope. Such order of vertices is a polar shelling. A line shelling is some special shelling, and its polar becomes an ordering of the vertices of ....

[Article contains additional citation context not shown here]

Peter McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970) 179--184.

....k ##d 2#, vertices is the vertex set of a face of the polytope. Neighborly d polytopes play a prominent role in the theory of polytopes since, among d polytopes with n vertices, they have the greatest number of facets ( Upper bound theorem , conjectured by Motzkin [28] and proved by McMullen [26, 27]. Recent and quite unexpected additional applications of cyclic polytopes may be found in [2, 24, 29, 39] Moment curves offer a rich spatial structure that occurs in various domains: let us mention, for instance, the use of a dth moment curve for embedding m dimensional simplicial complexes in ....

....of the text supposes the reader is familiar with matroid theory [40, 41] and oriented matroid theory [3] nevertheless, the paper is essentially self contained and may support an introductory course on oriented matroids and or polytopes. Additional information concerning polytopes may be found in [1, 7, 19, 26, 30, 35, 37, 38, 42, 43] and their references. 2. ORIENTED MATRO I DS AND POLYTOPES We remember that a finite non empty subset X # R d is affinely dependent if there are reals # x , x # X , with # x#X # x = 0 and some # x #= 0, satisfying # x#X # x x = 0. Let S be a fixed finite set of points in R d ....

P. McMullen, The maximum number of faces of a convex polytope, Mathematika, 17 (1970), 179-- 184.

....of polytopes. 1 Introduction A total order of the facets of a polytope is a shelling if it satisfies some topological condition (defined below at (3) Shellings have many applications both in combinatorial and computational geometry: for example, they are crucial for the upper bound theorem [1] [7], and are used in convex hull construction [10] A total order of the facets of a polytope corresponds to a total order of the vertices of the polar polytope. Such order of the vertices is a polar shelling. A line shelling is some special shelling, and its polar becomes an ordering of the vertices ....

Peter McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970) 179--184.

....in dual form which gives, for example, the maximum number of vertices in a d polytope with m facets. Theorem 4 (Upper Bound Theorem in Dual Form) For any d polytope with m facets, f k (P ) f d k 1 (C(d; m) 8k = 0; 1; d 2; holds. The original proof of the Upper Bound Theorem is in [McM70, MS71]. There are di erent variations, see [Kal97, Mul94, Zie94] 2.10 What is convex hull What is the convex hull problem For a subset S of R d , the convex hull conv(S) is de ned as the smallest convex set in R d containing S. The convex hull computation means the determination of conv(S) ....

P. McMullen. The maximum number of faces of a convex polytope. Mathematika, XVII:179-184, 1970.

....shellability was introduced by Bruggesser Mani [5] who showed the shellability of the boundary complexes of polytopes. Shellability is important both in combinatorial and computational geometry, for example, it was essential for the proof of the upper bound of the number of faces of polytopes [11], or has been used for efficient convex hull construction of polytopes [14] Shellability has also been studied from algebra through the Stanley Reisner ring of simplicial complexes [8] 15] A pure simplicial complex is extendably shellable if any sequence of a subset of facets satisfying the ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970) 179--184.

.... almost trivial for d 2, and for d = 3 it has been observed independently by Clarkson Shor [2] and Philipp [10] The main subject of the present article is the following conjecture (cf. also [7] which may be viewed as a generalization of the well known upper bound theorem for convex polytopes [8], since g 0 is the number of vertices of the polyhedron P (A) Conjecture. In an arbitrary arrangement of n half spaces of S d , the number g k of vertices having weight at most k attains its maximum for each k (n Gamma d) 2 in the case of a cyclically polyhedral arrangement. This ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179 - 184.

.... Consider the following problem min f(x) Gammax 2 1 Gamma (x 2 2) 2 Gamma x 2 3 Gamma x 4 7 2 2 1 A better upper bound for the number of extreme points in a polytope is Gamma m Gammab(n 1) 2c bn=2c Delta Gamma m Gammab(n 2) 2c b(n Gamma1) 2c Delta : see McMullen [16]. Les Cahiers du GERAD G 97 48 Revised 10 s.t. 8 : 3x 1 7x 2 6x 3 2x 4 0 (2) 2x 1 Gamma 2x 2 Gamma x 3 3x 4 0 (3) 3x 1 7x 3 Gamma 4x 4 22 (4) x 1 0 (5) x 2 Gamma2 (6) x 3 0 (7) x 4 Gamma 7 2 : 8) Let P be the ....

McMullen, P. (1970). The maximum numbers of faces of a convex polytope. Mathematika, 17, 179--184.

....vertices that can be possessed by a d polytope P de ned by means of n linear inequality constraints; hence it represents the maximum number of local strict maxima that can be attained by a convex function over P . The assertion of the upper bound theorem was proved for polytopes (McMullen, 1970 [73]) for simplicial spheres (Stanley, 1975 [79, 82] and for simplicial manifolds with either vanishing middle homology or the same Euler characteristic as a sphere (Novik, 1998 [74] It was also been proved when n is large w.r.t. d (n d 2 =4, will do) for all Eulerian simplicial complexes ....

.... 50] and some combinatorial applications [81, 51] h numbers and polytope duality [81, 63] and mirror symmetry [39] algebraic combinatorics a la Stanley [Stanley] 44, 82, 83, 84, 85] Various proofs for the UBT: for Eulerian complexes with many vertices [65] for polytopes using shellability [73], a simple dual form using linear objective functions, 187] for spheres using the Cohen Macaulay property [79] using shellability and the Cohen Macaulay property [64] using shellability and a strong form of an extremal theorem of Bollob as [36] for manifolds, using relations between face ....

[Article contains additional citation context not shown here]

P. McMullen, The maximum numbers of faces of a convex polytopes, Matematika 17 (1970), 179-184.

....Introduction In his paper [12] on face numbers of simplicial polytopes, Sommerville found a transformation of the f vector that puts the linear relations on f vectors into a simple form. Fifty years later the transformed vector, now called the h vector, proved crucial in the Upper Bound Theorem [11] and, finally, the characterization of f vectors of simplicial polytopes [6, 13] The h vector can be interpreted in several ways, in particular, as the Betti numbers of the toric variety associated with a simplicial polytope. This can be generalized to define a toric h vector for every ....

Peter McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179--184.

....subtopics of polyhedral sets are mentioned below. Geometric definitions of polyhedral sets are described in the references [24, 43, 59] The subclass of polytopes is discussed in [25] References on the subclass of polyhedral cones are [11] The face structure of polyhedral cones is treated in [24, 36, 43]. PL sets and mappings between such sets have been proposed by E.D. Sontag, see [48, 49] Algorithms on polyhedral sets are treated in several references. The algorithm by N.V. Chernikova is proposed in [18] and further discussed in [22, 58] Additional references on algorithms are [17, 52, 21, ....

P. McMullen. The maximum number of faces of a convex polytope. Mathematica, 17:179--184, 1970.

....of the solution in the simplicial case is of interest here. Rather than working directly with the numbers of faces of each dimension (the f vector) two linearly equivalent derived invariants are considered, the h polynomial and the g polynomial. These were introduced in this context by McMullen [22], who showed by means of a shelling argument that the h polynomial of a simplicial polytope always has nonnegative coefficients and it is maximized, over all simplicial d dimensional polytopes with n vertices, by the cyclic polytope C(n; d) the convex hull of n points on the moment curve (t; t ....

....where C(n; d) is the cyclic polytope in d dimensions and with n vertices. Proof. We can pull each of the vertices of the polytope P until we obtain a simplicial polytope Q with the same number of vertices. By Proposition 6. 4 we have that Psi(P ) Psi(Q) Among simplicial polytopes McMullen [22, 23] proved that the cyclic polytope maximizes the h vector. Since the cd polynomials Phi d;i are nonnegative, it follows that Psi(Q) Psi(C(n; d) Since the flag h vector is a nonnegative linear combination of the coefficients of the cd index, and the flag f vector a nonnegative linear ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179--184.

....Introduction In his paper [12] on face numbers of simplicial polytopes, Sommerville found a transformation of the f vector that puts the linear relations on f vectors into a simple form. Fifty years later the transformed vector, now called the h vector, proved crucial in the Upper Bound Theorem [11] and, finally, the characterization of f vectors of simplicial polytopes [6, 13] The h vector can be interpreted in several ways, in particular, as the Betti numbers of the toric variety associated with a simplicial polytope. This can be generalized to define a toric h vector for every ....

Peter McMullen. The maximum number of faces of a convex polytope. Mathematika, 17:179-- 184, 1970.

....terms. 1 Introduction A total order of the facets of a polytope is a shelling if it satisfies some topological condition (defined below at (3) Shellings have many applications both in combinatorial and computational geometry: for example, they are crucial for the upper bound theorem [1] [7], and are used in convex hull construction [10] A total order of the facets of a polytope corresponds to a total order of the vertices of the polar polytope. Such order of the vertices is a polar shelling. A line shelling is some special shelling, and its polar becomes an ordering of the vertices ....

Peter McMullen, The maximum numbers of faces of a convex polytope, Mathematika, 17 (1970) 179--184.

.... concept of shellability was first studied in the field of combinatorial topology in relation with the Poincar e Conjecture, but recently many researchers of combinatorics have been interested in this concept after the famous Upper Bound Theorem for convex polytopes was solved by using this concept [11]. Important property of shellability is that shellable pseudomanifolds are always PL homeomorphic to spheres or balls. Moreover, it is known that shellability of pseudomanifolds is equivalent to sphericity and ballness if the dimension is 2, that is, all the triangulations of 2 spheres and 2 balls ....

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179-184.

....the notion, shellability has come to be of fundamental importance in the study of complexes and has been extensively studied by many researchers. See [8] 19, Chapter 8] 20] One of the most famous applications is the proof of the Upper Bound Theorem for convex polytopes by McMullen [12] which used the result of Brugesser and Mani [2] that convex polytopes are shellable. Shellability is indeed a very useful notion, but it is sometimes so strong that it is hard to show whether the complex in interest is shellable or not. Spherical fans and oriented matroid polytopes are the ....

P. McMullen, The maximum numbers of faces of a convex polytope. Mathematika 17 (1970), 179-184.

....relative to the labels of P in a certain way, then (P; Q) has Theta Gamma (1 p 2) d = p d Delta complementary vertex pairs, where 1 p 2 2:414. Polytopes in dimension d with 2d facets have at most O(2:6 d = p d) vertices, according to the Upper Bound Theorem for polytopes [15]. This is also the maximum number of complementary pairs since every vertex belongs to at most one such pair. Hence, there is still a gap for the maximum number, but the new lower bound of 2:414 d = p d offers a substantial improvement over the previously known bound of 2 d . The problem of ....

....l Gamma 1 l Gamma 1 = N l N Gamma l Gamma 1 l Gamma 1 : 3:3) Similarly, one can show Phi(2l 1; N) 2 Gamma N Gammal Gamma1 l Delta . No d polytope with N vertices has more facets than the cyclic polytope C d (N) according to the Upper Bound Theorem for polytopes [15, 18]. Applied to the polars, this implies that no d polytope with N facets has more than Phi(d; N) vertices. Hence, the polytopes P and Q in (2.2) have at most Phi(m; m n) and Phi(n; m n) vertices, respectively. The bound is stricter for the polytope of smaller dimension since Phi(d; N) ....

P. McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179--184.

....terms of the geometric features of the polyhedron (lines, rays, and vertices) Inequalities and equalities are referred to collectively as constraints. An equivalent problem is called the convex hull problem which computes the facets of the convex hull surrounding given a set of points. McMullen [McM70, MS71] showed that for any d polytope with n vertices, the number of k faces, f k is upper bounded by the number of k faces of a cyclic d polytope with the same number of vertices. One of the implications of this is that the number of facets, f d Gamma1 = O(n b d 2 c ) The algorithms to solve ....

P. McMullen. The maximum number of faces of a convex polytope. Mathematica, XVII:179--184, 1970.

....XI.2.5] i.e. we split the polytopes into n simplices. Triangulation works well for polygons (dim(P ) 2) but is rather difficult for dimension greater than 2. The complexity of the decomposition step depends on the number of faces which is O(m bn=2c ) where m is the number of vertices ([23], cf. 8, chapter XI.2.5] 3) Another approach are grid methods (see [8, chapter VIII.3.2] The polytope is enclosed in a hyper rectangle, which is decomposed in a set of grid rectangles. In a setup step the grid rectangles are classified into inside, outside or on the border of the polytope. ....

....method (2) the main advantage of the new algorithm is the fact that practically no setup is necessary. On the other hand sampling is slower. For method (2) the complexity of the decomposition step depends on the number of faces which is O(m bn=2c ) where m is the number of vertices ([23]) Thus for polytopes with a large number of vertices in high dimensions triangulation is very slow. Hence the presented new method is preferable if ffl the dimension is high ( 3) and ffl the polytope contains a large number of vertices, or ffl we only need a few random points for the given ....

McMullen, P. The maximum number of faces of a convex polytope. Mathematika 17 (1970), 179--184.

.... the known bounds are better than the naive bound O(n d ) for the complexity of the entire arrangement) These include the cases of (i) hyperplanes, where the complexity of a single cell, being a convex polyhedron bounded by at most n hyperplanes, is O(n bd=2c ) by the Upper Bound Theorem [50]) ii) spheres, where an O(n dd=2e ) bound is easy to obtain by lifting the spheres into hyperplanes in (d 1) space [26, 58] iii) d Gamma 1) simplices, where an O(n d Gamma1 log n) bound has been established in [8] and (iv) several special types of surfaces in three dimensions, that ....

P. McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179-- 184.

....Polytope P A is O(n d 2 p 3 2 ) Further, there is an algorithm that, given n 2 IN, A 2 l Q d Thetan , and oracle presented , produces all facets of P A in strongly polynomial oracle time using O(n d 2 p 3 ) operations and queries. Proof. By the well known Upper Bound Theorem [18], the number of facets of any k dimensional polytope with m vertices is O(m k 2 ) Applying this to P A with k dp and m = O(n d( p 2 ) we get the bound on the number of facets of P A . To construct the facets, construct first the set V of vertices using the algorithm of Theorem ....

P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika, 17:179--184, 1970.

....cube is defined by 2d inequalities and has 2 d vertices. This is not the largest possible number, however. The upper bound is obtained for the so called dual neighborly polytopes, which have the number of vertices stated in the following result. Theorem 2.12. Upper bound theorem for polytopes, McMullen, 1970. The maximum number of vertices of a d dimensional polytope with k facets is Phi(d; k) k Gamma b d Gamma1 2 c Gamma 1 b d 2 c k Gamma b d 2 c Gamma 1 b d Gamma1 2 c : 2:27) In (2.27) i p q j is the binomial coefficient p = q (p Gamma q) and brc ....

P. McMullen (1970), The maximum number of faces of a convex polytope. Mathematika 17, 179--184.

....polyhedral fans are signable (Theorem 4.5) which stands in contrast with the common belief that they are not shellable in general. Also in Section 4, we show that if a signable simplicial complex is moreover totally signable, then it satisfies McMullen s Upper Bound Theorem on the face numbers [13]. Thus, Theorem 4.4 provides a rather general sufficient condition for a simplicial complex to satisfy this theorem. In Section 5 we use the framework of signed families once more to prove that (Las Vergnas face lattices of) oriented matroid polytopes are signable (Theorem 5.11) again in contrast ....

....given by f i = i X j =0 d j d i h j and h i = i X j =0 ( 1) i j d j d i f j . In many situations the h vector is more suitable for the enumerative study of a simplicial complex than the f vector itself. For example, McMullen s upper bound theorem [13] asserts, in terms of the h vector, that for a simplicial polytope h i # h 1 i 1 i holds for all positive i . A simplicial complex for which these inequalities hold is said to possess the upper bound property. In the case of a partitionable complex, the h vector has the ....

[Article contains additional citation context not shown here]

P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika, 17:179--184, 1970.

....by creating and maintaining a facet graph in which facets are vertices and adjacent facets are connected by edges. It takes a little extra code to maintain the graph, but then he does not need to do the Motzkin adjacency test on all pairs of vertices (facets) PI n785 30 Doran K. Wilde McMullen [McM70, MS71] showed that for any d polytope with n vertices, the number of k faces, f k is upper bounded by the number of k faces of a cyclic d polytope with the same number of vertices. One of the implications of this is that the number of facets, f d Gamma1 = O(n b d 2 c ) 4.2.1 The Motzkin ....

P. McMullen. The maximum number of faces of a convex polytope. Mathematica, XVII:179--184, 1970.

....O(n d ) are known for the general case, even in three dimensions. The special cases for which better bounds are known include the case of hyperplanes, where the complexity of a single cell, being a convex polytope bounded by at most n hyperplanes, is O(n bd=2c ) by the Upper Bound Theorem [22]) the case of spheres, where an O(n dd=2e ) bound is easy to obtain by lifting the spheres into hyperplanes in (d 1) space [11, 25] the case of (d Gamma 1) simplices, where an O(n d Gamma1 log n) bound has been recently established in [5] and several special cases in three dimensions that ....

P. McMullen, The maximum number of faces of a convex polytope, Mathematika 17 (1970), 179--184.

....Complexity of the algorithm: Let us analyze the asymptotic time complexity of the algorithm described above. The following analysis is based on the facts that the maximum number of the edges of a convex polytope is 3r Gamma 6 and that of the vertices 2r Gamma 4, if the number of the faces is r[9]. Therefore, we can compute step 1 3, 4 1, 5 1 and 6 1 in O(rArB ) We can also execute step 4 2, 4 3, 5 2 and 5 3 in O(rArB ) if we search C5face A(f Pvert(e2) etc. by the hashing. Step 6 2 and 6 3 are a little bit complicated. Let the number of the edges on the i th face of A be v i , and that ....

P.McMullen, "The Maximum Numbers of Faces of a Convex Polytope", Mathematika, Vol.17, No.34, 179/184, 1970.

....as a V or H polytope, and in fixed dimension one can be computed from the other in polynomial time. This is no longer true in general when the dimension is part of the input, since the number of vertices of a polytope may be exponential in its number of facets and vice versa; see [Mc70]. Zonotopes admit specifically compact presentations. A string (n, s; c; z 1 , z s ) with n, s # N and c, z 1 , z s # Q n is called an S zonotope in R n ; it represents the geometric object Z = c P s i=1 [0, 1]z i . Sometimes we will also work with zonotopes whose ....

P. MCMULLEN, The maximum number of faces of a convex polytope, Mathematika, 17 (1970), pp. 179--184.

....the supports S f1; ng and fn 1; 2ng Gamma S of mixed strategies for player 1 and 2, respectively. A much better upper bound is q 27=4 n = p n, approximately 2:6 n = p n. As observed by Keiding (1997) this can be derived from the Upper Bound Theorem for polytopes (McMullen, 1970). The polyhedral approach to equilibrium enumeration is due to Vorob ev (1958) Kuhn (1961) and Mangasarian (1964) and works even for degenerate games. An elegant vertex enumeration algorithm for polytopes due to Avis and Fukuda (1992) has apparently not yet been applied to bimatrix games. A ....

....1 put at each end. Hence, Phi(2l; N) N Gamma l l N Gamma l Gamma 1 l Gamma 1 = N l N Gamma l Gamma 1 l Gamma 1 : 3:3) No d polytope with N vertices has more facets than the cyclic polytope C d (N) according to the Upper Bound Theorem for polytopes (McMullen, 1970; for a selfcontained proof see Mulmuley, 1994) Applied to the polars, this implies that no d polytope with N facets has more than Phi(d; N) vertices. Hence, the polytopes P 1 and P 2 in (2.2) have at most Phi(m; m n) and Phi(n; m n) vertices, respectively. The bound is stricter for the ....

P. McMullen (1970), The maximum number of faces of a convex polytope. Mathematika 17, 179--184.

....on the n=2 level in E 2 [4] Thus the contribution here is mostly one of observed connections and new proofs, and not new theorems. Section 3 uses ideas of linear programming duality to show that the bound on i minima readily implies the celebrated Upper Bound Theorem for convex polytopes[6, 1]. Here we mean only the upper bound of that theorem, and do not characterize the polytopes for which the bound is tight. 2 The bound for i minima Some preliminary notation: for a set S, let Gamma S k Delta denote the collection of subsets of S of size k, so j Gamma S k Delta j = Gamma ....

....= X i i k g i (P) 2) since each k face F has a unique bottom vertex v, with all k edges in F incident to v pointing up. To bound the quantities f k (P) it is enough to bound g i (P) The above condenses the discussion in Br ndsted s text of McMullen s proof of the Upper Bound Theorem[6, 1]. The LP dual arrangement. The linear programming problem maxfwx j x 2 Pg has the dual problem minfyb j y 2 P 0 g; where P 0 = fy 2 E n j y 2 F ; y 0g; and F = fy 2 E n j yA = wg is an (n Gamma d) flat. Letting d 0 = n Gamma d, the d 0 polytope P 0 is one cell in the ....

P. McMullen. The maximum number of faces of a convex polytope. Mathematika, 17:179--184, 1970. Clarkson Local Minima of Arrangements 7

....3.2 Complexity of the algorithm Let us analyze the asymptotic time complexity of the algorithm described above. Assume that KA , the number of the faces of A is equal to KB for simplicity. Let the number be N . Then the maximum number of the edges is 3N 0 6 and that of the vertices 2N 0 4[10]. Therefore, we can compute step 1 3, 4 1, 5 1 and 6 1 in O(N 2 ) We can also execute step 4 2, 4 3, 5 2 and 5 3 in O(N 2 ) if we search C5face A(f Pvert(e2) etc. by the hashing. Step 6 2 and 6 3 are a little bit complicated. Let the number of the edges on the i th face of A be m i , and ....

P.McMullen, "The Maximum Numbers of Faces of a Convex Polytope", Mathematika, Vol.17, No.34, 179/184, 1970.

No context found.

P. McMullen, The maximum number of faces of a convex polytope, Mathematika, 17 (1970), 179--184.

No context found.

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179--184.

No context found.

P. McMullen, The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179--184.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC