Families of Polytopes with Rational Linear Precision in Higher Dimensions

In this article, we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models have rational maximum likelihood estimators (MLE) and give a criterion for these models to be log-linear. Our main result is then obtained by applying Garcia-Puente and Sottile’s theorem that establishes a correspondence between polytopes with rational linear precision and log-linear models with rational MLE. Throughout this article, we also study the interplay between the primitive collections of the normal fan of a polytope with rational linear precision and the shape of the Horn matrix of its corresponding statistical model. Finally, we investigate lattice polytopes arising from toric multinomial staged tree models, in terms of the combinatorics of their tree representations.


Introduction
In Geometric Modelling, pieces of parametrised curves and surfaces are used as building blocks to describe geometric shapes in 2D and 3D.Some of the most widely used parametric units for this purpose are Bézier curves, triangular Bézier surfaces and tensor product surfaces.These pieces of curves and surfaces are constructed using a set of polynomial blending functions defined on the convex hull of a set of points A , together with a set of control points.Taking as inspiration the theory of toric varieties and the form of the blending functions for the previous examples, Krasauskas introduced the more general notion of a toric patch whose domain is a lattice polytope P ⊆ R d [15].The blending functions, {β w,m ∶ P → R} m∈A , of a toric patch are constructed from the set of lattice points A ∶= P ∩ Z d and a vector of positive weights w associated to each point in A .
A significant difference between an arbitrary toric patch and one of the triangular or tensor product patches is that its blending functions do not necessarily satisfy the property of linear precision.A collection of blending functions {β m ∶ P → R} m∈A has linear precision if for any affine function Λ ∶ R d → R, Λ(u) = m∈A Λ(m)β m (u), for all u ∈ P.
Thus, linear precision is the ability of the blending functions to replicate affine functions and it is desirable from the practical standpoint [11].To decide if the collection of blending functions associated to (P, w) has linear precision it is necessary and sufficient to check that the identity p = ∑ m∈A β w,m (p)m holds for all p ∈ P [11, Proposition 11], in this case we say the pair (P, w) has strict linear precision.If there exist rational blending functions { βw,m ∶ P → R} m∈A that are nonnegative on P , form a partition of unity, parametrise the same variety X A ,w as the blending functions {β w,m ∶ P → R} m∈A , and also have linear precision, we say the pair (P, w) has rational linear precision.It is an open problem, motivated by Geometric Modelling, to characterise all pairs (P, w) that have rational linear precision in dimension d ≥ 3 [15,4].The classification of all such pairs in dimension d = 2 is given in [12].
Garcia-Puente and Sottile studied the property of rational linear precision for toric patches by associating a scaled projective toric variety X A ,w to the pair (P, w) [11].The variety X A ,w is the image of the map [wχ] A ∶ (C * ) d → P n−1 defined by t ↦ [w 1 t m 1 ∶ w 2 t m 2 ∶ . . .∶ w s t mn ] where A = {m 1 , . . ., m n }.One of their main results states that a pair (P, w) has rational linear precision if and only if the variety X A ,w , seen as a discrete statistical model, has rational maximum likelihood estimator (MLE).This result establishes a communication channel between Geometric Modelling and Algebraic Statistics.Thus, it is natural to use ideas from Algebraic Statistics to study the property of rational linear precision.
Models with rational MLE are algebraic varieties that admit a parametrisation known as Horn uniformisation [10,14].This parametrisation depends on a Horn matrix H and a coefficient for each column of H.In their recent study of moment maps of toric varieties [4], Clarke and Cox go one step further in strengthening the relationship between pairs (P, w) with rational linear precision and models X A ,w with rational MLE by using Horn matrices to characterise all pairs (P, w) that have strict linear precision.They propose the use of Horn matrices to study polytopes with rational linear precision and state several questions and conjectures about the relationship between the Horn matrix of X A ,w and the primitive collections of the normal fan of P .
In this article we study the property of rational linear precision of pairs (P, w) from the point of view of Algebraic Statistics.Our main contribution is Theorem 4.1, which introduces a new family of polytopes (with associated weights) that has rational linear precision.We construct this family from a subclass of discrete statistical models introduced in Section 4 that we call multinomial staged trees.Looking at specific members of this family in 3D, we settle some of the questions raised in [4] related to Horn matrices and primitive collections.
This paper is structured as follows: In Sections 2.1-2.4 we provide background material on rational linear precision, discrete statistical models with rational MLE and Horn matrices.In Section 2.5 we state Questions 1 and 2 which guided our investigations related to Horn matrices and primitive collections.These questions are followed by a quick outline referring to the places in this article where they are addressed.In Section 3, we characterise the shape of the Horn matrix for pairs (P, w) in 2D.We also present a family of pairs (P, w) in 3D that has rational linear precision and explain several aspects of this family that relate to Questions 1 and 2. In Section 4.1 we define multinomial staged tree models, we prove they have rational MLE in Section 4.6 and we characterise the subclass of these models that are toric varieties in Section 4.5.These results lead to our main theorem, Theorem 4.1.Finally, in Section 5, we show that the examples from Section 3 are all multinomial staged trees and prove our conjectures about the relationship between the combinatorics of the trees and primitive collections.

Preliminaries
We assume the reader is familiar with introductory material on computational algebraic geometry and toric geometry at the level of [6] and [7].

Notation and conventions
We consider pairs (P, w) where P is a d-dimensional lattice polytope in R d , Z d is the fixed lattice, A = P ∩ Z d = {m 1 , . . ., m n } and w is a vector of positive weights indexed by A .Fix n 1 , . . ., n r to be the inward facing primitive normal vectors of P corresponding to the facets F 1 , . . ., F r of P and let a 1 , . . ., a r be the corresponding integer translates in the facet presentation of P given by P = {p ∈ R d ∶ ⟨p, n i ⟩ ≥ −a i , ∀i ∈ {1, . . ., r}}.The lattice distance to the face F i evaluated at p ∈ R d is h i (p) = ⟨p, n i ⟩ + a i , i = 1, . . ., r, we record each of these values in the vector h(p) = (h 1 (p), . . ., h r (p)) The value h i (m j ) is the lattice distance from the j-th lattice point to the i-th facet.The matrix with ij entry equal to h i (m j ) is the lattice distance matrix of A .We will often consider products of linear forms or variables whose exponents are given by vectors.For vectors v = (v 1 , . . ., v N ), w = (w 1 , . . ., w N ) we use v w to denote the product ∏ N i=1 v w i i and use the convention that 0 0 = 1.Common choices for v, w in the upcoming sections are the vectors t = (t 1 , . . ., t d ), h(p) and h(m), m ∈ A .If P is a polytope and a ≥ 1 is an integer, aP denotes its dilation.

Rational linear precision
In this section we follow closely the exposition in [4].A more elementary introduction to this topic is available in [5,Chapter 3].Definition 2.1.Let P ⊆ R d be a full dimensional polytope and let w = (w 1 , . . ., w n ) be a vector of positive weights.
1.For 1 ≤ j ≤ n and p ∈ P , β j (p) ∶= h(p) h(m j ) = ∏ r i=1 h i (p) h i (m j ) . 2. The functions β w,j ∶= w j β j β w are the toric blending functions of (P, w), where β w (p) ∶= ∑ n j=1 w j β j (p). 3. Given control points {Q j } 1≤j≤n ∈ R , the toric patch F ∶ P → R is defined by In part (3) of the previous definition, it is natural to choose the set of control points to be A .
1.The tautological patch K w ∶ P →P is the toric patch (1) where {Q j =m j } 1≤j≤n .
2. The pair (P, w) has strict linear precision if K w is the identity on P , that is w j β j (p)m j , for all p ∈ P.
3. The pair (P, w) has rational linear precison if there are rational functions β1 , . . ., βn on C d satisfying: (a) (c) For every p ∈ P ⊂ C d , βj (p) is defined and is a nonnegative real number.
Remark 2.1.We are interested in the property of linear precision.By [11,Proposition 2.6], the blending functions {β w,j ∶ 1 ≤ j ≤ n} have linear precision if and only if the pair (P, w) has strict linear precision.Rational linear precision requires the existence of rational functions { βj ∶ P → R ∶ 1 ≤ j ≤ n} that have strict linear precision, and that are related to the blending functions of (P, w) via 3(b) in Definition 2.2.
Remark 2.2.An alternative way to specify a pair (P, w) is by using a homogeneous polynomial F A ,w whose dehomogenisation f A ,w = ∑ n j=1 w j t m i encodes the weights in the coefficients and the lattice points in A as exponents.We use this notation in Section 3 to describe toric patches in 2D and 3D.
Remark 2.3.If (P, w) has rational linear precision then (aP, w), a ≥ 1, also has this property where w is the vector of coefficients of (f A ,w ) a .See [12,Lemma 2.2].
The pair (P, w) does not have strict linear precision, but it has rational linear precision.By Proposition 3.1 the parametrisation of the patch which has linear precision is given by: βw,(i,j) (s, t) = 2 j 3 − j i , where m = a 1 + ⋯ + a d .

Discrete statistical models with rational MLE
A probability distribution of a discrete random variable X with outcome space {1, . . ., n} is a vector (p 1 , . . ., p n ) ∈ R n where p i = P (X = i), i ∈ {1, . . ., n}, p i ≥ 0 and ∑ consists of all strictly positive probability distributions for a discrete random variable with n outcomes.A discrete statistical model M is a subset of ∆ ○ n−1 .Given a set D = {X 1 , . . ., X N } of independent and identically distributed observations of X, we let u = (u 1 , . . ., u n ) be the vector where u i is the number of times the outcome i appears in D. The likelihood function L(p, u) ∶ M → R ≥0 defined by (p 1 , . . ., p n ) ↦ ∏ p u i i records the probability of observing the set D. The maximum likelihood estimator (MLE) of the model M is the function Φ ∶ R n → M that sends each vector (u 1 , . . ., u n ) to the maximiser of L(p, u), i.e.Φ(u) ∶= arg max L(p, u).
For arbitrary M, the problem of estimating arg max L(p, u) is a difficult one.However, for special families, such as discrete exponential families, there are theorems that guarantee the existence and uniqueness of arg max L(p, u) when u has nonzero entries.We are interested in the case where Φ is a rational function of u.
Example 2.4.The MLE Φ in Example 2.3 is given by a Horn parametrisation ϕ (H,λ) , where , and λ = (4, 4, 4, 4).Definition 2.5.We say that (H, λ) is a Horn pair if: (1) the sum of the coordinates of ϕ (H,λ) as rational functions in u is equal to 1 and (2) the map ϕ (H,λ) is defined for all positive vectors and it sends these to positive vectors in R r . is a minimal Horn pair, then every row of H has either all entries greater than or equal zero or all entries less than or equal to zero.We call the submatrix of H that consists of all rows with nonnegative entries, the positive part of H, and its complement the negative part of H.

The links between Algebraic Statistics and Geometric Modelling
The links referred to in the title of this section are Theorem 2.3 and Theorem 2.4.
Given a pair (P, w), the scaled projective toric variety X A ,w is the image of the map To consider the maximum likelihood estimation problem in the realm of complex algebraic geometry we consider the variety W = V (x 1 . . .x n (x 1 + ⋯ + x n )) ⊂ P n−1 and the map The image of this map is closed and denoted by Y A ,w .We call Y A ,w a scaled very affine toric variety.The set We now consider the maximum likelihood estimation problem for log-linear models.Given a vector of counts u, we let u ∶= u u ∈ ∆ ○ n−1 be the empirical distribution, where u = ∑ u j .We define the tautological map τ A following the convention in [4], The maximum likelihood estimate of u for the model M A ,w exists and it is unique whenever all entries of u are positive.
Theorem 2.2.[18, Corollary 7.3.9]The maximum likelihood estimate in M A ,w for the empirical distribution u ∈ ∆ ○ n−1 is the unique point p ∈ M A ,w that satisfies τ A (p) = τ A (u).In the Algebraic Statistics literature, models with rational MLE are also known as models with maximum likelihood degree equal to 1.Even though the previous theorem guarantees the existence and uniqueness of the MLE, it is not true that every log-linear model has rational MLE.We refer the reader to [1] for several examples of log-linear models that do not have rational MLE, or equivalently for examples of models with maximum likelihood degree greater than 1.We end this section by recalling two theorems that connect models with rational MLE and pairs with rational linear precision.1.The pair (P, w) has strict linear precision.

n
3. M A ,w has rational MLE with minimal Horn pair (H, λ) given by

Primitive collections and Horn pairs
The notion of primitive collections was first introduced by Batyrev in [3] for a smooth and projective toric variety X Σ P of the polytope P .It provides an elegant description of the nef cone for X Σ P .This result has been generalised to the simplicial case and the definition of primitive collections for the non-simplicial case has been introduced in [8].
In particular, if Σ P is simplicial, C is a primitive collection if C does not generate a cone of Σ P but every proper subset does.
For strict linear precision, Theorem 2.4 gives the minimal Horn pair based only on the lattice distance functions of the facets of the polytope.The authors in [4] raise the question whether it is possible to obtain a similar description of minimal Horn pairs of polytopes with rational linear precision.Question 1.Is the positive part of the minimal Horn matrix of a pair (P, w) with rational linear precision always equal to the lattice distance matrix of A ?For pairs (P, w) in 2D with rational linear precision, and the family of prismatoids in Section 3.2, the answer to Question 1 is affirmative, see Theorem 3.2, Proposition 3.3, and Appendix A.
In [4] there are two examples, one of a trapezoid [4, Section 8.1] and one of a decomposable graphical model [4,Section 8.3], where the positive part of the Horn matrix is the lattice distance matrix of A and the negative rows are obtained via the primitive collections of the normal fan of P .These examples motivate the next definition and Question 2: Definition 2.7.To a pair (P, w) we associate the matrix M A ,Σ P which consists of the lattice distance matrix of A , with ij-th entry h i (m j ), together with negative rows given by summing the rows of the lattice distance functions −h i , for which the facet normals n i belong to the same primitive collection of Σ P .
Question 2. For a pair (P, w) with rational linear precision is there a Horn pair (H, λ) for which H = M A ,Σ P ?For pairs (P, w) in 2D with rational linear precision, the answer to Question 2 is affirmative, see Theorem 3.2.For the family of prismatoids in Section 3.2, Question 2 is affirmative only for certain subclasses, see Theorem 3.5.For an arbitrary pair (P, w) with rational linear precision, the matrix M A ,Σ P is not necessarily a Horn matrix, see Section 3.3.1.Even in the case that M A ,Σ P is a Horn matrix, it does not necessarily give rise to a Horn pair for (P, w), see Section 3.3.2.In Section 3 we see a number of special cases for which the answer to Question 2 is affirmative.In Section 5, we give a condition on (P, w) which guarantees the existence of a Horn pair (H, λ) with H = M A ,Σ P .We also provide an explanation for the negative rows of the Horn matrix in the language of multinomial staged tree modelsintroduced in Section 4.

Examples of Horn pairs in 2D and 3D
In this section we present families of 2D and 3D pairs (P, w) with rational linear precision and explore the connection between the geometry of the polytope and the shape of its corresponding Horn pair.Throughout this section we use (s, t), respectively (s, t, v) to denote t in the 2D, respectively 3D case.

Toric surface patches and Horn pairs in 2D
By [12], the only 2D toric patches with rational linear precision are the Bézier triangles, tensor product patches and trapezoidal patches, seen in Figure 1.This family of polygons, that we denote by F, consists of all the Newton polytopes of the polynomials For general a, b, d, the Newton polytope associated to f a,b,d , which we will denote by T a,b,d , will be a trapezoidal patch, in the special cases T 0,b,1 = b∆ 2 and T a,b,0 = a∆ 1 × b∆ 1 , we will have the more familiar Bézier triangles and tensor product patches.The lattice points in T a,b,d ∩ Z 2 are A = {(i, j) ∶ 0 ≤ j ≤ b, 0 ≤ i ≤ a + d(b − j)}.By Theorems 2.1 and 2.3 we know that the statistical model associated to a pair in F admits a Horn pair.Proposition 3.1.A Horn pair (H, λ) of a polygon in the family F is given by: where m ∶= (i, j) ∈ A is a general lattice point, m 1 , . . ., m n is an ordered list of elements in A , t ∶= (s, t), and h 1 , . . ., h 4 are Proof.We use [4,Proposition 8.4].The terms of the polynomial f a,b,d (t) specify weights and lattice points in T a,b,d ∩ Z 2 .i.e.
The monomial parametrisation (2) of Y A ,w is where S m = w m t m .Composing the monomial parametrisation with the tautological map (3) gives the following birational map: with the following inverse: The component of the monomial parametrisation corresponding to a lattice point m, composed with ϕ(t) is given by where Therefore, the columns of the Horn matrix are the exponents of Remark 3.2.For general a, b, d, Proposition 3.1 gives the minimal Horn pair for T a,b,d ; this is not the case for T 0,b,1 and T a,b,0 .For the last two cases, the minimal Horn pair is obtained after row reduction operations or from Theorem 2.4.
Using Proposition 3.1 and Theorem 2.4 we obtain an affirmative answer to Question 1 for pairs (P, w) in 2D.A closer look at the primitive collections in Figure 1 also reveals an affirmative answer to Question 2. This is contained in the next theorem.Theorem 3.2.Every pair (P, w) in 2D with rational linear precision has a Horn pair (H, λ) with H = M A ,Σ P .
Proof.The normal fans of the polygons in F are depicted in Figure 1, in each subcase the shape of the normal fan and its primitive collections are independent of the values of a, b, d.The minimal Horn pair (H, λ) for the 2D simplex, T 0,b,1 = b∆ 2 , given in Theorem 2.4 satisfies H = M A ,Σ P .This follows because b∆ 2 has one primitive collection, {n 1 , n 2 , n 3 } and hence M A ,Σ P has a single negative row.For the tensor product patch T a,b,0 = a∆ 1 × b∆ 1 and the general trapezoid T a,b,d , the primitive collections are {n 1 , n 3 } and {n 2 , n 4 }.In these cases, the Horn pair (H, λ) in Proposition 3.1 satisfies H = M A ,Σ P .

A family of prismatoids with rational linear precision
Unlike the 2D case, there is no classification for 3D lattice polytopes with rational linear precision.In this section we consider the family of prismatoids A general element of P is depicted in Figure 2, prismatoids for different specialisations of a, a ′ , b, b ′ , d are displayed in Table 1.Note that some 3D Bézier simploids are also obtained by specialisation.Even though Remark 2.3 says it suffices to show that P has rational linear precision for l = 1, we do not use this extra assumption.
Proposition 3.3.The pairs in P have rational linear precision with a Horn pair (H, λ): where m ∶= (i, j, k) ∈ A is a general lattice point, m 1 , . . ., m n is an ordered list of elements Table 1: Representative members of P. The coordinates of the vertices of each polytope in this table are obtained by specializing the parameters a, a ′ , b, b ′ , d in the coordinates the vertices of the prismatoid in Figure 2.
in A , t ∶= (s, t, v), and h 1 , . . ., h 6 are Proof.The polynomial f A ,w (t) in the definition of P, can be expressed as a sum where We let then, the vector of all (wχ A (t)) m gives the monomial parametrisation (2) of Y A ,w with weights Composing the monomial parametrisation with the tautological map (3) gives the following birational map: with the following inverse: Composing ϕ(t) with the monomial parametrisation gives where h(q) = (h 1 (q), ⋯ , h 6 (q), −h 7 (q), −h 8 (q), −h 9 (q)), (q ∈ {t, m}), the functions h 1 , . . ., h 6 are as in the statement of the theorem and According to [4,Proposition 8.4], the polytope has rational linear precision with weights w m as defined above and the Horn parametrisation of Y A ,w is given by: where Since the Horn parametrisation is, by definition, a product of linear forms whose exponents match their coefficients, we know that the columns of H are the vectors h(m).It follows that λ m = (−1) (∑ 6 γ=1 hγ )(m) w m .

Minimal Horn pairs for prismatoids in P
We now study Questions 1 and 2 for elements in P. Proposition 3.3 gives a Horn pair (H, λ) for each (P, w) ∈ P in Table 1, however H need not be the minimal Horn matrix in each case.By [10, Lemma 9], we can find the minimal Horn matrix associated to (P, w) using row reduction operations on H.
Notation 3.4.We will denote the facets of a general element in P as follows: This labelling is used in Figure 2. The normal vectors of each facet are: , n 6 = (0, 0, −1).

The non-simple prismatoids
The trapezoidal pyramids, tensor product pyramids and prismatoids with triangle on top, depicted in where m 1 , . . .m n ∈ A , t ∶= (s, t, v) and h 1 , . . ., h 6 are defined to be We were able to add h 6 to the negative rows −(h 1 + h 4 ) and −(h 2 + h 5 ) since all three rows are colinear in this case.As a result, the positive part of the minimal Horn matrix coincides with the lattice distance matrix of A .

The simple prismatoids with fewer facets
The trapezoidal wedges (A), tensor product wedges (B), triangular frusta (C) and triangular based pyramids (C) from Table 1 are simple prismatoids with less than 6 facets.The primitive collections in each case are: None of the polytopes above, except the triangular frusta, have an upper facet F 6 and hence their normal fans and primitive collections do not include n 6 .Also, the triangular based pyramid and triangular frusta have no back facet F 5 and hence their normal fans and primitive collections do not include n 5 .In each case, the primitive collections give a partition of the rays in the normal fan, hence the matrix M A ,Σ P associated to (P, w) is a Horn matrix for these cases.The question is whether this Horn matrix belongs to a Horn pair for (P, w).
Example 3.2.Proposition 3.3 gives a Horn pair for the trapezoidal wedge in Table 1 (A), which can be reduced to a Horn pair (H, λ), with: where m 1 , . . .m n ∈ A , t ∶= (s, t, v) and h 1 , . . ., h 9 are defined to be Let us compare H with the matrix where m 1 , . . .m n and h 1 , . . ., h 5 are as in H.For b = 1, we see that h 2 + h 5 − h 6 = 0, h 3 + h 6 = l, and h 2 + h 3 + h 5 = l, thus H = M A ,Σ P .For b > 1, H and M A ,Σ P are minimal Horn matrices, hence, by uniqueness, M A ,Σ P cannot give rise to a Horn pair for (P, w).
For all other examples of simple prismatoids with fewer facets, we noticed a similar phenomenon.Firstly, if n i is not in the normal fan, then the positive row h i is collinear with a negative row.In particular, for all these examples the positive part of the minimal Horn matrix coincides with the lattice distance matrix of A .Below we summarise for which parameters the matrix M A ,Σ P gives rise to a Horn pair for (P, w), this is not true in general for these families of 'simple prismatoids with fewer facets'.These seemingly arbitrary constraints have a nice geometrical interpretation.The constraint b = 1 forces the triangular facet F 1 in the trapezoidal wedges and tensor product wedges (b ′ = 0) to be a simplex.The constraint a = 1 forces the triangular facet F 2 in the tensor product wedges (a ′ = 0) to be a simplex.The constraint b = d = 1 on the triangular based pyramid, means it is a 3D simplex and the constraint d = 1 on the triangular frusta forces the two triangular facets F 3 and F 6 to be simplices.All the prismatoids considered in this section, except the ones just described, are examples of polytopes with simplicial normal fans for which the answer to Question 2 is negative.

The trapezoidal and tensor product frusta
The primitive collections for the trapezoidal frusta and the tensor product frusta are: It follows easily that the Horn matrix given by Proposition 3.3 is M A ,Σ P .This matrix is also the minimal Horn matrix for all trapezoidal frusta and for general tensor product frusta.However, there are cases of tensor product frusta, where two or more rows of this matrix are collinear and hence the minimal Horn matrix is not exactly M A ,Σ P .For an overview of all minimal Horn matrices for the family P of prismatoids, see where m 1 , . . .m n ∈ A , t ∶= (s, t, v) and h 1 , . . ., h 6 are defined to be If we consider the subfamily of tensor product frusta such that a = λb, a ′ = λb ′ for λ ≥ 1 or λ = 1 µ with µ ≥ 1, then the minimal Horn matrix is , where m 1 , . . .m n ∈ A and h 1 , . . ., h 6 , are as above.
Theorem 3.5.For all pairs in P, the positive part of the minimal Horn matrix is the lattice distance matrix of A .For the subfamilies of P in Table 2, the matrix M A ,Σ P gives rise to a Horn pair for (P, w).

Multinomial staged tree models
In this section we define multinomial staged tree models, we prove that every such model has rational MLE and we give criteria to determine when such models are toric varieties for binary multinomial staged trees, see Theorem 4.7 and Theorem 4.6 respectively.To each toric binary multinomial staged tree one can associate a polytope, by Theorem 2.3 such a polytope has rational linear precision.These results imply our main theorem: Our motivation to introduce this model class arose from the observation that the Horn pairs of all 2D and 3D polytopes in Section 3 could be interpreted as a statistical model defined by an event tree with a specific choice of parametrisation.Multinomial staged tree models improve the understanding of polytopes with rational linear precision in 2D and 3D.They also offer a generalisation for polytopes with rational linear precision in higher dimensions.

Definition of multinomial staged trees
We start by introducing the multinomial model as an event tree.This model is the building block of multinomial staged tree models.Throughout this section m denotes a positive integer and [m] ∶= {1, 2, . . ., m}, this differs from Section 3 where m was used for lattice point.
Example 4.1.The multinomial model encodes the experiment of rolling a q-sided die n independent times and recording the side that came up each time.The outcome space for this model is the set Ω of all tuples K = (k 1 , ⋯ , k q ) ∈ N q whose entries sum to n.We can depict this model by a rooted tree T = (V, E) with vertices V = {r} ∪ {r(K) ∶ K ∈ Ω} and edges E = {r → r(K) ∶ K ∈ Ω}.To keep track of the probability of each outcome we can further label T with monomials on the set of symbols {s 1 , . . ., s q }.Each symbol s i represents the probability that the die shows side i when rolled once.The monomial representing the probability of outcome K is the term with vector of exponents K in the multinomial expansion of (s 1 + . . .
. The labelled tree bT ∆ 2 in Figure 4, represents the multinomial model with n = b and q = 3.
In general terms a multinomial staged tree, is a labelled and directed event tree such that at each vertex, the subsequent event is given by a multinomial model as in Example 4.1.To introduce this concept formally, we start with a rooted and directed tree T = (V, E) with vertex set V and edge set E such that edges are directed away from the root.The directed edge from v to w is denoted v → w, the set of children of a vertex then we say that v is a leaf and we let Ṽ denote the set of non-leaf vertices of T .Given a rooted and directed tree T , we now explain how to label its edges using monomials terms.Figure 3 shows a general sketch of a multinomial staged tree.(1) The sets S 1 , . . ., S m are called stages.
(2) For a ∈ Z ≥1 and ∈ [m], a floret of degree a on S is the set of terms in the multinomial expansion of the expression (∑ i∈I s i ) a , we denote this set by f ,a . ( (4) A multinomial staged tree is a pair (T , L), where T is a rooted directed tree and L is a labelling of T as in condition (3).
In a multinomial staged tree (T , L), each v ∈ Ṽ is associated to the floret f ,a that satisfies im(L v ) = f ,a .In this case we index the children of v by v(K) where K = (k i 1 , . . ., k i I ) ∈ N I is a tuple of nonnegative integers that add to a and i 1 , . . ., i I is a fixed ordering of the elements in I .It follows that when im(L v ) = f ,a , then E(v) = {v → v(K) ∶ K ∈ N I , K = a}, where K ∶= ∑ I q=1 k iq .We further assume that the indexing of the children v is compatible with the labelling L, namely for all multinomial staged trees, . It is important to note that this local description of the tree at the vertex v is the multinomial model described in Example 4.1 up to a change of notation.To clarify the notation just introduced we revisit Example 4.1 with a concrete choice of parameters.
Example 4.2.Consider the multinomial model for q = 2 and n = 3, the outcome space are all possible outcomes of flipping a coin 3 times.Here S = S 1 = {s 1 , s 2 } and the root vertex v will have 4 children, all of which are leaves.The 4 edges of the tree will be labelled by the elements in the floret f 1,3 = {s 3  1 , 3s 2 1 s 2 , 3s 1 s 2 2 , 3s 3 2 }.The sets of children and outgoing edges of Remark 4.1.We will always consider a multinomial staged tree (T , L) as an embedded tree in the plane.This means the tree has a fixed ordering of its edges and vertices.The level of a vertex v in T is the number edges in a path from the root to v.All the trees we consider satisfy the property that two florets associated to two vertices in different levels must be on different stages.This implies that each root-to-leaf path contains at most one monomial term from each floret.Several figures in Section 5 contain multinomial staged trees, in these pictures, for simplicity, we omit the coefficients of the monomial edge labels.Definition 4.2.Let (T , L) be a multinomial staged tree with index set I = ⊔ ∈[m] I .Fix J to be the set of root-to-leaf paths in T , with J = n.For j ∈ J, define p j to be the product of all edge labels in the path j.Let c j be the coefficient of p j and a j the exponent vector of the symbols (s i ) i∈I in p j .With this notation, p j = c j ∏ i∈I s i , where a ij are the entries of a j .Define the parameter space The multinomial staged tree model M (T ,L) is the image of the parameterisation Remark 4.2.The sum-to-one conditions on the parameter space Θ T imply that the image of φ T is contained in ∆ ○ n−1 .The multinomial coefficients on the labels of T are necessary for this condition to hold.The model M (T ,L) is an algebraic variety inside ∆ ○ n−1 with an explicit parameterisation given by φ T .For θ ∈ Θ T , eval θ is the evaluation map s i ↦ θ i .The j-th coordinate of φ T is eval θ (p j ), where p j = c j ∏ i∈I s a ij i (Definition 4.2).For this reason we also use p j to denote the j-th coordinate in the probability simplex ∆ ○ n−1 .Remark 4.3.If all of the florets in a multinomial staged tree have degree one, then it is called a staged tree.Multinomial staged tree models are a generalisation of discrete Bayesian networks [16] and of staged tree models introduced in [17].
Example 4.3.Consider the following experiment with two independent coins: Toss the first coin b times and record the number of tails, say this number is j.Then toss the second coin a + d(b − j) times, record the number of tails, say it is i.An outcome of this experiment is a pair (i, j) where i is the number of tails in the second sequence of coin tosses and j is the number of tails in the first.This sequence of events may be represented by a multinomial staged tree (T = (V, E), L) where This tree has two stages S 1 = {s 0 , s 1 }, S 2 = {s 2 , s 3 } that are a formal representation of the parameters of the Bernoulli distributions of the two independent coins.The set E(r) is labelled by the floret f 1,b and the set E(r(j)) is labelled by the floret f 2,a+d(b−j) .Following the conventions set up earlier we see that L(r → r(j)) = b j s j 0 s b−j 1 and L(r(j) → r(i, j)) = The multinomial staged tree model M a,b,d ⊂ ∆ n assocciated to (T , L), is the statistical model consisting of all probability distributions that follow the experiment just described.Let p ij denote the probability of the outcome (i, j).The model M a,b,d is parameterised by the map φ where .
This model depends on two independent parameters, thus it has dimension two.The model M a,b,d is a binary multinomial staged tree model, its tree representation T a,b,d is displayed in Figure 4.
Definition 4.3.Let (T , L) be a multinomial staged tree.Fix the polynomial rings )) is a toric variety that contains M (T ,L) .The polynomial 1 − ∑ j∈J P j is always an element in ker(Ψ T ), hence using this polynomial as a homogenising element, we shall always consider ker(Ψ T ) as a homogeneous ideal in R[P j ∶ j ∈ J].

The ideal of model invariants for M (T ,L)
As is common in algebraic geometry, finding the explicit equations of the prime ideal ker(Ψ T ) is hard.Luckily, the statistical insight of the problem allows us to find a nonprime ideal, usually referred to as the ideal of model invariants, that defines the model inside the probability simplex.We now define this ideal and postpone the proof that it has the aforementioned property to Section 4.4.Definition 4.4.Let (T , L) be a multinomial staged tree.For a vertex v ∈ V , define [v] ∶= ¸{j ∈ J ∶ the path j goes through the vertex v} and set P The ideal of model invariants of (T , L) is I M(T ,L) ∶= I stages + I vertices + ⟨1 − ∑ j∈J P j ⟩.
The previous definition indicates, that there are equations that must hold for every pair of vertices with the same associated stage, and equations that must hold for every vertex.The motivation for this definition of the ideal of model invariants arises from the technical Lemma B.1 in Appendix B.
Remark 4.5.The generators of I vertices for each fixed vertex v are similar to the Veronese relations of the embedding ν a ∶ P I −1 → P M by monomials of total degree a.The only difference is in the coefficients, defined in Lemma B.1 part (2), that are needed for cancellation.
Remark 4.6.By definition, I M(T ,L) always contains the sum to one condition 1−∑ j∈J P j , thus in a similar way as for ker(Ψ T ) in Remark 4.4, we always consider I M(T ,L) as a homogeneous ideal generated by I stages and I vertices .

Algebraic lemmas for multinomial staged trees
To understand the defining equations of ker(Ψ T ) and the case when this ideal is toric, it is important to establish several lemmas that describe algebraic relations that hold in R[P j ∶ j ∈ J], R[s i ∶ i ∈ I], R[P j ∶ j ∈ J] ker(Ψ T ) and R[P j ∶ j ∈ J] I M(T ,L) .The reader may decide to skip this section and only get back to it when the lemmas are used in the proofs of Theorem 4.4 and Theorem 4.6.Definition 4.5.Let (T , L) be a multinomial staged tree with T = (V, E).
If v is a leaf, t(v) ∶= 1.We denote by t(v), the image of t(v) under the canonical projection to R[s i ∶ i ∈ I] q.Note that for all v ∈ V , t(v) = 1.Lemma 4.2.Let (T , L) be a multinomial staged tree where T = (V, E) and let v ∈ Ṽ be such that im(L v ) = f ,a .
(1) The polynomial t(v) satisfies (2) The image of , where λ r,v is the set of edges in the root-to-v path in T .Moreover Ψ T (P [v] ) = ∏ e∈λr,v L(e).
Proof.(1) Any path in Λ v goes through a child v(K) of v.The sum of all the edge products corresponding to the paths that go through child v(K) is equal to the sum of all the edge products corresponding to the paths starting at v(K) (t(v(K))) multiplied by the label of the edge from v to v(K) Taking the sum of this expression over all children of v gives the desired result.
(2) Let j be a root-to-leaf path that goes through v. Then j is the concatenation of a path from the root to v, denoted by λ r,v and a path from v to the leaf denoted by λ v,j .Then The second statement follows by noting that t(v) = 1.
Lemma 4.3.Let (T , L) be a multinomial staged tree, there is a containment of ideals Proof.To show that I M(T ,L) ⊂ ker(Ψ T ), it suffices to show that the generators of I stages and I vertices are zero after applying Ψ T .We present the proof for the generators of I stages , the proof for I vertices is similar and also uses Lemma 4.2.A generator of Using Lemma 4.2, we compute Ψ T (P [v(K)] ).
The last equality follows from the fact that ∑ L(e) = 0.

Defining equations of binary multinomial staged trees
In this section and the next, we prove Theorem 4.4 and Theorem 4.6 for binary multinomial staged trees; despite being unable to provide a proof, we believe these statements also hold for non-binary multinomial staged trees.First we show that the ring homomorphism Ψ T admits an inverse when localised at a suitable element.From this it follows as a corollary that the ideal of model invariants defines M (T ,L) inside the probability simplex.Then, the localised map is an isomorphism of R-algebras.Therefore (I M(T ,L) ) P = (ker(Ψ T )) P and thus (I M(T ,L) ∶ P ∞ ) = ker(Ψ T ).
Proof.We define a ring homomorphism and show that it is a two sided inverse for (Ψ T ) P .For ∈ [m] and 1 ≤ q ≤ I , let v be a vertex with im(L v ) = f ,a and define aP [v] .
Note that ϕ is well defined: If w is another vertex with im(L w ) = f ,b , then The second to last equality follows by using the expression for Ψ T (P [v] ) presented in Lemma 4.2 part (2), the same result is used to compute Ψ T (P [v(K)] ), finally their quotient Ψ T (P The last equality is obtained by using the same argument as in Lemma B.1 part (3).Next, we verify ϕ ○ (Ψ T ) P = Id, which amounts to proving that (ϕ ○ Ψ T ,P )(P j ) = P j for each j ∈ J. From this point on we further assume that I = 2 for all ∈ [m].Fix j ∈ J and let v 1 → v 2 → ⋯ → v α be the root-to-leaf path j.By Definition 4.3 Where for each γ ∈ [α − 1], im(L vγ ) = f γ ,aγ for some γ ∈ [m] and a γ ∈ Z ≥1 .By Remark 4.1, none of the florets f γ ,aγ share the same set of symbols.Moreover, for each γ ∈ [α − 1], With this notation, we also deduce that v γ+1 = v γ (k γ , a − k γ ).Now we apply ϕ to (5), use that ϕ is a ring homomorphism and use equation ( 6) to obtain Using the definition of ϕ, for each γ ∈ .
To obtain the previous cancellation we used the fact that for each γ ∈ = 1 by definition of I M(T ,L) and P [vα] = P j because v α is the last vertex in the path j.Thus ϕ((Ψ T ) P (P j )) = P j .The second statement of the theorem follows from the fact that I M(T ,L) ⊂ ker(Ψ T ) and that the localisation (Ψ T ) P is an isomorphism.

Toric binary multinomial staged tree models
It is not true in general the the ideal ker(Ψ T ) of a multinomial staged tree is toric.For the case of staged trees, a characterisation of when ker(Ψ T ) is equal to a subideal generated by binomials is available in [10].The goal of this section is to establish a similar criterion, based on interpolating polynomials from Definition 4.5, for multinomial staged trees.This criterion will allow us to study the polyhedral geometry of these models in Section 5. ( (2) The pair of vertices v, w is balanced if for all tuples The multinomial staged tree (T , L) is balanced if every vertex is balanced and every pair of vertices in the same stage is balanced.
Remark 4.7.Condition (1) in Definition 4.6 is an empty condition for florets of degree one.For staged trees, condition (2) specialises to the definition of balanced stated in [2].
Remark 4.8.If all root-to-leaf paths in (T , L) have length 1, then (T , L) is vacuously balanced.If (T , L) has all root-to-leaf paths of length 2, such as T a,b,d in Figure 5, it suffices to check that the root is balanced.For the other vertices, the conditions in Definition 4.6 reduce to the trivial equality 1 ⋅ 1 = 1 ⋅ 1.
Theorem 4.6.Let (T , L) be a binary multinomial staged tree.The model M (T ,L) is toric if and only if (T , L) is balanced.
Proof.We prove that ker(Ψ T ) = ker(Ψ toric T ) if and only if (T , L) is balanced.Define the ideal J to be generated by all polynomials of the form where v, w ∈ V are in the same stage and K, K ′ , Q, Q ′ obey the condition (2) and K 1 , K 2 , K 3 , K 4 obey the condition (1) in Definition 4.6.Claim 1: Note that the right hand side of the two equations above share the common factor ∏ e∈λv,w L(e) where λ v,w is the set of edges in the path from v to w.Thus we extract this factor from the two previous equations and multiply times the labels of the edges v → v(K), w → w(Q) and v → v(K ′ ), w → w(Q ′ ), respectively, to further simplify the two expressions into Finally, since ), tracing these equations backwards implies that T must be balanced.Claim 2: I M(T ,L) ⊂ J.The ideal I M(T ,L)) is the sum of I stages and I vertices .By definition, the generators of I vertices are also generators of J. Hence it suffices to show that the generators of I stages are polynomial combinations of the generators of J. From this point on we further assume that (T , L) is binary.Suppose v, w are in the same stage, where im(L v ) = f ,a , im(L w ) = f ,b and I l = 2.There are two equations that hold for this stage, one for each element in I .We will show that the equation which is the equation for the first element in I , is a combination the generators of J, defined at the beginning.The one for the second element in I follows an analogous argument.We use the following two identities: and Working from equation ( 12), using the identities, we have After rearranging the terms in (13) we get a single double summation.Finally, the (k 1 , k 2 ) summand in ( 14) is a multiple of the generator of J, where Note that gives the (k 1 , k 2 ) summand in ( 14).This implies that ( 14) is a sum of multiples of the generators in J, hence I stages ⊂ J.

Multinomial staged tree models have rational MLE
In this last section on multinomial staged trees we prove that they have rational MLE.This fact together with Theorem 4.6 establishes Theorem 4.1 and thus provides a new class of polytopes that have rational linear precision.
Theorem 4.7.The multinomial staged tree model M (T ,L) has rational MLE Φ.The j-th coordinate of Φ is .
Proof.Let u = (u 1 , . . ., u n ) be a vector of counts.The likelihood function for M T ,L is where L 1 , . . ., L m denote the factors before the last equality in the previous line.The function L(p u) is maximised when each factor is maximised.This is because the parameters are partitioned by I 1 , . . ., I m and hence each factor is independent.Thus we find the maximisers of each factor.The function L , ∈ [m], is the likelihood function of the saturated model ∆ I −1 with parameters (θ i ) i∈I and vector of counts ∑ j∈J u j a ij i∈I .Therefore θi = , and λ j ∶= (−1) ∑ i∈I a ij c j .
Then (H (T ,L) , λ) is a Horn pair for M (T ,L) .
Proof.It suffices to check that the j-th coordinate of ϕ (H,λ) is equal to Φ j in Theorem 4.7.

Polytopes arising from toric multinomial staged trees
The aim of this section is to bring together the examples of 2D and 3D polytopes with rational linear precision (Section 3) and multinomial staged trees (Section 4).To this end, we investigate certain properties of the lattice polytopes arising from toric multinomial staged trees.This leads to a better understanding of the negative part of the Horn matrix than that provided by the primitive collections.Recall that J denotes the set of root-to-leaf paths in T .For j ∈ J, p j is defined to be the product of all edge labels in the path j.We denote the stages of (T , L) by S 1 , . . ., S m .Throughout this section m is a positive integer as in Section 4 and m j (m with a subindex) denotes a lattice point as in Section 3.
Definition 5.1.The lattice polytope P T of a balanced multinomial staged tree (T , L) is the convex hull of exponent vectors a j of p j for every root-to-leaf path j in T .
Note that P T ⊂ R d is not a full-dimensional polytope for d = S 1 + ⋯ + S m .This can be observed e.g. in Figure 4 (left) for P T b∆ 2 ≅ b∆ 2 (unimodularly equivalent).We call (T , L) a multinomial staged tree representation of a full-dimensional polytope P ≅ P T .

Two dimensional multinomial staged tree models
The polytopes in 2D from Section 3.1 admit a multinomial staged tree representation.
Proposition 5.1.All statistical models associated to pairs (P, w) in 2D with rational linear precision are toric multinomial staged tree models.The multinomial staged tree representations for each family in 2D are described in Figure 4.
Proof.For the model b∆ 2 = T 0,b,1 , it suffices to note that the polytope b∆ n with weights given by multinomial coefficients has a Horn pair given by Theorem 2.
= (s 2 + s 3 ) 2a+2db−d(j 3 +j 4 ) = (s 2 + s 3 ) a+d(b−j 3 ) (s 2 + s 3 ) a+d(b−j 4 ) = t(r(K 3 ))t(r(K 4 )) Note that we obtain P T 0,b,1 ≅ b∆ 2 i.e. we have two different tree representations of b∆ 2 : T b∆ 2 and T 0,b,1 .For the investigation of the shape of a Horn matrix, we will be interested in those trees T where the positive part of the Horn matrix H (T ,L) from Corollary 4.8 is the lattice distance matrix of P T (Definition 5.3)(1).For simple polytopes P T , these trees with an additional property provide us an explanation for the negative part of H (T ,L) in terms of primitive collections in Theorem 5.5.

Three dimensional binary multinomial staged tree models
Before we examine the multinomial staged tree representations more generally, we present the multinomial staged trees for the family P in Section 3.
Proposition 5.2.All statistical models associated to pairs in P are toric binary multinomial staged trees.
Proof.We first show that the Horn matrix of the statistical model associated to a general element in P is equal to the Horn matrix of a binary multinomial staged tree.The general element in P is a frustum with parameters a, a ′ , b, b ′ , d, l > 0. Let S = {{s 0 , s 1 }, {s 2 , s 3 }, {s 4 , s 5 }}  We obtain similar formulae for t r(Q 2 ) , t r(Q 3 ) and t r(Q 4 ) .It follows that A similar argument can be used to prove that the children of the root are balanced vertices.Next, let us denote by v such a vertex, whose parent is r.By Remark 4.8, any child of v is trivially balanced.Finally, we prove that all pairs of vertices in the same stage are balanced.There are three stages S 1 = {s 0 , s 1 }, S 2 = {s 2 , s 3 } and S 3 = {s 4 , s . Similarly, we consider two children of v ′ and we denote by We obtain the following equality: and its analogues for t v(Q 2 ) , t v(Q 3 ) and t v(Q 4 ) .Then Therefore the pairs of vertices we considered are balanced.
To obtain the multinomial staged tree representations for the models of the polytopes in Table 1, we use the tree in the proof of Proposition 5.2 and specialise the values of the parameters a, a ′ , b, b ′ , d, l accordingly.The trees for the family of prismatoids with trapezoidal base in Table 1 (A), with l = 1, are depicted in Figure 5.The trapezoidal frusta is represented by T (A) 1 , the upper branch is the model for T a,b,d and the lower branch is the the model for T a ′ ,b ′ ,d .The other trees, T (A) 2 , T (A) 3 and T (A) 4 , have the same upper branch as T (A) 1 .For the prismatoid with simplex on top, the substitution a ′ = 0 has the effect of chopping a floret from T (A) 1 , this gives T (A) 2 .For the trapezoidal wedge, b ′ = 0, the edges in T (A) 1 that contain b ′ contract to a single vertex, yielding T (A) 3 .For the trapezoidal pyramid, a ′ = b ′ = 0, we chop off the lower part of the tree after the edge labelled by s 1 .The trees for the remaining part of the Table 1, (B), (C) and (D) are obtained similarly.the maximal cone associated to the vertex a j ′ in Σ P T has more 1-face (ray) generators than the one associated to a j where j has length m.Thus Σ P T is not simplicial, contradiction.Moreover we obtain that the maximal cone associated to a vertex a j is generated by the normal vectors associated to ⋃ m l=1 S l s i l for some s i l ∈ S l and where ∏ m l=1 s i l divides p j .This implies that dim(P T ) = S 1 + ⋯ + S m − m.Now suppose that all vertex representing root-toleaf paths have the same length m.Then the number of symbols which do not divide p j is S 1 + ⋯ + S m − m where j is a vertex representing root-to-leaf path.If this number is equal to dim(P T ), then P T is simple.
Remark that the equality S 1 + ⋯ + S m − m = dim(P T ) holds for all models from Proposition 5.1 and Proposition 5.2.
Example 5.1.The multinomial staged tree T (A) 4 in Figure 5 for the trapezoidal pyramid, does not satisfy Definition 5.3 (1).However when b = 1, we can find such a balanced multinomial staged tree representation for this polytope, it is shown in Figure 6 (left).This tree T and T (A) 4 represent the same model because their minimal Horn matrices are equal.When a = b = d = 1, the tree and its polytope are in Figure 6 (center) and (right).There are five vertex representing root-to-leaf paths namely 1, 3, 4, 5, and 6 and thus a 1 , a 3 , a 4 , a 5 and a 6 are the vertices of the trapezoidal pyramid.In particular a 2 = 1 2 a 1 + 1 2 a 3 .Hence P T has property (⋆).Moreover, P T is not simple by Lemma 5.4, since not all root-to-leaf paths have the length 2. Furthermore, the minimal Horn matrix for this example with b = 1 (below left) coincides with H (T ,L) .As mentioned also in Section 3.3.1, the primitive collections {n 1 , n 3 , n 4 }, {n 2 , n 3 , n 5 } do not offer an explanation for the negative part of the minimal Horn matrix, however the stages {s 0 , s 1 , s 2 },{s 3 , s 4 } do.
On the other hand we observe that there exists no multinomial staged tree representation for b = 2, a = d = 1 fitting Definition 5.3 by looking at the lattice distance matrix seen in the positive part of its minimal Horn matrix (above right).This matrix can also be obtained by applying Corollary 4.8 to T (A) 4 and performing the row operations explained in [10, Lemma 3] eliminating the row s 0 = h 6 .This demonstrates how multinomial staged trees provide a wider understanding for the negative part of the Horn matrix.
For simple polytopes P T with property (⋆) we show that the stages coincide with the primitive colections of Σ P T .
Theorem 5.5.Let P T ⊂ R d be a simple polytope with property (⋆).Then the primitive collections of the simplicial normal fan Σ P T are represented by the stages S 1 , . . ., S m .
Proof.By Definition 5.3(1), the symbols of the stages represent the facets of P T .Let now j be a vertex representing root-to-leaf path.Recall by the proof of Lemma 5.4, the maximal cone associated to a j is generated by the normal vectors (1-faces) associated to ⋃ m l=1 S l s i l for some s i l ∈ S l and where ∏ m l=1 s i l divides p j .Since any intersection of two cones in Σ P T is also a cone in Σ P T , we obtain that ⋃ m l=1 S l S ′ l for all S ′ l ⊆ S l with S ′ l ≥ 1 is a cone of Σ P T .By Definition 2.6, since Σ P T is simplicial, a primitive collection is a set of 1-faces which does not generate a cone itself but any proper subset does.This concludes that the partition S 1 , . . ..S m are the primitive collections of Σ P T .
The following corollary gives an affirmative answer to Question 2.
Corollary 5.6.Let P T ⊂ R d be a simple polytope with property (⋆).Then the negative rows are given by the primitive collections of Σ P T , i.e.H (T ,L) = M A ,Σ P T .
Proof.It follows from Corollary 4.8 and Theorem 5.5.
Example 5.2.The multinomial staged trees T b∆ 2 and T a,b,d satisfy Definition 5.3(1) for the simplex and trapezoid (a, b, d > 0) respectively.That means the facets of the polytopes are in one-to-one correspondence with the symbols in the stages.Moreover P T b∆ 2 and P T a,b,d are simple polytopes.Hence by Theorem 5.5 we obtain that the primitive collections are given by the partition of the stages.For the simplex P T b∆ 2 ≅ a∆ 2 we have only one primitive collection {s 0 , s 1 , s 2 }.Similarly, for P T a,b,d ≅ T a,b,d we have the partition of the stages as {s 0 , s 1 } and {s 2 , s 3 }, which correspond exactly to the primitive collections obtained in Theorem 3.2.3).However a simple computation shows that there exists no tree (T , L) such that the positive part of H (T ,L) is the lattice distance matrix of P T (A) 3 i.e. satisfying Definition 5.3 (1).

B Appendix B
The next lemma gives several equations that hold between a point in Θ T and its image under φ T .We use Lemma B.1 parts (2) and (4), to define the ideal of model invariants for a multinomial staged tree model.(2) Let K 1 , K 2 , K 3 , K 4 ∈ N I with K 1 = K 2 = K 3 = K 4 = a, be such that a K 2 and similarly for C (K 3 ,K 4 ) .Then (3) For each i q ∈ I , 1 ≤ q ≤ I θ iq = ∑ K =a,ki q ≥1 k iq p [v(K)] ap [v] .
(4) Let w ∈ V and im(L w ) = f ,b .For all i q ∈ I : (2) This equality follows by direct substitution for the values from (1) and by noting that the coefficients C (K 1 ,K 2 ) , C (K 3 ,K 4 ) are needed to achieve cancellation.
(3) We start from the right-hand side, use (1), the fact that ∑ i∈I θ i = 1, and simplification with multinomial coefficients to arrive at θ iq, : (4) Applying part (3) to i q for v and w separately yields .
After cross multiplication we get the desired equation in (4).
We are now ready to prove Lemma B.2.
Proof.Let us first prove equality (16).We will do this by mathematical induction on k.First we show that (16) holds for k = 1: Let us now prove equality (17).By (18), we have Proof.First, note that aP [v] = (l 1 + l 2 ).Indeed be the standard simplex in R d and k∆ d be its dilation by the integer k ≥ 1.To a point m = (a 1 , . . ., a d ) ∈ A = k∆ d ∩ Z d we associate the weight

Theorem 2 . 3 .
[11, Proposition 5.1] The pair (P, w) has rational linear precision if and only if the model M A ,w has rational MLE.Theorem 2.4.[4] Set a P ∶= ∑ r i=1 a i and n P ∶= ∑ r i=1 n i .The following are equivalent:

Figure 1 :
Figure 1: Left: Bézier triangles.Middle: Tensor product patches.Right: Trapezoids.The normal fan of each polygon is displayed in the bottom row; two rays with the same colour are in the same primitive collection.

Remark 3 . 1 .
The blending functions { βm ∶ m ∈ A } for each pair (P, w) in F that satisfy Definition 2.2 (3) are given in equation (4) in the previous proof.For the case a = d = 1 and b = 2, these are written in Example 2.1.

Figure 2 :
Figure 2: The general representative of a prismatoid in P is the convex hull of two trapezoids, conv(T a,b,d ×{0}, T a ′ ,b ′ ,d ×{1}), dilated by l.For the labelling of facets, we refer to Notation 3.4.

Theorem 4 . 1 .Figure 3 :
Figure 3: General sketch of a multinomial staged tree.The vertex v is labeled by the floret of degree 3 on S l , denoted by f l,3 .The green vertices are the leaves and a root-to-leaf path is shown in orange.

Definition 4 . 1 .
Fix a set of symbols S = {s i ∶ i ∈ I} indexed by a set I. Let I 1 , . . ., I m be a partition of I and S 1 , . . ., S m the induced partition in the set S.

Figure 4 :
Figure 4: The multinomial staged trees T b∆ 2 and T a,b,d represent the multinomial model with three outcomes and b trials and the model in Example 4.3 respectively.

Corollary 4 . 5 .
The ideal of model invariants defines the binary multinomial staged tree model inside the probability simplex, i.e.M (T ,L) = V (I M(T ,L) ) ∩ ∆ ○ n−1 .Proof.The variety V (I M(T ,L) ∶ P ∞ ) exactly describes the points in V (I M(T ,L) ) that are not in V (P).The latter variety contains the boundary of the simplex, hence restricting to positive points that add to one, yields M (T ,L) = V (I M(T ,L) ) ∩ ∆ ○ n−1 .

Definition 4 . 6 .
Let (T , L) be a multinomial staged tree and let v, w be two vertices in the same stage with im(L v ) = f ,a and im(L w ) = f ,b for some ∈ [m].

Corollary 4 . 8 .
Let H (T ,L) be the ( I + m) × ( J ) matrix with entries 4 which is equal to that one described in [10, Example 20] for multinomial models with b trials and n + 1 outcomes.The statistical model for T a,b,d is the binary multinomial staged tree M a,b,d in Example 4.3, denoted by T a,b,d in Figure 4.The Horn matrix in Proposition 3.1, associated to the model for T a,b,d , is equal to the Horn matrix of the model M a,b,d .Firstly, in both cases the columns are indexed by pairs (i, j) such that 0 ≤ j ≤ b, 0 ≤ i ≤ a + d(b − j) so these matrices have the same number of columns.Using Corollary 4.8, we see that the column corresponding to the outcome (i, j) in M a,b,d is (i, j, a + d(b − j) − i, b − j, −(a + d(b − j)), −b), which equals the column associated to the lattice point (i, j) in Proposition 3.1.Uniqueness of the minimal Horn matrix, implies that the model associated to T a,b,d is M a,b,d .It remains to show that T b∆ 2 and T a,b,d are balanced.By Remark 4.8, T b∆ 2 is balanced because all root-to-leaf paths have length 1.For T a,b,d , it suffices to prove that the root r is balanced.Following the notation in Definition 4.6, let
5 }.Denote by v and v ′ two children of the root r.The exponents of the outgoing edges of v can be written as pairs of natural numbers that sum to the degree b − (b − b ′ )k 1 of the floret.Thus they are pairs of the form (j, b − (b − b ′ )k 1 − j).Let us consider two such pairs, denoted by

Proof. ( 1 )
Since M (T ,L) is a probability tree, the transition probability from v to v(K) is the probability of arriving at v(K) divided by the probability of arriving at v, namely p [v(K)] p[v]  .By definition of M (T ,L) , and since L v (v → v(K)) = a ki 1 ,...,ki I
Example 2.3.Consider the model M of two independent binary random variables X, Y , with outcome set {0, 1} and p ij = P (X = i, Y = j).This model is the set of all points (p 00 , p 01 , p 10 , p 11 ) in ∆ ○ 3 that satisfy the equation p 00 p 11 − p 10 p 01 = 0.The model has rational MLE Φ ∶ R 4 → M where (u 00 , u 01 , u 10 , u 11 Definition 2.3.Let M be a discrete statistical model with MLE Φ ∶ R n → M, u ↦ p.The model M has rational MLE if the coordinate functions of Φ are rational functions in u. Theorem 2.1.[10, Theorem 1] A discrete statistical model M has rational MLE Φ if and only if there exists a Horn pair (H, λ) such that M is the image of the Horn parametrisation ϕ (H,λ) restricted to the open orthant R n >0 and Φ = ϕ (H,λ) on R n >0 .It is possible that two Horn parametrisations ϕ (H,λ) and ϕ ( H, λ) are equal even if H ≠ H and λ ≠ λ.A Horn matrix H is minimal if it has no zero rows and no two rows are linearly dependent.By [4, Proposition 6.11] there exists a unique, up to permutation of the rows, minimal Horn matrix that defines ϕ (H,λ) .Any other pair (H, λ) that defines the same Horn parametrisation may be transformed into one where H is a minimal Horn matrix; this is done by adding collinear rows, deleting zero rows and adjusting the vector λ accordingly, see [10, Lemma 3].We end this section by noting that [10, Proposition 23] states that if (H, λ) and as such it is a statistical model.This class of models, of the form M A ,w , are known as log-linear models.Remark 2.4.The variety Y A ,w admits two parameterisations, one by monomials and one by toric blending functions [4, Proposition 5.2].These are

Table 1
There is no n 6 for the two pyramids since the facet F 6 has collapsed to a point.For a pair (P, w) in the subfamily of non-simple prismatoids in P, the matrix M A ,Σ P cannot be a Horn matrix since the primitive collections are not a partition of the 1-dimensional rays of the normal fan and therefore the columns cannot add to zero.Example 3.1.It follows from Proposition 3.3 that the minimal Horn matrix associated to the tensor product pyramid in Table 1 (B) is: (A) and (B), are all examples of non-simple polytopes in P. Their primitive collections are: Prismatoids with triangle on top {n 1 , n 3 , n 4 }, {n 1 , n 2 , n 4 }, {n 2 , n 5 }, {n 3 , n 6 } Trapezoidal pyramids {n 1 , n 3 , n 4 }, {n 2 , n 3 , n 5 } Tensor product pyramids {n 1 , n 3 , n 4 }, {n 2 , n 3 , n 5 }.

Table 3
in Appendix A. Example 3.3.A Horn matrix associated to the tensor product frusta in Table 1 (B) is

Table 2 :
Subfamilies of prismatoids for which there exists a Horn pair (H, λ) with H = M A ,Σ P .Proof.Let (P, w) ∈ P, if M A ,Σ P is a Horn matrix, then after row reduction operations, we get a minimal Horn matrix.Comparing this matrix with the minimal Horn matrix associated to (P, w) in

Table 3 (
Appendix A) and by uniqueness of minimal Horn matrices, one can verify both statements on the theorem.