WorksMathematics
Rational barycentric coordinates and low degree adjoints
Abstract
We study rational generalized barycentric coordinates (rational GBCs) on polytopes. We recall their essential theory and clarify some statements from the literature. We study polytopes that admit GBCs with low degree denominators (and hence, low degree (affine) adjoint polynomials). We give a full classification of polytopes that admit polynomial barycentric coordinates (i.e. constant adjoints).
Introduction
Given a convex polytope , every point can be expressed as a convex combination of the polytopes vertices. If is a simplex, then this representation is unique and the convex coefficients are known as the barycentric coordinates of . In contrast, if has more than vertices, there is no longer a unique such representation, but there are many. This motivates the following definition: a system of generalized barycentric coordinates on (GBCs for short) consists of a family of maps , one per vertex of , so that for all holds
All sums range over the vertices of . In other words, GBCs make a consistent choice of convex representation across all points of the polytope.
GBCs provide a solution to the ubiquitous problem of interpolating data given only at the vertices of a polytope, as it appears, for example, in finite element analysis, computer graphics or geometric modeling. An overview of different well-studied GBCs and some applications can be found in [5]. For many of these applications it is advantageous to use GBCs that are easy to represent and evaluate. This constraint naturally favors algebraic over transcendental expressions and motivates the study of polynomial and rational GBCs.
In this paper we study such polynomial and rational GBCs, with a particular focus on understanding their degrees.
Polynomial GBCs
Polynomial GBCs have a multivariate polynomial in . The classical barycentric coordinates on simplices are linear, and hence examples thereof. Other examples are obtained by taking products of polytopes and GBCs (cf. Theorem 2.4).
As pointed out by Wachspress already in 1975, most polytopes do not admit polynomial GBCs:
Theorem 1.1 ([9 Chapter 2, §2.1]). A quadrangle has polynomial GBCs if and only if it is a parallelogram.
The polynomial GBCs on a parallelogram are obtain as affine transformations of the product GBCs on squares. We likewise obtain polynomial GBCs on all affine transformations of products of simplices. In § 4.1 we prove that this list is complete:
Theorem 1.2. A polytope admits polynomial GBCs if and only if it is affinely equivalent to a product of simplices.
This resolves [4 Conjecture 4.8].
Rational GBCs
In his work on the finite element method Wachspress gave a construction for rational GBCs that exist for all convex polygons and simple 3-polytopes ([9] (i.e., where are multivariate polynomials in ). Warren later extended the construction to polytopes of general dimension and combinatorics [10]. These coordinates came to be known as the Wachspress coordinates and are of great practical and theoretical interest (cf. Theorem 2.3).
We emphasize that the typical definition of rational GBCs (and a main reason for the nice theory) is that all coordinates are over a common denominator . We will assume throughout that does not vanish on the interior of the polytope.
In § 2 and § 3 we recall and complement Warren’s theory of denominator degrees in rational GBCs. We provide corrections and completions to important points in Warren’s arguments.
In § 4 we transition to studying the denominator degrees of rational GBCs. We in particular focus on low degree denominators. In particular, the denominator degree is zero if and only if the GBCs are polynomial. In § 4.1 we apply this theory to provide the classification of polytopes with polynomial GBCs (Theorem 1.2). This amounts to the classification of polytopes with degree-zero adjoints.
On Warren's theory of rational GBCs
This section focuses primarily on the theory of rational GBCs developed by Warren, and in particular, on reproving degree bounds and the uniqueness of Wachspress coordinates. For this we essentially follow [11]. At times this section goes beyond the classical work and provides deeper insight into the structure of degrees and vanishing orders of general rational GBCs.
Remark 2.1. While [11] contains the essential ideas, it also contains a number of inaccuracies and gaps that have confused readers over the years. Some of them are not trivial to patch. A few stem from being imprecise about whether the setting is affine or projective, which leads to neglecting the consequences of parallelisms in the face structure of polytopes. In fact, there are true subtleties to the degree theory once we work in affine space (e.g. the denominator degree is not bounded from below by #facets − dim − 1). Other gaps appear in central proofs, such as local-global arguments for proving degree bounds. We include comments throughout the section (in footnotes and remarks) to point out whenever we repair or elaborate on [11].
Throughout, let be a -dimensional polytope (i.e., with non-empty interior) and rational GBCs on .
Affine precision
On rational GBCs normalization and precision take on the following form:
The left sum states that is determined by the numerator polynomials. A standard argument shows that the pair (1) is equivalent to the single property called affine precision: for any affine linear form holds
Some authors define GBCs (rational or not) in terms of this single property.
Positivity
The third defining property, positivity, is used essentially in the following way: if is a facet and is a vertex that does not lie in , then we necessarily have for all , or equivalently, for all . In still other words, the facet linear form (characterized by ) divides the numerator polynomial . We conclude that the numerators of general rational GBCs factors as follows:
where the product is over all facets that do not contain the vertex , and is some polynomial whose form we do not yet know.
Interestingly, (3) is the only consequence of positivity that we will make use of. Hence, at least for our purpose, one could replace positivity by (3).
Degrees
There are essentially three ways to measure complexity of GBCs by their degrees: numerator degrees, denominator degrees and rational degrees.
Numerator degrees have been the primary focus of Warren’s work. For example, consider GBCs on a simple polytope . Then from (3) follows that the degree of must be at least , where is the number of facets of . There are three major insights from Warren’s theory:
the lower bound of on the numerator degree applies to all polytopes, not just simple polytopes (we reprove this in Theorem 2.9);
this lower bound is actually attained by some GBCs (see Theorem 2.3);
the rational GBCs that attain this lower bound are essentially unique (we prove this in Theorem 3.10).
These unique degree minimizers are known as the Wachspress coordinates of and have many interesting properties and use cases. We emphasize again that this extraordinarily nice theory is, to a decent extent, a consequence of the fact that all coordinates of GBCs share the same denominator (see also Theorem 2.10 and Theorem 2.11).
Denominator degrees, in contrast, are much less well-understood. The right sum in (1) gives
The denominator of Wachspress coordinates is called the adjoint or adjoint polynomial of . There are several ways to define this polynomial even without the Wachspress coordinates. This often happens in a projective setting, where one can show that the (homogeneous) degree is exactly [10]. One of the oversights of Warren in [12] was that this does not carry over to the affine setting. For a general polytope, the degree of can be much smaller than . And so, while for a generic polytope the Wachspress coordinates satisfy (4) with equality, this is not the case for general polytopes, not even if they are simple or simplicial. This “deficiency in degree”
was studied in detail in [2], where it was found to subtly relate to parallelisms in the face structure of .
For general GBCs, no nice theory (as compared with the numerator degrees) has emerged so far. In contrast, we found polytopes with GBCs so that (1) , where are not the Wachspress coordinates. (2) .
In § 4 we introduce as the minimally possible denominator degree of rational GBCs on .
Lastly, one can study the rational degree . By (4) . We did not pursue this route. We note that in the case of Wachspress coordinates, is precisely and its study is therefore subsumed by [2].
Basic examples
The classical barycentric coordinates are defined on simplices. They are linear functions and are the unique GBCs with this property. We give a definition based on cone volumes:
Example 2.2 (barycentric coordinates). Let be a -dimensional simplex. Let be the facet opposite to vertex . For a point let be the cone with base and apex . Define . Since the cones partition , we have . We also have if and otherwise. Lastly, it is easy to see that is linear in . It follows that these are the classical barycentric coordinates on .
Interestingly, the Wachspress coordinates can be defined in terms of cone volumes as well, but they require the polar dual.
Example 2.3 (Wachspress coordinates). Given a polytope with . Consider its polar dual at :
Let be the facet of that is dual to the vertex . Let be the cone with base and apex at the origin. Define . These are the Wachspress coordinates of at . The fact that these are indeed GBCs is a consequence of Minkowski’s balancing condition. This geometric cone volume
construction goes back to Ju, Schaefer, Warren and Desbrun [6]. Evidently, they are rational. We do here not reverify the degree but point to the literature.
An important elementary operations to construct new GBCs from old ones is the product construction:
Example 2.4 (product coordinates). Given polytope with with GBCs , one can define the product coordinates on . The vertices of are of the form , where . Then
One can verify that these do indeed give GBCs.
Taking the product of barycentric coordinates on simplices gives polynomial GBCs on products of simplices. As we will show in § 4.1, these are the only polytopes that admit polynomial GBCs. The simplest non-simplicial example is the square:
Example 2.5 (square).
Let be the linear form of the facet spanned by and . Then
and
and .
Vanishing orders and the face arrangement
A central tool for proving degree lower bounds for the numerators and denominators is to look at the multiplicities of their zeroes. Let denote the vanishing order of the polynomial along a non-empty affine subspace . Clearly, . For a face we abbreviate .
Lemma 2.6. Given a -face and vertex :
(i) if then .
(ii) with equality if and only if .
Proof. Part (i): by the factorization (3) we have
But the latter term vanishes since none of the linear forms , is zero on .
Part (ii): the limits of as approaches the face from within exist and yield GBCs on . The limit towards a point in the relative interior of is zero if and only if . □
The face arrangement of a polytope is the arrangement of the affine subspaces generated by face spans (including of and the empty face) closed under intersection. The elements of the arrangement are called flats. The ones generated by faces are called facial flats. The others are called residual flats. Alternatively, a flat is facial if and only if it is spanned by the vertices that it contains.
Face arrangements are only implicit in Warren’s treatment of the subject. They are more visible in his work on the adjoint polynomial [10]. The modern treatment of rational GBCs seems to favor this language, especially in the form of the residual arrangement [8].
Lemma 2.7. If is a flat then
Proof. Let be the affine span of the vertices that lie in . Let be a generic affine linear form that vanishes on . Then
where in we used affine precision, and is the well-known inequality for the vanishing order of sums of polynomials. Since is linear, . If is residual, then it is not spanned by the contained vertices, and so . Since was chosen generic, it does not vanish on , and so . □
Facial flats
Given a flat , its excess counts how many more facet hyperplanes of contain than one would generically except from only knowing its dimension. More precisely, the number of facet hyperplanes that contain is , where .
Lemma 2.8. Given rational GBCs on and a face , it holds
Proof. We use induction on . If , then and , and the statement is immediate. Assume now .
By Theorem 2.7 we have and so it suffices to show that for all . Fix such a . Let be the minimal face of that contains both and . To bound we consider two independent contributions to its value: first, the vanishing order of on the larger face ; second, additional contributions from the facet linear forms where contains but not (cf. the factorization (3)):
The left term we bound using Theorem 2.6 (ii) and the induction hypothesis. The latter applies due to :
The second term we bound as follows:
where in the first equality we use that was chosen minimal; in the second equality we use that the facets that contain are a subset of the facets that contain , that is contained in facets, and is contained in facets.
Combining both estimations in (5) finishes the proof. □
We obtain our first major insight for numerator degrees:
Theorem 2.9. Let be a polytope with facets and rational GBCs on . Then for all vertices .
Proof. Suppose that lies on facets, that is, . By Theorem 2.6 (i) and (ii), as well as Theorem 2.8, we have
And hence
□
The lower bound of Theorem 2.9 should be understood as a consequence of writing our rational GBCs over a common denominator polynomial . Even though the Wachspress coordinates satisfy , individual may still share factors with the adjoint, and canceling these factors would result in lower numerator degrees.
Example 2.10 (Pyramid). Given a polytope with GBCs . Let be the pyramid over with apex at the origin. The following gives GBCs of :
One can verify that these are indeed rational GBCs of . Note that , independent of the combinatorics of . Hence, if , then by Theorem 2.9 factors in numerator and denominator must have canceled.
In fact, it is possible that and share factors at all vertices .
Example 2.11 (Joins). Let and be polytopes with rational GBCs and . Each point of the join can be written as for some , and . The following defines GBCs on :
Again, one can verify that these are indeed rational GBCs of . Note that, as written here, the only depend on , whereas the depend only on . Hence, unless and had constant denominator, writing over a common denominator requires adding shared factors at all vertices.
The following fact, that GBCs cannot vanish on facets, is of use later.
Lemma 2.12. Let be a facet, and assume either of the following:
(i) for some vertex , or
(ii) ,
Then for all vertices .
Proof. Part (i): If , then by Theorem 2.6 (ii). But this means , as well as , contradicting the coprimality assumption. Consequently, . Via Theorem 2.6 (ii) also follows for all . Part (ii): As in the proof of (i), if , then for all . Therefore, .
Results stating non-vanishing on faces of will be important later, are however hard to come by in this generality. Theorem 2.12 is among the strongest claims we can make under current assumptions. Even assuming , it is still possible that vanishes on a face of codimension two, or that vanishes on a facet to an order higher than one.
Residual flats
Lemma 2.13. If is a polytope with rational GBCs and a residual flat , then . In other words, vanishes on the residual flats of .
In the literature this is often phrased as “ vanishes on the residual arrangement of ”.
Proof. Theorem 2.7 states , thus it suffices to show for all . Fix such a . Since is cut out by facet hyperplanes, there is some facet whose span contains but not . Hence by (3), and .
The following conjecture is a natural common generalization of Theorem 2.13 and Theorem 2.8.
Conjecture 2.14. If is a flat, then
In fact, in the case of Wachspress coordinates, where the denominator is the adjoint polynomial , these vanishing orders are exact [3]:
One could expect to prove Theorem 2.14 by combining ideas from Theorem 2.8 and Theorem 2.13. The proof of the latter relies on the fact that we can estimate the vanishing orders of the . But so far we know how to do this only if . In fact, already an analogue of Theorem 2.13 for numerator polynomials fails for sufficiently complicated examples (see Theorem A.4). Analogous can be proven in special cases, for example, see Theorem 3.3.
Minimal numerator degree
In this section we focus specifically on rational GBCs of minimal possible numerator degree, that is, according to Theorem 2.9. The goal is to show that must be the Wachspress coordinates. Again, we broadly follow Warren’s work [11], though we make corrections at several points in the proof.
It turns out that quite a number of our statements have a “per-vertex” version, that is, need to assume only for a single vertex rather than all vertices at the same time. We make an effort to provide per-vertex versions whenever this is possible and reasonable given our setup. The following is a first example:
Corollary 3.1. Suppose for some vertex . Then
(i) .
(ii) for each facet .
Proof. To prove (i) suppose that for all vertices . Then and can be canceled from all , yielding GBCs of lower numerator degrees. This contradicts Theorem 2.9 at .
To prove (ii) observe that if , Theorem 2.6 (ii) implies for all . From (3) we also get for all . In other words, for all , contradicting (i). □
Numerators on residual flats
Recall as define in (3).
Lemma 3.2. If for some vertex , then
In particular, is homogeneous at of degree and is (up to a factor) the homogeneous part of of lowest degree.
This lemma is later strengthened to general faces (see Theorem 3.9), though that requires more preparation.
Proof of Theorem 3.2. From minimal degree and the factorization (3) we get
which rearranges to . Using also Theorem 2.6 (i) and Theorem 2.6 (ii), as well as Theorem 2.8 we get the following cyclic chain of inequalities:
Thus all terms must be equal, giving the claimed identities in (6). □
The following is an anlogue of Theorem 2.13 for numerator polynomials:
Lemma 3.3. Let be a residual flat. If for some vertex , then
(i) .
(ii) if , then .
Proof. Case : The flat is the intersection of some facet hyperplanes. Thus, for at least one such facets . We get , and .
Case : Normalization gives us
This identity must hold in each homogeneous degree (defined at ), and so we may restrict to degree . Write for the homogeneous part of degree of a polynomial . By Theorem 3.2 we have . Using Theorem 2.6 (ii), for we have , and hence . In degree the identity (7) therefore reduces to . Now restrict both sides to . Recall that restriction to homogeneous parts and restriction to affine subspaces (through ) commutes:
where by Theorem 2.13. We conclude . □
Remark 3.4. Theorem 3.2 combined with Theorem 3.3 (ii) states that is a homogeneous polynomial of minimal degree that vanishes on the residual flats of the tangent cone at . The reader familiar with the literature on adjoints might then recognize that must be the adjoint of the tangent cone [3, 8]. This insight could shortcut our proof of uniqueness for minimal degree rational GBCs. Note however that the known proofs of uniqueness for the adjoint requires advanced tools, such as canonical forms. We emphasize that our goal is to reconstruct Warren’s elementary proof of uniqueness of GBCs without significant external input.
Restriction to facets
Later, we will need to perform induction on the dimension of the polytope by stepping from to its faces. We therefore need to understand how rational GBCs (in particular, their degrees) behave under restriction to faces.
If are rational GBCs and is a facet, then the restriction yields rational GBCs on :
We emphasize that this representation is valid only because we have due to Theorem 3.1 (ii). This representation might however not be reduced, i.e., numerator and denominator may still share factors.
Lemma 3.5. Given a facet and a vertex with , the following polynomial divides both and :
Observe that the shared factor depends neither on the precise GBCs nor the vertex . This will be important in Theorem 3.10.
Proof of Theorem 3.5. We show that each restricted linear factor divides and all . If is parallel to , then is constant, and the claim is trivial. If is not parallel, then since it is not adjacent to , it defines a -dimensional residual flat . By Theorem 2.13 and Theorem 3.3 and vanish on . Since is the zero locus of on , the claim follows.
We can then cancel the common factor provided by Theorem 3.5 and define the polynomials and . We call the representation
the reduced restriction of on . From this definition alone it is not clear (and in general not true) that we removed all shared factors. It is however sufficient for preparing the facet induction argument.
Lemma 3.6. Given a facet and a vertex with , then , where denotes the number of facets of .
Proof. By definition we have . We are going to compute the summands on the right individually.
From (3) we get the factorization
From Theorem 2.6 and , as well as Theorem 3.1 we get
Hence, . By Theorem 3.2, is homogeneous at . The restriction of a homogeneous polynomial to a containing affine subspace is either zero or of the same degree. Hence we get
Assume for now that there is no facet parallel to .2 Then for all facets . We get
Likewise . The claim follows by subtraction.
If, however, is a facet that is parallel to , then , changing the computed value of both and . But both values change by exactly 1, and so there is no net change to the value of .
Corollary 3.7. Let be a facet. If are GBCs on of minimal numerator degree , then the reduced restrictions form GBCs on of minimal numerator degree .
Remark 3.8. It is this point at which we stop proving per-vertex variants. For completeness we note that Theorem 3.9 and Theorem 3.10 below do admit such variants, but their proofs go too far beyond the intended focus of this article.
The following result provides an equality analogue of Theorem 2.8, and a strengthening of Theorem 3.1 to general faces.
Lemma 3.9. Suppose for all . For a face with holds
This result is stronger than needed for what follows. Subsequently we only need this statement for when is a facet or a ridge of . In both cases , that is, Theorem 3.9 gives us that and do not vanish on these faces.
Proof of Theorem 3.9. The proof proceeds by induction on . The statement is clear for . If is a facet then this is precisely Theorem 3.1 (ii).
Assume now . We have by Theorem 2.6 (ii) and Theorem 2.8. Thus, it suffices to show . Fix a facet . Then
We rewrite the summands individually.
First, we rewrite . Theorem 3.7 gives us that form GBCs on of minima numerator degree . Also (here and in the following we use subscripts to indicate the polytopes with respect to which a quantity is expressed). Hence, the induction hypothesis applies and gives us .
To rewrite we use that is the product of restricted linear forms , where is a facet that is neither identical nor adjacent to . Such a linear form contributes to exactly if . Write (resp. ) for the number of facets of (resp. of ) that contain . Recall that the facets adjacent to correspond to facets of . Then
This finishes the proof. □
We arrive at the main result of the section (cf. [11 Theorem 6]).
Theorem 3.10. If and are rational GBCs with minimal numerator degrees for all vertices , then . In particular, the Wachspress coordinates are the unique rational GBCs of minimal numerator degree.
Proof. We proceed by induction on the dimension of . The case is clear because then is a simplex on which only barycentric coordinates exist.
We now assume . Fix a facet . By Theorem 3.7 the reduced restrictions and are GBCs of minimal numerator degree on . Hence, the induction hypothesis applies, that is, and are equivalent and there is a factor so that and . For all we know, might depend on the facet . We show that it does not.3
From Theorem 3.5 we get
Now choose a ridge . Restricting both sides of (8) to yields
which is valid since by Theorem 3.9. We see that only depends on the ridge. In particular, adjacent facets share the same value for the factor. Since the facet-adjacency graph is connected, it follows that is independent of .
At this point we can conclude
for all facets . Since does not vanish on , we conclude that each facet linear form divides . There are of these. Since this exceeds the degree of and , we conclude . The same argument proves .
Induction on Theorem 3.7 then also yields
Corollary 3.11. The restriction of the Wachspress coordinates to some face yields the Wachspress coordinates on .
Intermediate degree GBCs
After proving [11 Theorem 6], Warren notes
[ . . . ] the last part of the proof allows for the possibility of rational coordinates functions of degree [ in our notation ] (or greater) that are barycentric. Constructing such a wider class of such coordinates functions is an interesting problem for future research.
suggesting that numerator degrees strictly between and are excluded by the same proof. This is not correct. The following example demonstrates that such intermediate degree GBCs (i.e., numerator degree with ) do indeed exist and are abundant:
Example 3.12 (Intermediate degree). Consider the cube . The parallelogram has GBCs of degree (cf. ??) and the line has GBCs of degree . The product GBCs on the cube therefore have numerator degree . To generalize this we can consider the parallelogram together with a simplex of any dimension. Then we can construct GBCs of degree for any dimension.
We do agree that the construction of a wider class of rational GBCs is interesting. For example, initial investigations (that are beyond the scope of this article) suggest that every polytope that is not a simplex can be equipped with rational GBCs of numerator degree for all . It appears interesting and challenging to study the space of rational GBCs on for a fixed . For example, the question for seems related to Kohn and Ranestad’s [8 Theorem 7], which in turn suggests that there is an -dimensional space of such rational GBCs (here, is the number of vertices of ).
Low denominator degrees
From this section on we transition to the study of denominators of rational GBCs. The focus is on polytopes that admit rational GBCs of especially low denominator degree. For a polytope let be the minimally possible denominator degree for rational GBCs on . We call it the degree of . Note that if and only if admits polynomial GBCs, which we address in § 4.1.
Recall that the denominator of the Wachspress coordinates is called the adjoint polynomial of and we have (cf. § 2.3), where is the number of facets of . Hence
A core message of [2] is that, in general, can be much smaller than . The main factor seems to be parallelities in the face structure of , though the precise geometric properties are not well understood. In particular, and in contrast to numerators, the degree of the Wachspress denominator does not depend only on the combinatorics of . It is known that [2 Theorem 3.5 (iii)].
Conjecture 4.1. For all polytopes holds .
In general, understanding the degree of polytopes seems to be hard. We are aware of the following negative results:
There are polytopes where . That is, the Wachspress coordinates are not necessarily the GBCs of minimal denominator degree (cf. Theorem A.2).
The GBCs of minimal denominator degree might not be unique (cf. Theorem A.3).
We collect some results about the polytope degree.
Corollary 4.2. If is a face, then .
Proof. It suffices to prove this for when is a facet, other faces follow by induction. If now are rational GBCs on with , they are in particular maximally canceled. By Theorem 2.12 does not vanish on a facet. We can therefore restrict to and obtain rational GBCs of a denominator degree that cannot be larger than .
Low degree implies combinatorial restrictions:
Lemma 4.3. Let be the vertex figure of at vertex . Every vertex lies in all but at most facets of .
Proof. Let be a vertex of . It corresponds to an edge of , where denotes the other endpoint of . Let be the number of facets of that do not contain . We show that .
Choose rational GBCs on such that , and set . The point of introducing is that may vanish identically on , so we cannot simply restrict the rational functions to .
Parametrize by , and choose a generic vector transverse to . Since , we may write
where is nonzero and . The second expansion is possible because Theorem 2.6 (ii) gives .
We first relate and . Choose an affine linear form with and . Affine precision says that . Substituting , we have , and hence . Thus the coefficient of on the left-hand side is .
On the right-hand side, the term corresponding to vanishes because , while the term corresponding to contributes because . If , then Theorem 2.6 (ii) gives , so these terms do not contribute to the coefficient of . Comparing coefficients therefore yields
We now use the factorization (3):
For every facet occurring in this product, , and hence . Thus does not vanish identically on , so . Since , it follows that .
We may therefore write for some . Since each is affine linear, we also have . Taking the coefficient of in the factorization above gives
From this point on, divisibility is understood in the univariate polynomial ring .
Facets of correspond to facets of containing , and such a facet of contains precisely when the corresponding facet contains . Hence the facets of not containing correspond exactly to the facets satisfying and .
For each such facet, and . Since , we have . Thus each of these factors contributes a factor to the product above, and hence . Together with , this gives whenever . Since ,
Thus , as claimed.
Polynomial GBCs
In this section we prove the following main result
Theorem 1.2. A polytope admits polynomial GBCs if and only if it is affinely equivalent to a product of simplices.
As a corollary we obtain
Corollary 4.4. If then .
As alluded to in § 4.1, polynomial GBCs on cartesian products of simplices are constructed as product coordinates. Polynomiality is moreover preserved under affine transformation. Thus, it suffices to focus on the “only if” part of Theorem 1.2.
Throughout this section, let be a polytope with polynomial GBCs. By the following theorem it suffices to show that is simple and affinely equivalent to a 0/1-polytope:
Theorem 4.5 ([7 Theorem 1]). A 0/1-polytope is simple if and only if it is a product of 0/1-simplices.
That is simple is a direct consequence of Theorem 4.3: for denominator degree zero, vertex figures must be simplices:
Corollary 4.6. Polytopes with polynomial GBCs are simple.
To show that is affinely equivalent to a -polytope requires some preparation. For this, recall that the slack matrix of is the matrix whose rows are indexed by the vertices, columns are indexed by the facets, and entries are given by
The slack matrix depends on our choice of facet linear forms , which are determined by only up to a positive factor. Hence, we can rescale the columns of freely and still obtain a slack matrix of . Given the following theorem, it therefore suffices to show that the columns can be rescaled to -vectors:
Theorem 4.7 ([1 Theorem 5]). is affinely equivalent to the convex hull of the rows of its slack matrix .
With this we have all ingredients for a proof.
Proof of Theorem 1.2. Suppose that has polynomial GBCs . Fix a facet . We show that across all vertices , the linear form only ever attains two values, depending on whether or . Since for all , the corresponding column of the slack matrix can therefore be rescaled to a -vector. The proof then concludes as explained above, using Theorem 4.7, Theorem 4.6 and Theorem 4.5.
It remains to show that takes on the same value for all . Since the part of the edge graph of induced on the vertices outside of is still connected, it suffices to show that adjacent vertices attain the same value under .
Suppose then that are adjacent via an edge and . Then the restriction is not constant. Moreover, there exists a facet that contains but not . Then , and the restriction is also not constant. Restricting the representation (3) to yields
and we see that both and are independent non-constant factors of . The latter is therefore at least quadratic. However, the form GBCs on the edge, and are therefore necessarily linear. This is a contradiction, and thus .
Statement on AI use
AI was used only for finding several of the examples in Section A. The article is entirely human written and AI had no part in the presented research results outside the appendix.
Funding
Martin Winter is funded by the SPP 2458 “Combinatorial Synergies” (project ID 539851419), funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation).
Appendix A. Examples
We collect here examples to support the main text.
Example A.1 (perturbations). Given rational GBCs , one can construct new rational GBCs using a suitable family of rational maps . Preserving normalization and precision is equivalent to
Positivity is harder to guarantee. We need at least whenever since we need to preserve the zero loci derived from positivity in § 2.2. This is automatic if we instead perturb like
Consider the square from Theorem 2.5. We can choose and . This yields GBCs of numerator degree 4:
Example A.2 (Adjoint degree is not minimal). We construct a polytope with , in dimension with fully explicit GBCs. The idea is to start with a polytope with a small adjoint, such as a zonotope, and to move facets parallel to themselves. This keeps the normals and parallelisms, but the adjoint jumps back to its generic degree . Other GBCs can still profit from cancellations that the adjoint does not see.
Let be the truncated octahedron
It is a zonotope with facets, so . Let be obtained from by moving three facets parallel to themselves: replace by , and and by and (see Figure 1). Then is simple with 24 vertices and the same normals, and . There are rational GBCs on with and , where each is a quadratic polynomial that is positive on . Hence again . The exact GBCs are complicatd and are provided on Zenodo.

Figure 1. The polytopes of Theorem A.2 in dimension three. Left: the truncated octahedron . Right: the polytope obtained by moving three facets (red edges) parallel to themselves. Both have 14 facets and the same normals, but and , while admits rational GBCs with denominator of degree 9.
Example A.3 (Minimal denominator degree is not unique). Consider the trapezoid with vertices , , , . It has facets, namely , , , , and dimension , so . We construct rational GBCs on whose numerators have the intermediate degree and the denominator has degree one, but is not equal to the adjoint.
Let
and . We claim that are rational GBCs on . Indeed, one checks by expanding that
The first identity is normalization. The other two are linear precision, since . On we have , and . Hence every factor of every is non-negative, and . So is well defined and non-negative on .
Degrees. We have for all and . The representation is maximally canceled: is an irreducible linear form that does not divide , so and the have no common non-constant factor. Hence the numerator degree is not caused by a cancelable common factor of numerators and denominator.
Residual flats and the adjoint. The Wachspress denominator of is , which also has degree 1. However, is not a multiple of . The pair of facets and is not adjacent, so is a residual flat, and as required by Theorem 2.13; see Figure 2. But does not vanish at the point at infinity of the two parallel facets and : in homogeneous coordinates this point is , and the homogenization of takes the value there. So vanishes on the affine, but not on the projective residual arrangement of . The adjoint, in contrast, vanishes on the projective residual arrangement.

Figure 2. The trapezoid of Theorem A.3 with its facet lines (dotted), the affine residual flat (red point) and the zero set of (orange). The parallel facets and meet only at infinity.
Example A.4. Theorem 2.13 states that the denominator vanishes on residual flats, and Theorem 3.3 gives the analogue for a numerator with under the assumption . The following example shows that this assumption cannot be dropped. There are rational GBCs, a residual flat , and a vertex with .
The polytope. Let be the square pyramid with apex ,
and let with coordinates . It has facets, dimension , and 20 vertices, namely and with and . Thus .
The residual flat. The facets and of intersect in
whereas
So is an intersection of facet-spanning flats that is not spanned by the vertices it contains, i.e., a residual flat. The vertices in are the four apex vertices .
The GBCs. On we use the GBCs
where denotes the base vertex . (One checks directly that they are non-negative on , sum to 1, and reproduce .) On we use the bilinear coordinates
and set . The product coordinates of Theorem 2.4 are GBCs on . We perturb them at the apex vertices:
These are rational GBCs on (verified below) with common denominator and numerators
The base numerators have degree , the apex numerators have degree .
Restriction to $E. Consider the vertex . On we have and , so the first summand of vanishes and
For instance, at the point it equals . This point lies in but not in ; on we have , so does vanish there. Since , this does not contradict Theorem 3.3. △
Normalization. Since and , the apex coordinates sum to . The base coordinates sum to . Hence .
Linear precision. The perturbation does not change : it sums to over , also when weighted with (the terms for and cancel) and with (those for and cancel), and the apex has . So equals the corresponding sum for the product coordinates, which is .
Non-negativity. The coordinates are products of non-negative factors. On the apex, and are sums of non-negative terms. For the remaining two,
because on and ; the vertex is analogous.
Continuity at . On we have for . Hence extends continuously to the fiber over the apex, where it equals the product coordinates.
References
- [1]M. Aprile, M. Conforti, Y. Faenza, S. Fiorini, T. Huynh, and M. Macchia. Recognizing cartesian products of matrices and polytopes. Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 Proceedings, pages 361–373, 2021.arxiv.org/abs/2002.02264
- [2]T. Baumbach, A. Freyer, J. Weigert, and M. Winter. The canonical form, scissors congruence and adjoint degrees of polytopes, 2025.arxiv.org/abs/2508.04275
- [3]C. Brüser and J. Weigert. Geometry of adjoint hypersurfaces for polytopes. arXiv preprint arXiv:2511.13537, 2025.
- [4]P. Clarke and D. A. Cox. Moment maps, strict linear precision, and maximum likelihood degree one. Advances in Mathematics, 370:107233, 2020.arxiv.org/abs/1810.03672
- [5]M. S. Floater. Generalized barycentric coordinates and applications. Acta Numerica, 24:161–214, 2015.DOI
- [6]T. Ju, S. Schaefer, J. D. Warren, and M. Desbrun. A geometric construction of coordinates for convex polyhedra using polar duals. In Symposium on Geometry Processing, pages 181–186, 2005.DOI
- [7]V. Kaibel and M. Wolff. Simple 0/1-polytopes. European Journal of Combinatorics, 21(1):139–144, 2000.DOI
- [8]K. Kohn and K. Ranestad. Projective geometry of wachspress coordinates. Foundations of Computational Mathematics, 20(5):1135–1173, 2020.arxiv.org/abs/1904.02123
- [9]E. L. Wachspress. A rational finite element basis. 1975.DOI
- [10]J. Warren. Barycentric coordinates for convex polytopes. Advances in Computational Mathematics, 6(1):97–108, 1996.DOI
- [11]J. Warren. On the uniqueness of barycentric coordinates. Contemporary Mathematics, 334:93–100, 2003.DOI
- [12]M. Winter. Can a polytopal graph be “centrally symmetric” in more than one way? https://mathoverflow.net/q/439787. version: 2023-02-01.