Abstract
We study deformations of graphical zonotopes. Deformations of the classical permutahedron (which is the graphical zonotope of the complete graph) have been intensively studied in recent years under the name of generalized permutahedra. We provide an irredundant description of the deformation cone of the graphical zonotope associated to a graph G, consisting of independent equations defining its linear span (in terms of non-cliques of G) and of the inequalities defining its facets (in terms of common neighbors of neighbors in G). In particular, we deduce that the faces of the standard simplex corresponding to induced cliques in G form a linear basis of the deformation cone, and that the deformation cone is simplicial if and only if G is triangle-free.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The of a graph G is a convex polytope whose geometry encodes several combinatorial properties of G. For example, its vertices are in bijection with the acyclic orientations of G [39, Prop. 2.5] and its volume is the number of spanning trees of G [40, Ex. 4.64]. When G is the complete graph \(K_n\), the graphical zonotope is a translation of the classical n-dimensional . This polytope, obtained as the convex hull of the n! permutations of the vector \((1,2,\dots ,n)\in \mathbb {R}^n\), was first introduced by Schoute in 1911 [37], and has become one of the most studied polytopes in geometric and algebraic combinatorics.
A (a.k.a. ) is a polytope obtained from the permutahedron by translating its facet-defining hyperplanes without passing through a vertex. These polytopes were originally introduced by Edmonds in 1970 under the name of as a polyhedral generalization of matroids in the context of linear optimization [16]. They were rediscovered by Postnikov in 2009 [31], who initiated the investigation of their rich combinatorial structure. They have since become a widely studied family of polytopes that appears naturally in several areas of mathematics, such as algebraic combinatorics [1, 2, 34], optimization [17], game theory [14], statistics [27, 28], and economic theory [20]. The set of deformed permutahedra can be parametrized by the cone of [16, 31].
In general, a deformation of a polytope can be equivalently described as (i) a polytope obtained from by moving the vertices so that the directions of all edges are preserved [31, 34], (ii) a polytope obtained from by translating its facet-defining halfspaces without passing through a vertex [31, 34], (iii) a polytope whose normal fan coarsens the normal fan of [23], (iv) a polytope whose support function is a convex piecewise linear continuous function supported on the normal fan of [13, Sec. 6.1] [15, Sec. 9.5], or (v) a Minkowski summand of a dilate of [26, 38]. The set of deformations of always forms a polyhedral cone under dilation and Minkowski addition, which is called the of [31]. Its interior is called the of the normal fan of [23], and contains those polytopes with the same normal fan as . When has rational vertex coordinates, then the type cone is known as the and encodes the embeddings of the associated toric variety into projective space [13].
There exist several methods to parametrize and describe the deformation cone of a given polytope (see e.g. [34, App. 15]), for example via the and the or via the and the . However, these methods only provide redundant inequality descriptions of the deformation cone. Not even the dimension of the deformation cone is easily deduced from these descriptions, as illustrated by the difficulty of describing which fans have a nonempty type cone (i.e. describing [15, Chap. 9.5.3]), or a one dimensional type cone (i.e. describing polytopes [21, 24, 26, 36, 38]).
The search of irredundant facet descriptions of deformation cones of particular families of combinatorial polytopes has received considerable attention recently [3, 7, 9, 10, 12, 32, 33]. One of the motivations sparking this interest arises from the to study scattering amplitudes in mathematical physics [6]. As described in [33, Sec. 1.4], the deformation cone provides canonical realizations of a polytope (seen as a [5]) in the positive region of the kinematic space, akin to those of the associahedron in [4].
The main result of this paper (Theorem 2.6) presents complete irredundant descriptions of the deformation cones of graphical zonotopes. Note that, since graphical zonotopes are deformed permutahedra, their type cones appear as particular faces of the submodular cone. Faces of the submodular cone are far from being well understood. For example, determining its rays remains an open problem since the 1970 s, when it was first asked by Edmonds [16].
It is worth noting that most of the existing approaches to compute deformation cones only focus on simple polytopes with simplicial normal fans [11, 34]. Nevertheless, most graphical zonotopes are not simple. They are simple only for chordful graphs (those where every cycle induces a clique), see [34, Prop. 5.2], [22, Rem. 6.2], or [29, Prop. 52]. In this paper, we thus use an alternative approach to describe the deformation cone of a non-simple polytope based on a simplicial refinement of its normal cone.
The paper is organized as follows. We first recall in Sect. 1 the necessary material concerning polyhedral geometry (Sect. 1.1), deformation cones (Sect. 1.2), and graphical zonotopes (Sect. 1.3). We then describe in Sect. 2 the deformation cone of any graphical zonotope, providing first a possibly redundant description (Sect. 2.1), then irredundant descriptions of its linear span (Sect. 2.2) and of its facet-defining inequalities (Sect. 2.3), and finally a characterization of graphical zonotopes with simplicial type cones (Sect. 2.4).
2 Preliminaries
2.1 Fans and Polytopes
We mainly follow [41] for the notation concerning polyhedral geometry, and we refer to it for more background and details.
A in \(\mathbb {R}^d\) is the convex hull of finitely many points. Its are the zero-sets of non-negative affine functions on . Its , and are its faces of dimension 0, dimension 1, and codimension 1, respectively. A d-dimensional polytope is called if every vertex is incident to d facets.
Similarly, a in \(\mathbb {R}^d\) is the positive span of finitely many vectors, and its are the zero-sets of non-negative linear functions on . Its and are its faces of dimension and codimension 1, respectively. Its is the inclusion-minimal face, which is always the largest linear subspace contained in . A cone is if its rays are linearly independent, and if its lineality is \(\{{\varvec{0}}\}\). Note that every cone can be decomposed as the free sum of its lineality with a pointed cone (obtained from any section transversal to the lineality).
A in \({\mathbb {R}}^d\) is a collection of cones closed under taking faces and such that the intersection of any two cones is a common face of the two cones. Two cones of a fan are if they share a facet. The fan is if the union of its cones is \({\mathbb {R}}^d\), if all its cones are pointed, and if all its cones are simplicial. We will say that is on the set of vectors \({\varvec{S}}\) if every cone of is the cone spanned by a subset of \({\varvec{S}}\). An essential fan is supported by representatives of its rays, and this is the unique inclusion-minimal set with this property, up to positive rescaling. For non-essential fans, however, non-canonical choices have to be made. We say that \(\mathcal {G}\) and that \(\mathcal {G}\) if every cone of a fan is a union of cones of a fan \(\mathcal {G}\).
The of a face of a polytope in \(\mathbb {R}^d\) is the polyhedral cone in the dual space \((\mathbb {R}^d)^*\) (which we identify with \(\mathbb {R}^d\) via the standard inner product) consisting of the linear forms whose maximal value on is attained on all the points of . The of is the collection of all the normal cones to its faces. It is always complete, and essential whenever is full dimensional.
The of two polytopes and is the polytope . The normal fan of is the common refinement of the normal fans of and . We say that is a of if there is a polytope such that , and a if there is a scalar \(\lambda \ge 0\) and a polytope such that . Equivalently, is a weak Minkowski summand of if and only if the normal fan of refines the normal fan of [38, Thm. 4]. The polytope is called if all its weak Minkowski summands are of the form for some scalar \(\lambda \ge 0\) and vector \({\varvec{t}} \in \mathbb {R}^d\).
A is a Minkowski sum of line segments, called its . Its normal fan is the fan induced by the arrangement of hyperplanes orthogonal to these segments, see [41, Sec. 7.3].
2.2 Deformation Cones
The weak Minkowski summands of a polytope are also known as of , as they can be always obtained from by translations of its facet-defining inequalities. It is sometimes convenient to consider the set of deformations of embedded inside the real vector space of [30]. This is the set of formal differences of polytopes under the equivalence relation whenever . Endowed with Minkowski addition, it is the Grothendieck group of the semigroup of polytopes, which are embedded into via the map . It extends to a real vector space via dilation: for and \(\lambda \in \mathbb {R}\), we set when \(\lambda \ge 0\), and when \(\lambda < 0\). Here, denotes the dilation of by \(\lambda \ge 0\). (Note in particular that does not represent the reflection of , but its group inverse.)
As we already mentioned, the set of deformations of a polytope forms a polyhedral cone under dilation and Minkowski addition, called the and denoted by :
Note that is a closed convex cone (dilations and Minkowski sums preserve weak Minkowski summands) and contains a lineality subspace of dimension d (translations preserve weak Minkowski summands). It is the set of all polytopes whose normal fan coarsens the normal fan of . Its interior consists of all polytopes whose normal fan is , and was called the of by McMullen [23]. The faces of are the deformation cones of the Minkowski summands of P, and the face lattice is described by the inclusions whenever the normal fan of coarsens the normal fan of . Having into account the lineality, we will say that the deformation cone is when its quotient modulo translations is simplicial. We will also talk about the rays of , meaning the rays of its quotient modulo translations. They are spanned by the indecomposable Minkowski summands of of dimension at least 1 (note that 0-dimensional summands account for the space of translations).
There are several linearly isomorphic presentations of this cone. The first ones we are aware of are due to McMullen [23] and Meyer [26], even though a description was already implicit in previous work of Shephard [38]. In fact, the type cone can also be reinterpreted as a chamber of regular triangulations of a vector configuration, as introduced in the theory of secondary polytopes [18], see [15, Sect. 9.5] for details. Other formulations can be found, for example, in the appendix of [34].
The following convenient formulation from [11, Lem. 2.1] shows that the deformation cone of simple polytopes is isomorphic to a polyhedral cone, and provides an explicit inequality description, usually called the
Let be a polytope with normal fan supported on the vector set \({\varvec{S}}\). Let \({\varvec{G}}\) be the \(N \times d\)-matrix whose rows are the vectors in \({\varvec{S}}\). For any height vector \({\varvec{h}} \in \mathbb {R}^N\), we define the polytope It is not hard to see that any weak Minkowski summand of is of the form for some \({\varvec{h}} \in \mathbb {R}^N\).
Moreover, for deformations and of , we have and for any \(\lambda >0\). Hence, the deformation cone, which lies in the space of virtual polyhedra, is linearly isomorphic to the cone
To describe this cone with the wall-crossing inequalities, we need some extra notation. For any pair of adjacent maximal cones \(\mathbb {R}_{\ge 0}{\varvec{R}}\) and \(\mathbb {R}_{\ge 0}{\varvec{R}}'\) of a simplicial fan there is a non-zero linear dependence
among the rays of \({\varvec{R}} \cup {\varvec{R}}'\). This dependence is unique up to rescaling, because the vectors in \({\varvec{R}}\) are linearly independent. For convenience in the exposition, we will denote by the coefficient of \({\varvec{s}}\) in the unique linear dependence such that , where \({\varvec{R}} \smallsetminus \{{\varvec{r}}\} = {\varvec{R}}' \smallsetminus \{{\varvec{r}}'\}\).
Proposition 1.1
([11, 18]) Let be a simple polytope with simplicial normal fan supported on the rays \({\varvec{S}}\). Then the deformation cone is the set of polytopes for all \({\varvec{h}}\) in the cone of \(\mathbb {R}^{\varvec{S}}\) defined by the inequalities
for all adjacent maximal cones \(\mathbb {R}_{\ge 0}{\varvec{R}}\) and \(\mathbb {R}_{\ge 0}{\varvec{R}}'\) of .
Example 1.2
Consider the hexagon and its normal fan depicted in Fig. 1. The fan has six rays labeled \(1, \dots , 6\) and six maximal cones labeled \(a,\dots , f\). The deformation cone lies in \(\mathbb {R}^6\), but has a 2-dimensional lineality space. The six pairs of adjacent maximal cones of give rise to following six defining inequalities for :
where \(H^\ge _{ij}\) denotes the halfspace defined by the inequality corresponding to the two adjacent maximal cones i and j. Note that the inequality \(H^\ge _{af}\) is redundant. The hexagon corresponds to the height vector \((\nicefrac {1}{2}, \nicefrac {3}{4}, \nicefrac {5}{4}, 1, \nicefrac {3}{2}, \nicefrac {5}{4})\).
This characterization can be extended to general (not necessarily simple) polytopes. One straightforward way to do so is via a simplicial refinement of the normal fan. If such a simplicial refinement contains additional rays, then the type cone will be embedded in a higher dimensional space, but projecting out these additional coordinates gives a linear isomorphism with the standard presentation. See [35, Prop. 3] and [33, Prop. 1.7].
Proposition 1.3
Let be a polytope whose normal fan is refined by the simplicial fan \(\mathcal {G}\) supported on the rays \({\varvec{S}}\). Then the deformation cone is the set of polytopes for all \({\varvec{h}}\) in the cone of \(\mathbb {R}^{\varvec{S}}\) defined by
-
the equalities for any adjacent maximal cones and of \(\mathcal {G}\) belonging to the same maximal cone of ,
-
the inequalities for any adjacent maximal cones and of \(\mathcal {G}\) belonging to distinct maximal cones of .
2.3 Graphical Zonotopes
Let \(G :=(V,E)\) be a graph with vertex set V and edge set E. The is the arrangement of the hyperplanes for all edges \({\{u,v\} \in E}\). It induces the whose cones are all the possible intersections of one of the sets , , or for each edge \(\{u,v\}\in E\). The lineality of is the subspace of \(\mathbb {R}^V\) spanned by the characteristic vectors of the connected components of G.
The is the Minkowski sum of the line segments \([{\varvec{e}}_u,{\varvec{e}}_v]\) in \(\mathbb {R}^V\) for all edges \({\{u,v\}\in E}\). Here, \(({\varvec{e}}_v)_{v \in V}\) denotes the canonical basis of \(\mathbb {R}^V\). Note that lies in a subspace orthogonal to . The graphical fan is the normal fan of the graphical zonotope .
The following result is well-known. For example, it can be easily deduced from [39, Prop. 2.5] or [8] (for the latter, see that the graphical matroid from Sec. 1.1 is realized by the graphical arrangement, and use the description of the cells of the arrangement in terms of covectors from Sec. 1.2(c)).
An \((\mu ,\omega )\) of G consists of a partition \(\mu \) of V where each part induces a connected subgraph of G, together with an acyclic orientation \(\omega \) of the quotient graph \(G/\mu \). We say that \((\mu ,\omega )\) refines \((\mu ',\omega ')\) if each part of \(\mu \) is contained in a part of \(\mu '\) and the orientations are compatible; that is, for all \(u,v\in V\) if there is a directed path in \(\omega \) between the parts of \(\mu \) respectively containing u and v, then there is a directed path in \(\omega '\) between the parts of \(\mu '\) respectively containing u and v.
Proposition 1.4
The face lattice of is antiisomorphic to the lattice of ordered partitions of G ordered by refinement. Explicitly, the antiisomorphism is given by the map that associates the ordered partition \((\mu ,\omega )\) to the cone defined by the inequalities \({\varvec{x}}_u \le {\varvec{x}}_v\) for all \(u,v\in V\) such that there is a directed path in \(\omega \) from the part containing u to the part containing v (in particular, \({\varvec{x}}_u = {\varvec{x}}_v\) if u, v are in the same part of \(\mu \)).
Some easy consequences of Proposition 1.4 are:
-
The maximal cones of are in bijection with the acyclic orientations of G. We denote by the maximal cone of associated to the acyclic orientation \(\omega \).
-
The minimal cones of , that is the rays of , are in bijection with the of G, i.e. non-empty subsets S of V such that there is a disjoint non-empty subset T of V such that \(S \cup T\) is a connected component of G and the induced subgraphs G[S] and G[T] are connected.
-
The rays of that belong to the maximal cone associated to an acyclic orientation are the biconnected subsets which form an upper set of the acyclic orientation (hence, they are in bijection with the minimal directed cuts of the acyclic orientation).
-
Similarly, the rays of that belong to the cone associated to an ordered partition \((\mu ,\omega )\) are the biconnected sets that contracted by \(\mu \) give rise to an upper set of \(\omega \).
Note that the natural embedding of a graphical fan is not essential, as it has a lineality given by its connected components. This is why we cannot directly talk about the rays of the fan in the enumeration above. The usual solution to avoid this is to consider the quotient by the subspace . However, this subspace depends on the graph, and with such a quotient we would lose the capacity of uniformly treating all the graphs with a fixed vertex set. We will instead work with the natural non-essential embedding, together with a collection of vectors supporting simultaneously all graphical fans.
Example 1.5
When G is the complete graph \(K_n\), the graphical zonotope is the . The graphical fan is the , induced by the consisting of the hyperplanes for all \(1\le i<j\le n\). Its lineality is spanned by the all-ones vector . Since all the proper subsets of \([n]:=\{1,2,\dots ,n\}\) are biconnected in \(K_n\), the face lattice of is isomorphic to the lattice of ordered partitions of [n]. The rays of correspond to proper subsets of [n], and its maximal cells are in bijection with permutations of [n]. Each maximal cell is the positive hull of the \(n-1\) rays corresponding to the proper upper sets of the order given by the permutation. In particular, is a simplicial fan.
3 Graphical Deformation Cones
Our main result is an irredundant facet description of the deformation cone of for every graph \(G :=(V,E)\). Our starting point is Proposition 2.4, which gives a (possibly redundant) description derived from Proposition 1.3. It is strongly based on the fact that the braid fan simultaneously refines all the graphical fans. Note however that the braid fan is not simplicial (due to its lineality). The classical approach to overcome this issue is to quotient the braid fan by its lineality space. However, we prefer to triangulate the braid fan, since it simplifies the presentation of the proof.
3.1 A First Polyhedral Description
Associate to each subset \(S \subseteq V\) the vector
This is essentially the characteristic vector of S, but it has the advantage that and positively span the line , which is the lineality of the braid fan.
Lemma 2.1
For any ordered partition \((\mu ,\omega )\) of a graph \(G :=(V,E)\), we have
Here, we mean that S is an upper set of \(\omega \) when contracted by \(\mu \). Note that \(\varnothing \) and V are always upper sets, which is consistent with the fact that the lineality of always contains the line spanned by .
We will work with a refined version of the braid fan whose maximal cells are
for every acyclic orientation of the complete graph \(K_V\), which we identify with a permutation \(\sigma \) of V. An example is depicted in Fig. 2. The following two immediate statements are left to the reader.
Lemma 2.2
For any finite set V:
-
(i)
The fan is an essential complete simplicial fan in \(\mathbb {R}^V\) supported on the \(2^{|V|}\) vectors \({\varvec{\iota }}_{S}\) for \(S\subseteq V\).
-
(ii)
For any permutation \(\sigma \), the maximal cones and are adjacent, and the unique linear relation supported on the rays of is \({\varvec{\iota }}_{\varnothing } + {\varvec{\iota }}_{V} = {\varvec{0}}.\)
-
(iii)
The other pairs of adjacent maximal cells are of the form and , where \(X\in \{\varnothing ,V\}\) and \(\sigma =PuvS\) and \(\sigma '=PvuS\) are permutations that differ in the inversion of two consecutive elements. The two rays that are not shared by and are \({\varvec{\iota }}_{S\cup \{u\}}\) and \({\varvec{\iota }}_{S\cup \{v\}}\), and the unique linear relation supported on the rays of is given by
$$\begin{aligned} {\varvec{\iota }}_{S \cup \{u\}} + {\varvec{\iota }}_{S \cup \{v\}} = {\varvec{\iota }}_{S} + {\varvec{\iota }}_{S \cup \{u, v\}}. \end{aligned}$$
Lemma 2.3
For any graph \(G :=(V,E)\):
-
(i)
The fan is a simplicial refinement of the graphical fan .
-
(ii)
For an acyclic orientation \(\omega \) of G and \(S\subseteq V\), we have if and only if S is an upper set of \(\omega \).
-
(iii)
For an acyclic orientation \(\sigma \) of \(K_V\) and \(X\in \{\varnothing ,V\}\) we have if and only if \(\sigma \) is a linear extension of \(\omega \).
We are now ready to describe the deformation cone of the graphical zonotope . For any \({\varvec{h}} \in \mathbb {R}^{2^V}\), let be the polytope given by
Proposition 2.4
For any graph \(G :=(V,E)\), the deformation cone of the graphical zonotope is the set of polytopes for all \({\varvec{h}}\) in the cone of \(\mathbb {R}^{2^V}\) defined by the following (possibly redundant) description:
-
\({\varvec{h}}_{\varnothing }=-{\varvec{h}}_{V}\),
-
\({\varvec{h}}_{S \cup \{u\}} + {\varvec{h}}_{S \cup \{v\}} = {\varvec{h}}_{S} + {\varvec{h}}_{S \cup \{u, v\}}\) for each \(\{u,v\}\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \smallsetminus E\) and \(S\subseteq V\smallsetminus \{u,v\}\), and
-
\({\varvec{h}}_{S \cup \{u\}} + {\varvec{h}}_{S \cup \{v\}} \ge {\varvec{h}}_{S} + {\varvec{h}}_{S \cup \{u, v\}}\) for each \(\{u,v\}\in E\) and \(S\subseteq V\smallsetminus \{u,v\}\).
Proof
Observe first that, as stated in Lemma 2.3, provides a simplicial refinement of . Following Proposition 1.3, we need to consider all pairs of adjacent maximal cones of , and to study which ones lie in the same cone of .
Adjacent maximal cones of are described in Lemma 2.2, and the containement relations of the cones of in the cones of are described in Lemma 2.3.
For any \(\sigma \), the cones and belong to the same cell of . Hence, by Proposition 1.3, the following equation holds in the deformation cone:
The remaining pairs of adjacent maximal cones of correspond to pairs of acyclic orientations of \(K_V\) differing in a single edge; or equivalently, to pairs of permutations of V of the form \(\sigma =PuvS\) and \(\sigma '=PvuS\). The unique linear relation supported on the rays of for \(X\in \{\varnothing ,V\}\) is then
We consider first the case when \(\{u,v\}\notin E\). Observe that both \(\sigma \) and \(\sigma '\) induce the same acyclic orientation of G, which we call \(\omega \). We have then by Lemma 2.3. Therefore, by Proposition 1.3 and Lemma 2.2, we have
for any \({\varvec{h}}\) in . Note that, for any \(\{u,v\}\notin E\) and \(S\subset V\smallsetminus \{u,v\}\), we can construct such permutations \(\sigma \) and \(\sigma '\). This gives the claimed description of the linear span of .
In contrast, if \(\{u,v\}\in E\), then \(\sigma \) and \(\sigma '\) induce different orientations of G, and hence they belong to different adjacent cones of by Lemma 2.3. Therefore, by Proposition 1.3 and Lemma 2.2, we have
for any \({\varvec{h}}\) in . As before, for any \(\{u,v\}\in E\) and \(S\subset V\smallsetminus \{u,v\}\), we can construct such permutations \(\sigma \) and \(\sigma '\). This gives the claimed inequalities describing . \(\square \)
3.2 The Linear Span of Graphical Deformation Cones
The description of the deformation cone of Proposition 2.4 is highly redundant, both in the equations describing its linear span and in the inequalities describing its facets. We will give a non-redundant description in Theorem 2.6. The first step will be to give linearly independent equations describing the linear span. As a by-product, we will obtain the dimension and a linear basis of the deformation cone .
For a polytope , we define the space of of as the vector subspace of virtual polytopes generated by the deformations of . Equivalently, is the linear span of the deformation cone . Every virtual polytope in is of the form for deformations . Note that the vector \({\varvec{h}}-{\varvec{h'}}\) uniquely describes the equivalence class of this virtual polytope, and we will use the notation to denote it.
Denote by the face of the standard simplex \(\triangle _V\) corresponding to a subset \(U \subseteq V\). These polytopes are particularly important deformed permutahedra as they form a linear basis of the deformation space of the permutahedron [14] (see also [2, Prop. 2.4]). Namely, any (virtual) deformed permutahedron can be uniquely written as a signed Minkowski sum of dilates of \(\triangle _I\). Our first result states that this linear basis is adapted to graphical zonotopes.
Theorem 2.5
For any graph \(G :=(V,E)\):
-
(i)
The dimension of is the number of non-empty induced cliques in G (the vertices of G count for the dimension as they correspond to the lineality space).
-
(ii)
The faces \(\triangle _K\) of the standard simplex \(\triangle _V\) corresponding to the non-empty induced cliques K of G form a linear basis of .
-
(iii)
is the set of virtual polytopes for all \({\varvec{h}} \in \mathbb {R}^{2^V}\) fulfilling the following linearly independent equations:
-
\({\varvec{h}}_{\varnothing }=-{\varvec{h}}_{V}\) and
-
\({\varvec{h}}_{S \smallsetminus \{u\}} + {\varvec{h}}_{S \smallsetminus \{v\}} = {\varvec{h}}_S + {\varvec{h}}_{S \smallsetminus \{u, v\}}\) for each \(S\subseteq V\) with \(|S|\ge 2\) not inducing a clique of G and any \(\{u,v\}\in \left( {\begin{array}{c}S\\ 2\end{array}}\right) \smallsetminus E\) (here, we only choose one missing edge for each subset S, for example, the lexicographically smallest).
-
Proof
Observe first that the faces \(\triangle _I\) of the standard simplex \(\triangle _V\) corresponding to the induced cliques I of G are all in the deformation cone . Indeed, faces of the standard simplex \(\Delta _I\) belong to the deformation cone of the complete graph \(K_I\) by [31, Prop. 6.3]. The graphical zonotope is a Minkowski summand of for any subgraph \(G'\) of G, and hence summands of are also summands of .
Moreover, all faces \(\triangle _I\) for \({\varnothing \ne I \subsetneq V}\) are Minkowski independent by [2, Prop. 2.4]. This shows that the dimension of is at least the number of non-empty induced cliques of G.
Let \(({\varvec{f}}_X)_{X\subseteq V}\) be the canonical basis of \(\big (\mathbb {R}^{2^V}\big )^*\). The vectors
for all subsets \(\varnothing \ne S \subseteq V\) not inducing a clique of G and one selected missing edge \(\{u, v\}\) for each S, are clearly linearly independent. Indeed, if the \({\varvec{f}}_X\) are ordered according to any linear extension of the inclusion order on the indices X, and the \({\varvec{o}}^S\) are ordered analogously in terms of the indices S, then the equations are already in echelon form, as \({\varvec{f}}_S\) is the greatest non-zero coordinate of \({\varvec{o}}^S\). Finally, the vector \({\varvec{v}}\in 2^V\) with \({\varvec{v}}_X=|X|\) for \(X\in 2^V\) is orthogonal to any \({\varvec{o}}^S\) with \(|S| \ge 2\) but not to \({\varvec{o}}^\varnothing :={\varvec{f}}_{\varnothing }+{\varvec{f}}_{V}\), showing that the latter is linearly independent to the former. This proves that the dimension of is at most the number of non-empty induced cliques of G.
We conclude that \(\big \{ \triangle _K \;\big |\; \varnothing \ne K\subseteq V\text { inducing a clique of }G \big \}\) is a linear basis of the deformation cone, and that \(\big \{ {\varvec{o}}^S \;\big |\; S = \varnothing \text { or } S \subseteq V \text { not inducing a clique of } G \big \}\) is a basis of its orthogonal complement (we slightly abuse notation here as \({\varvec{o}}^S\) was defined in \(\smash {\big (\mathbb {R}^{2^V}\big )^*}\) instead of in , but note that each \({\varvec{f}}_X\) can be considered as a linear functional in if seen as a support function). \(\square \)
Note that the dimension of the deformation space of graphical zonotopes has been independently computed by Raman Sanyal and Josephine Yu (personnal communication), who computed the space of Minkowski 1-weights of graphical zonotopes in the sense of McMullen [25]. Their proof also uses the basis from Theorem 2.5 (ii), but with an alternative argument to show that they are a generating family.
3.3 The Facets of Graphical Deformation Cones
To conclude, it remains to compute the facets of the deformation cones, i.e. a non-redundant inequality description.
We define the of a vertex v of a graph as .
Theorem 2.6
For any graph \(G :=(V,E)\), the deformation cone of the graphical zonotope is the set of polytopes for all \({\varvec{h}}\) in the cone of \(\mathbb {R}^{2^V}\) defined by the following irredundant facet description:
-
\({\varvec{h}}_{\varnothing }=-{\varvec{h}}_{V}\),
-
\({\varvec{h}}_{S \smallsetminus \{u\}} + {\varvec{h}}_{S \smallsetminus \{v\}} = {\varvec{h}}_S + {\varvec{h}}_{S \smallsetminus \{u, v\}}\) for each \(\varnothing \ne S \subseteq V\) and any \(\{u,v\} \in \left( {\begin{array}{c}S\\ 2\end{array}}\right) \smallsetminus E\),
-
\({\varvec{h}}_{S \cup \{u\}} + {\varvec{h}}_{S \cup \{v\}} \ge {\varvec{h}}_{S} + {\varvec{h}}_{S \cup \{u, v\}}\) for each \(\{u,v\}\in E\) and \(S \subseteq N(v) \cap N(v)\).
Note that this description is given as a face of the submodular cone, embedded into \(\mathbb {R}^{2^V}\). One gets easily an intrinsic presentation by restricting to the space spanned by the biconnected subsets of V. However, that presentation loses its symmetry, and the explicit equations depend on the biconnected sets of G.
Proof of Theorem 2.6
We know by Proposition 2.4 that is the intersection of the cone
for \(\{u,v\}\in E \text { and } S\subseteq V\smallsetminus \{u,v\}\) with the linear space given by the equations \({\varvec{h}}_\varnothing =-{\varvec{h}}_V\) and
for \(\{u,v\}\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \smallsetminus E \text { and } S\subseteq V\smallsetminus \{u,v\}\).
We have already determined the equations describing the linear span in Theorem 2.5, so it only remains to provide non-redundant inequalities describing the deformation cone.
We will prove first that the inequalities from (1) indexed by \(\{u,v\}\in E \text { and } S\subseteq N(v)\cap N(v)\) suffice to describe .
To this end, consider an inequality from (1) for which \(S\nsubseteq N(v)\cap N(v)\). Without loss of generality, assume that there is some \(x\in S\) such that \(\{x,v\}\notin E\). We will show that this inequality is induced (in the sense that the halfspaces they define coincide on the linear span of ) by the inequality
where \(S'=S\smallsetminus \{x\}\). Our claim will then follow from this by induction on the elements of \(S\smallsetminus (N(v)\cap N(v))\).
Indeed, if \(\{x,v\}\notin E\), we know by (2) that the following two equations hold in the linear span of by considering the non-edge \(\{x,v\}\) with the subsets \(S'\cup \{u\}\) and \(S'\), respectively:
where we used that \((S'\cup \{u\}) \cup \{x\}=S\cup \{u\}\) and \((S'\cup \{u\}) \cup \{x, v\}=S\cup \{u, v\}\) in the first equation, and that \(S' \cup \{x\}=S\) and \(S' \cup \{x, v\}=S \cup \{ v\}\) in the second equation. To conclude, note that (1) is precisely the linear combination (3 + (4)-(5)).
We know therefore that the descriptions in Proposition 2.4 and Theorem 2.6 give rise to the same cone. It remains to show that the latter is irredundant. That is, that each of the inequalities gives rise to a unique facet of .
Let \(({\varvec{f}}_X)_{X\subseteq V}\) be the canonical basis of \(\big (\mathbb {R}^{2^V}\big )^*\). For \(u,v\in V\) and \(S\subseteq V\smallsetminus \{u,v\}\), let
Note that,if \(\{u,v\}\notin E\), then \({\varvec{n}}(u,v,S)\) is orthogonal to ,whereas if \(\{u,v\}\in E\), then \({\varvec{n}}(u,v,S)\) is an inner normal vector to .
Fix \(\{u,v\}\in E\) and \(S\subseteq N(v)\cap N(v)\). To prove that the halfspace with normal \({\varvec{n}}(u,v,S)\) is not redundant, we will exhibit a vector \({\varvec{w}}\in \mathbb {R}^{2^V}\) in the linear span of that belongs to the interior of all the halfspaces describing except for this one. That is, we will construct a vector \({\varvec{w}}\in \mathbb {R}^{2^V}\) respecting the system:
Denote by \(T :=N(u)\cap N(v)\smallsetminus S\). We will construct \({\varvec{w}}\) as the sum \({\varvec{w}}:={\varvec{t}}^S - {\varvec{t}}^T+ {\varvec{c}}\) for some vectors \({\varvec{t}}^S\), \({\varvec{t}}^T\), and \({\varvec{c}}\in \mathbb {R}^{2^V}\) defined below, whose scalar products with \({\varvec{n}}(a,b,X)\) for \(\{a,b\}\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \) and \(X\subseteq V\smallsetminus \{a,b\}\) fulfill:
It immediately follows from this table that the vector \({\varvec{w}}\) will fulfill the desired properties from (6). For the second one, note that if \(S\ne X \subseteq S\sqcup T\), then either \(|S\cap X|<|S|\) or \(|T\cap X|>0\).
To define these vectors, first, for \(\{x,y,z\}\in \left( {\begin{array}{c}V\\ 3\end{array}}\right) \), let \({\varvec{t}}^{xyz}\in \mathbb {R}^{2^V}\) be the vector such that \({\varvec{t}}^{xyz}_X = 1\) if \(\{x,y,z\} \subseteq X\) and \({\varvec{t}}^{xyz}_X = 0\) otherwise. Note that, for any \(a,b\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \) and \(X\subseteq V\smallsetminus \{a,b\}\), we have
We define
It is straightforward to derive the identities in the table from (7). For the inequalities, notice that if \(\langle \, {\varvec{t}}^{uvx} \; | \; {\varvec{n}}(a,b,X) \, \rangle =-1\) but \(\{a,b\}\ne \{u,v\}\), then either \(\{a,b\}=\{u,x\}\) or \(\{a,b\}=\{v,x\}\), and in both cases \(\langle \, {\varvec{t}}^{uvy} \; | \; {\varvec{n}}(a,b,X) \, \rangle =0\) for any \(y\ne x\).
Now, for \(\{x,y\}\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \), let \({\varvec{c}}^{xy}\in \mathbb {R}^{2^V}\) be the vector such that \({\varvec{c}}^{xy}_X\! =\! 1\) if \(| \{x,y\} \cap X| \!=\!1\) (that is, if \(\{x,y\}\) belongs to the cut defined by X), and \({\varvec{c}}^{xy}_X\! =\! 0\) otherwise. Note that, for any \(a,b\in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \) and \(X\subseteq V\smallsetminus \{a,b\}\), we have
We set
The identities in the table are straightforward to derive from (8). \(\square \)
Corollary 2.7
For any graph \(G :=(V,E)\), the dimension of is the number of induced cliques in G, the dimension of the lineality space of is |V|, and the number of facets of is the number of triplets (u, v, S) with \(\{u,v\} \in E\) and \(S \subseteq N(u) \cap N(v)\).
Example 2.8
For the complete graph \(K_V\), the graphical zonotope is a permutahedron and the deformation cone is the submodular cone given by the irredundant inequalities \({{\varvec{h}}_{S \cup \{u\}} + {\varvec{h}}_{S \cup \{v\}} \ge {\varvec{h}}_{S} + {\varvec{h}}_{S \cup \{u, v\}}}\) for each \(\{u,v\} \subseteq V\) and \(S \subseteq V \smallsetminus \{u,v\}\). (The usual presentation imposes \({\varvec{h}}_\varnothing = 0\), but both presentations are clearly equivalent up to translation). It has dimension \(2^{|V|}-1\) and \(\left( {\begin{array}{c}|V|\\ 2\end{array}}\right) 2^{|V|-2}\) facets. The lineality is |V|-dimensional, given by the space of translations in \(\mathbb {R}^{|V|}\).
For instance, for the triangle \(K_3\), the graphical zonotope is the regular hexagon depicted in the bottom left of Fig. 3, which arises as the Minkowski sum of 3 coplanar vectors in \(\mathbb {R}^{3}\). Its deformation cone lives in the 8-dimensional space \(\smash {\mathbb {R}^{2^{[3]}}}\), has dimension 7, a lineality space of dimension 3, and 6 facets. It admits as irredundant description the equation \({\varvec{h}}_{\varnothing } = -{\varvec{h}}_{123}\) and the following 6 inequalities:
After quotienting the lineality and intersecting with an affine hyperplane, we get the bipyramid illustrated on Fig. 3. Note that the four rays of (i.e. vertices of the bipyramid) of the form \(\triangle _K\) for an induced clique K of \(K_3\) provide a linear basis of (i.e. an affine basis of the bipyramid). Nevertheless, the last ray can not be written as a positive Minkowski sum of \(\triangle _K\).
Example 2.9
For a triangle-free graph \(G :=(V,E)\), the deformation cone has dimension \(|V|+|E|\) and |E| facets. As before, the lineality is |V|-dimensional, given by the space of translations in \(\mathbb {R}^{|V|}\). Thus is simplicial.
For instance, for the 4-cycle \(C_4\), the graphical zonotope is the 3-dimensional zonotope depicted in the bottom right of Fig. 4, which arises as the Minkowski sum of 4 vectors in a hyperplane of \(\mathbb {R}^4\). Its deformation cone lives in the 16-dimensional space \(\smash {\mathbb {R}^{2^{[4]}}}\), has dimension 8, a lineality space of dimension 4, and 4 facets. It admits as irredundant description the following 8 equations and 4 inequalities
After quotienting the lineality and intersecting with an affine hyperplane, we get the 3-simplex illustrated in Fig. 4.
3.4 Simplicial Graphical Deformation Cones
As an immediate corollary, we obtain a characterization of those graphical zonotopes whose deformation cone is simplicial.
Corollary 2.10
The deformation cone is simplicial (modulo its lineality) if and only if G is triangle-free.
Proof
If G is triangle-free, the deformation cone has dimension \(|V|+|E|\), lineality space of dimension |V|, and |E| facets, and hence it is simplicial. If G is not triangle-free, then we claim that the number of induced cliques K of G with \(|K| \ge 2\) is strictly less than the number of triples (u, v, S) with \(\{u,v\} \in E\) and \(S \subseteq N(u) \cap N(v)\). Indeed, each induced clique K of G with \(|K| \ge 2\) already produces \(\left( {\begin{array}{c}|K|\\ 2\end{array}}\right) \) triples of the form \((u, v, K \smallsetminus \{u,v\})\) which satisfy \(\{u,v\} \in E\) and \(K \smallsetminus \{u,v\} \subseteq N(u) \cap N(v)\) and are all distinct. Since \(\left( {\begin{array}{c}|K|\\ 2\end{array}}\right) > |K|\) as soon as \(|K|\ge 3\), by Corollary 2.7, this shows that the deformation cone is not simplicial. \(\square \)
Corollary 2.11
If G is triangle-free, then every deformation of is a zonotope, which is the graphical zonotope of a subgraph of G up to rescaling of the generators.
Proof
For any induced clique K of G of size at least 2, \(\triangle _K\) is a Minkowski indecomposable \({(|K|-1)}\)-dimensional polytope in the deformation cone (see for example [19, 15.1.3] for a certificate of indecomposability). It spans therefore a ray of . When G is triangle-free, the deformation cone modulo its lineality is of dimension |E|, and the polytopes \(\Delta _e\) for \(e\in E\) account for the |E| rays of the simplicial deformation cone .
Therefore, each polytope can be uniquely expressed as a Minkowski sum
with nonnegative coefficients \(\lambda _e\). Since each \(\Delta _e\) is a segment, P is a zonotope, normally equivalent to the graphical zonotope of the subgraph \(G'=(V,E')\) with . \(\square \)
Data availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Aguiar, M., Ardila, F.: Hopf monoids and generalized permutahedra. Mem. Amer. Math. Soc. 289, 1437 (2023)
Ardila, F., Benedetti, C., Doker, J.: Matroid polytopes and their volumes. Discrete Comput. Geom. 43(4), 841–854 (2010)
Ardila, F., Castillo, F., Eur, C., Postnikov, A.: Coxeter submodular functions and deformations of Coxeter permutahedra. Adv. Math. 365, 107039, 36 (2020)
Arkani-Hamed, N., Bai, Y., He, S., Yan, G.: Scattering forms and the positive geometry of kinematics, color and the worldsheet. J. High Energy Phys. (5):096, front matter+75 (2018)
Arkani-Hamed, N., Bai, Y., Lam, T.: Positive geometries and canonical forms. J. High Energy Phys. (11):039, front matter+121 (2017)
Arkani-Hamed, N.: Trnka, Jaroslav: The amplituhedron. J. High Energy Phys. 10, 30 (2014)
Albertin, D., Pilaud, V., Ritter, J.: Removahedral congruences versus permutree congruences. Electron. J. Combin. 28(4), Paper No. 4.8, 38 (2021)
Björner, Anders, L.V., Michel, S., Bernd, W., Neil, Z., Günter M.: Oriented matroids, Volume 46 of Encyclopedia of Mathematics and its Applications, 2nd Edn. Cambridge University Press, Cambridge (1999)
Bazier-Matte, V., Douville, G., Mousavand, K.: Hugh Thomas, and Emine Yıldırım. ABHY Associahedra and Newton polytopes of \({F}\)-polynomials for finite type cluster algebras. Preprint (2018) arXiv:1808.09986
Castillo, F., Doolittle, J., Goeckner, B., Ross, M.S., Ying, L.: Minkowski summands of cubes. Bull. Lond. Math. Soc. 54, 996–1009 (2022)
Chapoton, F., Fomin, S., Zelevinsky, A.: Polytopal realizations of generalized associahedra. Canad. Math. Bull. 45(4), 537–566 (2002)
Castillo, F., Liu, F.: Deformation cones of nested braid fans. Int. Math. Res. Not, IMRN (2020)
Cox, D.A., Little, J.B., Schenck, H.K.: Toric Varieties. Graduate Studies in Mathematics, vol. 124. American Mathematical Society, Providence, RI (2011)
Danilov, V.I., Koshevoy, G.A.: Cores of cooperative games, superdifferentials of functions, and the Minkowski difference of sets. J. Math. Anal. Appl. 247(1), 1–14 (2000)
De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications, Volume 25 of Algorithms and Computation in Mathematics. Springer, New York (2010)
Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 69–87. Gordon and Breach, New York (1970)
Fujishige, S.: Submodular Functions and Optimization. volume 58 of Annals of Discrete Mathematics, 2nd edn. Elsevier B. V., Amsterdam (2005)
Gelfand, I., Kapranov, M., Zelevinsky, A.: Discriminants, resultants and multidimensional determinants. Modern Birkhäuser Classics. Birkhäuser Boston Inc., Boston, MA, Reprint of the 1994 edition (2008)
Grünbaum, B.: Convex polytopes, volume 221 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition,: Prepared and with a preface by Volker Kaibel. Victor Klee and Günter M, Ziegler (2003)
Joswig, M., Klimm, M., Spitz, S.: Generalized permutahedra and optimal auctions. SIAM J. Appl. Algebra Geom. 6(4), 711–739 (2022)
Kallay, M.: Indecomposable polytopes. Israel J. Math. 41(3), 235–243 (1982)
Kim, S.: Shellable complexes and topology of diagonal arrangements. Discrete Comput. Geom. 40(2), 190–213 (2008)
McMullen, P.: Representations of polytopes and polyhedral sets. Geom. Dedicata 2, 83–99 (1973)
McMullen, P.: Indecomposable convex polytopes. Israel J. Math. 58(3), 321–323 (1987)
McMullen, P.: Weights on polytopes. Discrete Comput. Geom. 15(4), 363–388 (1996)
Meyer, W.: Indecomposable polytopes. Trans. Am. Math. Soc. 190, 77–86 (1974)
Morton, J., Pachter, L., Shiu, A., Sturmfels, B., Wienand, O.: Convex rank tests and semigraphoids. SIAM J. Discrete Math. 23(3), 1117–1134 (2009)
Mohammadi, F., Uhler, C., Wang, C., Josephine, Yu.: Generalized permutohedra from probabilistic graphical models. SIAM J. Discrete Math. 32(1), 64–93 (2018)
Pilaud, V.: Acyclic reorientation lattices and their lattice quotients. Preprint (2021) arXiv:2111.12387
Pukhlikov, A.V., Khovanskiĭ, A.G.: Finitely additive measures of virtual polyhedra. Algebra i Analiz 4(2), 161–185 (1992)
Postnikov, A.: Permutohedra, associahedra, and beyond. Int. Math. Res. Not. IMRN 6, 1026–1106 (2009)
Padrol, A., Pilaud, V., Poullot, G.: Deformation cones of graph associahedra and nestohedra. Eur. J. Combin. 107, Paper No. 103594 (2023)
Padrol, A., Palu, Y., Pilaud, V., Plamondon, P.-G.: Associahedra for finite type cluster algebras and minimal relations between \({\textbf{g}}\)-vectors. Proc. Lond. Math. Soc. 127(3), 513–588 (2023)
Postnikov, A., Reiner, V., Williams, L.K.: Faces of generalized permutohedra. Doc. Math. 13, 207–273 (2008)
Pilaud, V., Santos, F.: Quotientopes. Bull. Lond. Math. Soc. 51(3), 406–420 (2019)
Przesławski, K., Yost, D.: More indecomposable polyhedra. Extracta Math. 31(2), 169–188 (2016)
Schoute, P.H.: Analytical treatment of the polytopes regularly derived from the regular polytopes. Section I: The simplex., volume 11 (1911)
Geoffrey, C.: Shephard. Decomposable convex polyhedra. Mathematika 10, 89–95 (1963)
Stanley, R.P.: An introduction to hyperplane arrangements. In: Geometric combinatorics, volume 13 of IAS/Park City Math. Ser., pp. 389–496. Amer. Math. Soc., Providence, RI (2007)
Stanley, R.P.: Enumerative combinatorics. Volume 1, Volume 49 of Cambridge Studies in Advanced Mathematics, 2nd Edn. Cambridge University Press, Cambridge (2012)
Ziegler, G.M.: Lectures on Polytopes. Graduate texts in Mathematics, Vol. 152. Springer, New York (1998)
Acknowledgements
We are grateful to Raman Sanyal for letting us know about his proof of Theorem 2.5 with Josephine Yu, as well as for many helpful discussions on the topic.
Funding
Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Kenneth Clarkson
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Partially supported by the French ANR grants CAPPS 17 CE40 0018, CHARMS 19 CE40 0017, and PAGCAP 21 CE48 0020, as well as by grant PID2019-106188GB-I00 funded by MCIN/AEI/10.13039/501100011033 and by project CLaPPo (21.SI03.64658) of Universidad de Cantabria and Banco Santander
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Padrol, A., Pilaud, V. & Poullot, G. Deformed Graphical Zonotopes. Discrete Comput Geom (2023). https://doi.org/10.1007/s00454-023-00586-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00454-023-00586-x