Asymptotically Efficient Triangulations of the d-Cube

Discrete & Computational Geometry, Jul 2003

David Orden, Francisco Santos

A PDF file should load here. If you do not see its contents the file may be temporarily unavailable at the journal website or you do not have a PDF plug-in installed and enabled in your browser.

Alternatively, you can download the file locally and open with any standalone PDF reader:

Asymptotically Efficient Triangulations of the d-Cube

Discrete Comput Geom Geometry Discrete & Computational David Orden 0 Francisco Santos 0 0 Departamento de Matema ́ticas, Estad ́ıstica y Computacio ́n, Universidad de Cantabria , Av. Los Castros s/n, E-39005 Santander, Cantabria , Spain Let P and Q be polytopes, the first of “low” dimension and the second of “high” dimension. We show how to triangulate the product P × Q efficiently (i.e., with few simplices) starting with a given triangulation of Q. Our method has a computational part, where we need to compute an efficient triangulation of P × m , for a (small) natural number m of our choice. m denotes the m-simplex. Our procedure can be applied to obtain (asymptotically) efficient triangulations of the cube I n : We decompose I n = I k × I n−k , for a small k. Then we recursively assume we have obtained an efficient triangulation of the second factor and use our method to triangulate the product. The outcome is that using k = 3 and m = 2, we can triangulate I n with O(0.816n n!) simplices, instead of the O(0.840n n!) achievable before. ∗ This research was partially supported by Project PB97-0358 of the Spanish Direccio´n General de Investigacio´n Cient´ıfica y Te´cnica. - 1. Introduction “Simple” triangulations of the regular d-cube I d = [ 0, 1 ]d have several applications, such as solving differential equations by finite-element methods or calculating fixed points. See, for example, [ 10 ]. In particular, it has brought special attention both from a theoretical point of view and from an applied one to determine the smallest size of a triangulation of the d-cube (see Section 14.5.2 of [ 8 ] for a recent survey). We point up that the general problem of computing the smallest triangulation of an arbitrary polytope is NP-complete even when restricted to dimension 3, see [ 2 ]. When we speak about triangulations of a polytope P of dimension d we mean decompositions of P into d-simplices that (i) use as vertices only vertices of P , and (ii) intersect face to face (i.e., forming a geometric simplicial complex). Some authors do not require these two conditions in triangulations. We will always require the first one, and when the second condition is not fulfilled, we call the decompositions simplicial dissections of P. The size of a triangulation or dissection T is its number of d-simplices and we denote it |T |. It is an open question whether high-dimensional cubes admit dissections with less simplices than needed in a triangulation. Actually, the minimum size of dissections of I 7 is unknown, while the minimum triangulation is known (see below). The paper [ 3 ] describes a general method to obtain the smallest triangulation of a polytope P as the optimal integer solution of a certain linear program. The linear program has as many variables as d-simplices with the vertex set contained in the vertices of P #vertices exist. That is, dim(P)+1 if the vertices of P are in general position and less than that if not. For the d-cube, the direct application of this method is impossible in practice beyond dimension 4 or 5. With a somewhat similar method but simplifying the system of equations via the symmetries of the cube, Anderson and Hughes [ 1 ] have calculated the smallest size among triangulations of the 6-cube and the 7-cube, in a computational tour-de-force which involved a problem with 1,456,318 variables and ad hoc ways of decomposing the system into smaller subsystems. The smallest sizes up to dimension 7 are shown in Table 1. In order to compare sizes of triangulations of cubes in different dimensions, Todd [10] defines the efficiency of a triangulation T of the d-cube to be the number (|T |/d!)1/d . This number is at most 1, since every simplex with integer vertices has a multiple of 1/d! as Euclidean volume, so |T | ≤ d!. Triangulations of efficiency 1 (i.e., unimodular) can be easily constructed in any dimension. On the other extreme, Hadamard’s inequality for determinants of matrices with coefficients in [ −1, 1 ] implies that the volume of every d-simplex inscribed in the regular d-cube I d = [ 0, 1 ]d is at most (d + 1)(d+1)/2/2d d!. Hence, every triangulation has size at least 2d d!/(d + 1)(d+1)/2 and efficiency at least 2/(d + 1)(d+1)/2d ≈ 2/√d + 1. Following the notation in Section 14.5.2 of [8], let ϕd and ρd be the smallest size and efficiency, respectively, of all triangulations of the cube of dimension d. The number ϕd (or some variations in which one or both of the conditions (i) and (ii) are not required) is known as the simplexity of the d-cube. Obviously, ρd = (ϕd /d!)1/d . In [6] (see also pages 283–284 of [8]), Haiman observes that a triangulation of I k+l with tk tl k+l simplices can be constructed from given triangulations of I k and I l with k tk and tl simplices, respectively. With this, one easily concludes: Theorem 1.1 [ 6 ]. For every k and l, ρkk++ll ≤ ρk ρl . k l Corollary 1.2. The sequence (ρi )i∈N converges and lim ρi ≤ ρd , i→∞ ∀d ∈ N. We fix d ∈ N and k ∈ {1, . . . , d}. Haiman’s theorem implies that, for every Proof. i ∈ N, ρk+id ≤ ρkk/(k+id)ρid/(k+id). d Since the right-hand side converges to ρd when i grows, the d subsequences of indices modulo d, and hence the whole sequence (ρi )i∈N, have an upper limit bounded by ρd . What is the limit of this sequence? In particular, is it positive or is it zero? The known values of ρd (up to d = 7) form a strictly decreasing sequence, as shown in Table 1, but it is not even known whether this occurs in general. Concerning lower bounds, the only significant improvement to Hadamard’s inequality has been obtained in [ 9 ], where the same volume argument is used, but with respect to a hyperbolic metric. The last row of the Table 1 shows the lower bound obtained, translated into efficiency of triangulations. For small dimensions, it is an excellent approximation of the smallest efficiency. Asymptotically, it only increases the lower bound obtained using Hadamard’s inequality by a constant factor √3/2. In this paper we propose a method to obtain efficient triangulations of a product polytope P × Q starting from a triangulation of Q and another of P × m−1, where m−1 denotes a simplex of dimension m − 1 and m is any relatively small number. We apply this with P being a small-dimensional cube and Q a high-dimensional one, iteratively. This allows us to obtain asymptotically efficient triangulations of arbitrarily high-dimensional cubes from any (efficient) triangulation of I l × m−1. Sections 3–5 explain our method, which is first outlined in Section 2. If the reader is happy with dissections, we cannot offer better efficiencies for them than for triangulations. Then Section 5, which contains most of the technicalities in this paper, can be skipped. The asymptotic efficiency of the triangulations obtained, clearly depends on how good our triangulation of I l × m−1 is. Finding the triangulation of I l × m−1 which is optimal for our purposes reduces to an integer programming problem, similar to finding the smallest triangulation of that polytope (actually, it is the same system of linear equations, with a different objective function). Using the linear programming software CPLEX, we have solved the system for some values of l and m. The best triangulation we have found is one of I 3 × 2, with which we obtain lim ρi ≤ i→∞ The best bound existing before was limi→∞ ρi ≤ ρ7 = 0.840. In other words, we prove that (asymptotically) the d-cube can be triangulated with 0.8159d d! simplices, instead of the 0.840d d! achievable before. It has to be observed that, even if the particular triangulation of I 3 × 2 that we use was obtained by an intensive computer calculation, once the triangulation is found it is a simple task to check that it is indeed a triangulation and compute the asymptotic efficiency obtained from it. Actually, in Section 7 we use the so-called Cayley Trick [ 7 ] to do this checking with no need of computers at all. We also use the Cayley Trick to explore the minimum efficiency that can be obtained from the product I 2 × k for any k. We briefly explain the trick in Section 6, where we also interpret our whole construction in terms of it. 2. Overview of the Method and Results We start by describing Haiman’s proof of Theorem 1.1, which is related to our method. Let Tk and Tl be triangulations of the regular cubes I k and I l , respectively. The product Tk × Tl of the two triangulations gives a decomposition of the cube I k × I l = I k+l into i|sTkw| e·l|lTkl|nsouwbnpothlyattoepveesr,yeatrcihanogfutlhaetmionisoofmokrp×hic tlohtahsespizroeduk c+ktl of(sseiem, pel.igc.e,sChakp×ter 7l .oIft [ 5 ]). Hence, refining Tk × Tl in an arbitrary way one gets a triangulation of I k+l of size |Tk | · |Tl | · k +kl . The implication of this is that starting with a triangulation of a cube I k of a certain efficiency ρ, one can construct a sequence of triangulations of I nk for n ∈ N whose asymptotic efficiencies converge to ρ. Our method is, in a way, similar. Starting from a triangulation of I n−1 and another one of I l × m−1, we get one of I l+n−1 with the following general method to triangulate P × Q starting from a triangulation of Q and another one of P × m−1: (1) We first show (Sections 3 and 4) how to obtain triangulations of P × n−1 from triangulations of P × m−1, where n − 1 = dim(Q) is supposed to be much bigger than m − 1. We call our triangulations multi-staircase triangulations. (2) A triangulation of Q induces, as in Haiman’s method, a decomposition of P × Q into polytopes isomorphic to P × n−1. Each of them can be triangulated using the previous paragraph, although this in principle only gives a dissection of P × Q; if we want a triangulation, we have to apply (1) to all the polytopes P × n−1 in a compatible way. In Section 5 we show how to do this using an m-coloring of the vertices of Q. (3) The analysis of the size of the triangulation obtained is also carried out in Section 5. In step (2) the final size of the triangulation is just the sum of the individual sizes of the triangulations used for the different subpolytopes P × n−1. In particular, if we are just interested in obtaining dissections, we can take an efficient triangulation of P × n−1 and repeat it in every subpolytope. In step (1) the computation of the size is more complicated and to state it in a simple way we introduce the following definitions. When we speak about simplices in a polytope P we implicitly suppose that its vertices are vertices of P , and we identify the simplex with its vertex set. Definition 2.1. Let P be a polytope of dimension l and let τ be a simplex of dimension l + m − 1 in P × m−1. Let {v1, . . . , vm } be the vertices of m−1. Then τ , understood as a vertex set, decomposes as τ = τ1 ∪ · · · ∪ τm with τi ⊂ P × {vi }. (i) We define the sequence (|τ1| − 1, . . . , |τm | − 1) to be the type of the simplex τ . The weight of a simplex τ of type (t1, . . . , tm ) is the number 1/ im=1 ti !. (ii) The weighted size of a triangulation T of P × m−1 is τ∈T weight(τ ), and the weighted efficiency is l τ∈T weight(τ ) ml . With this, our main result can be stated as: Theorem 2.2. Consider polytopes P of dimension l and Q of dimension n − 1. Let m be such that m ≤ n. Given a triangulation T0 of P × m−1 of weighted size t0 and a triangulation TQ of Q, then there are triangulations of P × Q with size at most |TQ |t0 n l m + l . Using this method to triangulate I l+n−1 = I l × I n−1 starting from a triangulation of I n−1 and another one of I l × m−1 we conclude: Theorem 2.3. If there is a triangulation T0 of I l × m−1 with weighted efficiency ρ0, then for every ε > 0 and all n bigger than lmρ0/ε we have ρnn++ll−−11 ≤ ρnn−−11(ρ0 + ε)l . lim ρi ≤ ρ0. i→∞ As a consequence, Observe that the definition of weighted efficiency makes sense even in the case m = 1, where all the simplices of P × 0 have the same type, equal to (l) if dim( P) = l, and the same weight, equal to 1/ l!. In particular, the weighted efficiency of a triangulation of I l × 0 is the same as the usual “non-weighted” one. Another common point between efficiency and weighted efficiency is that the weighted efficiency of a triangulation of I l × m−1 is always less than or equal to 1, and it is 1 if and only if the triangulation is unimodular; i.e., if every simplex has volume 1/(l + m − 1)! (this is proved in Section 6). We now describe the practical results obtained. The last theorem leads us to study the smallest weighted efficiency of triangulations of I l × m−1; we denote it by ρl,m . This number can be calculated by minimizing a linear form over the so-called universal polytope of all the triangulations of I l × m−1. The definition of this universal polytope for triangulations of an arbitrary polytope P is as follows (see [ 3 ] for further details): Let ( P) be the set of all the simplices of maximal dimension which use as vertices only vertices of P. Given a triangulation T of P, its incidence vector VT ∈ R (P) has a 1 in the coordinates corresponding to simplices of T and a 0 in the others. The universal polytope of P is conv{VT : T is a triangulation of P}. In our case, to calculate the smallest weighted size (and efficiency), we have to minimize over the universal polytope of I l × m−1 the linear form having as coefficient m of each simplex its weight 1/ i=1 ti !. (To minimize non-weighted efficiency and size one just uses the functional with all coefficients equal to 1.) One of the results in [ 3 ] is a description of the vertices of the universal polytope as integer solutions of a certain system of linear inequalities derived from the oriented matroid of P. Thus, our minimization problem is restated as an integer linear programming problem. In order to apply our method, we have used the program UNIVERSAL BUILDER by de Loera and Peterson [ 4 ]. Given as input the vertices of P, the program generates the linear system of equations defining the universal polytope of P. The output is a file readable by the linear programming software CPLEX. We have created a routine that generates our particular objective function. Table 2 shows the results obtained in the cases we have been able to solve. Note that ρl,1 = ρl and so the column m = 1 in Table 2 is the same as the second row of Table 1. The fact that ρ1,m = 1 for every m reflects that every triangulation of the prism I × m−1 is unimodular. In the case of ρ2,m we prove (Section 7.1) that the smallest weighted efficiency is always 3m2/4 /m2. That is to say, √3/4 for even m and √3/4 + (m−2) for odd m. The computation of ρ3,3 involved a system with 74,400 variables, whose resolution by CPLEX took 37 hours of CPU on a SUN UltraSparc. 3. Polyhedral Subdivision of P × Subdivision of P × m−1 k1+···+km−1 Induced by a Polyhedral We call polyhedral subdivisions of a polytope P its face-to-face partitions into subpolytopes which only use vertices of P as vertices. Let P be a polytope of dimension l. Let m and k1, . . . , km be natural numbers and let n := k1 + · · · + km . Let v1, . . . , vm be the m vertices of the standard simplex m−1 and let v11, . . . , vk11 , . . . . . . , v1m , . . . , vkmm be the vertices of n−1. Observe that, implicitly, we have the following surjective map: This map uniquely extends to an affine projection π0: induces a projection n−1 → m−1. In turn, this vert( n−1) → vert( m−1), vij → vi . π = 1 × π0: P × ( p, a) n−1 → P × m−1, → ( p, π0(a)). Given the projection π and a polyhedral subdivision S of the target polytope P × m−1, it is obvious that the inverse images π −1(B) of the subpolytopes of S form a subdivision of P × n−1 into subpolytopes matching face to face. In a more general projection it would not be true that those subpolytopes use as vertices only vertices of P × n−1. However, it is true in our case: Lemma 3.1. Let B ⊂ P × m−1 be a subpolytope with vert(B) ⊂ vert( P × Let π be the projection considered before. Let B˜ = {( p, vij ) : ( p, vi ) ∈ vert(B)}. Then m−1). π −1(B) ⊂ conv(B˜ ). Proof. Let ( p, a) be a point of π −1(B), so ( p, π0(a)m) ∈ B. Let us write a as a convex combination of the vertices of n−1, that is, a = i=1 kj=i1 λij vij , with λij ≥ 0, ∀i, j and i j λij = 1. Without loss of generality, we can suppose that none of the sums kj=i1 λij is zero, otherwise everything “happens” on a face of m−1 and we can restrict the statement to that face. Let ( p11, v1), . . . , ( pl11 , v1), ( p12, v2), . . . , ( pl22 , v2), . . ., ( p1m , vm ), . . . , ( plmm , vm ) be the vertices of B, so we have B˜ = {( phi , vij ) : i = 1, . . . , m, j = 1, . . . , ki , h = 1, . . . , li }. We now write ( p, π0(a)) as a convex combination of the vertices of B, that is, ( p, π0(a)) = µ ih ( phi , vi ), m li i=1 h=1 with µ ih ≥ 0, ∀i, h, and because π0(a) = im=1 i h µ ih = 1. Observe that kj=i1 λij = kj=i1 λij vi . Then it is easy to check that lhi=1 µ ih for every i , ( p, a) = m ki li i=1 j=1 h=1 λij µ ih kj=i1 λij ( phi , vij ) and 1 = m ki li i=1 j=1 h=1 λij µ ih kj=i1 λij . That is, ( p, a) is a convex combination of points of B˜ , as we wanted to prove. Corollary 3.2. Under the previous conditions: (i) π −1(B) = conv(π −1(vert(B))). (ii) vert(π −1(B)) = B˜ . Proof. In both equalities, the inclusion from right to left is trivial. In the second one, observe that if ( p, vij ) is in B˜ , then ( p, vi ) is a vertex of B. Therefore, ( p, vij ) ∈ π −1(B) and it is a vertex of P × n−1, which implies that it is a vertex of π −1(B). Inclusions from left to right follow from Lemma 3.1, because: (1) B˜ ⊂ π −1(vert(B)) ⇒ π −1(B) ⊂ conv(B˜ ) ⊂ conv(π −1(vert(B))). (2) π −1(B) ⊂ conv(B˜ ) ⇒ vert(π −1(B)) ⊂ vert(conv(B˜ )) = B˜ , where the last equality follows from the fact that all the elements of B˜ are vertices of P × n−1. Corollary 3.3. Every polyhedral subdivision S of P ×n−1.mF−u1rtihnedrumceosrea, tphoelvyehretdicreasl subdivision S˜ := π −1(S) = {π −1(B) : B ∈ S} of P × of each subpolytope π −1(B) in this subdivision are B˜ := {( p, vij ) : ( p, vi ) ∈ vert(B)}. 4. Triangulation of P × P × m−1 k1+···+km−1 Induced by a Triangulation of We suppose now that the polyhedral subdivision S of P × m−1 is a triangulation. A convenient graphic representation of the vertices of the polytope P × m−1 is as a grid whose rows represent vertices of P and whose m columns represent the vertices v1, . . . , vm of m−1. In order to represent a subset of vertices of P × m−1 we just mark the corresponding squares. In the same way we can represent the vertices of P × k1+···+km−1, but now it is convenient to divide the grid horizontally in blocks, each of them corresponding to each ki and containing the vertices v1i, . . . , vkii of k1+···+km−1. Figure 1 shows how to obtain, with the notation of the previous section, the set B˜ associated to a simplex B ∈ S in this graphic representation. In the i th block, rows corresponding to vertices ( p, vi ) in B have all their squares marked. Restricting B˜ to that block gives precisely conv({ p1i, . . . , plii }) × conv({v1i, . . . , vkii }), with the notation used for the vertices of B in the proof of Lemma 3.1. Since B is a simplex, any subset of its vertices also forms a simplex; thus, the restriction of B˜ to each block is a product of two simplices. Recall that the staircase triangulation of the product of two simplices k × l is the one whose k+kl simplices are all the possible monotone staircases in a grid of size (k + 1) × (l + 1). Following this analogy, we define multi-staircases as follows: Definition 4.1. Let B˜ = π −1(B) be a subpolytope of P × obtained in Section 3. k1+···+km−1 of the kind (i) A multi-staircase in B˜ is any subset of vertices which, restricted to every block, forms a monotone staircase. (ii) The multi-staircase triangulation of B˜ is the one which has as simplices the different multi-staircases (see Fig. 2). Lemma 4.2. The multi-staircases indeed form a triangulation of B˜ and taking the multi-staircase triangulations of the different B˜ ’s obtained from a triangulation of P B ~ B P ∆ m-1 ∆ k1+...+km-1 Fig. 1. How to obtain B˜ from B. P × m−1 we get a triangulation of P × triangulation. k1+···+km −1, which we call multi-staircase Proof. It is clear that multi-staircases form full-dimensional simplices in B˜ . A way to prove that a collection T of full-dimensional simplices in a polytope B˜ is a triangulation is to show that: (1) They induce a triangulation on one face of B˜ . (2) For each full-dimensional simplex in the collection, the removal of any single vertex produces a codimension 1 simplex either • lying on a facet of B˜ and not contained in any other simplex of T , or • contained in exactly another full-dimensional simplex of T which is separated from the first one by their common facet. In our case, the first condition follows by induction on k1 + · · · + km , the base case being k1 + · · · + km = m. For the second condition, let σ be a multi-staircase, and let ( p, v) be a vertex in it. Then one of the following three things happens (Fig. 3 gives an example of a multi-staircase): • If ( p, v) is the only point of σ in its column, then no other multi-staircase contains σ \{( p, v)}. Removing ( p, v) indeed produces a codimension 1 simplex contained in a facet P × k1+···+km −2 of P × k1+···+km −1. • If ( p, v) is the only point of σ in a row within a block, then no other multi-staircase contains σ \{( p, v)}. Removing ( p, v) indeed produces a codimension 1 simplex in a facet of B˜ of the form π −1( B\{( p, π0(v))}) (remember that B = π( B˜ ) is a simplex). • If ( p, v) is an elbow in the multi-staircase, then removing it leads to a uniquely different way of completing the multi-staircase. More precisely, let ( p , v) and ( p, v ) be the points of the multi-staircase adjacent to ( p, v). Then removing ( p, v) and inserting ( p , v ) produces the other possible multi-staircase. The obvious affine dependency ( p, v)+( p , v ) = ( p, v )+( p , v) implies that the two multi-staircases lie in opposite sides of their common facet. Lemma 4.3. Let li be the number of vertices of B in the i th column. Then the multistaircase triangulation of B˜ has exactly im=1 ki −k1i+−l1i −1 simplices. Proof. In each sub-block there are ki −1+li −1 possible monotone staircases. ki −1 5. A Triangulation of P × Q We consider polytopes P of dimension l and Q of dimension n − 1. We assume we are given a triangulation TQ of Q, which induces a decomposition of P × Q into cells isomorphic to P × n−1. Then any decomposition n := k1 + · · · + km allows us to apply the procedure of Sections 3 and 4 to triangulate the cells P × n−1 starting from a triangulation T0 of P × m−1. There are two important tasks remaining: first, show that the triangulations of the different P × n−1 can be achieved in a coordinated way to obtain a real triangulation of P × Q; second, analyze the efficiency of that triangulation. Both of them will be done in this section, using the following trick: Consider a partition of the vertices of Q into m “colors”. Then in each subpolytope P × n−1 of P × Q the vertices of the factor n−1 are colored as well. We use this coloring to construct the projections n−1 → m−1 we need for each of them. Then on each common face (isomorphic to P × k , k < n − 1) of two of the cells P × n−1 we get the multi-staircase triangulation induced by the m-coloring of Q restricted to that face. Hence, the triangulations of the different cells P × n−1 intersect face-to-face, and we obtain a triangulation TP×Q of P × Q, which we call the multi-staircase triangulation of P × Q. In order to analyze the size of TP×Q , we suppose that the m-coloring of the vertices of Q is chosen at random with a uniform distribution. For each σ ∈ TQ let σi := {vertices of σ colored i }, and for each τ ∈ T0, τi := {vertices of τ over the i th vertex of m−1}. By Lemma 4.3, the triangulation TP×Q we obtain has σ ∈TQ τ∈T0 i=1 m |σi | − 1 + |τi | − 1 |τi | − 1 m |τi | − 1 simplices. The expected value of this sum, when the coloring is random, equals the sum of the expected values. So let us fix a pair of simplices τ ∈ T0 and σ ∈ TQ and calculate the expected value of We say li := |τi | and ki := |σi |. The li ’s are considered constants, while the ki ’s are random variables depending on the coloring. They follow a multinomial distribution, in which the probability of the m-tuple (k1, . . . , km ) is P(k1, . . . , km ) = n!/(k1! · · · km !mn). Since nx = x n/n!, where x n := x (x − 1) · · · (x − n + 1) is the nth falling power of x , we can write E m i=1 . For the numerator in the right-hand side of this equation we use the following result from [ 11 ] (Theorem 4.4.4): Theorem 5.1. Let X1, . . . , Xm be scalar random variables. Then the expected value of im=1 Xivi is given by the formal calculus E m X vi i = ∂v1+···+vm ∂ z1v1 · · · ∂ zmvm E m ziXi i=1 i=1 z1=···=zm=1 in which extra variables zi , i = 1, . . . , m, appear with formal purposes. Lemma 5.2. Let l1, . . . , lm be positive integers with li = l + m and let k1, . . . , km be random variables obeying a multinomial distribution with ki = n. Then m i=1 E (ki − 1 + li − 1)li −1 n l ≤ l + m . Proof. If some li equals 1 we can neglect it in the statement: we remove it and will still have (li − 1) = l. Hence we assume li ≥ 2 for every i . We use the following formula for expectations under a multinomial distribution, again taken from [11] (p. 53, last formula in the proof of Theorem 4.2.1): E m i=1 ziki = m 1 z i=1 m i n . Since im=1(li − 1) = l and only the ki depend on the random process, applying Theorem 5.1 to the random variables Xi := ki + li − 2 and using the equality above we get E m i=1 (ki − 1 + li − 1)li −1 = = = ∂l ∂l ∂l ∂ zl11−1 · · · ∂ zlmm−1 ∂ zl11−1 · · · ∂ zlmm−1 ∂ zl11−1 · · · ∂ zlmm−1 E ziki −1+li −1 m i=1 m i=1 m i=1 zli −2 E i zli −2 i m i=1 ziki z=1 (∗) m ≤ ≤ where the last inequality comes from li ≤ l+1 (since (li −1) = l and li −1 ≥ 1), and the aonnde mGanr(kze)d:=with aimn=a1smt1ezriiskn.nUeesdinsgtothbaet proved. For this we say Fl1,...,lm (z) := im=1 zlii −2 ∂k ∂ xk f (x)g(x) = k j=0 k ∂ j ∂k− j j ∂ x j f (x) ∂ xk− j g(x) we come up to ∂li −1 ∂ zlii −1 (Fl1,...,lm (z)Gn(z)) = li −1 li − 1 j=0 j Therefore, since (li −2)li −1− j m 1 j n j Fl1,..., j+1,...,lm (z)Gn− j (z). and we get ∂l ∂ zl11−1 · · · ∂ zlmm−1 Fl1,...,lm (z)Gn(z) ∂l ∂lm−1 ∂l1−1 ∂ z1l1−1 · · · ∂ zmlm−1 h(z) = ∂ zmlm−1 · · · ∂ z1l1−1 (h(z)) · · · [Fh1,...,hm (z)]z=1 = [Gt (z)]z=1 = 1, = = ≤ = l1−1 j1=0 l1−1 j1=0 l1−1 j1=0 · · · · · · · · · lm−1 m jm=0 i=1 lm−1 m jm=0 i=1 lm−1 m jm=0 i=1 m li −1 li − 1 i=1 ji =0 ji z=1 li − 1 (li − 2)li −1− ji ji li − 1 (li − 2)li −1− ji ji li − 1 ji (li − 2)li −1− ji (li − 2)li −1− ji 1 ji 1 ji 1 ji m m m n ji n ji (n − j1 − · · · − ji−1) ji m 1 ji j n i = m i=1 n li −1 li − 2 + m This lemma is crucial to prove the two theorems announced in Section 2. Indeed, Theorem 2.2 is just a version of the following more precise statement: Lemma 5.3. Consider polytopes P of dimension l and Q of dimension n − 1. Let m be such that m ≤ n. Given a triangulation T0 of P × m−1 of weighted size t0 and a triangulation TQ of Q, the expected size of the multi-staircase triangulation TP×Q of P × Q is bounded above by Proof. Lemma 5.2 implies that Hence, E E m ki − 1 + li − 1 i=1 li − 1 σ∈TQ τ∈T0 i=1 m ki − 1 + li − 1 li − 1 = E m (ki − 1 + li − 1)li−1 i=1 (li − 1)! Proof of Theorem 2.3. Let t0 = ρ0lml be the weighted size of the triangulation in the statement. For any n ≥ lmρ0/ε, m n ρ0 + ε ≥ ρ0 n m + l , nl (ρ0 + ε)l ≥ ρ0lml n l n l m + l = t0 m + l , (n(+n −l−1)1!)! (ρ0 + ε)l ≥ t0 m + l . n l Theorem 2.2, with Q = In−1 and P = Il, tells us that or, in other words, So, we have proved the first part of the theorem: n l ϕn+l−1 ≤ ϕn−1t0 m + l , (n + l − 1)!ρnn++ll−−11 ≤ t0 m + l . n l (n − 1)!ρnn−−11 lmρ0 ∀ε > 0, ∀n ≥ ε , ρnn++ll−−11 ≤ ρnn−−11(ρ0 + ε)l. The second part of the statement follows from the first one with arguments similar to those of Corollary 1.2. Recursively, we have that ∀ε > 0, ∀i ∈ N, ∀n ≥ lmρ0 ε , ρn+il ≤ ρnn/(n+il)(ρ0 + ε)il/(n+il). This implies that for the given l and any fixed n, taking ε = lmρ0/n we get lim ρn+il ≤ ρ0 + i→∞ lmρ0 n . That is, the sequence of indices congruent to n modulo l has limit bounded by the righthand side. Since we can make n as big as we want and the rest of the right-hand side are constants, the l subsequences of indices modulo l have limit bounded by ρ0, hence the limit of the whole sequence has this bound. 6. Interpretation of Our Method via the Cayley Trick The Cayley Trick allows us to study triangulations of a product P × n−1 as mixed subdivisions of the Minkowski sum P + · · · + P (n summands). We overview this method here, but the reader should look at [ 7 ] for more details. Let Q1, . . . , Qm ⊂ Rd be convex polytopes of vertex sets Ai . Consider their Min kowski sum, defined as m i=1 m i=1 Qi = {x1 + · · · + xm : xi ∈ Qi }. We understand im=1 Qi as a marked polytope, whose associated point configuration is im=1 Ai := {q1 + · · · + qm : qi ∈ Ai }. Here a marked polytope is a pair ( P, A) where P is a polytope and A is a finite set of points of P including all the vertices. Subdivisions of a marked polytope are defined in Chapter 7 of [ 5 ] (sometimes they are called subdivisions of A). Roughly speaking, they are the polyhedral subdivisions of P which use only elements of A as vertices (but perhaps not all of them). They form a poset under the refinement relation. The minimal elements are the triangulations of A. A subset B of im=1 Ai is called mixed if B = B1 + · · · +m Bm for some non-empty subsets Bi ⊂ Ai , i = 1, . . . , m. A mixed subdivision of i=1 Qi is a subdivision of it whose cells are all mixed. Mixed subdivisions form a subposet of the poset of all subdivisions, whose minimal elements are called fine mixed, in which every mixed cell is fine, i.e., does not properly contain any other mixed cell. We call Cayley embedding of {Q1, . . . , Qm } the marked polytope (C(Q1, . . . , Qm ), C(A1, . . . , Am )) in Rd × Rm−1 dRedfi×neRdma−s1foblelothwes:inlceltuesi1o,n. .g.i,veemn bdye nµoit(ex )an=a(ffixn,eei )b.aTsihseinnwRemd−e1finaned let µ i : Rd → C(A1, . . . , Am ) := µ i (Ai ), C(Q1, . . . , Qm ) := conv(C(A1, . . . , Am )). Each Qi is naturally embedded as a face in C(Q1, . . . , Qm ). Moreover, the vertex set of C(Q1, . . . , Qm ) is the disjoint union of the vertices of all the Qi ’s. This induces the following bijection between cells in C(Q1, . . . , Qm ) and mixed cells in Q1 + · · · + Qm : To each mixed cell B1 + · · · + Bm we associate the disjoint union B1 ∪ · · · ∪ Bm . To a cell B in C(Q1, . . . , Qm ), we associate the Minkowski sum B1 + · · · + Bm , where Bi = B ∩ Qi . Theorem 6.1 (The Cayley Trick [ 7 ]). Let Q1, . . . , Qm ⊂ Rd be convex polytopes. The bijection just exhibited induces an isomorphism between the poset of all subdivisions of C(Q1, . . . , Qm ) and the poset of mixed subdivisions of im=1 Qi . In this isomorphism triangulations correspond to fine mixed subdivisions. Remark 6.2. With the previous definitions, for any polytope P: P × m−1 = C( P, . m. ., P). In particular, in our context the Cayley Trick provides the following bijections between triangulations and mixed subdivisions: Triangulation of P × m−1  Cayley Trick  Triangulation of P × n−1  Cayley Trick  m Fine mixed subdivision of P+ · · · +P −→ n Fine mixed subdivision of P+ · · · +P Our interest in the Cayley Trick is twofold. On the one hand, it provides a way to visualize our candidate triangulations of I l × m−1 as objects in dimension l, instead of l + m − 1. We use this in Section 7. On the other hand, the construction of the previous sections has a simple geometric interpretation in terms of the Cayley Trick. More precisely, the polyhedral subdivision of Corollary 3.3 can be obtained as follows: Let S be a polyhedral subdivision of P × m−1, and let SM be the corresponding mixed m subdivision of P+ · · · + P. Each cell in S decomposes uniquely as m i=1 Bi × {vi }, where the Bi are subsets of vertices of P. The corresponding cell in SM is just B1 + · · · + Bm . To construct our polyhedral subdivision of P × n−1 we just need to scale each summand Bi by the integer ki which tells us how many vertices of n−1 correspond to the vertex vi of m−1. n That is to say, from SM we construct a mixed subdivision of P+ · · · + P by the formula k1 km SM = {B1+ · · · +B1 + · · · + Bm + · · · +Bm : B1 + · · · + Bm ∈ SM }. The polyhedral subdivision S˜ of P × n−1 stated in Corollary 3.3 is the one corresponding n via the Cayley Trick to the mixed subdivision SM of P+ · · · + P. Also the type and weight of a simplex in P × m−1 have a simple interpretation via the Cayley Trick. With the notation of Definition 2.1, let τ = τ1 ∪ · · · ∪ τm be a simplex. The m corresponding cell τM in P+ · · · + P is the Minkowski sum of the simplices τ1, . . . , τm , which lie in complementary affine subspaces. Hence, τM is combinatorially a product of m simplices, of dimensions t1, . . . , tm where (t1, . . . , tm ) is the type of τ . Then the weight of τ represents the volume of τM , normalized with respect to the unit parallelepiped in the lattice spanned by the vertices of τM . With this we can prove: Proposition 6.3. Let P be a lattice polytope of dimension l. Let V be its volume, normalized to the unit parallelepiped in the lattice. Then the weighted size of a triangulation of P × m−1 is at most ml V , with equality if and only if the triangulation is unimodular (with respect to the lattice). In particular, the weighted efficiency of a triangulation of I l × m−1 is at most one, with equality for unimodular triangulations. Proof. If P is a lattice polytope (e.g., a cube), then the lattice spanned by τM is a m sublattice of the one spanned by the point configuration P+ · · · + P, and coincides with it if and only if τ is unimodular. Then, for unimodular triangulations, the weighted size m is just the volume of P+ · · · + P, normalized to the unit parallelepiped, which equals ml V . For non-unimodular triangulations the weighted size is smaller than that. More on ρl,m In this section we obtain the value of ρ2,m for any m and we also show triangulations of I 3 × 1 and I 3 × 2 providing the values of ρ3,2 and ρ3,3 stated in Section 2. 7.1. Smallest Weighted Efficiency of Triangulations of I 2 × m−1 Here we prove: Theorem 7.1. The smallest weighted efficiency ρ2,m of triangulations of I 2 × m−1 is ρ2,m = 3m2/4 m2 . That is, √3/4 for even m and √3/4 + (m−2) for odd m. A fine mixed subdivision of I 2+ · m· · +I 2 corresponding to a triangulation of I 2 × m−1 with that weighted efficiency is given in Fig. 4. m m Let BM = B1+ · · · +Bm be a cell in a fine mixed subdivision of I 2+ · · · +I 2 (a square of size m). Each Bi must be a simplex coming from the i th copy of I 2, and in order to have a fine mixed subdivision, the different Bi ’s must lie in complementary m−1 with smallest weighted affine subspaces. Then there are the following possibilities: • BM is a triangle, obtained as the sum of a triangle in one of the I l ’s and a single point in the others. The weight of BM is 12 . • BM is a quadrangle, obtained as the sum of two (non-parallel) segments from two of the Bi ’s and a point in the rest of them. Three types of quadrangles can appear, depending on whether none, one, or both of the two segments involved is a diagonal of I 2: a square parallel to the axes, a rhomboid (both with area 1), and a diagonal square (of area 2). The weight of BM is 1. In particular, the weighted size of the mixed subdivision equals T /2 + S1 + S2 + R, where T , S1, S2, and R denote, respectively, the numbers of triangles, squares of area 1, m squares of area 2, and rhombi in the subdivision. Since the total area of I 2+ · · · +I 2 is m2 = T /2 + S1 + 2S2 + R, we conclude that: m Proposition 7.2. The weighted size of a mixed subdivision of I 2+ · · · +I 2 equals m2 − S2, where S2 is the number of squares of size 2 in the subdivision. With this we can already conclude that the fine mixed subdivisions shown in Fig. 4 (one for m even and one for m odd) have weighted size equal to 3m2/4 , since they have exactly m2/4 squares of area 2. Our task is now to prove that no mixed subdivision can have more than m2/4 squares of area 2. For this we use: m Lemma 7.3. Taking the i th summands of all the mixed cells B1+ · · · +Bm in a mixed m subdivision of P1+ · · · + Pm produces a polyhedral subdivision of Pi . If the mixed subdivision was fine, the polyhedral subdivision is a triangulation. Proof. By the Cayley Trick, the mixed subdivision of P1+ · m· · + Pm induces a polyhedral subdivision of C( P1, . . . , Pm ), and a triangulation if the mixed subdivision is fine. Since the polytope Pi appears as a face in C( P1, . . . , Pm ), any subdivision (resp. triangulation) of C( P1, . . . , Pm ) induces a subdivision (resp. triangulation) of Pi . That this subdivision is the one obtained taking the i th summands of all the mixed cells follows from Theorem 6.1. Proposition 7.4. Let SM be a fine mixed subdivision of I 2+ · m· · +I 2. Let a and b be the number of summands I 2’s which are triangulated in one and the other possible triangulations of I 2 (i.e., using one or the other diagonal). Then the number of squares of area 2 in SM is at most ab and the weighted size of SM is at least m2 − ab. Proof. Each square of area 2 is the Minkowski sum of two opposite diagonals of two copies of I 2 (say, the i th and j th copies), and a point in the other m − 2 of the copies of I 2. Clearly, the two copies which contribute diagonals have to be triangulated in opposite ways. The only thing which remains to be shown is that the same pair of copies of I 2 cannot contribute two different squares of size 2. For this, observe that “contracting” in every mixed cell of a mixed subdivision all the summands other than the i th and j th should give a mixed subdivision of Pi + Pj . In a mixed subdivision of two squares there is no room to put two different diagonal squares of area 2. In the statement of Proposition 7.4, we have that a + b = m. In particular, the maximum possible value of ab is m2/4 . This finishes the proof of Theorem 7.1. 7.2. Smallest Weighted Efficiency Triangulations of I 3 × m−1, m = 2, 3 Here we try to visualize triangulations of I 3 × 1 and I 3 × 2 which minimize the weighted efficiency, which we computed using the integer programming approach sketched in Section 2. Of course, we use the Cayley Trick to decrease the dimension, so we show the corresponding fine mixed subdivision of a Minkowski sum instead of the triangulation itself. • I 3 × 1 I 3 × 1 = C(I 3, I 3) ←→ I 3 + I 3. We have to give a subdivision of a 3-cube of size 2. For this we first cut the eight corners of the cube, producing a cubeoctahedron, a semiregular 3-polytope with six square and eight triangular facets. The edges of the cubeoctahedron can be distributed in four “equatorial hexagons,” each of which cuts the polytope into two halves. Figure 5 depicts these halves for one of the equatorial hexagons. The labels in the vertices are heights, interpreted as follows: our point configuration is {0, 1, 2}3 and the height of point (i, j, k) is just i + j + k. It turns out that performing three of these four possible halvings, the cubeoctahedron is decomposed into six triangular prisms and two tetrahedra. In Fig. 5 each half is actually decomposed into three prisms and one tetrahedron. These, together with the eight tetrahedra we have cut from corners, form a fine mixed subdivision of {0, 1, 2}3 with ten tetrahedra and six triangular prisms. Its weighted size is then 10 · 16 + 6 · 12 = 3 14 and its weighted efficiency √3(14/3)/8. • I 3 × 2 I 3 × 2 = C(I 3, I 3, I 3) ←→ I 3 + I 3 + I 3. The fine mixed subdivision of I 3 + I 3 + I 3 is given in Fig. 6. It consists of 20 triangular prisms, 16 tetrahedra, and 2 parallelepipeds. Thus, the weighted size of the triangulation is 20 12 + 16 16 + 2 11 = 434 , and then the smallest weighted efficiency is ρ3,3 = Let us explain how to interpret Fig. 6. Again, each point (i, j, k) in {0, 1, 2, 3}3 has been given a height i + j + k, which is written next to it. The subdivision is displayed in five parts. The left-top portion in the figure is a half cubeoctahedron exactly as the 3 5 3 6 7 5 6 Fig. 6. Fine mixed subdivision of I 3 + I 3 + I 3 corresponding to a triangulation of I 3 × weighted efficiency. one in Fig. 5. The reader has to assume it divided into a tetrahedron and three triangular prisms, as before. The left-bottom portion consists of a corner tetrahedron and three triangular prisms located at corners of the cube, each joined to the half cubeoctahedron by a tetrahedron. So far we have six prisms and five tetrahedra, and the same is got from the right-top and right-bottom portions of the figure. In between the two half cubeoctahedra, however, we now have a hexagonal prism decomposed into two triangular prisms and two quadrilateral prisms, all of height √3. The hexagonal prism is surrounded by a belt formed by six triangular prisms and six tetrahedra. The thick edges in Fig. 6 represent edges of the big 3-cube of side 3, whose three visible facets are drawn by dotted lines. We have also shaded the facets of the subdivision which are contained in those facets of the big 3-cube. 1. R. Anderson , B. Hughes , Simplexity of the cube , Discrete Math., 158 ( 1996 ), 99 - 150 . 2. A. Below , J. A. de Loera, J. Richter-Gebert, Finding minimal triangulations of convex 3-polytopes is NPhard , in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000 , San Francisco, California, United States, ACM Press, New York, 2000 , pp. 65 - 66 . 3. J. A. de Loera , S. Hos¸ten, F. Santos , B. Sturmfels , The polytope of all triangulations of a point configuration, Doc . Math., 1 ( 1996 ), 103 - 119 . 4. J. A. de Loera , S. Peterson, universalbuilder. Software available at http://www.math.ucdavis. edu/∼deloera/RECENT WORK/universalbuilder.tar.gz 5. I. M. Gel'fand, M. M. Kapranov , A. V. Zelevinsky , Multidimensional Determinants, Discriminants and Resultants, Birkha¨user, Boston, 1994 . 6. H. Haiman , A simple and relatively efficient triangulation of the n-cube, Discrete Comput . Geom. , 6 ( 1991 ), 287 - 289 . 7. B. Huber , J. Rambau , F. Santos , The Cayley Trick, lifting subdivisions and the Bohne-Dress Theorem on zonotopal tilings , J. European Math. Soc. (JEMS) , 2 ( 2 ) ( 2000 ), 179 - 198 . 8. C. W. Lee , Subdivisions and triangulations of polytopes, in Handbook of Discrete and Computational Geometry (J.E. Goodman and J. O 'Rourke, eds.), CRC Press, New York, 1997 , pp. 271 - 290 . 9. W. D. Smith , A lower bound for the simplexity of the N -cube via hyperbolic volumes , European J. Combin. , 21 ( 1 ) ( 2000 ), 131 - 137 . 10. M. J. Todd , The Computation of Fixed Points and Applications, Lecture Notes in Economics and Mathematical Systems , Vol. 124 , Springer-Verlag, Berlin, 1976 . 11. P. Whittle, Probability via Expectation, 3rd edition, Texts in Statistics, Springer-Verlag, Berlin, 1992 .

This is a preview of a remote PDF:

David Orden, Francisco Santos. Asymptotically Efficient Triangulations of the d-Cube, Discrete & Computational Geometry, 2003, 509-528, DOI: 10.1007/s00454-003-2845-5