Extremal Behaviour in Sectional Matrices
|
|
- Lee Randall
- 5 years ago
- Views:
Transcription
1 Extremal Behaviour in Sectional Matrices Elisa Palezzato 1 joint work with Anna Maria Bigatti 1 and Michele Torielli 2 1 University of Genova, Italy 2 Hokkaido University, Japan arxiv: Ph.D. Seminar, University of Genova 6 March 2017 Elisa Palezzato Ph.D. Seminar 6 March / 27
2 Extremal Behaviour in Sectional Matrices 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
3 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
4 From Wikipedia I A Computer Algebra System is a software program that allows computation over mathematical expressions in a way which is similar to the traditional manual computations of mathematicians and scientists. The development of the computer algebra systems started in the second half of the 20th century and this discipline is called computer algebra or symbolic computation. Computer algebra systems may be divided in two classes: The specialized ones are devoted to a specic part of mathematics, such as number theory, group theory, etc. [CoCoA, Macaulay2, Singular,...] General purpose computer algebra systems aim to be useful to a user working in any scientic eld that requires manipulation of mathematical expressions. [Matlab, Maple, Magma,...] Elisa Palezzato Ph.D. Seminar 6 March / 27
5 From Wikipedia II A Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a eld K[x 1,..., x n ]. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps. Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclidian algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems. What you need to compute a Gröbner Basis: polynomial ring monomial ordering reduction algorithm Elisa Palezzato Ph.D. Seminar 6 March / 27
6 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
7 Hilbert Function The computation of Hilbert function is available in most computer algebra systems. Elisa Palezzato Ph.D. Seminar 6 March / 27
8 Hilbert Function The computation of Hilbert function is available in most computer algebra systems. Denition Let K be a eld of characteristic 0. Given a homogeneous ideal I in P = K[x 1,..., x n ], we dene the Hilbert function of I to be the function H I (d) := dim K (I d ). Elisa Palezzato Ph.D. Seminar 6 March / 27
9 Hilbert Function The computation of Hilbert function is available in most computer algebra systems. Denition Let K be a eld of characteristic 0. Given a homogeneous ideal I in P = K[x 1,..., x n ], we dene the Hilbert function of I to be the function H I (d) := dim K (I d ). Similarly, we dene the Hilbert function of P/I to be the function H P/I (d) := dim K ((P/I) d ). Elisa Palezzato Ph.D. Seminar 6 March / 27
10 Hilbert Function The computation of Hilbert function is available in most computer algebra systems. Denition Let K be a eld of characteristic 0. Given a homogeneous ideal I in P = K[x 1,..., x n ], we dene the Hilbert function of I to be the function H I (d) := dim K (I d ). Similarly, we dene the Hilbert function of P/I to be the function H P/I (d) := dim K ((P/I) d ). The Hilbert function is important in computational algebraic geometry, as it is the easiest known way for computing the dimension and the degree of an algebraic variety dened by explicit polynomial equations. Elisa Palezzato Ph.D. Seminar 6 March / 27
11 Question Can the Hilbert function characterize also some of the geometrical behaviour of algebraic variety in the projective space? Elisa Palezzato Ph.D. Seminar 6 March / 27
12 Question Can the Hilbert function characterize also some of the geometrical behaviour of algebraic variety in the projective space? Answer In general no. Elisa Palezzato Ph.D. Seminar 6 March / 27
13 Example in P 2 x y Elisa Palezzato Ph.D. Seminar 6 March / 27
14 Example in P 3 y z x Elisa Palezzato Ph.D. Seminar 6 March / 27
15 Question Can we nd an other algebraic invariant that characterize some of the geometrical behaviour of algebraic variety in the projective space? Elisa Palezzato Ph.D. Seminar 6 March / 27
16 Question Can we nd an other algebraic invariant that characterize some of the geometrical behaviour of algebraic variety in the projective space? Answer Yes, the sectional matrix. Elisa Palezzato Ph.D. Seminar 6 March / 27
17 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
18 Sectional Matrix Denition Let K be a eld of characteristic 0. Given a homogeneous ideal I in P = K[x 1,..., x n ], we dene the sectional matrix of I to be the function M I (i, d) := dim K (I + (L 1,..., L n i )/(L 1,..., L n i )) d where L 1,..., L n i are general linear forms, i = 1,..., n and d 0. Elisa Palezzato Ph.D. Seminar 6 March / 27
19 Sectional Matrix Denition Let K be a eld of characteristic 0. Given a homogeneous ideal I in P = K[x 1,..., x n ], we dene the sectional matrix of I to be the function M I (i, d) := dim K (I + (L 1,..., L n i )/(L 1,..., L n i )) d where L 1,..., L n i are general linear forms, i = 1,..., n and d 0. Similarly, we dene the sectional matrix of P/I to be the function M P/I (i, d) := dim K (P/(I + (L 1,..., L n i )/(L 1,..., L n i ))) d ( ) d + i 1 = M I (i, d) i 1 where L 1,..., L n i are general linear forms, i = 1,..., n and d 0. Elisa Palezzato Ph.D. Seminar 6 March / 27
20 Strongly Stable Ideal Denition Let I be a homogenous ideal in P = K[x 1,..., x n ]. We say that I is a strongly stable ideal if T = x i 1 1 x in n I, then x i T/x j I for all i < j max{k i k 0}. Elisa Palezzato Ph.D. Seminar 6 March / 27
21 Strongly Stable Ideal Denition Let I be a homogenous ideal in P = K[x 1,..., x n ]. We say that I is a strongly stable ideal if T = x i 1 1 x in n I, then x i T/x j I for all i < j max{k i k 0}. Example The ideal I = (x 3, x 2 y, xy 2, xyz) is not a strongly stable in Q[x, y, z] because x xyz/y = x 2 z I. The ideal I + (x 2 z) is strongly stable. Elisa Palezzato Ph.D. Seminar 6 March / 27
22 Strongly Stable Ideal Denition Let I be a homogenous ideal in P = K[x 1,..., x n ]. We say that I is a strongly stable ideal if T = x i 1 1 x in n I, then x i T/x j I for all i < j max{k i k 0}. Example The ideal I = (x 3, x 2 y, xy 2, xyz) is not a strongly stable in Q[x, y, z] because x xyz/y = x 2 z I. The ideal I + (x 2 z) is strongly stable. Remark If I is a strongly stable ideal, then in the denition of the sectional matrix we can take L i = x n i+1. Elisa Palezzato Ph.D. Seminar 6 March / 27
23 Generic Initial Ideal Theorem (Galligo '74) Let I be a homogeneous ideal in K[x 1,..., x n ], σ a term-ordering such that x 1 > σ x 2 > σ > σ x n. Then there exists a Zariski open set U GL(n) and a strongly stable ideal J such that for each g U, LT σ (g(i)) = J. Elisa Palezzato Ph.D. Seminar 6 March / 27
24 Generic Initial Ideal Theorem (Galligo '74) Let I be a homogeneous ideal in K[x 1,..., x n ], σ a term-ordering such that x 1 > σ x 2 > σ > σ x n. Then there exists a Zariski open set U GL(n) and a strongly stable ideal J such that for each g U, LT σ (g(i)) = J. Denition The strongly stable ideal J given in the previous Theorem will be called the generic initial ideal with respect to σ of I and it will be denoted by gin σ (I). In particular, gin DegRevLex (I) is denoted by many authors with rgin(i). Elisa Palezzato Ph.D. Seminar 6 March / 27
25 Generic Initial Ideal Theorem (Galligo '74) Let I be a homogeneous ideal in K[x 1,..., x n ], σ a term-ordering such that x 1 > σ x 2 > σ > σ x n. Then there exists a Zariski open set U GL(n) and a strongly stable ideal J such that for each g U, LT σ (g(i)) = J. Denition The strongly stable ideal J given in the previous Theorem will be called the generic initial ideal with respect to σ of I and it will be denoted by gin σ (I). In particular, gin DegRevLex (I) is denoted by many authors with rgin(i). Example Consider the ideal I = (z 5, xyz 3 ) in Q[x, y, z], then rgin(i) = (x 5, x 4 y, x 3 y 3 ). Elisa Palezzato Ph.D. Seminar 6 March / 27
26 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then Elisa Palezzato Ph.D. Seminar 6 March / 27
27 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then 1 M I (n, ) coincides with the Hilbert function of I, and M P/I (n, ) with the one of P/I. Elisa Palezzato Ph.D. Seminar 6 March / 27
28 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then 1 M I (n, ) coincides with the Hilbert function of I, and M P/I (n, ) with the one of P/I. 2 M I = M rgin(i), and M P/I = M P/rgin(I). Elisa Palezzato Ph.D. Seminar 6 March / 27
29 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then 1 M I (n, ) coincides with the Hilbert function of I, and M P/I (n, ) with the one of P/I. 2 M I = M rgin(i), and M P/I = M P/rgin(I). 3 M P/I (k, d + 1) k i=1 M P/I(i, d), for all k and d. If we have M P/I (k, δ + 1) = k i=1 M P/I(i, δ), then M P/I (s, d + 1) = s i=1 M P/I(i, d), for all s k and d δ. Elisa Palezzato Ph.D. Seminar 6 March / 27
30 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then 1 M I (n, ) coincides with the Hilbert function of I, and M P/I (n, ) with the one of P/I. 2 M I = M rgin(i), and M P/I = M P/rgin(I). 3 M P/I (k, d + 1) k i=1 M P/I(i, d), for all k and d. If we have M P/I (k, δ + 1) = k i=1 M P/I(i, δ), then M P/I (s, d + 1) = s i=1 M P/I(i, d), for all s k and d δ. 4 If I is a strongly stable ideal (I = rgin(i)), then M P/I (k, d + 1) = k i=1 M P/I(i, d), for all d > δ and for all k. Elisa Palezzato Ph.D. Seminar 6 March / 27
31 Properties of the Sectional Matrix Proposition Let I be a homogeneous ideal in P = K[x 1,..., x n ] with minimal generators of degree δ. Then 1 M I (n, ) coincides with the Hilbert function of I, and M P/I (n, ) with the one of P/I. 2 M I = M rgin(i), and M P/I = M P/rgin(I). 3 M P/I (k, d + 1) k i=1 M P/I(i, d), for all k and d. If we have M P/I (k, δ + 1) = k i=1 M P/I(i, δ), then M P/I (s, d + 1) = s i=1 M P/I(i, d), for all s k and d δ. 4 If I is a strongly stable ideal (I = rgin(i)), then M P/I (k, d + 1) = k i=1 M P/I(i, d), for all d > δ and for all k. 5 If δ = reg(i), then M P/I (k, d + 1) = k i=1 M P/I(i, d), for all d > δ and for all k. Elisa Palezzato Ph.D. Seminar 6 March / 27
32 Example Let I be the zero-dimensional homogeneous ideal (x 2 +y 2 25z 2, y 4 3xy 2 z 4y 3 z+12xyz 2 25y 2 z yz 3, xy 3 16xyz 2 ) Elisa Palezzato Ph.D. Seminar 6 March / 27
33 Example Let I be the zero-dimensional homogeneous ideal (x 2 +y 2 25z 2, y 4 3xy 2 z 4y 3 z+12xyz 2 25y 2 z yz 3, xy 3 16xyz 2 ) and rgin(i) = (x 2, xy 3, y 4 ). Elisa Palezzato Ph.D. Seminar 6 March / 27
34 Example Let I be the zero-dimensional homogeneous ideal (x 2 +y 2 25z 2, y 4 3xy 2 z 4y 3 z+12xyz 2 25y 2 z yz 3, xy 3 16xyz 2 ) and rgin(i) = The sectional matrix of I is (x 2, xy 3, y 4 ) H I+ L1,L 2 (d) = M I (1, d) : H I+ L1 (d) = M I (2, d) : H I (d) = M I (3, d) : Elisa Palezzato Ph.D. Seminar 6 March / 27
35 Example Let I be the zero-dimensional homogeneous ideal (x 2 +y 2 25z 2, y 4 3xy 2 z 4y 3 z+12xyz 2 25y 2 z yz 3, xy 3 16xyz 2 ) and rgin(i) = The sectional matrix of I is (x 2, xy 3, y 4 ) H I+ L1,L 2 (d) = M I (1, d) : H I+ L1 (d) = M I (2, d) : H I (d) = M I (3, d) : The sectional matrix of P/I is H P/(I+ L1,L 2 )(d) = M P/I (1, d) : H P/(I+ L1 )(d) = M P/I (2, d) : H P/I (d) = M P/I (3, d) : Elisa Palezzato Ph.D. Seminar 6 March / 27
36 Additional Algebraic Properties I Proposition (Bigatti-P.-Torielli) Let I be a homogeneous ideal in P = K[x 1,..., x n ] and δ = reg(i). Suppose that M P/I (i, δ) 0 but M P/I (i 1, δ) = 0 for some i = 2,..., n. Elisa Palezzato Ph.D. Seminar 6 March / 27
37 Additional Algebraic Properties I Proposition (Bigatti-P.-Torielli) Let I be a homogeneous ideal in P = K[x 1,..., x n ] and δ = reg(i). Suppose that M P/I (i, δ) 0 but M P/I (i 1, δ) = 0 for some i = 2,..., n. Then dim(p/i) = n i + 1 and deg(p/i) = M P/I (i, δ). Elisa Palezzato Ph.D. Seminar 6 March / 27
38 Additional Algebraic Properties II Proposition (Bigatti-P.-Torielli) Let I be a homogeneous ideal in P = K[x 1,..., x n ] such that the minimal generators of I have degree δ. Suppose that there exist i = 2,..., n and d δ such that M P/I (k, d) = 0 for all k = 1,..., i 1; Elisa Palezzato Ph.D. Seminar 6 March / 27
39 Additional Algebraic Properties II Proposition (Bigatti-P.-Torielli) Let I be a homogeneous ideal in P = K[x 1,..., x n ] such that the minimal generators of I have degree δ. Suppose that there exist i = 2,..., n and d δ such that M P/I (k, d) = 0 for all k = 1,..., i 1; M P/I (i, d) = M P/I (i, d + 1) 0. Elisa Palezzato Ph.D. Seminar 6 March / 27
40 Additional Algebraic Properties II Proposition (Bigatti-P.-Torielli) Let I be a homogeneous ideal in P = K[x 1,..., x n ] such that the minimal generators of I have degree δ. Suppose that there exist i = 2,..., n and d δ such that M P/I (k, d) = 0 for all k = 1,..., i 1; M P/I (i, d) = M P/I (i, d + 1) 0. Then dim(p/i) = n i + 1 and deg(p/i) = M P/I (i, d). Elisa Palezzato Ph.D. Seminar 6 March / 27
41 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
42 Geometrical Properties I Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ] such that (I) δ 0. Assume that one of the following holds Elisa Palezzato Ph.D. Seminar 6 March / 27
43 Geometrical Properties I Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ] such that (I) δ 0. Assume that one of the following holds M P/I (2, δ) = M P/I (2, δ + 1) 0. Elisa Palezzato Ph.D. Seminar 6 March / 27
44 Geometrical Properties I Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ] such that (I) δ 0. Assume that one of the following holds M P/I (2, δ) = M P/I (2, δ + 1) 0. M P/I (2, δ) 0 and M P/I (n, δ + 1) = n i=1 M P/I(i, δ). Elisa Palezzato Ph.D. Seminar 6 March / 27
45 Geometrical Properties I Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ] such that (I) δ 0. Assume that one of the following holds M P/I (2, δ) = M P/I (2, δ + 1) 0. M P/I (2, δ) 0 and M P/I (n, δ + 1) = n i=1 M P/I(i, δ). Then the ideals (I) δ and (I) δ+1 are saturated and their elements have a GCD of degree M P/I (2, δ). Elisa Palezzato Ph.D. Seminar 6 March / 27
46 Geometrical Properties II Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ]. Suppose that exists δ such that 0 = M P/I (1, δ) = = M P/I (i 1, δ); Elisa Palezzato Ph.D. Seminar 6 March / 27
47 Geometrical Properties II Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ]. Suppose that exists δ such that 0 = M P/I (1, δ) = = M P/I (i 1, δ); M P/I (i, δ) 0 for some n i 2; Elisa Palezzato Ph.D. Seminar 6 March / 27
48 Geometrical Properties II Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ]. Suppose that exists δ such that 0 = M P/I (1, δ) = = M P/I (i 1, δ); M P/I (i, δ) 0 for some n i 2; M P/I (n, δ + 1) = n k=i M P/I(k, δ). Elisa Palezzato Ph.D. Seminar 6 March / 27
49 Geometrical Properties II Theorem (Bigatti-P.-Torielli) Let I be a saturated ideal of P = K[x 1,..., x n ]. Suppose that exists δ such that 0 = M P/I (1, δ) = = M P/I (i 1, δ); M P/I (i, δ) 0 for some n i 2; M P/I (n, δ + 1) = n k=i M P/I(k, δ). Then the ideal (I) δ is a saturated, dim(p/(i) δ ) = (n i + 1), and of degree M P/I (i, δ) and it is δ-regular. Moreover, dim(p/i) n i + 1. Elisa Palezzato Ph.D. Seminar 6 March / 27
50 1 PREQUEL 2 Introduction 3 Sectional matrix and its algebraic properties 4 Geometrical properties 5 Examples Elisa Palezzato Ph.D. Seminar 6 March / 27
51 Example in P 2 x Consider the points (0, 5), (0, 5), (5, 0), ( 5, 0) ( 3, 4), (3, 4), ( 3, 4) y Elisa Palezzato Ph.D. Seminar 6 March / 27
52 Example in P 2 x Consider the points (0, 5), (0, 5), (5, 0), ( 5, 0) ( 3, 4), (3, 4), ( 3, 4) The dening ideal is I = (x 2 + y 2 25z 2, y ,... ) y and rgin(i) = (x 2, xy 3, y 4 ). Elisa Palezzato Ph.D. Seminar 6 March / 27
53 Example in P 2 x Consider the points (0, 5), (0, 5), (5, 0), ( 5, 0) ( 3, 4), (3, 4), ( 3, 4) The dening ideal is I = (x 2 + y 2 25z 2, y ,... ) y and rgin(i) = (x 2, xy 3, y 4 ). The sectional matrix is Elisa Palezzato Ph.D. Seminar 6 March / 27
54 Example in P 3 y Consider the points (0, 0, 0), (0, 1, 0), (0, 2, 0) (0, 3, 0), (0, 4, 0), (0, 5, 0) (2, 1, 0), (1, 1, 0), (0, 0, 3) z x Elisa Palezzato Ph.D. Seminar 6 March / 27
55 Example in P 3 y Consider the points (0, 0, 0), (0, 1, 0), (0, 2, 0) (0, 3, 0), (0, 4, 0), (0, 5, 0) (2, 1, 0), (1, 1, 0), (0, 0, 3) The dening ideal I is such that rgin(i) = (x 2, xy, xz, y 2, yz 2, z 6 ). z x Elisa Palezzato Ph.D. Seminar 6 March / 27
56 Example in P 3 y Consider the points (0, 0, 0), (0, 1, 0), (0, 2, 0) (0, 3, 0), (0, 4, 0), (0, 5, 0) (2, 1, 0), (1, 1, 0), (0, 0, 3) z x The dening ideal I is such that rgin(i) = (x 2, xy, xz, y 2, yz 2, z 6 ). The sectional matrix is Elisa Palezzato Ph.D. Seminar 6 March / 27
57 H-SM-gin-res Hilbert function sectional matrix generic initial ideal (gin) resolution (Example) Elisa Palezzato Ph.D. Seminar 6 March / 27
58 H-SM-gin-res Hilbert function sectional matrix generic initial ideal (gin) resolution (Example) Elisa Palezzato Ph.D. Seminar 6 March / 27
59 The End Elisa Palezzato Ph.D. Seminar 6 March / 27
Overview of Computer Algebra
Overview of Computer Algebra http://cocoa.dima.unige.it/ J. Abbott Universität Kassel J. Abbott Computer Algebra Basics Manchester, July 2018 1 / 12 Intro Characteristics of Computer Algebra or Symbolic
More informationThe F 4 Algorithm. Dylan Peifer. 9 May Cornell University
The F 4 Algorithm Dylan Peifer Cornell University 9 May 2017 Gröbner Bases History Gröbner bases were introduced in 1965 in the PhD thesis of Bruno Buchberger under Wolfgang Gröbner. Buchberger s algorithm
More informationPolynomials, 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 informationGRÖ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 informationBOREL IDEALS IN THREE AND (FOUR) VARIABLES
BOREL IDEALS IN THREE AND (FOUR) VARIABLES FRANCESCA CIOFFI, MARIA GRAZIA MARINARI, AND LUCIANA RAMELLA Fixed any term-ordering < on the set T(n) of terms in n variables x 1,..., x n, we study homogeneous
More informationGroebner 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 informationLecture 5: Ideals of Points
Lecture 5: Ideals of Points The Vanishing Lecture Martin Kreuzer Fakultät für Informatik und Mathematik Universität Passau martin.kreuzer@ uni-passau.de Sophus Lie Center Nordfjordeid June 18, 2009 1 Contents
More informationAn Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD Dong Lu Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS Joint work with Deepak Kapur,
More informationarxiv: v1 [math.ac] 23 Feb 2017
Computing and Using Minimal Polynomials John Abbott arxiv:1702.07262v1 [math.ac] 23 Feb 2017 Dip. di Matematica, Università degli Studi di Genova, Via Dodecaneso 35, I-16146 Genova, Italy Anna Maria Bigatti
More informationUnit 3 Factors & Products
1 Unit 3 Factors & Products General Outcome: Develop algebraic reasoning and number sense. Specific Outcomes: 3.1 Demonstrate an understanding of factors of whole number by determining the: o prime factors
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
More informationOn 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 informationLecture 4 February 5
Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 4 February 5 Lecturer: Lior Pachter Scribe/ Editor: Michaeel Kazi/ Cynthia Vinzant 4.1 Introduction to Gröbner Bases In this lecture
More informationComputation of the Minimal Associated Primes
Computation of the Minimal Associated Primes Santiago Laplagne Departamento de Matemática, Universidad de Buenos Aires Buenos Aires, Argentina slaplagn@dm.uba.ar Abstract. We propose a new algorithm for
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
More informationPOLYNOMIAL 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 informationHilbert Polynomials. dimension and counting monomials. a Gröbner basis for I reduces to in > (I)
Hilbert Polynomials 1 Monomial Ideals dimension and counting monomials 2 The Dimension of a Variety a Gröbner basis for I reduces to in > (I) 3 The Complexity of Gröbner Bases a bound on the degrees of
More informationOil 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 informationProblem Set 1 Solutions
Math 918 The Power of Monomial Ideals Problem Set 1 Solutions Due: Tuesday, February 16 (1) Let S = k[x 1,..., x n ] where k is a field. Fix a monomial order > σ on Z n 0. (a) Show that multideg(fg) =
More information1 Hilbert function. 1.1 Graded rings. 1.2 Graded modules. 1.3 Hilbert function
1 Hilbert function 1.1 Graded rings Let G be a commutative semigroup. A commutative ring R is called G-graded when it has a (weak direct sum decomposition R = i G R i (that is, the R i are additive subgroups,
More informationM3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS
M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS (1) (a) Fix a monomial order. A finite subset G = {g 1,..., g m } of an ideal I k[x 1,..., x n ] is called a Gröbner basis if (LT(g
More informationDepth and Stanley depth of the canonical form of a factor of monomial ideals
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(105) No. 2, 2014, 207 216 Depth and Stanley depth of the canonical form of a factor of monomial ideals by Adrian Popescu Abstract We introduce a so called canonical
More informationRepresentations of Positive Polynomials: Theory, Practice, and
Representations of Positive Polynomials: Theory, Practice, and Applications Dept. of Mathematics and Computer Science Emory University, Atlanta, GA Currently: National Science Foundation Temple University
More informationHILBERT 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 informationA Combinatorial Approach to Involution and δ-regularity II: Structure Analysis of Polynomial Modules with Pommaret Bases
AAECC manuscript No. (will be inserted by the editor) A Combinatorial Approach to Involution and δ-regularity II: Structure Analysis of Polynomial Modules with Pommaret Bases Werner M. Seiler AG Computational
More informationComputing toric degenerations of flag varieties
Computing toric degenerations of flag varieties Sara Lamboglia University of Warwick with Lara Bossinger, Kalina Mincheva and Fatemeh Mohammadi (arxiv 1702.05505 ) Compute Gröbner toric degenerations of
More informationMinimal free resolutions of analytic D-modules
Minimal free resolutions of analytic D-modules Toshinori Oaku Department of Mathematics, Tokyo Woman s Christian University Suginami-ku, Tokyo 167-8585, Japan November 7, 2002 We introduce the notion of
More informationMA 252 notes: Commutative algebra
MA 252 notes: Commutative algebra (Distilled from [Atiyah-MacDonald]) Dan Abramovich Brown University February 11, 2017 Abramovich MA 252 notes: Commutative algebra 1 / 13 Primary ideals Primary decompositions
More informationMCS 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 informationAnswers and Solutions to Selected Homework Problems From Section 2.5 S. F. Ellermeyer. and B =. 0 2
Answers and Solutions to Selected Homework Problems From Section 2.5 S. F. Ellermeyer 5. Since gcd (2; 4) 6, then 2 is a zero divisor (and not a unit) in Z 4. In fact, we see that 2 2 0 in Z 4. Thus 2x
More informationOn Fulton s Algorithm for Computing Intersection Multiplicities
On Fulton s Algorithm for Computing Intersection Multiplicities Steffen Marcus 1 Marc Moreno Maza 2 Paul Vrbik 2 1 University of Utah 2 University of Western Ontario March 9, 2012 1/35 Overview Let f 1,...,f
More informationMath 4370 Exam 1. Handed out March 9th 2010 Due March 18th 2010
Math 4370 Exam 1 Handed out March 9th 2010 Due March 18th 2010 Problem 1. Recall from problem 1.4.6.e in the book, that a generating set {f 1,..., f s } of I is minimal if I is not the ideal generated
More informationA brief introduction to computational algebraic geometry
A brief introduction to computational algebraic geometry Evan M. Bullock This is a collection of lecture notes and problem sets from MATH 499: VIGRE Computational Algebraic Geometry at Rice University
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationGroebner Bases in Boolean Rings. for Model Checking and. Applications in Bioinformatics
Groebner Bases in Boolean Rings for Model Checking and Applications in Bioinformatics Quoc-Nam Tran, Ph.D. Professor of Computer Science Lamar University Invited Talk at CMU on October 8, 2010 Outline
More information4 Hilbert s Basis Theorem and Gröbner basis
4 Hilbert s Basis Theorem and Gröbner basis We define Gröbner bases of ideals in multivariate polynomial rings and see how they work in tandem with the division algorithm. We look again at the standard
More informationPrologue: General Remarks on Computer Algebra Systems
Prologue: General Remarks on Computer Algebra Systems Computer algebra algorithms allow us to compute in, and with, a multitude of mathematical structures. Accordingly, there is a large number of computer
More informationCurrent Advances. Open Source Gröbner Basis Algorithms
Current Advances in Open Source Gröbner Basis Algorithms My name is Christian Eder I am from the University of Kaiserslautern 3 years ago Christian Eder, Jean-Charles Faugère A survey on signature-based
More informationGroebner Bases and Applications
Groebner Bases and Applications Robert Hines December 16, 2014 1 Groebner Bases In this section we define Groebner Bases and discuss some of their basic properties, following the exposition in chapter
More informationAlmost polynomial Complexity for Zero-dimensional Gröbner Bases p.1/17
Almost polynomial Complexity for Zero-dimensional Gröbner Bases Amir Hashemi co-author: Daniel Lazard INRIA SALSA-project/ LIP6 CALFOR-team http://www-calfor.lip6.fr/ hashemi/ Special semester on Gröbner
More information2.4. Solving ideal problems by Gröbner bases
Computer Algebra, F.Winkler, WS 2010/11 2.4. Solving ideal problems by Gröbner bases Computation in the vector space of polynomials modulo an ideal The ring K[X] /I of polynomials modulo the ideal I is
More information5.1 Monomials. Algebra 2
. Monomials Algebra Goal : A..: Add, subtract, multiply, and simplify polynomials and rational expressions (e.g., multiply (x ) ( x + ); simplify 9x x. x Goal : Write numbers in scientific notation. Scientific
More informationarxiv: v2 [cs.sy] 18 Sep 2014
Projective Root-Locus: An Extension of Root-Locus Plot to the Projective Plane Francisco Mota Departamento de Engenharia de Computação e Automação Universidade Federal do Rio Grande do Norte Brasil e-mail:mota@dca.ufrn.br
More informationImplicitization of Rational Parametric Surfaces
J. Symbolic Computation (1996) 21, 329 336 Implicitization of Rational Parametric Surfaces GEORGE FIX, CHIH-PING HSU AND TIE LUO Box 19408, Mathematics Department The University of Texas at Arlington Arlington,
More informationPREMUR Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications
PREMUR 2007 - Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications Day 1: Monomial Orders In class today, we introduced the definition of a monomial order in the polyomial
More informationT -equivariant tensor rank varieties and their K-theory classes
T -equivariant tensor rank varieties and their K-theory classes 2014 July 18 Advisor: Professor Anders Buch, Department of Mathematics, Rutgers University Overview 1 Equivariant K-theory Overview 2 Determinantal
More informationSets of Points and Mathematical Models
Sets of Points and Mathematical Models Lorenzo Robbiano Università di Genova Dipartimento di Matematica Lorenzo Robbiano (Università di Genova) Points and Models Osnabrück, June 2013 1 / 79 Standard References
More informationALGORITHMS FOR ALGEBRAIC CURVES
ALGORITHMS FOR ALGEBRAIC CURVES SUMMARY OF LECTURE 7 I consider the problem of computing in Pic 0 (X) where X is a curve (absolutely integral, projective, smooth) over a field K. Typically K is a finite
More informationAlgebra Review. Terrametra Resources. Lynn Patten
Terrametra Resources Lynn Patten ALGEBRAIC EXPRESSION A combination of ordinary numbers, letter symbols, variables, grouping symbols and operation symbols. Numbers remain fixed in value and are referred
More informationNew Strategies for Computing Gröbner Bases
New Strategies for Computing Gröbner Bases Bruno Simões Department of Mathematics University Trento Advisor: Prof. Lorenzo Robbiano University of Genova A thesis submitted for the degree of PhilosophiæDoctor
More informationGröbner Bases. eliminating the leading term Buchberger s criterion and algorithm. construct wavelet filters
Gröbner Bases 1 S-polynomials eliminating the leading term Buchberger s criterion and algorithm 2 Wavelet Design construct wavelet filters 3 Proof of the Buchberger Criterion two lemmas proof of the Buchberger
More informationRational 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 informationGröbner Bases. Applications in Cryptology
Gröbner Bases. Applications in Cryptology Jean-Charles Faugère INRIA, Université Paris 6, CNRS with partial support of Celar/DGA FSE 20007 - Luxembourg E cient Goal: how Gröbner bases can be used to break
More informationOn the Complexity of Gröbner Basis Computation for Regular and Semi-Regular Systems
On the Complexity of Gröbner Basis Computation for Regular and Semi-Regular Systems Bruno.Salvy@inria.fr Algorithms Project, Inria Joint work with Magali Bardet & Jean-Charles Faugère September 21st, 2006
More informationPolynomials and Gröbner Bases
Alice Feldmann 16th December 2014 ETH Zürich Student Seminar in Combinatorics: Mathema:cal So
More informationSecant varieties. Marin Petkovic. November 23, 2015
Secant varieties Marin Petkovic November 23, 2015 Abstract The goal of this talk is to introduce secant varieies and show connections of secant varieties of Veronese variety to the Waring problem. 1 Secant
More informationAlgebraic Varieties. Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra
Algebraic Varieties Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Algebraic varieties represent solutions of a system of polynomial
More informationGiac and GeoGebra: improved Gröbner basis computations
Giac and GeoGebra: improved Gröbner basis computations Z. Kovács, B. Parisse JKU Linz, University of Grenoble I November 25, 2013 Two parts talk 1 GeoGebra (Z. Kovács) 2 (B. Parisse) History of used CAS
More informationOn some properties of elementary derivations in dimension six
Journal of Pure and Applied Algebra 56 (200) 69 79 www.elsevier.com/locate/jpaa On some properties of elementary derivations in dimension six Joseph Khoury Department of Mathematics, University of Ottawa,
More informationDeviations of graded algebras
Deviations of graded algebras Alessio D Alì (joint work with A. Boocher, E. Grifo, J. Montaño, and A. Sammartano) Università degli Studi di Genova October 9th, 2015 Alessio D Alì (U. Genova) Deviations
More informationSummer Project. August 10, 2001
Summer Project Bhavana Nancherla David Drescher August 10, 2001 Over the summer we embarked on a brief introduction to various concepts in algebraic geometry. We used the text Ideals, Varieties, and Algorithms,
More informationPolynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:
Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a
More informationRATIONALITY CRITERIA FOR MOTIVIC ZETA FUNCTIONS
RATIONALITY CRITERIA FOR MOTIVIC ZETA FUNCTIONS YUZHOU GU 1. Introduction Work over C. Consider K 0 Var C, the Grothendieck ring of varieties. As an abelian group, K 0 Var C is generated by isomorphism
More informationMy Little Project with CoCoALib
My Little Project with CoCoALib Anna M. Bigatti, Genova, Italy February 2017, Kassel A.M. Bigatti My Little Project with CoCoALib Kassel, February 2017 1 / 5 Time to start! an algorithm in a paper a mathematical
More informationAbstract Algebra for Polynomial Operations. Maya Mohsin Ahmed
Abstract Algebra for Polynomial Operations Maya Mohsin Ahmed c Maya Mohsin Ahmed 2009 ALL RIGHTS RESERVED To my students As we express our gratitude, we must never forget that the highest appreciation
More informationDipartimento 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 informationarxiv: v1 [math.ac] 14 Sep 2016
NEW STRATEGIES FOR STANDARD BASES OVER Z arxiv:1609.04257v1 [math.ac] 14 Sep 2016 CHRISTIAN EDER, GERHARD PFISTER, AND ADRIAN POPESCU Abstract. Experiences with the implementation of strong Gröbner bases
More informationExact Computation of the Real Solutions of Arbitrary Polynomial Systems
Exact Computation of the Real Solutions of Arbitrary Polynomial Systems Presented by Marc Moreno Maza 1 joint work with Changbo Chen 1, James H. Davenport 2, François Lemaire 3, John P. May 5, Bican Xia
More informationOn 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 informationFrom Wikipedia, the free encyclopedia
1 of 8 27/03/2013 12:41 Quadratic form From Wikipedia, the free encyclopedia In mathematics, a quadratic form is a homogeneous polynomial of degree two in a number of variables. For example, is a quadratic
More informationA gentle introduction to Elimination Theory. March METU. Zafeirakis Zafeirakopoulos
A gentle introduction to Elimination Theory March 2018 @ METU Zafeirakis Zafeirakopoulos Disclaimer Elimination theory is a very wide area of research. Z.Zafeirakopoulos 2 Disclaimer Elimination theory
More informationSymbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) RISC Research Institute for Symbolic Computation
Symbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) Franz Winkler joint with Ekaterina Shemyakova RISC Research Institute for Symbolic Computation Johannes Kepler Universität.
More informationProjective Varieties. Chapter Projective Space and Algebraic Sets
Chapter 1 Projective Varieties 1.1 Projective Space and Algebraic Sets 1.1.1 Definition. Consider A n+1 = A n+1 (k). The set of all lines in A n+1 passing through the origin 0 = (0,..., 0) is called the
More informationA degree bound for codimension two lattice ideals
Journal of Pure and Applied Algebra 18 (003) 01 07 www.elsevier.com/locate/jpaa A degree bound for codimension two lattice ideals Leah H. Gold Department of Mathematics, Texas A& M University, College
More informatione socle degrees 0 2: 1 1 4: 7 2 9: : : 12.
Socle degrees of Frobenius powers Lecture January 8, 26 talk by A. Kustin I will talk about recent joint work with Adela Vraciu. A preprint is available if you want all of the details. I will only talk
More informationDavid Eklund. May 12, 2017
KTH Stockholm May 12, 2017 1 / 44 Isolated roots of polynomial systems Let f 1,..., f n C[x 0,..., x n ] be homogeneous and consider the subscheme X P n defined by the ideal (f 1,..., f n ). 2 / 44 Isolated
More informationIdeal Databases. Vadim Tropashko INTRODUCTION
Ideal Databases Vadim Tropashko Vadim.Tropashko@or..cle.com vadimtro@gm..l.com From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic
More informationDe Nugis Groebnerialium 5: Noether, Macaulay, Jordan
De Nugis Groebnerialium 5: Noether, Macaulay, Jordan ACA 2018 Santiago de Compostela Re-reading Macaulay References Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including
More informationSignature-based algorithms to compute Gröbner bases
Signature-based algorithms to compute Gröbner bases Christian Eder (joint work with John Perry) University of Kaiserslautern June 09, 2011 1/37 What is this talk all about? 1. Efficient computations of
More informationSolving Third Order Linear Differential Equations in Terms of Second Order Equations
Solving Third Order Linear Differential Equations in Terms of Second Order Equations Mark van Hoeij (Florida State University) ISSAC 2007 Talk presented by: George Labahn (University of Waterloo) Notations.
More informationOn the effective cone of P n blown-up at n + 3 points (and other positivity properties)
On the effective cone of P n blown-up at n + 3 points (and other positivity properties) Elisa Postinghel KU Leuven joint with M.C. Brambilla (Ancona) and O. Dumitrescu (Hannover) Daejeon August 3-7, 2015
More informationTHE CONE OF BETTI TABLES OVER THREE NON-COLLINEAR POINTS IN THE PLANE
JOURNAL OF COMMUTATIVE ALGEBRA Volume 8, Number 4, Winter 2016 THE CONE OF BETTI TABLES OVER THREE NON-COLLINEAR POINTS IN THE PLANE IULIA GHEORGHITA AND STEVEN V SAM ABSTRACT. We describe the cone of
More informationE. GORLA, J. C. MIGLIORE, AND U. NAGEL
GRÖBNER BASES VIA LINKAGE E. GORLA, J. C. MIGLIORE, AND U. NAGEL Abstract. In this paper, we give a sufficient condition for a set G of polynomials to be a Gröbner basis with respect to a given term-order
More informationON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE
ON CERTAIN CLASSES OF CURVE SINGULARITIES WITH REDUCED TANGENT CONE Alessandro De Paris Università degli studi di Napoli Federico II Dipartimento di Matematica e Applicazioni R. Caccioppoli Complesso Monte
More informationTHE PYTHAGOREAN THEOREM
THE STORY SO FAR THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS
More informationPOSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents
POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) SALMA KUHLMANN Contents 1. Proof of Hilbert s Theorem (continued) 1 2. The Motzkin Form 2 3. Robinson Method (1970) 3 3. The Robinson Form 4 1. PROOF OF
More informationComputing Intersection Multiplicity via Triangular Decomposition
Computing Intersection Multiplicity via Triangular Decomposition Paul Vrbik 1 1 University of Western Ontario Contributions 1. Devised an algorithm to calculate the Intersection Multiplicity in (generically)
More informationThe Mountaintop Guru of Mathematics
The Mountaintop Guru of Mathematics New Directions in Boij-Söderberg Theory The cone of Betti diagrams over a hypersurface ring of low embedding dimension Courtney Gibbons University of Nebraska Lincoln
More informationDipartimento 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 information2 Figure 1: Entering identities and the problem type. Knowing polynomial identities is interesting in its own right, but it often helps determine the
1 A Computer Algebra System for Nonassociative Identities 1 D. Pokrass Jacobs, Sekhar V. Muddana, A. Jeerson Outt Department of Computer Science Clemson University Clemson, S.C. 29634-1906 USA Introduction
More informationLinear Algebra, 3rd day, Wednesday 6/30/04 REU Info:
Linear Algebra, 3rd day, Wednesday 6/30/04 REU 2004. Info: http://people.cs.uchicago.edu/laci/reu04. Instructor: Laszlo Babai Scribe: Richard Cudney Rank Let V be a vector space. Denition 3.. Let S V,
More informationHave Fun with computations:hilbert polynomials, Hodge diamonds, Sheaf cohomology...
Have Fun with computations:hilbert polynomials, Hodge diamonds, Sheaf cohomology... Shuai Wang June 206 Introduction Basic knowledge about Hilbert schemes. 2 Computing Hibert Polynomials Example 2.. Let
More informationToric statistical models: parametric and binomial representations
AISM (2007) 59:727 740 DOI 10.1007/s10463-006-0079-z Toric statistical models: parametric and binomial representations Fabio Rapallo Received: 21 February 2005 / Revised: 1 June 2006 / Published online:
More informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More informationSparse Polynomial Multiplication and Division in Maple 14
Sparse Polynomial Multiplication and Division in Maple 4 Michael Monagan and Roman Pearce Department of Mathematics, Simon Fraser University Burnaby B.C. V5A S6, Canada October 5, 9 Abstract We report
More informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationBENCHMARKING SOFTWARE FOR SOLVING MULTI-POLYNOMIAL SYSTEMS
BENCHMARKING SOFTWARE FOR SOLVING MULTI-POLYNOMIAL SYSTEMS Abstract Benchmarking different software which performs the same task gives students in computer science and computer engineering an opportunity
More informationWorkshop I The R n Vector Space. Linear Combinations
Workshop I Workshop I The R n Vector Space. Linear Combinations Exercise 1. Given the vectors u = (1, 0, 3), v = ( 2, 1, 2), and w = (1, 2, 4) compute a) u + ( v + w) b) 2 u 3 v c) 2 v u + w Exercise 2.
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
More information