Lifts for Voronoi Cells of Lattices

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct small-size linear programs. Motivated by algorithmic implications for the closest vector problem, we study lifts of Voronoi cells of lattices. We construct an explicit d-dimensional lattice such that every lift of the respective Voronoi cell has 2Ω(d/logd)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{\Omega (d/{\log d})}$$\end{document} facets. On the positive side, we show that Voronoi cells of d-dimensional root lattices and their dual lattices have lifts with O(d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {O}}}(d)$$\end{document} and O(dlogd)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {O}}}(d \log d)$$\end{document} facets, respectively. We obtain similar results for spectrahedral lifts.

In this work, we study to which extent this phenomenon also applies to Voronoi cells of lattices.Here, a lattice is the image of Z d under a linear map.We say that a lattice is k-dimensional, if k is the dimension of its linear hull.The Voronoi cell VC(Λ) of a lattice Λ ⊆ R d is the set of all points in lin(Λ) for which the origin is among the closest lattice points, i.e., VC(Λ) := {x ∈ lin(Λ) : x ≤ x − z for all z ∈ Λ} , where lin(•) denotes the linear hull and • denotes the Euclidean norm.The lattice translates z + VC(Λ), z ∈ Λ, induce a facet-to-facet tiling of lin(Λ), so that in particular Voronoi cells of lattices are what is commonly called space tiles, see Figure 1.Moreover, it is known that VC(Λ) is a centrally symmetric polytope with up to 2(2 d − 1) facets.We refer to [22,Ch. 32] for background on translative tilings of space.
It is tempting to believe that the rich structure of Voronoi cells of lattices allows to construct polytopes with significantly fewer than 2(2 d − 1) facets and that linearly project onto VC(Λ).In fact, this is true for several examples: A lattice whose Voronoi cell has the largest possible number of facets is the dual root lattice A d (see Section 3.1 for a definition).However, its Voronoi cell is a permutahedron and admits a lift with only O(d log d) facets [17], see Section 3.1.More generally, if the Voronoi cell of a d-dimensional Figure 1: A lattice in R 2 together with its Voronoi cell and the corresponding tiling of the plane via its lattice translates.lattice is a zonotope, then it has O(d 2 ) generators and hence has a lift with O(d 2 ) facets.We discuss this result in detail in Section 3.2.
The lattice A d also belongs to the prominent class of root lattices and their duals.By their algebraic and geometric properties, these lattices are prime examples in various contexts: For example, they play a crucial role in Coxeter's classification of reflection groups (cf.[9,Ch. 4]), and they yield the densest sphere packings and thinnest sphere coverings in small dimensions (see [9] or [39]).
As one part of our work, we show that Voronoi cells of such lattices generally admit small lifts.In what follows, for a polytope P we write xc(P ) for the minimum number of facets of any polytope that can be linearly projected onto P .This number is called the extension complexity of P .This raises the question whether Voronoi cells of other lattices also have a small extension complexity, say, polynomial in their dimension.One of the main motivations for representing a polytope P as the projection of another polytope Q is that a linear optimization problem over P can be reduced to one over Q.If Q has a small number of facets, then the latter task can be expressed as a linear program with a small number of inequalities, also known as an extended formulation.
Thus, given a lattice Λ ⊆ R d whose Voronoi cell has a small extension complexity, we may phrase any linear optimization problem over VC(Λ) as a small-size linear program.Such a representation may have several algorithmic consequences for the closest vector problem.In this problem, one is given Λ and a point x ∈ R d and is asked to determine a lattice point that is closest to x, i.e., a point in Note that z ∈ cl(x, Λ) if and only if x − z ∈ VC(Λ).Thus, a small extension complexity of VC(Λ) would yield a small-size linear program to test whether a lattice point is the closest lattice vector to x.However, in view of the fact that the closest vector problem is NPhard [42] and the belief that NP = coNP, we do not expect efficient algorithms that, for general lattices (given in form of a basis), decide whether a point is the closest lattice vector to x.Another sequence of algorithmic implications arises from the algorithm of Micciancio & Voulgaris [33], which also motivated other recent work on compact representations of Voronoi cells, such as [24], see also [25, § 3.7].
We remark that the mere existence of small size extended formulations of Voronoi cells may not be immediately applicable, since finding such representations as well as verifying that they indeed yield the Voronoi cell of a given lattice might be hard.Thus, polynomial bounds on the extension complexities of Voronoi cells of general lattices would not contradict hardness assumptions in complexity theory.In fact, we initially considered the possibility of such bounds.
However, as our main result we explicitly construct lattices with Voronoi cells of extension complexity close to the trivial upper bound 2(2 d − 1).
Lower bounds on extension complexities have been established for various prominent polytopes in recent years.Of particular note are results for cut polytopes [15,26,6], matching polytopes [38], and certain stable set polytopes [19].Lower bounds for other polytopes Q are typically obtained by showing that a face F of Q affinely projects onto one of the polytopes P from above and using the simple fact xc(P ) ≤ xc(F ) ≤ xc(Q).Unfortunately, it seems difficult to construct lattices for which this approach can be directly applied to the Voronoi cell.However, we will exploit the lesser known fact that xc(Q) = xc(Q • ) holds for every polytope Q with the origin in its interior, where Q • is the dual polytope of Q.In fact, we will describe a way to obtain many 0/1-polytopes as projections of faces of dual polytopes of Voronoi cells of lattices.As an example, for every n-node graph G we can construct a lattice Λ of dimension at most n + 1 such that the stable set polytope of G is a projection of a face of VC(Λ) • .Theorem 2 then follows from a construction of Göös, Jain & Watson [19] of stable set polytopes with high extension complexity.
Another prominent way of representing polytopes is via linear projections of feasible regions of semidefinite programs, i.e., spectrahedra.We will discuss how our approach also yields a version of Theorem 2 for such semidefinite lifts with a slightly weaker but still superpolynomial bound.
Outline In Section 2, we provide a brief introduction to lifts of polytopes and lattices, focusing on tools and properties that are essential for our arguments in the following sections.In Section 3, we derive upper bounds on the extension complexity of Voronoi cells for some selected classes of lattices, such as root lattices and their duals, zonotopal lattices, and a class of lattices that do not admit a compact representation in the sense of [24].The proof of Theorem 2 is given in Section 4, and in Section 5, we briefly introduce semidefinite lifts and present a version of Theorem 2 with a superpolynomial bound on the semidefinite extension complexity.We close our paper with a discussion of open problems in Section 6. Lemma 3.For every face F of a polytope P , we have xc(F ) ≤ xc(P ).
Proof.If P is the image of a polyhedron Q with k facets under a linear map τ , then F is the image of τ −1 (F ) ∩ Q, which is a face of Q and hence has at most k facets.
For the next fact we need the notion of a slack matrix of a polytope.To this end, we consider a polytope , where [m] := {1, . . ., m} and •, • denotes the standard Euclidean scalar product.Corresponding to these two descriptions of P , we define the slack matrix S = (S i,j ) ∈ R m×n ≥0 via S i,j = b i − a i , v j .Yannakakis [46] showed that the extension complexity xc(P ) of P equals the nonnegative rank of S, which is the smallest number r such that S = F V , where F ∈ R m×r ≥0 and V ∈ R r×n ≥0 , and which is denoted by r + (S).For a polytope P containing the origin 0 in its relative interior, the dual polytope of P is defined as It is a basic fact that P • is again a polytope with the origin in its relative interior, lin(P • ) = lin(P ), and (P • ) • = P .Moreover, it is easy to see that if In particular, this shows that if S is a slack matrix of P induced by v 1 , . . ., v n and w 1 , . . ., w m , then S is a slack matrix of P • .Since r + (S) = r + (S ) we obtain the following fact.
Lemma 4. For every polytope P ⊆ R d that contains the origin in its relative interior, we have xc(P ) = xc(P • ).
The next statement shows that the extension complexity behaves well under Cartesian products, Minkowski sums and intersections.
Proof.(i): If P linearly projects onto P and Q onto Q, then P × Q linearly projects onto P × Q.Moreover, the number of facets of P × Q is equal to the sum of the number of facets of P and Q .
(ii): The polytope P × Q linearly projects onto P + Q via (p, q) → p + q for (p, q) ∈ P × Q, and hence the claim follows from (i).
(iii): If P = π(P ) and Q = τ (Q ) hold for some polyhedra P , Q and linear maps π, τ , then Moreover, the number of facets of L is at most the number of facets of P × Q , which, again, is equal to the sum of the number of facets of P and Q .
The next fact is a very useful result following from a work of Balas [3] deriving a description of the convex hull of the union of certain polytopes.The proof of the version presented here can be found in [44,Prop. 3.1.1].Lemma 6.Let P 1 , . . ., P k be polytopes, then We mentioned already that some lattices have a permutahedron as their Voronoi cell.These polytopes arise from a single vector by permuting its coordinates in all possible ways and taking their convex hull.Let us denote the set of all bijective maps on [d] by S d .For a permutation π ∈ S d and a vector ) be the vector that arises from v via permuting its entries according to π.

Lattices and Voronoi cells
Most basic notions regarding lattices and their Voronoi cells have been already introduced in Section 1.In this section, we provide some further definitions and results that we use to obtain bounds on the extension complexity of Voronoi cells of lattices.
We call two lattices Λ, Γ ⊆ R d isomorphic, if there exists an orthogonal matrix Q ∈ R d×d such that QΛ = Γ.Note that VC(Γ) = Q VC(Λ) and therefore the extension complexities of their Voronoi cells coincide.
In some parts, we will consider the dual lattice of a lattice Λ ⊆ R d , which is defined as Λ = {x ∈ lin(Λ) : x, y ∈ Z for all y ∈ Λ} .
Note that for every two lattices Λ, Γ, their product Λ × Γ is also a lattice.The following lemma shows that the Cartesian product behaves well with respect to Voronoi cells or duals of lattices.
Lemma 8.For any two lattices Λ ⊆ R d and Γ ⊆ R d we have The proof is straightforward from the definitions and is left as an exercise.A main ingredient for proving Theorem 2 is to consider the dual polytope VC(Λ) • of VC(Λ).Recall that we have xc(VC(Λ)) = xc(VC(Λ) • ) by Lemma 4. The following two observations are crucial for our arguments.Lemma 9.For every lattice Λ we have Proof.In view of the identities the claim follows from (1).
with equality if and only if z ∈ cl(p, Λ) \ {0}.Note that the above inequality is equivalent to p, 2 z 2 z ≤ 1.Thus, due to Lemma 9 we see that F := {y ∈ VC(Λ) • : p, y = 1} is a face of VC(Λ) • .This establishes the claim since 3 Lattices with small extension complexity In this section, we provide bounds on the extension complexities of Voronoi cells of some prominent lattices.

Root lattices and their duals
We start with Voronoi cells of root lattices and their duals.An irreducible root lattice is a lattice Λ for which there exists a finite set S of vectors of squared length equal to 1 or 2, such that Λ = { b∈S α b b : α b ∈ Z for all b ∈ S}.We say that a lattice is a (general) root lattice, if it is isomorphic to a lattice obtained by iteratively taking Cartesian products with irreducible root lattices.A well-known theorem related to the classification of reflection groups states that besides the lattice Z d of integers, up to isomorphism the irreducible root lattices split into the two infinite classes x(1) + . . .+ x(d + 1) = 0 and and the three exceptional lattices x, e 7 + e 8 = 0} and x, e 6 + e 8 = 0} .
Here and in the following, we denote by e i the ith standard Euclidean unit vector and by 1 the all-one vector in the corresponding space.Moreover, the dual lattices of the two infinite classes A d and D d are given by , for 0 ≤ i ≤ d and j = d + 1 − i, and respectively.In the literature the dual D d is usually scaled by a factor of 2 in order to get an integral lattice, which is often more convenient to investigate.In order to avoid confusion, we denote it by and note that this scaling has no effect on the extension complexity of its Voronoi cell.We refer to Conway & Sloane [9, Ch. 4 & Ch.21] and Martinet [31,Ch. 4] for proofs, original references and background information on root lattices.Details on Voronoi cells and Delaunay polytopes of root lattices can be found in Moody & Patera [34], which together with the two aforementioned monographs are our main sources of information.Given a lattice Λ ⊆ R d we write |Λ| = min{ z : z ∈ Λ\{0}} for the length of a shortest non-trivial vector in Λ.A minimal vector of Λ is any vector z ∈ Λ with z = |Λ|, and a facet vector of Λ is any vector w ∈ Λ, such that the constraint x, w ≤ 1 2 w 2 defines a facet of the Voronoi cell VC(Λ).For convenience, we write for the set of minimal vectors and facet vectors, respectively.In general, one has the inclusion S(Λ) ⊆ F(Λ), which however is usually strict.Root lattices are now neatly characterized by the property that every facet vector is at the same time a minimal vector, that is, the equality S(Λ) = F(Λ) holds (see Rajan & Shende [36]).
Since the set of minimal vectors of the irreducible root lattices are well-understood, this allows to describe their Voronoi cells as well.For the sake of the asymptotic study of the extension complexity of their Voronoi cells, it suffices to understand the two infinite families A d and D d , and their duals A d and D d .In the sequel, we provide bounds on the extension complexities of the Voronoi cells of these lattices.To achieve these bounds, we sometimes use a characterization of the facet vectors and in other cases we use a characterization of the vertices of the Voronoi cell.For the sake of easy reference, we describe the vertices and facet vectors in all cases.Due to Lemma 5 and Lemma 8, these bounds directly imply Theorem 1.Moreover, the bound in Theorem 1 is asymptotically tight since the Voronoi cell of A d is a permutahedron, see Lemma 13.

Voronoi cell of A d
The Voronoi cell of the root lattice A d is given by Proof.Using the description of the vertices of VC(D d ) stated above, we obtain that Hence, the dual of the Voronoi cell is the intersection of a hypercube and a crosspolytope.

Voronoi cell of A d
The Voronoi cell of the dual of the root lattice A d is given by . Moreover, we have The characterization of the vertices can be found in [9, Ch.21, Sec.3F] and the fact that the facet vectors are exactly the vertices of VC(A d ) is explained in detail in the unpublished monograph [10,Ch. 3.5].

Lemma 13. xc(VC(A d )) = Θ(d log d).
Proof.Using the description of the vertices of VC(A d ) stated before, we obtain that VC(A d ) is an affine linear transformation of the standard permutahedron The claim follows, since Goemans [17] showed that the extension complexity of P d is in Θ(d log d).

Voronoi cell of D d
As explained before, we consider the integral lattice D Moreover, we have Note that all the bounds stated in Lemmas 11, 12, and 14 are asymptotically tight, since the extension complexity of a polytope grows at least linearly with its dimension (cf.[13, Eq. 2 & Prop.5.2]).

Zonotopal lattices
A zonotope Z ⊆ R d is the Minkowski sum of finitely many line segments, that is, there are vectors a The non-zero vectors z i = b i − a i are usually called the generators of the zonotope, and clearly, Z is an affine projection of the m-dimensional cube [−1, 1] m via e i → z i , for 1 ≤ i ≤ m, and a suitable translation.Regarding the extension complexity of a zonotope Z, the bound xc(Z) ≤ 2m thus immediately follows from the definition.
A lattice Λ ⊆ R d is said to be zonotopal if its Voronoi cell is a zonotope.Every lattice of dimension at most three is zonotopal, but from dimension four on there exist non-zonotopal lattices.For instance, the Voronoi cell of the root lattice D 4 is the non-zonotopal 24-cell.Examples of classes of zonotopal lattices are Z d , the root lattice A d , its dual lattice A d , lattices of Voronoi's first kind, and the tensor product A d ⊗A d .Zonotopal space tiles have been extensively studied over the years, mostly due to their combinatorial connections to regular matroids, hyperplane arrangements, and totally unimodular matrices.For a detailed account on zonotopal lattices and pointers to the original works containing the previous statements we refer to [32,Sect. 2].
The tiling constraint on a zonotope that arises as the Voronoi cell of a lattice, allows it to have at most quadratically many generators in terms of its dimension.In particular, these polytopes admit lifts with quadratically many facets.
Proof.It suffices to argue that the Voronoi cell is generated by at most d+1 2 line segments.Indeed, each line segment L satisfies xc(L) = 2 and hence the statement follows using Lemma 6.
Erdahl [11,Sect. 5] proved that the generators of a space tiling zonotope correspond to the normal vectors of a certain dicing.A dicing in R d is an arrangement of hyperplanes consisting of r ≥ d families of infinitely many equallyspaced hyperplanes such that: (1) there are d families whose corresponding normal vectors are linearly independent, and (2) every vertex of the arrangement is contained in a hyperplane of each family.
By [11,Thm. 3.3], every dicing is affinely equivalent to a dicing whose set of hyperplane normal vectors -one normal vector for each of the r families -consists of the columns of a totally unimodular d × r matrix.By construction, this totally unimodular matrix is such that for any two of its columns v, w, we have v = ±w and v, w = 0.A classical result, that is often attributed to Heller [23] but already appears in Korkine & Zolotarev [28], yields that every such totally unimodular d × r matrix has at most r ≤ d+1 2 columns.Thus, the zonotopal Voronoi cell VC(Λ) is generated by at most d+1 2 line segments.
Alternatively, the fact that zonotopal Voronoi cells in R d are generated by at most d+1 2 line segments also follows from Voronoi's reduction theory.The Delaunay subdivisions of zonotopal lattices correspond to certain polyhedral cones (Voronoi's L-types) in the cone S d ≥0 of positive semi-definite d × d matrices that are generated by rank one matrices.Since S d ≥0 has dimension d+1 2 , Carathéodory's Theorem yields the bound.We refer the reader to Erdahl [11,Sect. 7] for an intuitive description and references to the original works.

Lattices defined by simple congruences
For any a ∈ N, we consider the lattice The case a = d 2 played a special role in [24,Thm. 2] for the determination of lattices that do not have a basis that admits a compact representation of the Voronoi cell.To this end, the authors determined the set F(Λ d ( d 2 )) of facet vectors explicitly (there are exponentially many of them).However, their proof can be extended to general a to give a description of the facet vectors of F(Λ d (a)) that is precise enough to allow drawing conclusions towards small extended formulations.
Lemma 16.For all a ∈ N, the set of facet vectors of Λ d (a) is contained in where the last union is over all k ∈ [d − 1], ∈ { ak d , ak d } and the sets V ±1 , V ±a and V k, are defined as follows: Combining these bounds and applying Lemma 6 and Lemma 4, we obtain the desired bound.

Lower bounds on the extension complexity of Voronoi cells
The aim of this section is to prove Theorem 2. Inspired by Kannan's proof [27,Sec. 6] of the NP-hardness of the closest vector problem, for every 0/1-polytopes P we are able to construct a lattice such that a face of its dual Voronoi cell projects onto P .To obtain a lattice of small dimension, P needs to fulfill some extra condition.
Lemma 18.Let H ⊆ R k be an affine subspace such that all vectors in X := {0, 1} k ∩ H have the same norm.There is a lattice Λ with dim(Λ) ≤ dim(H) + 1 such that conv(X) is a linear projection of a face of VC(Λ) • .
Proof.Let α ≥ 0 be such that x = α for all x ∈ X.We may assume that H is nonempty and that α > 0, otherwise conv(X) is empty or consists of a single point, in which case the claim is trivial.Let h ∈ H and let L be the linear subspace such that H = L + h.Consider the lattice holds.The claim then follows from Lemma 10.First note that U ⊆ Λ.Moreover, we have p − 0 = α and for each x ∈ X we have p − (x, −α) = x = α.Thus, in order to establish (4) it remains to show that every lattice point z = (z , z ) ∈ Λ \ U satisfies α < p − z .Equivalently, we have to show that every such point satisfies ( equality only if z ∈ {0, 1} k .However, in the latter case we would have z ∈ {0, 1} k ∩ H = X and hence z ∈ U , a contradiction.Thus, we obtain (5).Finally, if z = −2α, then f (z) = z 2 + α 2 and 1, z = 2α 2 > 0, implying z = 0 and hence (5) holds.
While the previous lemma appears quite restrictive, the next lemma shows that we may apply it to a large class of 0/1-polytopes.
for all x ∈ X.There is a lattice Λ of dimension at most k + 1 such that conv(X) is the linear projection of a face of VC(Λ) • .Proof.Consider the set and observe that projecting X onto the first k coordinates yields the set X.Moreover, notice that every vector in X consists of exactly k + m ones.In other words, the norm of every vector in X is √ k + m and hence, we may apply Lemma 18 to obtain a lattice Λ with dimension at most k + 1 such that conv(X ) is the linear projection of a face F of VC(Λ) • .Since conv(X) is a linear projection of conv(X ), we see that conv(X) is also a linear projection of F .
Proof of Theorem 2. We use a result of Göös, Jain & Watson [19] that yields a family of n-node graphs G such that the stable set polytope P G of G satisfies xc(P G ) = 2 Ω(n/ log n) .Let X ⊆ {0, 1} n denote the set of characteristic vectors of stable sets in G. Notice that and the claim follows since d = O(n).

Open questions
We conclude our investigations of the extension complexity of Voronoi cells of lattices with a collection of some open problems that naturally arise from our studies and which we find interesting to pursue in future research.
In view of Theorem 2 a natural question is whether the logarithmic term in the lower bound 2 Ω(d/ log d) on the extension complexity of certain Voronoi cells can be removed: Question 21.Does there exist a family of d-dimensional lattices Λ such that xc(VC(Λ)) = 2 Ω(d) ?
We remark that our bound relies on a lower bound by Göös, Jain & Watson [19] on extension complexities of stable set polytopes, which meet the criteria of Lemma 19.It is known that there exist d-dimensional 0/1-polytopes with extension complexity 2 Ω(d) , see [37].However, no explicit construction of such polytopes is known and so it is unclear how to transform such polytopes in order to apply Lemma 18 efficiently.
Comparing the superpolynomial bound in Theorem 2 with the polynomial upper bounds for certain classes of lattices in Section 3, the question arises what we can expect the extension complexity of the Voronoi cell of a generic lattice to be.Of course, this requires a suitable notion of a random lattice.Our question refers to interesting examples such as Siegel's measure [41] or uniform distributions over integer lattices of a fixed determinant, see Goldstein & Mayer [18].
In Theorem 2 we have shown that exactly describing a Voronoi cell of a lattice may require superpolynomial-size extended formulations.It would be interesting to understand how this situation changes if we allow approximations instead of exact descriptions, in particular in view of various results on the complexity of the approximate closest vector problem, see, e.g., Aharonov & Regev [1].To this end, for α ≥ 1 we say that a polytope Q is an α-approximation of a polytope P , if P ⊆ Q ⊆ αP .

Question 23. What can be said about extension complexities of α-approximations of Voronoi cells of lattices?
We have seen in Theorem 1 that not only the root lattices but also their dual lattices have polynomial extension complexity.Is that a general phenomenon?Question 24.Given a d-dimensional lattice Λ, is there a polynomial relationship between xc(VC(Λ)) and xc(VC(Λ ))?
Given that in view of Theorem 15 zonotopal lattices admit lifts with quadratically many facets, and the fact that the closest vector problem on such lattices can be solved in polynomial time (see [32]), one might expect that small-sized lifts of the corresponding Voronoi cells can actually be constructed explicitly.
Question 25.Given a basis of a d-dimensional zonotopal lattice Λ, is it possible to construct an explicit lift of VC(Λ) with polynomially many facets in polynomial time?
Note that our arguments leading to Theorem 15 are not constructive.

Theorem 1 .
For every d-dimensional lattice Λ that is a root lattice or the dual of a root lattice, we have xc(VC(Λ)) = O(d log d).
1} d .We refer to [9, Ch.21, Sect.3E] for the characterization of the facet vectors and the inner description of the Voronoi cell, which is therein denoted by the symbols β(d, d/2), for d even, and 1 2 δ(d, (d − 1)/2), for d odd.Lemma 14. xc(VC(D d )) = O(d).Proof.Using the above description of the facet vectors, we obtain that VC( D d ) = [−1, 1] d ∩ d 2 • conv{±e 1 , . . ., ±e d }.Hence, the Voronoi cell of D d is the intersection of a hypercube and a crosspolytope.As in the case of the root lattice D d , the stated bound follows by Lemma 5 and Equation (2).