Solving Algebraic Equations in Terms of A-Hypergeometric Series. Bernd Sturmfels. Department of Mathematics. University of California

Size: px
Start display at page:

Download "Solving Algebraic Equations in Terms of A-Hypergeometric Series. Bernd Sturmfels. Department of Mathematics. University of California"

Transcription

1 Solving Algebraic Equations in Terms of A-Hypergeometric Series Bernd Sturmfels Department of Mathematics University of California Berkeley, CA 9472, U.S.A. Abstract The roots of the general equation of degree n satisfy an A-hypergeometric system of dierential equations in the sense of Gel'fand, Kapranov and Zelevinsky. We construct the n distinct A-hypergeometric series solutions for each of the 2 n? triangulations of the Newton segment. This works over any eld whose characteristic is relatively prime to the lengths of the segments in the triangulation.. Solving the Quintic A classical problem in mathematics is to nd a formula for the roots of the general equation of degree n in terms of its n coecients. While there are formulas in terms of radicals for n 4, Galois theory teaches us that no such formula exists for the general quintic a x a 4 x 4 x 3 x 2 a x a = : (:) An alternative approach is to expand the roots into fractional power series (or Puiseux series). In 77 Johann Lambert expressed the roots of the trinomial equation x p x r as a Gauss hypergeometric function in the parameter r. Series expansions of more general algebraic functions were subsequently given by Euler, Chebyshev and Eisenstein, among others. The poster \Solving the Quintic with Mathematica" [2] gives a nice introduction to these classical techniques and underlines their relevance for symbolic computation. The state of the art in the rst half of our century appears in works of Richard Birkeland [2] and Karl Mayr []. They proved that the roots are multivariate hypergeometric functions (in the sense of Horn) in all of the coecients and they gave series expansions for the roots and their powers. The purpose of this note is to rene the these results. Our point of departure is the fact that the roots satisfy the A-hypergeometric dierential equations introduced by Gel'fand, Kapranov and Zelevinsky [6],[7]. Here A denotes the conguration of n equidistant points on the ane line. It follows from recent work

2 of McDonald [] that there are 2 n? distinct complete sets of series solutions, one for each of the 2 n? triangulations of A. We shall construct these series solutions explicitly. Let us illustrate our general construction for the example of the quintic (.). Here the set A has 6 distinct triangulations. The nest triangulation divides A into ve segments of unit length. The coarsest triangulation of A is just a single segment of length. For the nest triangulation we get the following expressions for the ve roots of (.): X ;? =? a a ; X2;? =? a a a ; X3;? =? a ; X 4;? =? a 4 ; X;? =? a 4 a a 4 : Each bracket represents a power series having the monomial in the bracket as its rst term: a a a a2 a3 a 4 a4 a = a a a2 = a a2 2 =? a a 3 = a 4? a 4 = a 4 a? a3 a 4? a3 a 4 a 4 2? a a 4 3 a2 3a 4 2 a3 2 a? 3 a a a a a 3 a 4 a4 a 4 a 2 a3 a3 3 a 2 a2 2a 4 3? 3 a 4 4? a4 a 6 a4 a a 2? a3 2a a 4 3? a a 4 4? a a a 6? a4 a 4 a a3 2 4 a 3 4 a a 4 Note that the last bracket is just a single Laurent monomial. The other four brackets can easily be written as an explicit sum over N4. For instance, ai? a i a a = X i;j;k;l (?) 2i3j4kl (2i3j4kl)! i! j! k! l! (i2j3k4l )! ai2j3k4l a i 2 aj 3 ak 4 al i3j4kl Each coecient appearing in one of these series is integral. Therefore our ve series solutions of the general quintic are characteristic-free. They work over any base eld. The situation is dierent for the coarsest triangulation of A. Here we must assume that the characteristic is dierent from. The ve series solutions of (.) are a = X ; = a = 2 a = = 3 2 = = 4 a = a 4=? a 4 a

3 where runs over the ve roots of the equation =?. The brackets denote the series a = a a = = = = = a = a 4= = a= a = = = = a? 2 = = = = a = a 4= a a 4 a 4= a 6=? 2? 3 = a 7=? 2? a 7= =? 3? a a 6= a 4=? 2 a 4= a 6= a 4 = a 7= a 4 = a 8= 4 a = a 9= a 9= a 6= 4 = = a a 4 a 7= a 8= a = a 4= a 4= a = a a 8= a 7= a 3 a 7= a 8= a a 4 a 6= a 9= Each of these four series can be expressed as an explicit sum over the lattice points in a 4-dimensional polyhedron. The general formula will be presented in Theorem 3.2 below. 2. The Roots are A-hypergeometric Our problem is to compute the roots of the general equation of degree n, f(x) = a a x x 2 : : : a n? x n? a n x n : (2:) Each root of f(x) is an algebraic function in the indeterminate coecients: X = X(a ; a ; ; : : : ; a n? ; a n ): Proposition 2.. (Karl Mayr [, p. 284]) The roots of the general equation of degree n satisfy the following system of linear partial dierential 2 j l whenever i j = k l; (2:2) nx i= i =?X and nx i= i = : (2:3) The system (2.2)-(2.3) is a special instance of the class of A-hypergeometric dierential equations introduced by Gel'fand, Kapranov and? Zelevinsky [],[7]. Namely, (2.2)-(2.3) is? the A-hypergeometric system with parameters associated with the integer matrix A := 2 3 n? n : (2:4) The column vectors of A are homogeneous coordinates of n equidistant points on the line. Their convex hull is a line segment: it is the Newton polytope of f(x). 3

4 The Euler-type equations (2.3) follow readily from the homogeneity relations X(a ; ta ; t 2 ; : : : ; t n? a n? ; t n a n ) = t X(a ; a ; ; : : : ; a n? ; a n ); X(ta ; ta ; t ; : : : ; ta n? ; ta n ) = X(a ; a ; ; : : : ; a n? ; a n ): The equations (2.2) appeared in Karl Mayr's 937 paper [, equation (2) on page 284]. I shall present two proofs dierent proofs. The rst one was shown to me in the spring of 992 by Jean-Luc Brylinski. See [3] for an appearence of (2.2) in dierential geometry. Brylinsky's proof of (2.2): It uses implicit dierentiation and works over any base eld. We consider the rst derivative f (x) = P n i= ia ix i? and the second derivative f (x) = P n i=2 i(i? )a ix i?2. Note that f (X) 6=, since a ; : : : ; a n are indeterminates. Dierentiating the dening identity P n i= a ix(a ; a ; : : : ; a n ) i = with respect to a j, we get X j j = : (2:) We next j with respect to the indeterminate a i 2 j X i f (X) (X) X j f (X)?2 jx f (X)? : i Using (2.) and the i =? f (X) f (X) Xi ix i?, we can rewrite (2.6) 2 j =?f (X)X ij f (X)?3 (i j)x ij? f (X)?2 : (2:7) The expression (2.7) depends only on the sum of indices i j. This proves (2.2). A complex analysis proof of (2.2): Suppose we are working over the eld of complex numbers C. Consider the logarithmic derivative [log(f(x))] = f (x)=f(x). We view it as a rational function in a ; a ; : : : ; a n and dierentiate with respect to these 2? [log(f(x))]?x ij = j f 2 (x) This shows that [log(f(x))] satises the quadratic A-hypergeometric equations (2.2). Proposition 2. follows by dierentiating under the integral sign in Cauchy's formula X = 2i where? is a suciently small loop in the complex plane. 4 Z? zf (z) dz; (2:8) f(z)

5 3. Series Expansions For any rational number u and any integer v we abbreviate (u; v) := 8 >< >: if v =, u(u? )(u? 2) (u v ) if v <, if u is a negative integer and u?v, otherwise. (u)(u2)(uv) Let L denote the integer kernel of A. This is the (n? )-dimensional sublattice of Z n spanned by fe i?? 2e i e i : i = ; : : : ; n?g. Consider any monomial a u au au n n with rational exponents in the coecients of f(x). We dene the formal power series a u au au n n := X ny (v ;:::;v n )2L i=? (ui ; v i ) a u i v i i : (3:) This series satises the quadratic dierential equations (2.2), and it satises the linear equations (2.3) with their right hand sides?x and replaced by X and 2 X. Lemm.. ([, Lemma ]) The series a u au n n is a formal solution of the A-hypergeometric system with parameters? 2 = A (u ; u ; : : : ; u n ) T. Gel'fand, Kapranov and Zelevinsky constructed a complete set of series solutions for each regular triangulations of the set A. We shall adapt their general construction to our special case. Extra care must be taken, however, because our equations (2.3) do not satisfy the non-resonance hypothesis which is necessary for [, Theorem 3] to hold. We write ; ; : : : ; n for the points in our conguration A in (2.4). It has 2 n? triangulations, all of which are regular. Each triangulation is indexed by a subset I of f; : : : ; n? g. Writing the complementary subset as f; ; : : : ; ngni = f = i < i < i 2 < < i r? < i r = ng, the triangulation of A indexed by I consists of the r segments [i ; i ]; [i ; i 2 ]; : : : ; [i r? ; i r ]. See [8, Sections 7.3.A and 2.2.A] for details. If r = n (resp. r = ) then this is the nest (resp. coarsest) triangulation referred to in Section. We are now prepared to present the main result of this note. In the remainder of Section 3 we shall be working over the eld of complex numbers C. Fix any of the 2 n? triangulations of A. For j = ; : : : ; r we write :=?? for the length of the j-th segment in that triangulation. Clearly, d d 2 d r = n. Let = (?) = be any of the -th roots of?. We dene the A-hypergeometric series X j; := a? a? d X j k=2 k a ij? k? a k?? a? k aij?? a ij? a If j = then the expression? a appears in the rightmost summand. We dene it to be zero. Note that by varying j and we have dened n distinct series in total.

6 Theorem 3.2. The n series X j; are roots of the general equation of order n, that is, f(x j; ) =. There exists a constant M such that all n series X j; converge whenever ja ij? j ij?k ja ij j k?? M ja k j for all j r and k 62 f? ; g: (3:2) Proof: Consider the open convex cone C = w 2 R n : (?k)w ij? (k?? )w ij < w k for j = ; : : :; r; k 62 f? ; g : This is the outer normal cone to the secondary polytope (A) at the vertex corresponding to the triangulation I of A (cf. [8, Theorem 2.2.2]). Equivalently, the cone C consists of all vectors w = (w ; w ; : : : ; w n ) which induce the triangulation in question. Let U be the region in the coecient space C n dened by the inequalities (3.2) for M. There exists a vector V 2 R n such that (log(ja j); : : : ; log(ja n j))? V 2 C for all (a ; : : : ; a n ) in U. Let H be the space? of all complex-valued functions on U which are? A-hypergeometric with parameters. The A-hypergeometric system is holonomic of rank n and its singular locus, the discriminantal locus of f, is disjoint from U (see []). Hence H is a complex vector space of dimension at most n. We shall identify n linearly independent elements in H, which will imply that H has dimension exactly n. It follows from [, Proposition 2] that the series a u au n n dened in (3.) converges in U provided at most two of the exponents u i are non-integers. Each of the summands in the denition of X j; has this property. Therefore X j; converges in U. Using Lemm., we conclude that the n series X j; lie in the vector space H. We x an vector w = (w ; : : : ; w n ) in C such that all coordinates w i are integers and such that no two of the lines spanned by pairs f(w i ; i); (w j ; j)g in R 2 are parallel. The weight of a monomial a i a i a i n n (with rational exponents) is dened to be w i w i w n i n. We replace the input equation by its toric deformation f t (x) = a t w a t w x t w 2 x 2 : : : a n? t w n? x n? a n t w n x n : (3:3) We shall study the n roots as an algebraic function of t. For t close to the origin the n roots split into r groups, one for each segment [? ; ], for j = ; : : : ; r. (This is a special case of the multivariate construction in [9, x3].) The roots in the j-th group possess a Puiseux expansion of the form j;(t) = a? a? t (w ij??w ij ) higher terms in t; where satises =?. We shall prove that j; () = X j; for all (a ; : : : ; a n ) 2 U. To this end we rst determine the second lowest term in the series j; (t). After modifying the weight vector w by an ane transformation w i 7! w i, which does not alter the 6

7 structure of the series, we may assume that w ij = w ij? =, and there is a unique index r with w r =, and w l > for l 2 f; ; : : : ; ngnf ;? ; rg. An explicit calculation reveals j;(t) = a? a? r?? a r a (r?)=? a (??r?)= t higher terms in t: (3:4) By varying w within the cone C we can arrange that the role of r is played by any index in the set? f; ; : : : ; ngnfi ; i 2 ; : : : ; i r g [ f? ; 2 g: (3:) Note that the cardinality of this set is at least?. Consider the linear map that extracts from a series in a ; : : : ; a n all those terms which are lowest or second lowest with respect to the grading dened by some w 2 C. Call this map T. Consider the image of a root j; () under T. This is a polynomial (with fractional exponents) having at least distinct terms, one for the lowest term in (3.4) and at least? for the distinct values of r coming from (3.). The coecients of these terms are distinct powers of. These considerations imply that the images of the roots j; () under T are linearly independent. Therefore the roots themselves are linearly independent? over C. Moreover, they all satisfy? the A-hypergeometric system with parameter, by Proposition 2.. We conclude that the space H is n-dimensional and the roots j; () form a basis for H. We wish to prove j; () = X j;. It suces to show T ( j; ()) = T (X j; ) because the functional T dened above separates the space H. Equivalently, given any generic w in C, we must show that, in the w-grading, X j; has the same rst two terms as j;(). This is clear for the rst term, so we only need to look at the second term r?? a r a (r?)=? a (??r?)=. Let a v denote this monomial. Let k be the unique integer between and such that r is congruent to??k modulo. If k = then a v equals the second lowest term (with respect to w) of the series [a =? a?= ]. If 2 k? then a v equals the w-lowest term of the series indexed by k in the central sum in the denition of X j;. For k = there are two subcases: if r >? then a v equals the w-lowest term of the series indexed by k = in the center sum; if r <? then a v equals the w-lowest term of the rightmost series [a ij??=a ij?]. In each of these four cases a v is the second lowest term in X j;. This completes the proof of Theorem

8 4. Integrality Issues To prove the identity f(x j; ) = in Theorem 3.2 we used the complex numbers. But, a posteriori, there is no need to stick with an algebraically closed eld of characteristic zero. If K is any integral domain such that the equation =? has distinct solutions and the coecients of X j; are dened in K, then f(x j; ) = is a valid identity in a suitable fractional power series ring over K. The following result shows that K can be an algebraically closed eld of characteristic p, provided p is relatively prime to d d 2 d r. The proof of Theorem 4. using Hensel's Lemma was suggested to me by Hendrik Lenstra. Theorem 4.. All coecients of the series X j; lie in the ring Z[ ][]. Proof: The series j; (t) in (3.4) lies in the fractional power series ring R [[t ]], where R := Q[ ] a s : s 62 f? ; g [a? ; a ]: This holds because! is integral and each term of X j;xi = j; () lies in R. To prove Theorem 4., it suces to show that j; (t) is an element of the subring R 2 [[t ]], where R 2 := Z[ ][ ] a s : s 62 f? ; g [a? ; a ]: We shall apply Hensel's Lemma [, Theorem 7.3] to the integral domain R 2 [[t ]]. This domain is complete with respect to the principal ideal m := ht i, and it contains all coecients of the polynomial f t (x) in (3.3). The constant term of j; (t) lies in R 2 ; we? a? denote it by A := a. It is an \approximate root" in the sense that f t (A) 2 m and ft(a) is the sum of a unit in R 2 and an element of m. By Hensel's Lemma there exists a unique element B in R 2 [[t ]] such that ft (B) = and A? B 2 m. By repeating the uniqueness part of this application of Hensel's Lemma for the coecient domain R instead of R 2, we conclude that B must be equal to our Puiseux series j; (t). A case of special interest is the nest triangulation, where I = f; 2; : : : ; n?g, r = n, = for all j. Theorem 4. implies that in this case our construction is characteristic-free. In other words, the series solutions X j;? have integer coecients. These series are X j;? =? aj? a j aj?2 a j? for j = ; 2; : : : ; n (4:) a where j? a j is the sum over all Laurent monomials (?)? i : : :? : : : i n ai ai a?2 j?2 a? j? a j ai n n a j (4:2) 8

9 where i ; i ; : : : ; i n are non-negative integers satisfying the relations i i i 2 i 3?? i n = i 2i 2 3i 3 (j? )?? j (j ) ni n = : (4:3) For generating the series a j? a j on a computer it convenient to rewrite (4.3) as follows.? =?ji? (j? )i? (j? 2)i 2?? 2?2 22 (n? j)i n ; =?(j? )i? (j? 2)i??? (n? j )i n : These equations ensure that the multinomial coecient in (4.3) is divisible by?.. Multivariate Outlook Consider a system of n polynomial equations in n variables, where the terms in the i- th equation have their exponent vectors in a xed set A i Z n. (This is the meaning of \sparse" in [9]). By Bernstein's Theorem, the system has mixed volume many roots (X ; : : : ; X n ). Each coordinate X i is an algebraic function in all the coecients. It is natural to wonder whether X i satises the A-hypergeometric dierential equations where A is the conguration arising from the \Cayley trick" (cf. [7, 2.], [8, page 273]): A := A fe g [ A 2 fe 2 g [ [ A n fe n g Z 2n : The answer is no. The coordinates of the roots (X ; : : : ; X n ) are not A-hypergeometric. For example, let (X ; X 2 ) be the unique solution of the system of two linear equations Then we nd a a x x 2 = b b x b 2 x 2 = : Note also that Mayr's dierential equations (4) and (4) in [] are no longer binomial. The correct generalization of Proposition 2. to higher dimensions is the following. Let J(x ; : : : ; x n ) denote the Jacobian j ) of the given equations f = = f n =. Proposition.. For any integers u ; u 2 ; : : : ; u n the algebraic function X u Xu 2 2 Xu n n J(X ; X 2 ; : : : ; X n ) (:) satises the A-hypergeometric dierential equations arising from the Cayley trick. Over the eld of complex numbers, we can derive Proposition. from Theorem 2.7 in [7] using Cauchy's formula in several variables. An alternative algebraic proof follows from 9

10 the construction in [, x2]. The quantity in (.) should be thought of as a local residue on a toric variety [4]. The sum over all (mixed volume many) local residues is the global residue associated with the monomial x u xu n n relative to the given equations f = = f n =. The global residue is a rational function. It is of importance in elimination theory. We plan to extend the techniques in Section 3 to the setting of Proposition. in a subsequent joint work with E. Cattani and A. Dickenstein. The goal of that project is to develop new formulas and algorithms for computing local and global residues. Another interesting question is whether explicit Puiseux series expansions of (.) might be useful to improve the numerical component in the homotopy algorithm proposed in [9]. References [] A. Adolphson and S. Sperber: Dierential modules dened by systems of equations, Seminario Rendiconti di Universita di Padova, to appear. [2] R. Birkeland: Uber die Auosung algebraischer Gleichungen durch hypergeometrische Funktionen, Mathematische Zeitschrift 26 (927) 6{78. [3] J.-L. Brylinski: Radon transform and functionals on the space of curves, Manuscript, 993. [4] E. Cattani, D. Cox, A. Dickenstein: Residues in toric varieties, Manuscript, 99. [] D. Eisenbud: Commutative Algebra with a View Towards Algebraic Geometry, Graduate Texts in Mathematics, Springer Verlag, New York, 99. [6] I.M. Gel'fand, A.V. Zelevinsky and M.M. Kapranov: Hypergeometric functions and toral manifolds, Functional Analysis and its Applications 23 (989) 94{6. [7] I.M. Gel'fand, A.V. Zelevinsky and M.M. Kapranov: Generalized Euler integrals and A-hypergeometric functions, Advances in Mathematics (99) 84 2{27. [8] I.M. Gel'fand, A.V. Zelevinsky and M.M. Kapranov: Discriminants, Resultants, and Multidimensional Determinants, Birkhauser, Boston, 994. [9] B. Huber and B. Sturmfels: A polyhedral method for solving sparse polynomial systems, Mathematics of Computation 64 (99) 4{. [] K. Mayr: Uber die Auosung algebraischer Gleichungssysteme durch hypergeometrische Funktionen, Monatshefte fur Mathematik und Physik 4 (937) 28{33. [] J. McDonald: Fiber polytopes and fractional power series, Journal of Pure and Applied Algebra, to appear. [2] Solving the Quintic with Mathematica, poster distributed by Wolfram Research, 994.

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea

(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract

More information

AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS

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

More information

Hypergeometric functions with integer homogeneities

Hypergeometric functions with integer homogeneities Hypergeometric functions with integer homogeneities Alicia Dickenstein Abstract. We survey several results on A-hypergeometric systems of linear partial differential equations introduced by Gelfand, Kapranov

More information

Rational hypergeometric functions

Rational hypergeometric functions University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Publication Series Mathematics and Statistics 2001 Rational hypergeometric functions E Cattani

More information

Polynomials, Ideals, and Gröbner Bases

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

More information

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

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

More information

THE HADAMARD PRODUCT OF HYPERGEOMETRIC SERIES

THE HADAMARD PRODUCT OF HYPERGEOMETRIC SERIES ISSN: 1401-5617 THE HADAMARD PRODUCT OF HYPERGEOMETRIC SERIES T.M. Sadykov Research Reports in Mathematics Number 2, 2001 Department of Mathematics Stockholm University Electronic versions of this document

More information

Tropical Algebraic Geometry

Tropical Algebraic Geometry Tropical Algebraic Geometry 1 Amoebas an asymptotic view on varieties tropicalization of a polynomial 2 The Max-Plus Algebra at Work making time tables for a railway network 3 Polyhedral Methods for Algebraic

More information

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

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

More information

ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p

ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p BJORN POONEN 1. Statement of results Let K be a field of characteristic p > 0 equipped with a valuation v : K G taking values in an ordered

More information

Polytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis

Polytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem

More information

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection

More information

Lecture 1. Toric Varieties: Basics

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

More information

COMBINATORICS OF HYPERGEOMETRIC FUNCTIONS ASSOCIATED WITH POSITIVE ROOTS

COMBINATORICS OF HYPERGEOMETRIC FUNCTIONS ASSOCIATED WITH POSITIVE ROOTS COMBINATORICS OF HYPERGEOMETRIC FUNCTIONS ASSOCIATED WITH POSITIVE ROOTS Israel M. Gelfand Department of Mathematics Rutgers University New Brunswick, NJ 08903, U.S.A. E-mail: igelfand@math.rutgers.edu

More information

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix

More information

Binomial Exercises A = 1 1 and 1

Binomial 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 information

On some properties of elementary derivations in dimension six

On 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 information

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

More information

The following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of

The following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of An algorithm for computing the Weierstrass normal form Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands e-mail: hoeij@sci.kun.nl April 9, 1995 Abstract This

More information

Discriminants, resultants, and their tropicalization

Discriminants, resultants, and their tropicalization Discriminants, resultants, and their tropicalization Course by Bernd Sturmfels - Notes by Silvia Adduci 2006 Contents 1 Introduction 3 2 Newton polytopes and tropical varieties 3 2.1 Polytopes.................................

More information

An introduction to Hodge algebras

An introduction to Hodge algebras An introduction to Hodge algebras Federico Galetto May 28, 2009 The Grassmannian Let k be a field, E a k-vector space of dimension m Define Grass(n, E) := {V E dim V = n} If {e 1,, e m } is a basis of

More information

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

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

More information

Classication of Quadratic Forms

Classication of Quadratic Forms Classication of Quadratic Forms Manuel Araújo September 14, 2011 Abstract We present the classication of quadratic forms over the rationals and then describe a partial classication of quadratic forms over

More information

Tropical Algebraic Geometry 3

Tropical 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 information

Solving Algebraic Equations in Terms of A-Hypergeometric Series. Bernd Sturmfels. Department of Mathematics. University of California

Solving Algebraic Equations in Terms of A-Hypergeometric Series. Bernd Sturmfels. Department of Mathematics. University of California Solving Algebric Equtions in Terms of A-Hypergeometric Series Bernd Sturmfels Deprtment of Mthemtics University of Cliforni Berkeley, CA 9472, U.S.A. bernd@mth.berkeley.edu Abstrct The roots of the generl

More information

COMBINATORICS OF RANK JUMPS IN SIMPLICIAL HYPERGEOMETRIC SYSTEMS

COMBINATORICS 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 information

Problems on Minkowski sums of convex lattice polytopes

Problems on Minkowski sums of convex lattice polytopes arxiv:08121418v1 [mathag] 8 Dec 2008 Problems on Minkowski sums of convex lattice polytopes Tadao Oda odatadao@mathtohokuacjp Abstract submitted at the Oberwolfach Conference Combinatorial Convexity and

More information

Lifting to non-integral idempotents

Lifting to non-integral idempotents Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,

More information

Topics in linear algebra

Topics in linear algebra Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over

More information

Elementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),

Elementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q), Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes

More information

The planar resolution algorithm

The planar resolution algorithm The planar resolution algorithm Dumitru Stamate 1 Introduction Let I = < m 1,..., m r > S := K[x 1,..., x n ] be an arbitrary monomial ideal, where K is a field. As we saw in [5], by computing the Scarf

More information

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

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

More information

REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS. Eduardo D. Sontag. SYCON - Rutgers Center for Systems and Control

REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS. Eduardo D. Sontag. SYCON - Rutgers Center for Systems and Control REMARKS ON THE TIME-OPTIMAL CONTROL OF A CLASS OF HAMILTONIAN SYSTEMS Eduardo D. Sontag SYCON - Rutgers Center for Systems and Control Department of Mathematics, Rutgers University, New Brunswick, NJ 08903

More information

SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS

SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS Bernd Sturmfels Department of Mathematics University of California at Berkeley Berkeley CA 94720, USA bernd@math.berkeley.edu May 17, 2002 Howdy readers, These are

More information

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin

More information

arxiv: v1 [quant-ph] 19 Jan 2010

arxiv: v1 [quant-ph] 19 Jan 2010 A toric varieties approach to geometrical structure of multipartite states Hoshang Heydari Physics Department, Stockholm university 10691 Stockholm Sweden arxiv:1001.3245v1 [quant-ph] 19 Jan 2010 Email:

More information

An Additive Characterization of Fibers of Characters on F p

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

More information

Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm

Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm Poteaux Adrien XLIM-DMI UMR CNRS 6172 Université de Limoges, France SNC'07 University of

More information

On the Parameters of r-dimensional Toric Codes

On the Parameters of r-dimensional Toric Codes On the Parameters of r-dimensional Toric Codes Diego Ruano Abstract From a rational convex polytope of dimension r 2 J.P. Hansen constructed an error correcting code of length n = (q 1) r over the finite

More information

Open Problems in Algebraic Statistics

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

More information

Balanced configurations of 2n + 1 plane vectors

Balanced configurations of 2n + 1 plane vectors Balanced configurations of n + 1 plane vectors RessayreNicolas (ressayre@math.univ-montp.fr) Université Montpellier II, Département de Mathématiques, UMR 5030 Case courrier 51- Place Eugène Bataillon,

More information

Section III.6. Factorization in Polynomial Rings

Section 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 information

4. Noether normalisation

4. 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 information

Tropical Approach to the Cyclic n-roots Problem

Tropical Approach to the Cyclic n-roots Problem Tropical Approach to the Cyclic n-roots Problem Danko Adrovic and Jan Verschelde University of Illinois at Chicago www.math.uic.edu/~adrovic www.math.uic.edu/~jan 3 Joint Mathematics Meetings - AMS Session

More information

PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM

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

More information

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial

4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and

More information

THE HEIGHT OF THE MIXED SPARSE RESULTANT

THE 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 information

1 Polynomials in One Variable

1 Polynomials in One Variable 1 Polynomials in One Variable The study of systems of polynomial equations in many variables requires a good understanding of what can be said about one polynomial equation in one variable. The purpose

More information

2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene

2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based

More information

TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS

TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be

More information

Rational Univariate Reduction via Toric Resultants

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

More information

Tropical Varieties. Jan Verschelde

Tropical Varieties. Jan Verschelde Tropical Varieties Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational Algebraic

More information

Tropical Elliptic Curves and their j-invariant

Tropical Elliptic Curves and their j-invariant and their j-invariant (joint work with Eric Katz and Hannah Markwig) Elliptic Tropical Thomas Markwig Technische Universität Kaiserslautern 15th February, 2008 Elliptic Tropical The tropical j-invariant

More information

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

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

More information

Hodge theory for combinatorial geometries

Hodge theory for combinatorial geometries Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that

More information

Polynomial functions over nite commutative rings

Polynomial functions over nite commutative rings Polynomial functions over nite commutative rings Balázs Bulyovszky a, Gábor Horváth a, a Institute of Mathematics, University of Debrecen, Pf. 400, Debrecen, 4002, Hungary Abstract We prove a necessary

More information

FREE DIVISORS IN A PENCIL OF CURVES

FREE DIVISORS IN A PENCIL OF CURVES Journal of Singularities Volume 11 (2015), 190-197 received: 17 February 2015 in revised form: 26 June 2015 DOI: 10.5427/jsing.2015.11h FREE DIVISORS IN A PENCIL OF CURVES JEAN VALLÈS Abstract. A plane

More information

Betti Numbers of Splittable Graphs

Betti Numbers of Splittable Graphs Betti Numbers of Splittable Graphs Brittany Burns Dept. of Mathematical Sciences Shawnee State University, Portsmouth, OH 45662 USA Haley Mansfield Dept. of Mathematics Kansas State University, Manhattan,

More information

Counterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co

Counterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is

More information

DISCRETE INVARIANTS OF GENERICALLY INCONSISTENT SYSTEMS OF LAURENT POLYNOMIALS LEONID MONIN

DISCRETE INVARIANTS OF GENERICALLY INCONSISTENT SYSTEMS OF LAURENT POLYNOMIALS LEONID MONIN DISCRETE INVARIANTS OF GENERICALLY INCONSISTENT SYSTEMS OF LAURENT POLYNOMIALS LEONID MONIN Abstract. Consider a system of equations f 1 = = f k = 0 in (C ) n, where f 1,..., f k are Laurent polynomials

More information

Properties of Arithmetical Functions

Properties of Arithmetical Functions Properties of Arithmetical Functions Zack Clark Math 336, Spring 206 Introduction Arithmetical functions, as dened by Delany [2], are the functions f(n) that take positive integers n to complex numbers.

More information

Lecture 1. Frits Beukers. October 23, Lecture 1 October 23, / 34

Lecture 1. Frits Beukers. October 23, Lecture 1 October 23, / 34 Lecture 1 Frits Beukers October 23, 2018 Lecture 1 October 23, 2018 1 / 34 Gauss hypergeometric function Euler and Gauss defined 2F 1 ( α β γ ) z = n=0 (α) n (β) n n!(γ) n z n where (x) n = x(x + 1) (x

More information

2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable

2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable Deciding positivity of real polynomials Eberhard Becker, Victoria Powers, and Thorsten Wormann Abstract. We describe an algorithm for deciding whether or not a real polynomial is positive semidenite. The

More information

Thus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally

Thus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally Math 248A. Discriminants and étale algebras Let A be a noetherian domain with fraction field F. Let B be an A-algebra that is finitely generated and torsion-free as an A-module with B also locally free

More information

2 ALGEBRA II. Contents

2 ALGEBRA II. Contents ALGEBRA II 1 2 ALGEBRA II Contents 1. Results from elementary number theory 3 2. Groups 4 2.1. Denition, Subgroup, Order of an element 4 2.2. Equivalence relation, Lagrange's theorem, Cyclic group 9 2.3.

More information

LECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2 1

LECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2  1 LECTURE 5 Characteristics and the Classication of Second Order Linear PDEs Let us now consider the case of a general second order linear PDE in two variables; (5.) where (5.) 0 P i;j A ij xix j + P i,

More information

Computing Minimal Polynomial of Matrices over Algebraic Extension Fields

Computing 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 information

Monomial Bases and Polynomial System Solving. (Extended Abstract) question is the construction of an explicit monomial

Monomial Bases and Polynomial System Solving. (Extended Abstract) question is the construction of an explicit monomial Monomial Bases and Polynomial System Solving (Extended Abstract) Ioannis Z Emiris Ashutosh Rege Abstract This paper addresses the problem of ecient construction of monomial bases for the coordinate rings

More information

MATH98 Intermediate Algebra Practice Test Form A

MATH98 Intermediate Algebra Practice Test Form A MATH98 Intermediate Algebra Practice Test Form A MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the equation. 1) (y - 4) - (y + ) = 3y 1) A)

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: June 12, 2017 8 Upper Bounds and Lower Bounds In this section, we study the properties of upper bound and lower bound of cluster algebra.

More information

Domain and range of exponential and logarithmic function *

Domain and range of exponential and logarithmic function * OpenStax-CNX module: m15461 1 Domain and range of exponential and logarithmic function * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License

More information

For example, if M = where A,,, D are n n matrices over F which all commute with each other, then Theorem 1says det F M = det F (AD, ): (2) Theorem 1 w

For example, if M = where A,,, D are n n matrices over F which all commute with each other, then Theorem 1says det F M = det F (AD, ): (2) Theorem 1 w Determinants of lock Matrices John R. Silvester 1 Introduction Let us rst consider the 2 2 matrices M = a b c d and product are given by M + N = a + e b + f c + g d + h and MN = and N = e f g h ae + bg

More information

ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS

ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS ALGORITHMIC COMPUTATION OF POLYNOMIAL AMOEBAS D. V. Bogdanov 1, A. A. Kytmanov 2, and T. M. Sadykov 3 1 Plekhanov Russian University arxiv:1604.03603v1 [cs.cg] 12 Apr 2016 125993 Moscow, Russia bogdv@rambler.ru

More information

Tropical Algebraic Geometry in Maple. Jan Verschelde in collaboration with Danko Adrovic

Tropical Algebraic Geometry in Maple. Jan Verschelde in collaboration with Danko Adrovic Tropical Algebraic Geometry in Maple Jan Verschelde in collaboration with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/

More information

294 Meinolf Geck In 1992, Lusztig [16] addressed this problem in the framework of his theory of character sheaves and its application to Kawanaka's th

294 Meinolf Geck In 1992, Lusztig [16] addressed this problem in the framework of his theory of character sheaves and its application to Kawanaka's th Doc. Math. J. DMV 293 On the Average Values of the Irreducible Characters of Finite Groups of Lie Type on Geometric Unipotent Classes Meinolf Geck Received: August 16, 1996 Communicated by Wolfgang Soergel

More information

q-alg/ Mar 96

q-alg/ Mar 96 Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald

More information

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and

More information

Tori for some locally integral group rings

Tori for some locally integral group rings Tori for some locally integral group rings Diagonalizability over a principal ideal domain Master's Thesis Fabian Hartkopf May 217 Contents Preface............................................... 5.1 Introduction..........................................

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

Garrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f

Garrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f 1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation

More information

Reciprocal domains and Cohen Macaulay d-complexes in R d

Reciprocal domains and Cohen Macaulay d-complexes in R d Reciprocal domains and Cohen Macaulay d-complexes in R d Ezra Miller and Victor Reiner School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA ezra@math.umn.edu, reiner@math.umn.edu

More information

Follow this and additional works at:

Follow this and additional works at: University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Publication Series Mathematics and Statistics 2002 Binomial residues E Cattani University of

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

Powers and Products of Monomial Ideals

Powers and Products of Monomial Ideals U.U.D.M. Project Report 6: Powers and Products of Monomial Ideals Melker Epstein Examensarbete i matematik, 5 hp Handledare: Veronica Crispin Quinonez Examinator: Jörgen Östensson Juni 6 Department of

More information

Iterative procedure for multidimesional Euler equations Abstracts A numerical iterative scheme is suggested to solve the Euler equations in two and th

Iterative procedure for multidimesional Euler equations Abstracts A numerical iterative scheme is suggested to solve the Euler equations in two and th Iterative procedure for multidimensional Euler equations W. Dreyer, M. Kunik, K. Sabelfeld, N. Simonov, and K. Wilmanski Weierstra Institute for Applied Analysis and Stochastics Mohrenstra e 39, 07 Berlin,

More information

Max-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed

More information

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2

2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2 1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert

More information

Smale s Mean Value Conjecture. and Related Problems. The University of Hong Kong

Smale s Mean Value Conjecture. and Related Problems. The University of Hong Kong Smale s Mean Value Conjecture and Related Problems Patrick, Tuen-Wai Ng The University of Hong Kong IMS, NUS, 3 May 2017 Content 1) Introduction to Smale s mean value conjecture. 2) Introduction to theory

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 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 information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

More information

J. Symbolic Computation (1995) 11, 1{000 An algorithm for computing an integral basis in an algebraic function eld Mark van Hoeij Department of mathem

J. Symbolic Computation (1995) 11, 1{000 An algorithm for computing an integral basis in an algebraic function eld Mark van Hoeij Department of mathem J. Symbolic Computation (1995) 11, 1{000 An algorithm for computing an integral basis in an algebraic function eld Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands

More information

Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions

Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions (joint talk with Andrei Khrennikov) Dr. Ekaterina Yurova Axelsson Linnaeus University, Sweden September 8, 2015 Outline Denitions

More information

AN INTRODUCTION TO TORIC SURFACES

AN INTRODUCTION TO TORIC SURFACES AN INTRODUCTION TO TORIC SURFACES JESSICA SIDMAN 1. An introduction to affine varieties To motivate what is to come we revisit a familiar example from high school algebra from a point of view that allows

More information

Tropicalizations of Positive Parts of Cluster Algebras The conjectures of Fock and Goncharov David Speyer

Tropicalizations of Positive Parts of Cluster Algebras The conjectures of Fock and Goncharov David Speyer Tropicalizations of Positive Parts of Cluster Algebras The conjectures of Fock and Goncharov David Speyer This talk is based on arxiv:math/0311245, section 4. We saw before that tropicalizations look like

More information

5 Dedekind extensions

5 Dedekind extensions 18.785 Number theory I Fall 2016 Lecture #5 09/22/2016 5 Dedekind extensions In this lecture we prove that the integral closure of a Dedekind domain in a finite extension of its fraction field is also

More information

Essentials of Intermediate Algebra

Essentials of Intermediate Algebra Essentials of Intermediate Algebra BY Tom K. Kim, Ph.D. Peninsula College, WA Randy Anderson, M.S. Peninsula College, WA 9/24/2012 Contents 1 Review 1 2 Rules of Exponents 2 2.1 Multiplying Two Exponentials

More information

Combinatorics and geometry of E 7

Combinatorics 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 information

THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Q p

THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Q p THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Q p EVAN TURNER Abstract. This paper will focus on the p-adic numbers and their properties. First, we will examine the p-adic norm and look at some of

More information

A degree bound for codimension two lattice ideals

A 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 information

Applied Mathematics &Optimization

Applied Mathematics &Optimization Appl Math Optim 29: 211-222 (1994) Applied Mathematics &Optimization c 1994 Springer-Verlag New Yor Inc. An Algorithm for Finding the Chebyshev Center of a Convex Polyhedron 1 N.D.Botin and V.L.Turova-Botina

More information