Sparse Differential Resultant for Laurent Differential Polynomials. Wei Li
|
|
- Penelope Paul
- 6 years ago
- Views:
Transcription
1 Sparse Differential Resultant for Laurent Differential Polynomials Wei Li Academy of Mathematics and Systems Science Chinese Academy of Sciences KSDA 2011 Joint work with X.S. Gao and C.M. Yuan Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
2 Motivations Sparse Resultant is a basic concept in algebraic geometry and a powerful tool in algebraic elimination theory with important applications. Differential polynomials from practice are usually sparse, and their differential resultant may vanish identically. Sparse differential resultant is not studied before. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
3 Work on Sparse Resultant Gelfand, Kapranov, and Zelevinsky (1991, 1994) introduced the sparse resultant. Sturmfels (1993, 1994) proved basic properties for the sparse resultant. Canny and Emiris (1993, 1995, 2000) gave matrix formulas for sparse resultants and efficient algorithms. D Andrea (2002) proved a sparse resultant is the quotient of two determinants. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
4 Work on Differential Resultant Ritt (1932): Differential resultant for two differential polynomials in one diff indeterminate. Ferro (1997): Differential resultant as algebraic Macaulay resultant. Ferrro s resultant of two generic diff polynomials of degree larger than one is always zero. Chardin (1991): Resultant for differential operators. Rueda-Sendra (2010): Differential resultant of a linear system. Gao, Li, Yuan (2010): Rigorous definition of differential resultant of n + 1 differential polynomials in n indeterminates. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
5 Outline of the Talk Sparse diff resultant for Laurent diff polynomials Properties of sparse diff resultant Criterion for Laurent diff essential system in terms of supports A single exponential algorithm to compute sparse diff resultant Sparse diff resultant for diff polynomial with non-vanishing degree zero terms Summary Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
6 Sparse Differential Resultant for Laurent Differential Polynomials Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
7 Notations Ordinary differential field: (F, δ). e.g. (Q(x), d dx ) Universal differential field of F: (E, δ). Diff Indeterminates: Y = {y 1,..., y n }. Notation: y (k) i = δ k y i, Y [t] = {y (k) : k t}. Differential Monomial: M = n k=1 m: set of diff monomials in Y. i o (l) l=0 (y k )d kl with d kl Z 0 ; Differential polynomial ring: F{Y} = F[y (k) i : k 0]. Notations: For S F{Y}, [S] = the diff ideal generated by S [S] : m = {f F{Y} M m, s.t. M f [S]}. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
8 Laurent Differential Polynomial Ring Laurent Diff Monomial: M = n o (l) k=1 l=0 (y k )d kl with d kl Z; Laurent Diff Polynomial: f = m k=1 a km k, M k Laurent diff monomials. Support of f : A = {M 1,..., M m }. Norm Form of f : f N = Mf, where M is the denominator of f. Laurent Diff Polynomials Ring: F{Y, Y 1 }. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
9 Laurent Differential Polynomial Ring Laurent Diff Monomial: M = n o (l) k=1 l=0 (y k )d kl with d kl Z; Laurent Diff Polynomial: f = m k=1 a km k, M k Laurent diff monomials. Support of f : A = {M 1,..., M m }. Norm Form of f : f N = Mf, where M is the denominator of f. Laurent Diff Polynomials Ring: F{Y, Y 1 }. E : universal diff field of F. E = E\{a E : k 0 s.t. a (k) = 0}. Non-polynomial Diff Solution: ξ (E ) n s.t. f (ξ) = 0. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
10 Sparse Laurent Diff Polynomials A = {M 1,..., M m }: finite set of Laurent Diff monomials. Notation: L(A) = { m k=1 b km k : b k E}. Sparse Laurent Diff Polynomial w.r.t. A: f L(A). Generic Sparse Laurent Diff Polynomial w.r.t. A: P L(A) with coefficients diff independent over Q. Given A i (i = 0,..., n) and f i L(A i ), we ask: f i have a common non-polynomial solution? Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
11 Sparse Differential Resultant Generic Sparse Laurent Diff polynomials w.r.t. A i : P i = l i j=0 u ijm ij L(A i ) with coefficients u i. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
12 Sparse Differential Resultant Generic Sparse Laurent Diff polynomials w.r.t. A i : P i = l i j=0 u ijm ij L(A i ) with coefficients u i. Sparse Differential Resultant Exists: [P 0,..., P n ] Q{u 0, u 1,..., u n } = sat(r(u 0,..., u n )) is of codimension 1 Definition R is defined to be the Sparse Differential Resultant of P i, denoted by Res P0,...,P n, or Res A0,...,A n. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
13 Sparse Differential Resultant Generic Sparse Laurent Diff polynomials w.r.t. A i : P i = l i j=0 u ijm ij L(A i ) with coefficients u i. Sparse Differential Resultant Exists: [P 0,..., P n ] Q{u 0, u 1,..., u n } = sat(r(u 0,..., u n )) is of codimension 1 P i are Laurent differentially essential: There exist k i (i = 0,..., n) with 1 k i l i such that d.tr.deg Q M 0k 0 M 00, M 1k 1 M 10,..., M nkn M n0 /Q = n. Definition R is defined to be the Sparse Differential Resultant of P i, denoted by Res P0,...,P n, or Res A0,...,A n. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
14 Facts: Laurent diff essential does not depend on M i0 : Lemma There exist (k i, j i ) with k i j i s.t. d.tr.deg Q M 0k 0 M 0j0,..., M nkn /Q = n. There exist k i with 1 k i l i s.t. d.tr.deg Q M 0k 0 M 00,..., M nkn M n0 /Q = n. M nj n Definition for Sparse Diff Resultant relies on the fact: Theorem [P N 0,..., PN n ] : m is a prime differential ideal in Q{Y, u 0,..., u n }. ([P N 0,..., PN n ] : m) Q{u 0,..., u n } is of codimension 1 if and only if P 0,..., P n are Laurent diff essential. [P 0,..., P n ] Q{u 0,..., u n } = ([P N 0,..., PN n ] : m) Q{u 0,..., u n }. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
15 A Property on Differential Specialization Key fact used in the proof: Theorem U = (u 1,..., u r ) and Y = (y 1,..., y n ): sets of diff indeterminates. P i (U, Y) F Y {U} (i = 1,..., m). If P i (U, Y) are diff dependent over F U, then for any specialization U to U F over F, P i (U, Y) are diff dependent over F. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
16 Examples Example (1) P 0 = u 00 + u 01 y 1 y 2 P 1 = u 10 + u 01 y 1 y 2 P 2 = u 20 + u 21 y 1 y 2. P 0, P 1, P 2 form a Laurent diff essential system. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
17 Examples Example (1) P 0 = u 00 + u 01 y 1 y 2 P 1 = u 10 + u 01 y 1 y 2 P 2 = u 20 + u 21 y 1 y 2. P 0, P 1, P 2 form a Laurent diff essential system. Using diff characteristic set method, we can compute Res P0,P 1,P 2 = u 11 u 2 20 u2 01 u 01u 00 u 2 21 u 10 + u 01 u 11 u 20 u 21 u 00 u 11u 20 u 00 u 21 u 01. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
18 Examples Example (2) n = 1 and A 0 = A 1 = {y, y, y 2 }. A 0, A 1 are Laurent diff essential. Res A = u 12 u 01 u 00 u 10 u 12 u 2 01 u 10 + u 12u 01 u 11 u 00 + u 12 u 01 u 11 u 00 u 11 u 02 u 00 u 10 + u 11 u 02 u 10 u 01 + u 02 u 01 u 2 10 u2 11 u 02u 00 +u 11 u 02 u 01 u 10 + u 11 u 2 00 u 12 + u 2 11 u 02 u 00 u 11 u 02 u 01u 10 u 11 u 01 u 12 u 00 + u 2 01 u 12 u 10 u 11 u 01 u 12u 00 u 11 u 02u 01 u 10. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
19 Basic Properties of Sparse Differential Resultant Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
20 Properties of Sparse Differential Resultant Theorem (Order and Diff homogeneity) Diff resultant is diff homogeneous in each u i and is of order h i = s s i in u i (i = 0,..., n) where s = n l=0 s l. Sparse diff resultant is diff homogeneous in each u i and is of order h i s s i in u i. Degree Bound will be given later! Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
21 Conditions for Existence of Non-polynomial Solutions A 0,..., A n : Laurent diff essential; (F 0,..., F n ) L(A 0 ) L(A n ): F i = l i j=0 v ijm ij. Z 0 (A 0,..., A n ): set of F i having a common non-polynomial solution. Z(A 0,..., A n ): Kolchin diff closure of Z 0 (A 0,..., A n ). Theorem Z(A 0,..., A n ) = V ( sat(res A0,...,A n ) ). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
22 Conditions for Existence of Non-polynomial Solutions A 0,..., A n : Laurent diff essential; (F 0,..., F n ) L(A 0 ) L(A n ): F i = l i j=0 v ijm ij. Z 0 (A 0,..., A n ): set of F i having a common non-polynomial solution. Z(A 0,..., A n ): Kolchin diff closure of Z 0 (A 0,..., A n ). Theorem Z(A 0,..., A n ) = V ( sat(res A0,...,A n ) ). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
23 Example The need to consider non-polynomial solutions: Example n = 2, and (F, δ) = (Q(x), d dx ). P i = u i0 y 1 + u i1y 1 + u i2y 2 (i = 0, 1, 2). P i form a Laurent diff essential system for d.tr.deg Q y 1 y 1 The sparse differential resultant is u 00 u 01 u 02 Res P0,P 1,P 2 = u 10 u 11 u 12 u 20 u 21 u 22 0., y 2 /Q = 2. y 1 But ξ = (c 11 x + c 10, c 22 x 2 + c 21 x + c 20 ) / (E ) 2 is a non-zero solution of P i = 0 (i = 0, 1, 2) where c ij are distinct arbitrary constants. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
24 Condition for Existence of Unique Non-polynomial Solutions Assume 1) Any n of the A i diff independent: ord(r, u i ) 0 for each i. 2) e j Span Z {α ij α i0 }. Theorem (P i, u i ) specialize to (P i, v i ). If R(v 0,..., v n ) = 0 and R u (h i ) ik (v 0,..., v n ) 0, then P i = 0 have at most a unique common non-polynomial solution. Z 1 (A 0,..., A n ): set of (v 0,..., v n ) s.t. P i have a unique non-polynomial solution. Then Z 1 (A 0,..., A n ) = V ( sat(res A0,...,A n ) ) Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
25 Differential Toric Variety A = {M 0,..., M l }: d.tr.deg Q M 1 M 0,..., M l M 0 /Q = n. P(l): l-dimensional diff projective space. Consider φ A : (E ) n P(l) ξ (M 0 (ξ), M 1 (ξ),..., M l (ξ)) Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
26 Differential Toric Variety A = {M 0,..., M l }: d.tr.deg Q M 1 M 0,..., M l M 0 /Q = n. P(l): l-dimensional diff projective space. Consider φ A : (E ) n P(l) ξ (M 0 (ξ), M 1 (ξ),..., M l (ξ)) Definition The Kolchin closure of φ A ( (E ) n) is defined to be the diff toric variety w.r.t. A, denoted by X A. That is, X A = φ A ( (E ) n). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
27 Differential Toric Variety A = {M 0,..., M l }: d.tr.deg Q M 1 M 0,..., M l M 0 /Q = n. P(l): l-dimensional diff projective space. Consider φ A : (E ) n P(l) ξ (M 0 (ξ), M 1 (ξ),..., M l (ξ)) Definition The Kolchin closure of φ A ( (E ) n) is defined to be the diff toric variety w.r.t. A, denoted by X A. That is, X A = φ A ( (E ) n). Theorem X A is an irreducible projective diff variety of dim n over Q. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
28 The Relation of Diff Toric variety and Diff Chow Form Laurent Diff Polynomial: P i = u i0 M 0 + u i1 M u il M l Generic Projective Diff Hyperplane in P(l): L i = u i0 z 0 + u i1 z u il M l Theorem Res A is the differential Chow form of X A. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
29 The Relation of Diff Toric variety and Diff Chow Form Laurent Diff Polynomial: P i = u i0 M 0 + u i1 M u il M l Generic Projective Diff Hyperplane in P(l): L i = u i0 z 0 + u i1 z u il M l Theorem Res A is the differential Chow form of X A. Example (Continue from Example 2) In this example, X A = V(sat(z 1 z 2 (z 0 z 2 z 0 z 2))). And Res A is the diff Chow form of X A. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
30 Poisson-Type Product Formula Algebraic Resultant: Res(A(x), B(x)) = c η,b(η)=0 A(η). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
31 Poisson-Type Product Formula Algebraic Resultant: Res(A(x), B(x)) = c η,b(η)=0 A(η). Differential Resultant: δres(u 0,..., u n ) = A(u 0,..., u n ) t 0 τ=1 P 0 (η τ1,..., η τn ) (h 0). And (η τ1,..., η τn ) are generic points of [P 1,..., P n ]. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
32 Poisson-Type Product Formula Algebraic Resultant: Res(A(x), B(x)) = c η,b(η)=0 A(η). Differential Resultant: δres(u 0,..., u n ) = A(u 0,..., u n ) t 0 τ=1 P 0 (η τ1,..., η τn ) (h 0). And (η τ1,..., η τn ) are generic points of [P 1,..., P n ]. Sparse Differential Resultant: Res(u 0,..., u n ) = A t 0 τ=1 (u 00 + l 0k=1 u 0k ξ τk ) (h 0). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
33 Possion Type Product Formula (Extended) Theorem When 1) Any n of the A i diff independent and 2) e j Span Z {α ij α i0 }, the result can be strengthened: Res(u 0,..., u n ) = A t 0 τ=1 ( P0 (η τ1,...,η τn) M 00(ητ1,...,ητn) ) (h0 ). And η τ = (η τ1,..., η τn ) lie on P 1,..., P n. Furthermore, they are generic points of [P N 0,..., PN n ] : m. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
34 Representation of the Sparse Resultant Algebraic Resultant: Res(A(x), B(x)) = A(x)T(x) + B(x)W(x), where deg(t ) < deg(b), deg(w ) < deg(a). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
35 Representation of the Sparse Resultant Algebraic Resultant: Res(A(x), B(x)) = A(x)T(x) + B(x)W(x), where deg(t ) < deg(b), deg(w ) < deg(a). Differential Resultant: δres(u 0,..., u n ) = n i=0 s si j=0 h ijp (j) i. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
36 Representation of the Sparse Resultant Algebraic Resultant: Res(A(x), B(x)) = A(x)T(x) + B(x)W(x), where deg(t ) < deg(b), deg(w ) < deg(a). Differential Resultant: δres(u 0,..., u n ) = n i=0 s si j=0 h ijp (j) i. Sparse Differential Resultant: Res(u 0,..., u n ) = n hi i=0 j=0 h ij(p N i ) (j), where h i s s i. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
37 Representation of the Sparse Resultant Algebraic Resultant: Res(A(x), B(x)) = A(x)T(x) + B(x)W(x), where deg(t ) < deg(b), deg(w ) < deg(a). Differential Resultant: δres(u 0,..., u n ) = n i=0 s si j=0 h ijp (j) i. Sparse Differential Resultant: Res(u 0,..., u n ) = n hi i=0 j=0 h ij(p N i ) (j), where h i s s i. Degree bound for this linear combination will be given later. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
38 Criterion for Laurent Diff Essential in terms of Supports Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
39 Basic Notions s k=0 B i = n j=1 ) d ijk (i = 1,..., m): Laurent Diff Monomials. New algebraic indeterminates: x 1,..., x n. d ij = s k=0 d ijkxj k (i = 1,..., m; j = 1,..., n). Symbolic Support Vector (SSV) of B i : β i = (d i1,..., d in ). (y (k) j Symbolic Support Matrix (SSM) of B 1,..., B m : β 1 β 2 M =. β m d 11 d d 1n = d 21 d d 0n... d m1 d m2... d mn Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
40 Basic Notions s k=0 B i = n j=1 ) d ijk (i = 1,..., m): Laurent Diff Monomials. New algebraic indeterminates: x 1,..., x n. d ij = s k=0 d ijkxj k (i = 1,..., m; j = 1,..., n). Symbolic Support Vector (SSV) of B i : β i = (d i1,..., d in ). (y (k) j Symbolic Support Matrix (SSM) of B 1,..., B m : β 1 β 2 M =. β m d 11 d d 1n = d 21 d d 0n... d m1 d m2... d mn Def: Call B 1,..., B m Reduced if deg(d ii ) > deg(d ji )(j > i) for each i min(m, n). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
41 Basic Notions s k=0 B i = n j=1 ) d ijk (i = 1,..., m): Laurent Diff Monomials. New algebraic indeterminates: x 1,..., x n. d ij = s k=0 d ijkxj k (i = 1,..., m; j = 1,..., n). Symbolic Support Vector (SSV) of B i : β i = (d i1,..., d in ). (y (k) j Symbolic Support Matrix (SSM) of B 1,..., B m : β 1 β 2 M =. β m d 11 d d 1n = d 21 d d 0n... d m1 d m2... d mn Def: Call B 1,..., B m Reduced if deg(d ii ) > deg(d ji )(j > i) for each i min(m, n). Lemma B 1,..., B m Reduced. Then d.tr.deg Q B 1, B 2,..., B m /Q = min(m, n). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
42 Laurent Diff monomials in T-shape Def: Call B 1,..., B m in T-shape with index (i, j) if there exist (i, j) s.t. 1) (M 1 ) i i and (M 2 ) (n i) j are reduced sub-matrices, 2) Z 1 and Z 2 constitute an (m i) (n j) zero matrix. Figure: T-shape Matrix Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
43 Laurent Diff monomials in T-shape Def: Call B 1,..., B m in T-shape with index (i, j) if there exist (i, j) s.t. 1) (M 1 ) i i and (M 2 ) (n i) j are reduced sub-matrices, 2) Z 1 and Z 2 constitute an (m i) (n j) zero matrix. Figure: T-shape Matrix Theorem B 1,..., B m in T-shape. d.tr.deg Q B 1, B 2,..., B m /Q = rk(m) = i + j. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
44 General Laurent Diff Monmials M: SSM of arbitrary B 1,..., B m. Q-elementary Transformations: row(column) interchanging, and adding a Q-multiple of one row to another. Theorem M can be reduced to a T-shape matrix by finite Q-elementary transformations. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
45 General Laurent Diff Monmials M: SSM of arbitrary B 1,..., B m. Q-elementary Transformations: row(column) interchanging, and adding a Q-multiple of one row to another. Theorem M can be reduced to a T-shape matrix by finite Q-elementary transformations. Q-elementary transformations keep diff transcendence degree: Theorem d.tr.deg Q B 1, B 2,..., B m /Q = rk(m) Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
46 Generic Laurent Diff Polynomials P i = l i j=0 u ijm ij (i = 1,..., m). SSV of M ij /M i0 : β ij Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
47 Generic Laurent Diff Polynomials P i = l i j=0 u ijm ij (i = 1,..., m). SSV of M ij /M i0 : β ij SSV of P i : β i = l i j=0 u ijβ ij. SSM of P 0,..., P n : M P = (β 0,..., β n ) T Theorem 1) d.tr.deg Q û P 1 M 10,..., Pm M m0 /Q û = rk(m P ) (û = m i=1 u i). 2) Codim([P N 1,..., PN m] : m) Q{u 0,..., u n } = n + 1 rk(m P ). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
48 Criterion for Laurent Diff Essential P i = l i j=0 u ijm ij (i = 0,..., n). Theorem The P i are Laurent differentially essential rk(m P ) = n there exist k i (1 k i l i ) s.t. rk(m k0,...,k n ) = n where M k0,...,k n is the SSM for M 0k0 /M 00,..., M nkn /M n,0. Remark: Here, a diff problem is translated to a linear algebraic one. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
49 A Single Exponential Algorithm to Compute Sparse Diff Resultant Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
50 Degree of Sparse Differential Resultant Laurent Diff Essential System: P 0,..., P n ord(p i ) = s i and deg(p i ) = m i. P N i = l j=0 u ijn ij R : the sparse resultant of P 0,..., P n. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
51 Degree of Sparse Differential Resultant Laurent Diff Essential System: P 0,..., P n ord(p i ) = s i and deg(p i ) = m i. P N i = l j=0 u ijn ij R : the sparse resultant of P 0,..., P n. Theorem 1 ord(r, u i ) = h i s s i, where s = n i=0 s i. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
52 Degree of Sparse Differential Resultant Laurent Diff Essential System: P 0,..., P n ord(p i ) = s i and deg(p i ) = m i. P N i = l j=0 u ijn ij R : the sparse resultant of P 0,..., P n. Theorem 1 ord(r, u i ) = h i s s i, where s = n i=0 s i. 2 deg(r) n i=0 (m i + 1) h i +1 (m + 1) ns+n+1, where m = max i {m i }. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
53 Degree of Sparse Differential Resultant Laurent Diff Essential System: P 0,..., P n ord(p i ) = s i and deg(p i ) = m i. P N i = l j=0 u ijn ij R : the sparse resultant of P 0,..., P n. Theorem 1 ord(r, u i ) = h i s s i, where s = n i=0 s i. 2 deg(r) n i=0 (m i + 1) h i +1 (m + 1) ns+n+1, where m = max i {m i }. 3 n i=0 N(h i +1)deg(R) i0 R = n hi i=0 j=0 G ) ij( P N (j) i where deg(g ij (P N i ) (j) ) [m n i=0 (h i + 1)deg(N i0 )]deg(r). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
54 Key Ingredients to Prove the Theorem R [P N 0,..., PN n ] : m Q{u 0,..., u n } Differential 1) (R) = (P (k) i : k h i ) : m [h] Q[U] where h i s s i Algebraic 2) ( ) Bound of deg(r) and deg(g ik P N (k)) i Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
55 Key Ingredients to Prove the Theorem R [P N 0,..., PN n ] : m Q{u 0,..., u n } Differential 1) (R) = (P (k) i : k h i ) : m [h] Q[U] where h i s s i Algebraic 2) ( ) Bound of deg(r) and deg(g ik P N (k)) i Key facts used in 1): Diff specialization technique from diff resultant to sparse case Substitute (P N i l i k=1 u ikn ik )/N i0 for u i0 into R and Y is a parametric set. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
56 Key Ingredients to Prove the Theorem R [P N 0,..., PN n ] : m Q{u 0,..., u n } Differential 1) (R) = (P (k) i : k h i ) : m [h] Q[U] where h i s s i Algebraic 2) ( ) Bound of deg(r) and deg(g ik P N (k)) i Key facts used in 1): Diff specialization technique from diff resultant to sparse case Substitute (P N i l i k=1 u ikn ik )/N i0 for u i0 into R and Y is a parametric set. Key facts used in 2): Bézout Inequality: deg(v ) r i=1 deg(f i) for each component V of V(f 1,..., f r ). Degree of Elimination Ideal: deg(i k ) deg(i). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
57 An Algorithm for Sparse Differential Resultant Outline of the Algorithm. Knowing order and degree bounds, we compute sparse diff resultant by solving linear equations. Precisely, Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
58 An Algorithm for Sparse Differential Resultant Outline of the Algorithm. Knowing order and degree bounds, we compute sparse diff resultant by solving linear equations. Precisely, 1 Search for R(u 0,..., u n ) with order h i = 0,..., s s i and with degree from D = 1,..., n i=0 (m i + 1) h i With fixed h i and D, computing coefficients of R and G ik by solving linear equations raising from n i=0 N(h i +1)D i0 R(u 0,..., u n ) = n hi i=0 k=0 G ikp (k) i. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
59 An Algorithm for Sparse Differential Resultant Outline of the Algorithm. Knowing order and degree bounds, we compute sparse diff resultant by solving linear equations. Precisely, 1 Search for R(u 0,..., u n ) with order h i = 0,..., s s i and with degree from D = 1,..., n i=0 (m i + 1) h i With fixed h i and D, computing coefficients of R and G ik by solving linear equations raising from n i=0 N(h i +1)D i0 R(u 0,..., u n ) = n hi i=0 k=0 G ikp (k) i. Theorem (Computing Complexity) O(((n + 1)(s + 1)) O(ls) (m + 1) O(nls2) ) Q-arithmetic operations. n: number of variables; s: order of system; l: size of sparse system Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
60 Sparse diff Resultant for Diff polynomials with Non-vanishing Degree Zero Terms Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
61 Diff Essential System and its Sparse Diff Resultant Sparse Diff Polynomials: P i = u i0 + l i j=1 u ijm ij (i = 0,..., n). Diff Essential System: Laurent Diff Essential. Resultant here has additional better properties. Theorem (P i, u i ) specialize to (P i, v i ). Z 2 : set of (v 0,..., v n ) s.t. P i have a common solution. Then Z 2 = V(sat(Res)). Assume 1) Any n of the P i diff independent and 2) e j Span Z {α ij }. If R(v 0,..., v n ) = 0 and R (v 0,..., v n ) 0, then u (h i ) ik P i = 0 have a unique common solution. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
62 Theorem P 0,..., P n : Diff essential system. ord(p i ) = s i and deg(p i, Y) = m i. Then R = n hi i=0 j=0 G ijp (j) i with deg(g ij P (j) i ) (m + 1)deg(R). Better computing complexity O(n (s + 1) O(n) (m + 1) O(nls2) ). Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
63 Theorem P 0,..., P n : Diff essential system. ord(p i ) = s i and deg(p i, Y) = m i. Then R = n hi i=0 j=0 G ijp (j) i with deg(g ij P (j) i ) (m + 1)deg(R). Better computing complexity O(n (s + 1) O(n) (m + 1) O(nls2) ). Degree Bound for the Diff Resultant can be improved: Theorem Diff resultant has degree bounded by s s k +1 m k n i=0 ms s i +1 i in each u k. Key Tool: The degree of Generalized Chow form. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
64 Summary We introduce the concepts of Laurent diff polynomials and Laurent diff essential systems, and give a criterion for Laurent differentially essential system in terms of the supports. Sparse differential resultant is defined and properties similar to that of the Macaulay resultant are given. A single exponential algorithm to compute the sparse differential resultant is given. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
65 Problems for Future Research Find a determinant representation for the (sparse) differential resultant. Bound the degree of the sparse diff resultant in terms of the mixed volume of the polytopes generated by the supports of the diff polynomials. Find practically efficient algorithms to compute the sparse differential resultants. Study differential toric variety further to give a necessary and sufficient condition for the sparse differential resultant vanishing. Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
66 Reference: Wei Li, Xiao-Shan Gao, Chun-Ming Yuan. Sparse Differential Resultant. In Proc. ISSAC 2011, San Jose, CA, USA, , ISSAC 2011 Distinguished Paper Award. Wei Li, Chun-Ming Yuan, Xiao-Shan Gao. Sparse Differential Resultant for Laurent Differential Polynomials. ArXiv: v1, page 1-57, 4 Nov Wei Li (AMSS, CAS) Sparse Differential Resultant / 40
Differential and Difference Chow Form, Sparse Resultant, and Toric Variety
Differential and Difference Chow Form, Sparse Resultant, and Toric Variety Xiao-Shan Gao Academy of Mathematics and Systems Science Chinese Academy of Sciences Xiao-Shan Gao (AMSS, CAS) 2015. 10. 2 1 /
More informationComputations with Differential Rational Parametric Equations 1)
MM Research Preprints,23 29 No. 18, Dec. 1999. Beijing 23 Computations with Differential Rational Parametric Equations 1) Xiao-Shan Gao Institute of Systems Science Academia Sinica, Beijing, 100080 Abstract.
More informationON THE RANK OF A TROPICAL MATRIX
ON THE RANK OF A TROPICAL MATRIX MIKE DEVELIN, FRANCISCO SANTOS, AND BERND STURMFELS Abstract. This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring.
More informationINTERSECTION THEORY IN DIFFERENTIAL ALGEBRAIC GEOMETRY: GENERIC INTERSECTIONS AND THE DIFFERENTIAL CHOW FORM
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 365, Number 9, September 2013, Pages 4575 4632 S 02-9947(201305633-4 Article electronically published on February 12, 2013 INTERSECTION THEORY IN
More informationOn Partial Difference Coherent and Regular Ascending Chains
MM Research Preprints, 82 88 KLMM, AMSS, Academia Sinica No. 24, December 2005 On Partial Difference Coherent and Regular Ascending Chains Xiao-Shan Gao and Gui-Lin Zhang Key Laboratory of Mathematics
More informationHomogeneous Coordinate Ring
Students: Kaiserslautern University Algebraic Group June 14, 2013 Outline Quotients in Algebraic Geometry 1 Quotients in Algebraic Geometry 2 3 4 Outline Quotients in Algebraic Geometry 1 Quotients in
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 information12. 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 informationEfficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Application in Analysis of Stream Ciphers 1
Efficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Application in Analysis of Stream Ciphers 1 Xiao-Shan Gao and Zhenyu Huang Key Laboratory of Mathematics Mechanization
More informationTHE HEIGHT OF THE MIXED SPARSE RESULTANT
THE HEIGHT OF THE MIXED SPARSE RESULTANT Abstract. We present an upper bound for the height of the mixed sparse resultant, defined as the logarithm of the maximum modulus of its coefficients. We obtain
More informationCS 4424 GCD, XGCD
CS 4424 GCD, XGCD eschost@uwo.ca GCD of polynomials First definition Let A and B be in k[x]. k[x] is the ring of polynomials with coefficients in k A Greatest Common Divisor of A and B is a polynomial
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationA 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 informationExact Arithmetic on a Computer
Exact Arithmetic on a Computer Symbolic Computation and Computer Algebra William J. Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 Tuesday 21 September 2010
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 informationDIFFERENTIAL CHOW VARIETIES EXIST
DIFFERENTIAL CHOW VARIETIES EXIST JAMES FREITAG, WEI LI, AND THOMAS SCANLON, WITH AN APPENDIX BY WILLIAM JOHNSON Abstract. The Chow variety is a parameter space for effective algebraic cycles on P n (or
More informationSolving determinantal systems using homotopy techniques
Solving determinantal systems using homotopy techniques J.D. Hauenstein 1, M. Safey El Din 2, É. Schost3, T. X. Vu 2,3 April 5, 2018 Abstract Let K be a field of characteristic zero and K be an algebraic
More informationECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am
ECS130 Scientific Computing Lecture 1: Introduction Monday, January 7, 10:00 10:50 am About Course: ECS130 Scientific Computing Professor: Zhaojun Bai Webpage: http://web.cs.ucdavis.edu/~bai/ecs130/ Today
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 informationThe final journal version of this paper appears in Rueda, S.L. Differential elimination by differential specialization of Sylvester style matrices.
The final journal version of this paper appears in Rueda, S.L. Differential elimination by differential specialization of Sylvester style matrices. Advances in Applied Mathematics 72 (2016), 4-37. DOI:
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationAlgebraic General Solutions of Algebraic ODEs 1)
MM Research Preprints, 1 16 MMRC, AMSS, Academia Sinica No. 23, December 2004 1 Algebraic General Solutions of Algebraic ODEs 1) J.M. Aroca, J. Cano, Ruyong Feng and Xiao-Shan Gao Department of Algebra,
More informationOn the Splitting of MO(2) over the Steenrod Algebra. Maurice Shih
On the Splitting of MO(2) over the Steenrod Algebra Maurice Shih under the direction of John Ullman Massachusetts Institute of Technology Research Science Institute On the Splitting of MO(2) over the Steenrod
More informationLecture 3: Tropicalizations of Cluster Algebras Examples David Speyer
Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
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 informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where
More informationSTEENROD OPERATIONS IN ALGEBRAIC GEOMETRY
STEENROD OPERATIONS IN ALGEBRAIC GEOMETRY ALEXANDER MERKURJEV 1. Introduction Let p be a prime integer. For a pair of topological spaces A X we write H i (X, A; Z/pZ) for the i-th singular cohomology group
More informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
More informationGeneric Picard-Vessiot extensions for connected by finite groups Kolchin Seminar in Differential Algebra October 22nd, 2005
Generic Picard-Vessiot extensions for connected by finite groups Kolchin Seminar in Differential Algebra October 22nd, 2005 Polynomial Galois Theory case Noether first introduced generic equations in connection
More informationComputing Approximate GCD of Univariate Polynomials by Structure Total Least Norm 1)
MM Research Preprints, 375 387 MMRC, AMSS, Academia Sinica No. 24, December 2004 375 Computing Approximate GCD of Univariate Polynomials by Structure Total Least Norm 1) Lihong Zhi and Zhengfeng Yang Key
More information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More informationComputing Rational Points in Convex Semi-algebraic Sets and Sums-of-Squares Decompositions
Computing Rational Points in Convex Semi-algebraic Sets and Sums-of-Squares Decompositions Mohab Safey El Din 1 Lihong Zhi 2 1 University Pierre et Marie Curie, Paris 6, France INRIA Paris-Rocquencourt,
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 informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationGEOMETRIC AXIOMS FOR THE THEORY DCF 0,m+1
GEOMETRIC AXIOMS FOR THE THEORY DCF 0,m+1 University of Waterloo March 24, 2011 (http://arxiv.org/abs/1103.0730) Motivation Motivation In the 50 s Robinson showed that the class of existentially closed
More informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationCommuting 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 informationRational 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 informationSparsity 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 informationBarnett s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
J Symbolic Computation (2002) 34, 59 81 doi:101006/jsco20020542 Available online at http://wwwidealibrarycom on Barnett s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through
More informationRoots of Polynomials in Subgroups of F p and Applications to Congruences
Roots of Polynomials in Subgroups of F p and Applications to Congruences Enrico Bombieri, Jean Bourgain, Sergei Konyagin IAS, Princeton, IAS Princeton, Moscow State University The decimation problem Let
More informationTotal 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 informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013 Throughout this lecture k denotes an algebraically closed field. 17.1 Tangent spaces and hypersurfaces For any polynomial f k[x
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 informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationVector Spaces and Subspaces
Vector Spaces and Subspaces Our investigation of solutions to systems of linear equations has illustrated the importance of the concept of a vector in a Euclidean space. We take time now to explore the
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 informationA Zero Structure Theorem for Differential Parametric Systems
A Zero Structure Theorem for Differential Parametric Systems XIAO-SHAN GAO Institute of Systems Science, Academia Sinica, Beijing SHANG-CHING CHOU Department of Computer Science Wichita State University,Wichita
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
More informationA POISSON FORMULA FOR THE SPARSE RESULTANT
A POISSON FORMULA FOR THE SPARSE RESULTANT CARLOS D ANDREA AND MARTÍN SOMBRA Abstract. We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationAn arithmetic Bernštein-Kušnirenko inequality
An arithmetic Bernštein-Kušnirenko inequality César Martínez joint with Martín Sombra Laboratoire de Mathématiques Nicolas Oresme Université de Caen Normandie MEGA June 12th 2017 Schema Counting the number
More informationMatrix rigidity and elimination theory
Matrix rigidity and elimination theory Abhinav Kumar joint work with Satya Lokam, Vijay Patankar and Jalayal Sarma M.N. MIT April 25, 2012 Abhinav Kumar (MIT) Matrix rigidity and elimination theory April
More informationAlgebraic General Solutions of Algebraic Ordinary Differential Equations
Algebraic General Solutions of Algebraic Ordinary Differential Equations JM Aroca and J Cano Department of Algebra, Geometry and Topology Fac Ciencias Univ de Valladolid Valladolid 47011, Spain (aroca,jcano)@agtuvaes
More informationA Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs
J. Symbolic Computation (2005) 11, 1 22 A Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs Ruyong Feng and Xiao-Shan Gao Key Lab of Mathematics Mechanization,
More information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
More informationThe Riemann Hypothesis for Function Fields
The Riemann Hypothesis for Function Fields Trevor Vilardi MthSc 952 1 Function Fields Let F = F q be the finite field with q elements (q is a prime power). Definiton 1. Let K/F (x) be an extension of F.
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 informationon 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 informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationRings of Integer -Valued Polynomials. David Lantz Colgate University
Rings of Integer -Valued Polynomials David Lantz Colgate University dlantz@mail.colgate.edu An integer-valued polynomial is a function from the integers to the integers that is given by a polynomial. Ex:
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 informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More informationON COMPLETENESS AND LINEAR DEPENDENCE FOR DIFFERENTIAL ALGEBRAIC VARIETIES
ON COMPLETENESS AND LINEAR DEPENDENCE FOR DIFFERENTIAL ALGEBRAIC VARIETIES JAMES FREITAG*, OMAR LEÓN SÁNCHEZ, AND WILLIAM SIMMONS** Abstract. In this paper we deal with two foundational questions on complete
More informationDependence of logarithms on commutative algebraic groups
INTERNATIONAL CONFERENCE on ALGEBRA and NUMBER THEORY Hyderabad, December 11 16, 2003 Dependence of logarithms on commutative algebraic groups Michel Waldschmidt miw@math.jussieu.fr http://www.math.jussieu.fr/
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationRational Points on Curves
Rational Points on Curves 1 Q algebraic closure of Q. k a number field. Ambient variety: Elliptic curve E an elliptic curve defined over Q. E N = E E. In general A an abelian variety defined over Q. For
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationAbstract Vector Spaces and Concrete Examples
LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.
More informationarxiv: v1 [math.ag] 14 Mar 2019
ASYMPTOTIC CONSTRUCTIONS AND INVARIANTS OF GRADED LINEAR SERIES ariv:1903.05967v1 [math.ag] 14 Mar 2019 CHIH-WEI CHANG AND SHIN-YAO JOW Abstract. Let be a complete variety of dimension n over an algebraically
More informationAN 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 informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationIrreducible multivariate polynomials obtained from polynomials in fewer variables, II
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 121 No. 2 May 2011 pp. 133 141. c Indian Academy of Sciences Irreducible multivariate polynomials obtained from polynomials in fewer variables II NICOLAE CIPRIAN
More informationBoston College, Department of Mathematics, Chestnut Hill, MA , May 25, 2004
NON-VANISHING OF ALTERNANTS by Avner Ash Boston College, Department of Mathematics, Chestnut Hill, MA 02467-3806, ashav@bcedu May 25, 2004 Abstract Let p be prime, K a field of characteristic 0 Let (x
More informationFiniteness Issues on Differential Standard Bases
Finiteness Issues on Differential Standard Bases Alexey Zobnin Joint research with M.V. Kondratieva and D. Trushin Department of Mechanics and Mathematics Moscow State University e-mail: al zobnin@shade.msu.ru
More informationLinear, Quadratic, and Cubic Forms over the Binary Field
Linear, Quadratic, and Cubic Forms over the Binary Field Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University October 28, 2009 POSTECH Linear, Quadratic, and Cubic Forms over
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationCompact Formulae in Sparse Elimination
Compact Formulae in Sparse Elimination Ioannis Emiris To cite this version: Ioannis Emiris. Compact Formulae in Sparse Elimination. ISSAC 2016 - International Symposium on Symbolic and Algebraic Computation,
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 informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
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 informationROST S DEGREE FORMULA
ROST S DEGREE FORMULA ALEXANDER MERKURJEV Some parts of algebraic quadratic form theory and theory of simple algebras with involutions) can be translated into the language of algebraic geometry. Example
More informationInstitutionen för matematik, KTH.
Institutionen för matematik, KTH. Contents 7 Affine Varieties 1 7.1 The polynomial ring....................... 1 7.2 Hypersurfaces........................... 1 7.3 Ideals...............................
More informationTropical Algebraic Geometry 3
Tropical Algebraic Geometry 3 1 Monomial Maps solutions of binomial systems an illustrative example 2 The Balancing Condition balancing a polyhedral fan the structure theorem 3 The Fundamental Theorem
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationComputable Differential Fields
Computable Differential Fields Russell Miller Queens College & CUNY Graduate Center New York, NY Mathematisches Forschungsinstitut Oberwolfach 10 February 2012 (Joint work with Alexey Ovchinnikov & Dmitry
More informationCOMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS
COMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS LAURA FELICIA MATUSEVICH AND EZRA MILLER Abstract. Let A be an integer d n matrix, and assume that the convex hull conv(a) of its columns
More informationHypertoric varieties and hyperplane arrangements
Hypertoric varieties and hyperplane arrangements Kyoto Univ. June 16, 2018 Motivation - Study of the geometry of symplectic variety Symplectic variety (Y 0, ω) Very special but interesting even dim algebraic
More informationMATH 304 Linear Algebra Lecture 18: Orthogonal projection (continued). Least squares problems. Normed vector spaces.
MATH 304 Linear Algebra Lecture 18: Orthogonal projection (continued). Least squares problems. Normed vector spaces. Orthogonality Definition 1. Vectors x,y R n are said to be orthogonal (denoted x y)
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationGENERALIZED CAYLEY-CHOW COORDINATES AND COMPUTER VISION
GENERALIZED CAYLEY-CHOW COORDINATES AND COMPUTER VISION BRIAN OSSERMAN Abstract. A fundamental problem in computer vision is to reconstruct the configuration of a collection of cameras from the images
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 informationarxiv:math/ v1 [math.nt] 26 Jul 2006
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 115, No. 2, May 2003, pp. 117 125. Printed in India Irreducibility results for compositions of polynomials in several variables arxiv:math/0607656v1 [math.nt]
More informationMath 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
More informationToric Varieties. Madeline Brandt. April 26, 2017
Toric Varieties Madeline Brandt April 26, 2017 Last week we saw that we can define normal toric varieties from the data of a fan in a lattice. Today I will review this idea, and also explain how they can
More informationdiv(f ) = D and deg(d) = deg(f ) = d i deg(f i ) (compare this with the definitions for smooth curves). Let:
Algebraic Curves/Fall 015 Aaron Bertram 4. Projective Plane Curves are hypersurfaces in the plane CP. When nonsingular, they are Riemann surfaces, but we will also consider plane curves with singularities.
More information