Toric statistical models: parametric and binomial representations

Size: px
Start display at page:

Download "Toric statistical models: parametric and binomial representations"

Transcription

1 AISM (2007) 59: DOI /s z Toric statistical models: parametric and binomial representations Fabio Rapallo Received: 21 February 2005 / Revised: 1 June 2006 / Published online: 12 October 2006 The Institute of Statistical Mathematics, Tokyo 2006 Abstract Toric models have been recently introduced in the analysis of statistical models for categorical data. The main improvement with respect to classical log-linear models is shown to be a simple representation of structural zeros. In this paper we analyze the geometry of toric models, showing that a toric model is the disjoint union of a number of log-linear models. Moreover, we discuss the connections between the parametric and algebraic representations. The notion of Hilbert basis of a lattice is proved to allow a special representation among all possible parametrizations. Keywords Contingency tables Hilbert basis log-linear models polynomial algebra structural zeros sufficient statistic toric ideals 1 Introduction In the past few years, the application of new algebraic non-linear techniques to Probability and Statistics have been presented. Here we follow the polynomial representation of random variables on discrete sample spaces as introduced in Pistone et al. (2001a) and we study some algebraic and geometrical properties of a class of models introduced as toric models in Pistone et al. (2001b), showing the links between toric models and log-linear models. See also Diaconis and Sturmfels (1998), where algebraic techniques were used for the first time in the analysis of contingency tables. The polynomial Algebra is used here to describe the geometrical structure of the statistical toric models on finite sample spaces. The first works in this F. Rapallo (B) Department of Mathematics, University of Genova, via Dodecaneso 35, Genova, Italy rapallo@dima.unige.it

2 728 F. Rapallo direction, but limited to the analysis of graphical models, are Geiger et al. (2002) and Garcia et al. (2005). In this paper we consider a general finite sample space and we use algebraic techniques in order to obtain a description of the notion of sufficiency. We show the connections between the parametric representation and the binomial representation of a toric model. In particular, we study the boundary of the toric model, and the problem of structural zeros. We present new results which lead to a parametrization with major properties, see Theorem 4. A number of classical examples of log-linear models (independence, quasi-independence, quasi-symmetry) are revisited in order to show the relevance of our analysis. The term toric comes from Commutative Algebra, because of the algebraic structure of the probabilities. In Commutative Algebra, toric ideals describe the algebraic relations among power products and in toric models the probabilities are expressed in terms of power products. See also Sturmfels (1996) and Bigatti and Robbiano (2001), where toric ideals are studied in details. Working in the non-negative case, in Sect. 2 we recall some background material. In Sect. 3, we introduce the class of toric models, both parametric and binomial, and we present the first results on the relationships between the two representations. Moreover, we study the behavior of the sufficient statistic under the sampling, generalizing a result on the exponential models. In Sect. 4, we study the geometry of toric models and we show that toric models are not exponential models, but they are disjoint union of log-linear models, i.e., disjoint union of exponential models. In Sect. 5 we analyze the problem of structural zeros and its connection with the parametrization of the model. In Sect. 6, we show that the parametrization plays a fundamental role, and we define a special parametrization based on the notion of Hilbert basis of a lattice and we show its properties. Finally, in Sect. 7 we show a detailed example from the classical literature on log-linear models. 2 Notation and background material Consider a statistical model on a finite sample space X. Although in contingency tables the sample space is usually a Cartesian product (for example in the two-way case is a space of the form {(i, j) i = 1,...I, j = 1,..., J}), we assume here, without loss of generality, a generic list of points X,with#X = k. The sample points are denoted by x X. A probability distribution on X is characterized by the value of the parameters p x = P[x] for all x X. In this paper we use the vector notation, that is p is the k-dimensional vector (p x, x X ). The parameter space for the saturated model is given by the simplex p x 0, x X and x X p x = 1. A statistical model is a variety of that simplex. Here we assume that the model is described by a set of polynomial equations. This means that the model is defined through the conditions f 1 (p) = 0,..., f m (p) = 0, where f 1,..., f m are polynomials. The variety of the simplex is the subset of the simplex where all f 1,..., f m vanish.

3 Toric statistical models 729 Let us consider a statistical model on the sample space X of the form p x = P φ [x] =φ(t(x)), x X (1) where T : X N s is the vector of integer valued components of the sufficient statistic. Here N denotes the set of non-negative integer numbers. In general φ, where is a subset of functions from N s to R. In point of fact, the range of T is a finite subset T N s. The set defines a subset M of the space of the probabilities, and we refer to this subset as to a statistical model. In other words, M is a subset defined through M ={p : p = φt, φ }. By the well known factorization theorem, T is a sufficient statistic of this model. 3 Parametric and binomial toric models We specialize Eq. (1), by assuming that there exists a parametrization with non-negative parameters ζ 1,..., ζ s such that the probabilities assume the form p x = L(ζ, x), (2) L(ζ, y) y X with L(ζ, x) = ζ T(x).HereT(x) = (T 1 (x),..., T s (x)) and y X L(ζ, y) is the normalizing constant. Consistently with the vector notation, ζ T(x) denotes the monomial ζ T 1(x) 1 ζ T s(x) s. Apart from the normalizing constant, the function L(ζ, x) is the likelihood of the statistical model. It is known, see Pistone et al. (2001a,b), that the probabilities expressed in the form (2) lead to a binomial representation of the statistical model, called toric model. We recall briefly the construction of the relevant binomials. For the basic Commutative Algebra we refer to Kreuzer and Robbiano (2000). Consider the polynomial ring Q[p, ζ ], i.e. the set of all polynomials in the indeterminates p 1,..., p k, ζ 1,..., ζ s. Define the binomials p x L(ζ, x), x X and take the ideal I generated by such binomials. The relevant set of binomials B is obtained by elimination of the ζ indeterminates, see Pistone et al. (2001a). B is a set of generators of the ideal I M = Elim(ζ, I) (3) It is known that the set of generators is not unique. Among others, we consider here B as a Gröbner basis of the ideal I M, see Sturmfels (1996) for algebraic details. The computation of the elimination ideal in Eq. (3) and its Gröbner basis can be performed with symbolic software, such as CoCoA, see CoCoATeam

4 730 F. Rapallo (2004). In point of fact, there exist other methods for the computation of the relevant ideal. The elimination method cited here is the simplest, while other methods based on the algebraic technique of saturation are faster and computationally feasible. For a review on such methods, see for example Rapallo (2003). Definition 1 If a statistical model M consists of all probability functions of the form in Eq. (2), then we say that the model is a parametric toric model. Example 1 Following Pistone et al. (2001a), we show the computation of the binomial for the classical 4-cycle, the conditional independence model for 4 binary random variables X 1, X 2, X 3, X 4, see Lauritzen (1996). Here X = {1, 2} 4. The model is defined through the conditional independence statements X 1 X 3 {X 2, X 4 } and X 2 X 4 {X 1, X 3 }. The parametric toric model is expressed for example by the set of equations below. p 1111 = ζ 0 p 2111 = ζ 0 ζ 1 p 1211 = ζ 0 ζ 2 p 1121 = ζ 0 ζ 3 p 1112 = ζ 0 ζ 4 p 2211 = ζ 0 ζ 1 ζ 2 ζ 5 p 2121 = ζ 0 ζ 1 ζ 3 p 2112 = ζ 0 ζ 1 ζ 4 ζ 6 p 1221 = ζ 0 ζ 2 ζ 3 ζ 7 p 1212 = ζ 0 ζ 2 ζ 4 p 1122 = ζ 0 ζ 3 ζ 4 ζ 8 p 2221 = ζ 0 ζ 1 ζ 2 ζ 3 ζ 5 ζ 7 p 2212 = ζ 0 ζ 1 ζ 2 ζ 4 ζ 5 ζ 6 p 2122 = ζ 0 ζ 1 ζ 3 ζ 4 ζ 6 ζ 8 p 1222 = ζ 0 ζ 2 ζ 3 ζ 4 ζ 7 ζ 8 p 2222 = ζ 0 ζ 1 ζ 2 ζ 3 ζ 4 ζ 5 ζ 6 ζ 7 ζ 8 In the statistical model, the coding {1, 2} is merely a notational fact. Moreover, the conditional independence statements are invariant under the shift of indices. Thus, all equations have to be invariant under the action of the group (S 2 ) 4 C 4, where S 2 is the group of permutations over the set of codings {1, 2} and C 4 is the cyclic sub-group of S 4 generated by the permutation (2, 3, 4, 1). (S 2 ) 4 acts componentwise on the indices, while C 4 naturally acts as permutation over four elements. The use of symmetries and group actions in this context is carefully discussed in Aoki and Takemura (2005). We exploit this fact in order to give a synthetic description of the ideal. In particular, the following binomials and their orbits give a system of generators of the elimination ideal in Eq. (3): p 1111 p 1212 p 1211 p 1112 (orbit of cardinality 8); p 1112 p 1221 p 2122 p 1121 p 2112 p 1222 (orbit of cardinality 16); p 1111 p 1221 p 1212 p 2122 p 1211 p 1121 p 2112 p 1222 (orbit of cardinality 32); p 2111 p 1221 p 1212 p 2122 p 1211 p 2121 p 2112 p 1222 (orbit of cardinality 8). For a discussion on the meaning of such binomials, see Pistone and Wynn (2003) and Sturmfels (2002). In this paper we investigate deeply the relationships between the parametric representations and the binomial representation. In Definition 1, the ζ parameters are unrestricted, except the non-negativity constraint. Note that in general a toric model is bigger than the exponential

5 Toric statistical models 731 model, as we do not assume positive probabilities, and with the constraint p x > 0 for all x X it is a log-linear model. Let M >0 be the subset of the toric model M with the restriction p x > 0 for all x X. Then log p x = j (log ζ j )T j (x) + log ζ 0, where ζ 0 = ( x L(ζ, x)) 1 is the normalizing constant. M >0 is a log-linear, and thus an exponential model with sufficient statistic T and canonical parameters log ζ j, j = 1,..., s. Note that the representation of the toric model in Eq. (2) points to the notion of multiplicative form of a log-linear model, see for example Goodman (1979). Example 2 Denote by I A the indicator function of the set A (i.e. I A (x) = 1if x A and I A = 0 otherwise). A first example of toric model is a model with sufficient statistic consisting of the counts over the sets A 1,..., A s X, possibly overlapping: T : x ( I A1 (x),..., I As (x) ) In most examples in the literature X {1,..., I 1 } {1,..., I d } is a d-way array, possibly incomplete. Example 3 A second example is a log-linear model of the type log P ψ (x) = s ψ i T i (x) k(ψ) (4) i=1 with integer valued T i s and parameters ψ = (ψ 1,..., ψ s ), see Fienberg (1980). Note that in Eq. (1) the strict positivity implied by the log-linear model in Eq. (4) is not assumed. For simplicity we state the following definition for the binomial representation of a toric model. Definition 2 Given a parametric toric model, the corresponding binomial toric model is the zero set of the polynomial ideal defined in Eq. (3). The connections between the two representations of toric models will be analyzed in the next sections. The following Lemma shows a first relationship among parametric toric models and binomial toric models. Lemma 1 Given a parametric toric model, the corresponding binomial toric model contains the parametric model. Proof Let γ : R s 0 Rn be the function such that γ(ζ)= (p x (ζ ), x X ) and let V(I M ) be the zero set of the ideal I M. It is enough to prove that γ(r s 0 )

6 732 F. Rapallo V(I M ). By definition I M = Elim(ζ, I), where I = Ideal(p x p x (ζ ), x X ). If p = p(γ ) γ(r s 0 ), for all polynomial g I M I there exist polynomials q x (p, ζ), x X such that g = x X q x (p, ζ)(p x p x (ζ )) and thus g = 0, as all terms (p x p x (ζ )) vanish. It is known that different parametrizations can lead to the same set of binomials, i.e. to the same binomial toric model. Thus, we state the following definition. Definition 3 Two parametric toric models are said to be b-equivalent if they have the same binomial representation. A number of parametrizations exist for the same binomial toric model. However, the different parametrizations allow differences only on the boundary of the model. Lemma 2 Two b-equivalent parametric toric models restricted to M >0 define the same variety. Proof In the strictly positive case the parametric toric model assumes the form log p = T log ζ, where T is the matrix of the exponents of the monomials. Let log p = T log ζ and log p = T log ζ (5) be two b-equivalent parametric toric models. From Theorem 2.10 in Bigatti and Robbiano (2001) follows that Image(T) = Image( T) and then there exists parameters ζ and ζ such that the relationships in Eq. (5) are both verified. Example 4 Consider the simple case of the independence model for 2 2 tables. The binomial toric model is given by the binomial p 11 p 22 p 12 p 21 and the following two parametric toric models are b-equivalent: (p 11, p 12, p 21, p 22 ) = (ζ 0, ζ 0 ζ 1, ζ 0 ζ 2, ζ 0 ζ 1 ζ 2 ) or (ζ 0 ζ 2, ζ 0 ζ 3, ζ 1 ζ 2, ζ 1 ζ 3 ). (6) The second parametrization is used in many books, see for example Agresti (2002). In view of Lemmas 1 and 2, it is clear why we use the analysis of parametric toric models in order to study the structural zeros. Consider the problem of sampling. It is easy to generalize a result well-known in the case of exponential models, that is when we suppose p x > 0 for all x X. We denote by (x 1,..., x N ) a sample of size N drawn from a vector (X 1,..., X N )

7 Toric statistical models 733 of independent and identically P-distributed random variables with values in X. As the probabilities can be written in the form p x = ζ 0 ζ T 1(x) 1 ζ T s(x) s the probability of a sample (x 1,..., x N ) is p x1 p xn = ζ N 0 ζ i T 1(x i ) 1 ζ i T s(x i ) s i.e., the sufficient statistic for the sample of size N is the sum of the sufficient statistics of the N components of the sample. Note that this result is formally the same as in the positive case where the theory of exponential models applies. The proof can be carried out by straightforward computation. In fact, the j-th component of the sufficient statistic for the sample of size N can be written as where is the count of the cell a. T j (x i ) = T j (a)f a (x 1,..., x N ) a X i F a (x 1,..., x N ) = N I a (x i ) i=1 4 Geometry of toric models Define the matrix A T in the following way. A T is a matrix with k rows and s columns and its generic element A T (i, j) is T j (x i ) for all i = 1,...k and j = 1,..., s. If η j = E(T j ) are the expectation parameters and p is the row vector of the probabilities, then η = pa T (7) The matrix A T can also be used in order to describe the geometric structure of the statistical model. First, we can state the following result. Proposition 1 Choose a parameter ζ j and take the set X of points x X such that T j (x) >0. Suppose that X = X.Ifwesetζ j = 0, we obtain a model on the remaining sample points and this model is again a toric model.

8 734 F. Rapallo Proof Without loss of generality, suppose j = 1 and T 1 (x) = 0fori = 1,..., k and T 1 (x) >0fori = k + 1,..., k. ThematrixA T can be partitioned as A T = 0. A T 0. where denotes non-zero entries. Now, the matrix A T is non-zero and it is the representation of a toric model on the first k sample points. Thus, the geometric structure of the toric model is an exponential model and at most s toric models with (s 1) parameters on appropriate subsets of the sample space X. Moreover, by applying recursively the above theorem we obtain the following result. Theorem 1 Let ζ j1,..., ζ jr be a set of parameters and take the set X of points x X such that T ib (x) >0 for at least one b {1,..., r} and T ib (x) = 0 for all b = 1,..., r and x X X. Suppose that X = X.Ifwesetζ jb = 0 for all b = 1,..., r, we obtain a toric model on the remaining sample points. Proof Apply b times Proposition 1. These results lead to a geometrical characterization of a toric model. Theorem 2 A toric model is the disjoint union of exponential models. Proof The result follows from the application of Theorem 1 for all possible sets of parameters ζ j1,..., ζ jb for which X = X. Example 5 Consider the independence model for 3 2 tables. The matrix representation of the sufficient statistic is A T = and the toric model is, apart from the normalizing constant, (p 11, p 12, p 21, p 22, p 31, p 32 ) = (ζ 1 ζ 4, ζ 1 ζ 5, ζ 2 ζ 4, ζ 2 ζ 5, ζ 3 ζ 4, ζ 3 ζ 5 ). If ζ>0 we have the log-linear model. Moreover, we can choose the following sets X in Theorem 1:

9 Toric statistical models 735 X ={(1, 1), (1, 2)} corresponding to ζ 1 = 0. In this cases we obtain the independence model for the 2 2 table X X. Similarly for ζ 2 = 0 and ζ 3 = 0; X ={(1, 1), (2, 1), (3, 1)} corresponding to ζ 4 = 0. In this case we obtain the multinomial model for the second column. Similarly for ζ 5 = 0. X ={(1, 1), (1, 2), (2, 1), (2, 2)} corresponding to ζ 1 = ζ 2 = 0. In this case we obtain the Bernoulli model for the third row. Similarly for ζ 1 = ζ 3 = 0 and ζ 2 = ζ 3 = 0. X ={(1, 1), (1, 2), (2, 1), (3, 1)} corresponding to ζ 1 = ζ 4 = 0 and similarly for ζ 1 = ζ 5 = 0, ζ 2 = ζ 4 = 0, ζ 2 = ζ 5 = 0, ζ 3 = ζ 4 = 0 and ζ 3 = ζ 5 = 0. In this case we obtain 6 Bernoulli models on the columns of the independence models found above. corresponding to the six conditions ζ 1 = ζ 2 = ζ 4 = 0, ζ 1 = ζ 2 = ζ 5 = 0, ζ 1 = ζ 3 = ζ 4 = 0, ζ 1 = ζ 3 = ζ 5 = 0, ζ 2 = ζ 3 = ζ 4 = 0 and ζ 2 = ζ 3 = ζ 5 = 0 we obtain 6 trivial distributions on one sample point. The toric model is then formed by 21 models: the log-linear model on 6 points, 3 models on 4 points, 2 models on 3 points, 9 models on 2 points and 6 trivial models on 1 point. 5 Structural zeros The procedure in Theorem 1, applied as in Example 5 can also be used to define the admissible sets of structural zeros. Definition 4 A subset X X is an admissible set of structural zeros for a parametric toric model with parameters ζ 1,..., ζ s if there exist parameters ζ i1,..., ζ ir such that the condition of Theorem 1 holds. Now, we consider the behavior of the η-parametrization in the different exponential models. Starting from the representation of the η parameters as function of the ζ parameters in Eq. (7), we can easily prove that the η parametrization is coherent, as stated in the following proposition. Proposition 2 The η parameters for the reduced models are the same as in the exponential case, provided that a component is fixed to zero. Proof For the proof, it is enough to combine the linear relation between η and ζ given in Eq. (7) and Theorem 1. Related work about the relationships among the parametrizations and the exponential family are presented in Geiger et al. (2001). Moreover, in the strictly positive case, the geometry of independence and conditional independence models is analyzed in the context of graphical models in Geiger et al. (2002).

10 736 F. Rapallo 6 Analysis of parametric toric models The geometric representation of the structural zeros as presented in the previous definition needs some further discussions. Let us consider a simple example. Example 6 Consider the independence model for 2 2 contingency tables and its two parametrizations in Eq. (6). The parametric toric models are different. In fact, the second parametrization contains for example the Bernoulli model on the two points (1, 1) and (1, 2), while the first parametrization does not. Now, consider the binomial equations obtained from a toric model by elimination of the ζ indeterminates as described in Sect. 3. In this way we obtain a set of binomials which defines a statistical model, but in general the binomial toric model differs from the parametric toric model. The binomial model is independent on the parametrizations and it can allow some boundaries excluded from the parametric model, as in the previous example. Moreover, we can also restate the definition of set of structural zeros for a binomial toric model. Definition 5 Let B be the set of binomials defined by elimination as described in Sect. 3. A subset X X is an admissible set of structural zeros independent from the parametrization if the polynomial system B = 0 together with p x = 0 for all x X has a non-negative normalized solution. In order to show the difference between Definitions 4 and 5, let us discuss the following example. Example 7 Consider the parametric toric model of independence for 2 2 contingency tables with the parametrization and binomial representation (p 11, p 12, p 21, p 22 ) = (ζ 0, ζ 0 ζ 1, ζ 0 ζ 2, ζ 0 ζ 1 ζ 2 ) B ={p 11 p 22 p 12 p 21 }. The set X ={(1, 1), (1, 2)} is an admissible set of structural zeros independent from the parametrization as (p 11, p 12, p 21, p 22 ) = (0, 0, 1/2, 1/2) is a non-negative normalized solution of B = 0, but it is not an admissible set of structural zeros for this parametrization as p 11 = 0 implies ζ 0 = 0 which in turn implies (p 11, p 12, p 21, p 22 ) = (0, 0, 0, 0). In general, it is difficult to find a parametrization such that the parametric form of the toric model contains all the exponential sub-models. Definition 6 If a parametrization defines a parametric toric model which contains all the exponential sub-models, we say that the parametrization is a full parametrization.

11 Toric statistical models 737 In view of Example 6 and Definition 6, it follows that not all matrix representations of the sufficient statistic are equivalent. In general there is an infinite number of non-negative integer valued bases of the sub-space spanned by T, but not all of these contains all the exponential sub-models. This happens because the columns of the matrix A T are defined in the vector space framework, but in the power product representation we need non-negative exponents and then we need linear combinations with non-negative integer coefficients. In general, it is difficult to find a full parametrization, but it is easy to characterize all the parametrizations which lead to a given binomial toric model. Theorem 3 Let A T be the matrix representation of the sufficient statistic of a toric model. If v 1,..., v s is a non-negative integer system of generators of the image of A T, then p x = ζ v 1(x) 1 ζ v s(x) s for x X is a parametrization and all parametrizations of this kind lead to the same binomial toric model. Proof Let A v be the matrix formed by the column vectors v 1,..., v s, i.e., A v = (v 1,..., v s ). By the definition of the v s it follows that Image(A T ) = Image(A s ) and thus the kernels of the systems A v = 0 and A T = 0arethesame.Asa consequence of the construction of the toric ideals presented in Sect. 3, the toric models defined through A T and A v are represented by the same binomials. Among others, one can consider the image of A T as a lattice and then consider a Hilbert basis of such lattice. We look at A T as an operator from N k to N s. The corresponding linear system has natural coefficients and we are interested in its solution with natural components. Definition 7 Let S N k be the set of integer solutions of a diophantine system pa T = 0. A set of integer vectors H ={v 1,..., v h } is a Hilbert basis of S if for all β S β = v H c v v where c v N. The notion of Hilbert basis has major applications both in combinatorics and integer programming. It is known that such a set H exists and is unique. The number of elements in H in general differs from the dimension of the image of A T as vector sub-space. For details about the properties of the Hilbert basis and the algorithms for its computation, see Sturmfels (1993) and Kreuzer and Robbiano (2005).

12 738 F. Rapallo Theorem 4 Let v 1,..., v s be the columns of the matrix A T and suppose that {v 1,..., v s } is the Hilbert basis of the image of A T. Then the parametrization p x = ζ v 1(x) 1 ζ v s(x) s for x X is the bigger parametrization of the toric model. Proof Consider another parametrization p x = θ u 1(x) 1 θ u t(x) t As {v 1,..., v s } is a Hilbert basis, any u i (x) can be written in the form u i (x) = s c i,j v j (x) j=1 with non-negative integer coefficients c i,j. Thus, p x = θ u 1(x) 1 θ u t(x) t rearranging the exponents = ( t i=1 θ c i,1 i sj=1 c 1,j v j (x) = θ1 θ ) v1 (x) ( t i=1 θ c i,s i sj=1 c t,j v j (x) t = ) vs (x) and the result is proved. The Hilbert basis can be computed using symbolic software, for example the free software 4ti2, see Hemmecke et al. (2005). Example 8 Consider again the simple independence model for 2 tables of Examples 4 and 6. The image of A T is generated by the three vectors u 1 = (1, 1, 1, 1) t, u 2 = (1, 0, 1, 0) t and u 3 = (0, 0, 1, 1) t. The vectors u 1, u 2, u 3 generate the first parametrization in Eq. (6). The Hilbert basis of the image of A T consists of the four vectors v 1 = (1, 1, 0, 0) t, v 2 = (0, 0, 1, 1) t, v 3 = (1, 0, 1, 0) t and v 4 = (0, 1, 0, 1) t. These vectors lead to the second parametrization in Eq. (6). 7 A final example Classical books on log-linear models state that the quasi-independence model is equivalent to the quasi-symmetry model in the case of 3 3 contingency tables, see for example Agresti (2002), page 427. We shortly recall two such models.

13 Toric statistical models 739 In the usual notation for log-linear models, see for example Bishop et al. (1975), the quasi-independence model has the form log µ ij = λ + λ X i + λ Y j + δ i I {i=j} (8) where the µ ij s are the expected frequencies, the λ X i s are the effects of the first variable X with values 1,...,3, the λ Y j s are the effects of the second variable Y with values 1,..., 3 and the δ i s are the effects of the diagonal cells (here the indicator I {i=j} equals 1 when i = j and 0 otherwise). The quasi-symmetry model has the form log µ ij = λ + λ X i + λ Y j + λ ij (9) with λ ij = λ ji for all i, j = 1,...,3. Using the technique described in Example 3, one can found the parametric toric models. For the quasi-independence model the following parametrization comes out: (p 11, p 12, p 13, p 21, p 22, p 23, p 31, p 32, p 33 ) = (ζ 1 ζ 4 ζ 7, ζ 1 ζ 5, ζ 1 ζ 6, ζ 2 ζ 4, ζ 2 ζ 5 ζ 8, ζ 2 ζ 6, ζ 3 ζ 4, ζ 3 ζ 5, ζ 3 ζ 6 ζ 9 ). (10) The binomial toric model is represented by one binomial. In fact, applying the elimination algorithm, we find: B qi ={p 12 p 23 p 31 p 13 p 21 p 32 } (11) For the quasi-symmetry, the parametric representation is (p 11, p 12, p 13, p 21, p 22, p 23, p 31, p 32, p 33 ) = (ζ 1 ζ 4 ζ 7, ζ 1 ζ 5 ζ 10, ζ 1 ζ 6 ζ 11, ζ 2 ζ 4 ζ 10, ζ 2 ζ 5 ζ 8, ζ 2 ζ 6 ζ 12, ζ 3 ζ 4 ζ 11, ζ 3 ζ 5 ζ 12, ζ 3 ζ 6 ζ 9 ) (12) and the binomial toric model is again: B qs = B qi ={p 12 p 23 p 31 p 13 p 21 p 32 } (13) The two parametric toric models are b-equivalent, but the boundaries differ. For instance, the set X = {(1, 3), (3, 1)} is a set of structural zeros for the quasi-symmetry model, but it does not for the quasi-independence model. Acknowledgements We want to acknowledge Professor Giovanni Pistone (Politecnico of Turin, Italy) for his helpful suggestions. This work is partially supported by MIUR grant COFIN03.

14 740 F. Rapallo References Agresti, A. (2002). Categorical Data Analysis, 2nd edn. New York: Wiley. Aoki, S., Takemura, A. (2005). The largest group of invariance for Markov bases and toric ideals, Technical Report METR , Department of Mathematical Informatics, The University of Tokio, Tokio Bigatti, A., Robbiano, L. (2001). Toric ideals. Matemática Contemporânea 21, Bishop, Y. M., Fienberg, S., Holland, P. W. (1975). Discrete multivariate analysis: theory and practice, Cambridge: MIT Press. CoCoATeam (2004). CoCoA, a system for doing Computations in Commutative Algebra, 4.0 edn, Available at Diaconis, P., Sturmfels, B. (1998). Algebraic algorithms for sampling from conditional distributions. Annals of Statistics 26(1), Fienberg, S. (1980). The Analysis of Cross-Classified Categorical Data, Cambridge: MIT Press. Garcia, L. D., Stillman, M., Sturmfels, B. (2005). Algebraic geometry of Bayesyan networks. Journal of Symbolic Computation 39, Geiger, D., Heckerman, D., King, H., Meek, C. ( 2001). Stratified exponential families: graphical models and model selection. Annals of Statistics 29(3), Geiger, D., Meek, C., Sturmfels, B. (2002). On the toric algebra of graphical models. Microsoft Research Report MSR-TR Goodman, L. A. (1979). Multiplicative models for square contingency tables with ordered categories. Biometrika 66(3), Hemmecke, R., Hemmecke, R., Malkin, P. (2005). 4ti2 version 1.2 computation of Hilbert bases, Graver bases, toric Gröbner bases, and more, Available at Kreuzer, M., Robbiano, L. (2000). Computational Commutative Algebra 1. Berlin Heidelberg New York: Springer. Kreuzer, M., Robbiano, L. (2005). Computational Commutative Algebra 2. Berlin Heidelberg New York: Springer. Lauritzen, S. L. (1996). Graphical Models. New York: Oxford University Press. Pistone, G., Wynn, H. P. (2003). Statistical toric models. Lecture Notes, Grostat VI, Menton, France. Pistone, G., Riccomagno, E., Wynn, H. P. (2001a). Algebraic Statistics: computational commutative algebra in statistics. Boca Raton: Chapman&Hall/CRC. Pistone, G., Riccomagno, E., Wynn, H. P. (2001b). Computational commutative algebra in discrete statistics.inm.a.g.viana&d.s.p.richards(eds.)algebraic methods in statistics and probability. Contemporary Mathematics, (pp ) American Mathematical Society, Vol Rapallo, F. (2003). Algebraic Markov bases and MCMC for two-way contingency tables. Scandinavian Journal of Statistics 30(2), Sturmfels, B. (1993). Algorithms in Invariant Theory, Texts and Monographs in Symbolic Computation. Berlin Heidelberg New York: Springer. Sturmfels, B. (1996). Gröbner bases and convex polytopes. InUniversity lecture series (Providence, R.I.), Vol. 8 American Mathematical Society. Sturmfels, B. (2002). Solving systems of polynomial equations, InCBMS Regional Conference Series in Mathematics, Vol. 97 American Mathematical Society, Providence, RI.

Markov bases and subbases for bounded contingency tables

Markov bases and subbases for bounded contingency tables Markov bases and subbases for bounded contingency tables arxiv:0905.4841v2 [math.co] 23 Jun 2009 Fabio Rapallo Abstract Ruriko Yoshida In this paper we study the computation of Markov bases for contingency

More information

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. Markov Bases for Two-way Subtable Sum Problems

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. Markov Bases for Two-way Subtable Sum Problems MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov Bases for Two-way Subtable Sum Problems Hisayuki HARA, Akimichi TAKEMURA and Ruriko YOSHIDA METR 27 49 August 27 DEPARTMENT OF MATHEMATICAL INFORMATICS

More information

Information Geometry and Algebraic Statistics

Information Geometry and Algebraic Statistics Matematikos ir informatikos institutas Vinius Information Geometry and Algebraic Statistics Giovanni Pistone and Eva Riccomagno POLITO, UNIGE Wednesday 30th July, 2008 G.Pistone, E.Riccomagno (POLITO,

More information

The Geometry of Statistical Models for Two-Way Contingency Tables with Fixed Odds Ratios

The Geometry of Statistical Models for Two-Way Contingency Tables with Fixed Odds Ratios Rend. Istit. Mat. Univ. Trieste Vol. XXXVII, 7 84 (2005) The Geometry of Statistical Models for Two-Way Contingency Tables with Fixed Odds Ratios Enrico Carlini and Fabio Rapallo ( ) Contribution to School

More information

Applications of Algebraic Geometry IMA Annual Program Year Workshop Applications in Biology, Dynamics, and Statistics March 5-9, 2007

Applications of Algebraic Geometry IMA Annual Program Year Workshop Applications in Biology, Dynamics, and Statistics March 5-9, 2007 Applications of Algebraic Geometry IMA Annual Program Year Workshop Applications in Biology, Dynamics, and Statistics March 5-9, 2007 Information Geometry (IG) and Algebraic Statistics (AS) Giovanni Pistone

More information

HILBERT BASIS OF THE LIPMAN SEMIGROUP

HILBERT BASIS OF THE LIPMAN SEMIGROUP Available at: http://publications.ictp.it IC/2010/061 United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL

More information

Characterizations of indicator functions of fractional factorial designs

Characterizations of indicator functions of fractional factorial designs Characterizations of indicator functions of fractional factorial designs arxiv:1810.08417v2 [math.st] 26 Oct 2018 Satoshi Aoki Abstract A polynomial indicator function of designs is first introduced by

More information

Dipartimento di Matematica

Dipartimento di Matematica Dipartimento di Matematica S. RUFFA ON THE APPLICABILITY OF ALGEBRAIC STATISTICS TO REGRESSION MODELS WITH ERRORS IN VARIABLES Rapporto interno N. 8, maggio 006 Politecnico di Torino Corso Duca degli Abruzzi,

More information

On a perturbation method for determining group of invariance of hierarchical models

On a perturbation method for determining group of invariance of hierarchical models .... On a perturbation method for determining group of invariance of hierarchical models Tomonari SEI 1 Satoshi AOKI 2 Akimichi TAKEMURA 1 1 University of Tokyo 2 Kagoshima University Dec. 16, 2008 T.

More information

Indispensable monomials of toric ideals and Markov bases

Indispensable monomials of toric ideals and Markov bases Journal of Symbolic Computation 43 (2008) 490 507 www.elsevier.com/locate/jsc Indispensable monomials of toric ideals and Markov bases Satoshi Aoki a, Akimichi Takemura b, Ruriko Yoshida c a Department

More information

Minimal basis for connected Markov chain over 3 3 K contingency tables with fixed two-dimensional marginals. Satoshi AOKI and Akimichi TAKEMURA

Minimal basis for connected Markov chain over 3 3 K contingency tables with fixed two-dimensional marginals. Satoshi AOKI and Akimichi TAKEMURA Minimal basis for connected Markov chain over 3 3 K contingency tables with fixed two-dimensional marginals Satoshi AOKI and Akimichi TAKEMURA Graduate School of Information Science and Technology University

More information

Algebraic Representations of Gaussian Markov Combinations

Algebraic Representations of Gaussian Markov Combinations Submitted to the Bernoulli Algebraic Representations of Gaussian Markov Combinations M. SOFIA MASSA 1 and EVA RICCOMAGNO 2 1 Department of Statistics, University of Oxford, 1 South Parks Road, Oxford,

More information

A Markov Basis for Conditional Test of Common Diagonal Effect in Quasi-Independence Model for Square Contingency Tables

A Markov Basis for Conditional Test of Common Diagonal Effect in Quasi-Independence Model for Square Contingency Tables arxiv:08022603v2 [statme] 22 Jul 2008 A Markov Basis for Conditional Test of Common Diagonal Effect in Quasi-Independence Model for Square Contingency Tables Hisayuki Hara Department of Technology Management

More information

Toric ideals finitely generated up to symmetry

Toric ideals finitely generated up to symmetry Toric ideals finitely generated up to symmetry Anton Leykin Georgia Tech MOCCA, Levico Terme, September 2014 based on [arxiv:1306.0828] Noetherianity for infinite-dimensional toric varieties (with Jan

More information

Dipartimento di Matematica

Dipartimento di Matematica Dipartimento di Matematica G. PISTONE, E. RICCOMAGNO, M. P. ROGANTIN ALGEBRAIC STATISTICS METHODS FOR DOE Rapporto interno N. 18, settembre 2006 Politecnico di Torino Corso Duca degli Abruzzi, 24-10129

More information

arxiv: v4 [math.ac] 31 May 2012

arxiv: v4 [math.ac] 31 May 2012 BETTI NUMBERS OF STANLEY-REISNER RINGS DETERMINE HIERARCHICAL MARKOV DEGREES SONJA PETROVIĆ AND ERIK STOKES arxiv:0910.1610v4 [math.ac] 31 May 2012 Abstract. There are two seemingly unrelated ideals associated

More information

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg Setup Let k be a field. For computations we use k = Q. k[p] := k[p 1,..., p n ] the polynomial ring in n indeterminates

More information

Toric Ideals, an Introduction

Toric Ideals, an Introduction The 20th National School on Algebra: DISCRETE INVARIANTS IN COMMUTATIVE ALGEBRA AND IN ALGEBRAIC GEOMETRY Mangalia, Romania, September 2-8, 2012 Hara Charalambous Department of Mathematics Aristotle University

More information

Algebraic Classification of Small Bayesian Networks

Algebraic Classification of Small Bayesian Networks GROSTAT VI, Menton IUT STID p. 1 Algebraic Classification of Small Bayesian Networks Luis David Garcia, Michael Stillman, and Bernd Sturmfels lgarcia@math.vt.edu Virginia Tech GROSTAT VI, Menton IUT STID

More information

Rational Normal Curves as Set-Theoretic Complete Intersections of Quadrics

Rational Normal Curves as Set-Theoretic Complete Intersections of Quadrics Rational Normal Curves as Set-Theoretic Complete Intersections of Quadrics Maria-Laura Torrente Dipartimento di Matematica, Università di Genova, Via Dodecaneso 35, I-16146 Genova, Italy torrente@dimaunigeit

More information

PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM

PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom

More information

Commuting birth-and-death processes

Commuting birth-and-death processes Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death

More information

arxiv:math/ v1 [math.ac] 11 Jul 2006

arxiv:math/ v1 [math.ac] 11 Jul 2006 arxiv:math/0607249v1 [math.ac] 11 Jul 2006 MINIMAL SYSTEMS OF BINOMIAL GENERATORS AND THE INDISPENSABLE COMPLEX OF A TORIC IDEAL HARA CHARALAMBOUS, ANARGYROS KATSABEKIS, AND APOSTOLOS THOMA Abstract. Let

More information

Toric Varieties in Statistics

Toric Varieties in Statistics Toric Varieties in Statistics Daniel Irving Bernstein and Seth Sullivant North Carolina State University dibernst@ncsu.edu http://www4.ncsu.edu/~dibernst/ http://arxiv.org/abs/50.063 http://arxiv.org/abs/508.0546

More information

Algebraic Models in Different Fields

Algebraic Models in Different Fields Applied Mathematical Sciences, Vol. 8, 2014, no. 167, 8345-8351 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.411922 Algebraic Models in Different Fields Gaetana Restuccia University

More information

Distance-reducing Markov bases for sampling from a discrete sample space

Distance-reducing Markov bases for sampling from a discrete sample space Bernoulli 11(5), 2005, 793 813 Distance-reducing Markov bases for sampling from a discrete sample space AKIMICHI TAKEMURA* and SATOSHI AOKI** Department of Mathematical Informatics, Graduate School of

More information

GRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases

GRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.

More information

Alexander duality in experimental designs

Alexander duality in experimental designs Ann Inst Stat Math (2013) 65:667 686 DOI 10.1007/s10463-012-0390-9 Alexander duality in experimental designs Hugo Maruri-Aguilar Eduardo Sáenz-de-Cabezón Henry P. Wynn Received: 11 April 2012 / Revised:

More information

The partial-fractions method for counting solutions to integral linear systems

The partial-fractions method for counting solutions to integral linear systems The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral

More information

A Saturation Algorithm for Homogeneous Binomial Ideals

A Saturation Algorithm for Homogeneous Binomial Ideals A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India, {deepkesh,skmehta}@cse.iitk.ac.in Abstract. Let k[x 1,...,

More information

On the Weight Distribution of N-th Root Codes

On the Weight Distribution of N-th Root Codes Fabrizio Caruso Marta Giorgetti June 10, 2009 The Recurrence Proof by Generating Functions A Computer-Generated Proof Computing Some Steps of the Recurrence A Computer-Provable Identity Proving the Guessed

More information

Sampling Contingency Tables

Sampling Contingency Tables Sampling Contingency Tables Martin Dyer Ravi Kannan John Mount February 3, 995 Introduction Given positive integers and, let be the set of arrays with nonnegative integer entries and row sums respectively

More information

Journal of Algebra 226, (2000) doi: /jabr , available online at on. Artin Level Modules.

Journal of Algebra 226, (2000) doi: /jabr , available online at   on. Artin Level Modules. Journal of Algebra 226, 361 374 (2000) doi:10.1006/jabr.1999.8185, available online at http://www.idealibrary.com on Artin Level Modules Mats Boij Department of Mathematics, KTH, S 100 44 Stockholm, Sweden

More information

Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics

Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics Tan Tran Junior Major-Economics& Mathematics History Groebner bases were developed by Buchberger in 1965, who later named

More information

Dipartimento di Matematica

Dipartimento di Matematica Dipartimento di Matematica G. PISTONE, M. P. ROGANTIN INDICATOR FUNCTION AND COMPLEX CODING FOR MIXED FRACTIONAL FACTORIAL DESIGNS (REVISED 2006) Rapporto interno N. 17, luglio 2006 Politecnico di Torino

More information

MIT Algebraic techniques and semidefinite optimization February 16, Lecture 4

MIT Algebraic techniques and semidefinite optimization February 16, Lecture 4 MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract

More information

What is Singular Learning Theory?

What is Singular Learning Theory? What is Singular Learning Theory? Shaowei Lin (UC Berkeley) shaowei@math.berkeley.edu 23 Sep 2011 McGill University Singular Learning Theory A statistical model is regular if it is identifiable and its

More information

MCS 563 Spring 2014 Analytic Symbolic Computation Friday 31 January. Quotient Rings

MCS 563 Spring 2014 Analytic Symbolic Computation Friday 31 January. Quotient Rings Quotient Rings In this note we consider again ideals, but here we do not start from polynomials, but from a finite set of points. The application in statistics and the pseudo code of the Buchberger-Möller

More information

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals

More information

Hadamard ideals and Hadamard matrices with two circulant cores

Hadamard ideals and Hadamard matrices with two circulant cores Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,

More information

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.

More information

Rational Univariate Reduction via Toric Resultants

Rational Univariate Reduction via Toric Resultants Rational Univariate Reduction via Toric Resultants Koji Ouchi 1,2 John Keyser 1 Department of Computer Science, 3112 Texas A&M University, College Station, TX 77843-3112, USA Abstract We describe algorithms

More information

An Additive Characterization of Fibers of Characters on F p

An Additive Characterization of Fibers of Characters on F p An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009

More information

Formal power series rings, inverse limits, and I-adic completions of rings

Formal power series rings, inverse limits, and I-adic completions of rings Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely

More information

AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS

AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS JESSICA SIDMAN. Affine toric varieties: from lattice points to monomial mappings In this chapter we introduce toric varieties embedded in

More information

Toric Deformation of the Hankel Variety

Toric Deformation of the Hankel Variety Applied Mathematical Sciences, Vol. 10, 2016, no. 59, 2921-2925 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6248 Toric Deformation of the Hankel Variety Adelina Fabiano DIATIC - Department

More information

On The Belonging Of A Perturbed Vector To A Subspace From A Numerical View Point

On The Belonging Of A Perturbed Vector To A Subspace From A Numerical View Point Applied Mathematics E-Notes, 7(007), 65-70 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ On The Belonging Of A Perturbed Vector To A Subspace From A Numerical View

More information

Nonlinear Discrete Optimization

Nonlinear Discrete Optimization Nonlinear Discrete Optimization Technion Israel Institute of Technology http://ie.technion.ac.il/~onn Billerafest 2008 - conference in honor of Lou Billera's 65th birthday (Update on Lecture Series given

More information

Polynomials, Ideals, and Gröbner Bases

Polynomials, Ideals, and Gröbner Bases Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields

More information

Asymptotic Approximation of Marginal Likelihood Integrals

Asymptotic Approximation of Marginal Likelihood Integrals Asymptotic Approximation of Marginal Likelihood Integrals Shaowei Lin 10 Dec 2008 Abstract We study the asymptotics of marginal likelihood integrals for discrete models using resolution of singularities

More information

The generic Gröbner walk

The generic Gröbner walk The generic Gröbner walk K. Fukuda, A. N. Jensen, N. Lauritzen, R. Thomas May 23, 2006 arxiv:math.ac/0501345 v3 13 Oct 2005 Abstract The Gröbner walk is an algorithm for conversion between Gröbner bases

More information

Chapter 5: Integer Compositions and Partitions and Set Partitions

Chapter 5: Integer Compositions and Partitions and Set Partitions Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Winter 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Winter 2017 1 / 32 5.1. Compositions A strict

More information

On the extremal Betti numbers of binomial edge ideals of block graphs

On the extremal Betti numbers of binomial edge ideals of block graphs On the extremal Betti numbers of binomial edge ideals of block graphs Jürgen Herzog Fachbereich Mathematik Universität Duisburg-Essen Essen, Germany juergen.herzog@uni-essen.de Giancarlo Rinaldo Department

More information

INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F

INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal

More information

Sparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University

Sparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University Sparsity of Matrix Canonical Forms Xingzhi Zhan zhan@math.ecnu.edu.cn East China Normal University I. Extremal sparsity of the companion matrix of a polynomial Joint work with Chao Ma The companion matrix

More information

General error locator polynomials for binary cyclic codes with t 2 and n < 63

General error locator polynomials for binary cyclic codes with t 2 and n < 63 General error locator polynomials for binary cyclic codes with t 2 and n < 63 April 22, 2005 Teo Mora (theomora@disi.unige.it) Department of Mathematics, University of Genoa, Italy. Emmanuela Orsini (orsini@posso.dm.unipi.it)

More information

Another algorithm for nonnegative matrices

Another algorithm for nonnegative matrices Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,

More information

ARTICLE IN PRESS. Journal of Multivariate Analysis ( ) Contents lists available at ScienceDirect. Journal of Multivariate Analysis

ARTICLE IN PRESS. Journal of Multivariate Analysis ( ) Contents lists available at ScienceDirect. Journal of Multivariate Analysis Journal of Multivariate Analysis ( ) Contents lists available at ScienceDirect Journal of Multivariate Analysis journal homepage: www.elsevier.com/locate/jmva Marginal parameterizations of discrete models

More information

Algebraic Generation of Orthogonal Fractional Factorial Designs

Algebraic Generation of Orthogonal Fractional Factorial Designs Algebraic Generation of Orthogonal Fractional Factorial Designs Roberto Fontana Dipartimento di Matematica, Politecnico di Torino Special Session on Advances in Algebraic Statistics AMS 2010 Spring Southeastern

More information

on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems

on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems Jan Verschelde joint work with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer

More information

Computing Maximum Likelihood Estimates in Log-Linear Models

Computing Maximum Likelihood Estimates in Log-Linear Models Computing Maximum Likelihood Estimates in Log-Linear Models Alessandro Rinaldo Department of Statistics Carnegie Mellon University June, 2006 Abstract We develop computational strategies for extended maximum

More information

Stat 5421 Lecture Notes Proper Conjugate Priors for Exponential Families Charles J. Geyer March 28, 2016

Stat 5421 Lecture Notes Proper Conjugate Priors for Exponential Families Charles J. Geyer March 28, 2016 Stat 5421 Lecture Notes Proper Conjugate Priors for Exponential Families Charles J. Geyer March 28, 2016 1 Theory This section explains the theory of conjugate priors for exponential families of distributions,

More information

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:??? MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present

More information

Combining the cycle index and the Tutte polynomial?

Combining the cycle index and the Tutte polynomial? Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table

More information

ABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n

ABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n ABSTRACT Title of Thesis: GRÖBNER BASES WITH APPLICATIONS IN GRAPH THEORY Degree candidate: Angela M. Hennessy Degree and year: Master of Arts, 2006 Thesis directed by: Professor Lawrence C. Washington

More information

Polyhedral Conditions for the Nonexistence of the MLE for Hierarchical Log-linear Models

Polyhedral Conditions for the Nonexistence of the MLE for Hierarchical Log-linear Models Polyhedral Conditions for the Nonexistence of the MLE for Hierarchical Log-linear Models Nicholas Eriksson Department of Mathematics University of California, Berkeley Alessandro Rinaldo Department of

More information

Markov chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations

Markov chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations arxiv:1502.02323v1 [math.st] 9 Feb 2015 Markov chain Monte Carlo methods for the Box-Behnken designs and centrally symmetric configurations Satoshi Aoki, Takayuki Hibi and Hidefumi Ohsugi October 27, 2018

More information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792 Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838

More information

DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES

DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed

More information

Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data

Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data Stephen E. Fienberg Department of Statistics, Machine Learning Department and Cylab Carnegie Mellon University Pittsburgh,

More information

Integral Closure of Monomial Ideals

Integral Closure of Monomial Ideals Communications to SIMAI Congress, ISSN 1827-9015, Vol. 3 (2009) 305 (10pp) DOI: 10.1685/CSC09305 Integral Closure of Monomial Ideals Paola L. Staglianò Dipartimento di Matematica, Facoltà di Scienze MM.FF.NN.

More information

An Introduction to Entropy and Subshifts of. Finite Type

An Introduction to Entropy and Subshifts of. Finite Type An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview

More information

arxiv: v2 [math.ac] 15 May 2010

arxiv: v2 [math.ac] 15 May 2010 MARKOV DEGREES OF HIERARCHICAL MODELS DETERMINED BY BETTI NUMBERS OF STANLEY-REISNER IDEALS SONJA PETROVIĆ AND ERIK STOKES arxiv:0910.1610v2 [math.ac] 15 May 2010 Abstract. There are two seemingly unrelated

More information

On the minimal free resolution of a monomial ideal.

On the minimal free resolution of a monomial ideal. On the minimal free resolution of a monomial ideal. Caitlin M c Auley August 2012 Abstract Given a monomial ideal I in the polynomial ring S = k[x 1,..., x n ] over a field k, we construct a minimal free

More information

Ideals and graphs, Gröbner bases and decision procedures in graphs

Ideals and graphs, Gröbner bases and decision procedures in graphs Ideals and graphs, Gröbner bases and decision procedures in graphs GIUSEPPA CARRA FERRO and DANIELA FERRARELLO Department of Mathematics and Computer Science University of Catania Viale Andrea Doria 6,

More information

Oil Fields and Hilbert Schemes

Oil Fields and Hilbert Schemes Oil Fields and Hilbert Schemes Lorenzo Robbiano Università di Genova Dipartimento di Matematica Lorenzo Robbiano (Università di Genova) Oil Fields and Hilbert Schemes March, 2008 1 / 35 Facts In the realm

More information

Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data

Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data Maximum Likelihood Estimation in Latent Class Models For Contingency Table Data Stephen E. Fienberg Department of Statistics, Machine Learning Department and Cylab Carnegie Mellon University Pittsburgh,

More information

The intersection axiom of

The intersection axiom of The intersection axiom of conditional independence: some new [?] results Richard D. Gill Mathematical Institute, University Leiden This version: 26 March, 2019 (X Y Z) & (X Z Y) X (Y, Z) Presented at Algebraic

More information

Root systems and optimal block designs

Root systems and optimal block designs Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question

More information

arxiv:math/ v1 [math.st] 23 May 2006

arxiv:math/ v1 [math.st] 23 May 2006 The Annals of Statistics 2006, Vol. 34, No. 1, 523 545 DOI: 10.1214/009053605000000822 c Institute of Mathematical Statistics, 2006 arxiv:math/0605615v1 [math.st] 23 May 2006 SEQUENTIAL IMPORTANCE SAMPLING

More information

Structural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.

Structural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley. I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

SF2729 GROUPS AND RINGS LECTURE NOTES

SF2729 GROUPS AND RINGS LECTURE NOTES SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking

More information

Chapter 5: Integer Compositions and Partitions and Set Partitions

Chapter 5: Integer Compositions and Partitions and Set Partitions Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Fall 2017 1 / 46 5.1. Compositions A strict

More information

Algebraic Statistics for a Directed Random Graph Model with Reciprocation

Algebraic Statistics for a Directed Random Graph Model with Reciprocation Algebraic Statistics for a Directed Random Graph Model with Reciprocation Sonja Petrović, Alessandro Rinaldo, and Stephen E. Fienberg Abstract. The p 1 model is a directed random graph model used to describe

More information

Bare-bones outline of eigenvalue theory and the Jordan canonical form

Bare-bones outline of eigenvalue theory and the Jordan canonical form Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional

More information

DIANE MACLAGAN. Abstract. The main result of this paper is that all antichains are. One natural generalization to more abstract posets is shown to be

DIANE MACLAGAN. Abstract. The main result of this paper is that all antichains are. One natural generalization to more abstract posets is shown to be ANTICHAINS OF MONOMIAL IDEALS ARE FINITE DIANE MACLAGAN Abstract. The main result of this paper is that all antichains are finite in the poset of monomial ideals in a polynomial ring, ordered by inclusion.

More information

Chapter 3. Introducing Groups

Chapter 3. Introducing Groups Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs

More information

arxiv: v1 [math.ac] 6 Jan 2019

arxiv: v1 [math.ac] 6 Jan 2019 GORENSTEIN T-SPREAD VERONESE ALGEBRAS RODICA DINU arxiv:1901.01561v1 [math.ac] 6 Jan 2019 Abstract. In this paper we characterize the Gorenstein t-spread Veronese algebras. Introduction Let K be a field

More information

A new parametrization for binary hidden Markov modes

A new parametrization for binary hidden Markov modes A new parametrization for binary hidden Markov models Andrew Critch, UC Berkeley at Pennsylvania State University June 11, 2012 See Binary hidden Markov models and varieties [, 2012], arxiv:1206.0500,

More information

12. Hilbert Polynomials and Bézout s Theorem

12. Hilbert Polynomials and Bézout s Theorem 12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of

More information

Computing Maximum Likelihood Estimates in Log-Linear Models

Computing Maximum Likelihood Estimates in Log-Linear Models Computing Maximum Likelihood Estimates in Log-Linear Models Stephen E. Fienberg Center for Automated Learning and Discovery and Cylab Carnegie Mellon University Alessandro Rinaldo Department of Statistics

More information

1.1.1 Algebraic Operations

1.1.1 Algebraic Operations 1.1.1 Algebraic Operations We need to learn how our basic algebraic operations interact. When confronted with many operations, we follow the order of operations: Parentheses Exponentials Multiplication

More information

arxiv: v1 [math.ac] 11 Dec 2013

arxiv: v1 [math.ac] 11 Dec 2013 A KOSZUL FILTRATION FOR THE SECOND SQUAREFREE VERONESE SUBRING arxiv:1312.3076v1 [math.ac] 11 Dec 2013 TAKAYUKI HIBI, AYESHA ASLOOB QURESHI AND AKIHIRO SHIKAMA Abstract. The second squarefree Veronese

More information

Open Problems in Algebraic Statistics

Open Problems in Algebraic Statistics Open Problems inalgebraic Statistics p. Open Problems in Algebraic Statistics BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY and TECHNISCHE UNIVERSITÄT BERLIN Advertisement Oberwolfach Seminar Algebraic

More information

POLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada

POLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada THE TEACHING OF MATHEMATICS 2013, Vol. XVI, 1, pp. 22 28 POLYNOMIAL DIVISION AND GRÖBNER BASES Samira Zeada Abstract. Division in the ring of multivariate polynomials is usually not a part of the standard

More information

Copyrighted Material. Type A Weyl Group Multiple Dirichlet Series

Copyrighted Material. Type A Weyl Group Multiple Dirichlet Series Chapter One Type A Weyl Group Multiple Dirichlet Series We begin by defining the basic shape of the class of Weyl group multiple Dirichlet series. To do so, we choose the following parameters. Φ, a reduced

More information

Lecture 1. Toric Varieties: Basics

Lecture 1. Toric Varieties: Basics Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

More information