An alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota
|
|
- Cornelius Warren
- 5 years ago
- Views:
Transcription
1 An alternative evaluation of the Andrews{Burge determinant C. Krattenthaler y Dedicated to Gian-Carlo Rota Abstract. We give a short, self-contained evaluation of the Andrews{Burge determinant (Pacic J. Math. 58 (994), {4).. Introduction In [9, Theorem ], Andrews and Burge proved a determinant evaluation equivalent to x i j y i j (.) det 0i;j i j i j = () (n3 mod 4) (n ) j= xy j b(j)=c xy bj=c 3n j 3 ; (j) j where the shifted factorial (a) k is given by (a) k := a(a ) (a k ), k, (a) 0 :=, and where (A)= if A is true and (A)=0 otherwise. This determinant identity arose in connection with the enumeration of symmetry classes of plane partitions. The known proofs [9, 0] of (.) require that one knows (.) to hold for x = y. Indeed, the latter was rst established by Mills, Robbins and Rumsey [5, p. 53], in turn using another determinant evaluation, due to Andrews [3], whose proof is rather complicated. In the meantime, simpler proofs of the x = y special case of (.) were found by Andrews [7], Andrews and Stanton [8], and Petkovsek and Wilf [6]. In this note we describe a new, concise, and self-contained proof of (.), see section 3. y Supported in part by EC's Human Capital and Mobility Program, grant CHRX-CT and the Austrian Science Foundation FWF, grant P09-MAT 99 Mathematics Subject Classication. Primary 5A5; Secondary 05A5, 05A7, 33C0. Key words and phrases. determinant evaluations, hypergeometric series, enumeration of symmetry classes of plane partitions. Typeset by AMS-TEX
2 C. Krattenthaler In fact, the main purpose of this note is to popularize the method that I use to prove (.) (see section for a description). This method is simple but powerful. Aside from this note, evidence for this claim can be found e.g. in [,, 3, 4]. Thus, the method enlarges the not at all abundant collection of methods for evaluating determinants. In fact, aside from elementary manipulations by row and column operations, we are just aware of one other method, namely Andrews' \favourite" method of evaluating determinants (cf. [,, 3, 4, 5, 6, 8]), which basically consists of guessing and then proving the LU-factorization of the matrix in question (i.e., the factorization of the matrix into a product of a lower triangular times an upper triangular matrix). We should, however, also point out a limitation of our method. Namely, in order to be able to apply our method, we need a free parameter occuring in the determinant. (In (.) there are even two, x and y.) Andrews' method, on the other hand, might still be applicable if there is no free parameter present. Still, it is safe to speculate that many more applications of our method are going to be found in the future.. The method The method that I use to prove (.) is as follows. Suppose we have a matrix fij (x) with entries 0i;j f ij(x) which are polynomials in x, and we want to prove the explicit factorization of det f ij (x) as a polynomial in x, (.) det fij (x) = C(n) (x a l (n)) ml(n) ; 0i;j l where C(n); a l (n); m l (n) are independent of x, and the a l (n)'s are pairwise dierent for xed n. Then, in the rst step, for each l we nd m l (n) linearly independent linear combinations of the columns, or of the rows, which vanish for x = a l (n). In different, but equivalent terms, we nd m l (n) linearly independent vectors in the kernel of our matrix evaluated at x = a l (n), i.e., in the kernel of f ij (a l (n)), or of its transpose. That this really guarantees that (x a l (n)) m l(n) is a factor of the determinant is a fact that might not be well-known enough. Therefore, for the sake of completeness, we state it as a lemma at the end of this section and provide a proof for it. The nding of a l (n) linearly independent linear combinations of columns or rows which vanish for x = a l (n) (equivalently, linearly independent vectors in the kernel of the matrix, or its transpose, evaluated at x = a l (n)) can be done with some skill (and primarily patience) by setting x = a l (n) in the matrix f ij (x), computing tables for the coecients of the linear combinations for n = ; ; : : : (by solving the respective systems of linear equations on the computer), and nally guessing what the general pattern of the coecients could be. To prove that the guess is correct, in case of binomial determinants (such as the one in (.)) one has to verify certain binomial identities. But this is pure routine today, by means of Zeilberger's algorithm [8, 9].
3 An alternative evaluation of the Andrews{Burge determinant 3 Next, in the second step, one checks the degrees of both sides of (.) as polynomials in x. If it should happen that the degree of det f ij (x) is not larger than P l m l(n), the degree of the right-hand side, then it follows by what we did in the rst step that the determinant det f ij (x) has indeed the form of the right-hand side of (.), where C(n) is some unknown constant. This constant can then be determined in the third step by comparison of coecients of a suitable power of x. Finally, here is the promised lemma, and its proof. Lemma. Let A = A(x) be a matrix whose entries are polynomials in x, and u a number. If dim Ker A(u) k, then u is a root of det A(x) of multiplicity at least k. Proof. Let v ; v ; : : :; v k be k linearly independent (column) vectors in the kernel of A(u). Without loss of generality, we may assume that v ; v ; : : :; v k are such that the matrix [v ; v ; : : :; v k ], formed by gluing the columns v ; v ; : : :; v k to a matrix, is in column-echelon form. In addition, again without loss of generality, we may assume that for any i = ; ; : : :; k the vector v i is of the form v i = (0; : : :; 0; ; : : :) t, i.e., the rst i entries are 0, the i-th entry is, and the remaining entries could be anything. (To justify \without loss of generality" one would possibly have to permute the columns of A.) Now we consider the matrix A ~ = A(x), ~ formed by replacing for i = ; ; : : :; k the i-th column of A by the column Av i. It is an easy observation that A ~ and A are related by elementary column operations. Therefore, their determinants are the same. On the other hand, the i-th column of A(u) ~ is A(u)v i = 0, for any i = ; ; : : :; k. Hence, each entry of Av i, being a polynomial in x, must be divisible by (x u). Therefore, in the determinant det A, ~ we may take (x u) out of the i-th column, i = ; ; : : :; k, with the entries in the remaining determinant still being polynomials in x. This proves that (x u) k divides det A ~ = det A, and, thus, the lemma. 3. Proof of (.) As announced in the previous section, the proof consists of three steps. For convenience, let us denote the determinant in (.) by AB(x; y; n), or sometimes just AB(n) for short. Step. Identication of the factors. We show that the product on the right-hand side of (.), j= xy j b(j)=c xy 3n j 3 bj=c ;
4 4 C. Krattenthaler is indeed a factor of AB(n), in the way that was described in section. Let us rst consider just one part of this product, j= ((x y)= j ) b(j)=c : Let us concentrate on a typical factor (x y j l), j n, l (j )=. We claim that for each such factor there is a linear combination of the columns that vanishes if the factor vanishes. More precisely, we claim that for any j; l with j n, l (j )= there holds (3.) b(jl)=c X s=l (j l ) (j s) (j l s) sl (s l )! (column s of AB(y j l; y; n)) (column j of AB(y j l; y; n)) = 0: To avoid confusion, for j = l it is understood by convention that the sum in the rst line of (3.) vanishes. To establish the claim, we have to check (3.) b(jl)=c X s=l (j l ) (j l s) sl (j s) (s l )! y j l i s y i s i s i s y j l i y i j i j i j = 0: The exceptional case j = l can be treated immediately. By assumption the sum in the rst line of (3.) vanishes for j = l, and, by inspection, also the last line in (3.) vanishes for j = l. So we are left with establishing (3.) for l j=. In terms of the usual hypergeometric notation this means to check (3.3) rf s a ; : : :; a r b ; : : :; b s ; z ( i j l y) il ( i l)! = X k=0 (a ) k (a r ) k k! (b ) k (b s ) k z k ; 4 F j l; j l; i l; i j y 3 j l; i j l y ; i j l y ; ( i 4l y) il ( i l)! l; i l; i l y j l; i l y ; i l y y j l i y i j = 0; i j i j 4F 3 j l; j ;
5 An alternative evaluation of the Andrews{Burge determinant 5 for j n, l j=. This identity can be proved routinely by means of Zeilberger's algorithm [8, 9] and Salvy and Zimmermann's Maple package GFUN [7]. However, it happens that a 4 F 3 -summation is already known that applies to both 4 F 3 -series in (3.3), namely Lemma in [9]. (Here we need the assumption l Q j=.) Little simplication then establishes (3.3) and hence the claim. Thus, j= ((x y)= j ) b(j)=c is a factor of AB(n). Now we prove that j= (x y)= 3n j 3 bj=c is a factor of AB(n). Also here, let us concentrate on a typical factor (x y 6n j l ), j n, l j=. This time we claim that for each such factor there is a linear combination of the columns that vanishes if the factor vanishes. More precisely, we claim that for any j; l with j n, l j= there holds Xnl s= (n j s) jl (n l j) jl (s) nls (3n l j ) nls 4 nls (n l s)! (n j ) nls This means to check Xnl s= (column s of AB(y 6n j l ; y; n)) = 0: (n j s) jl (s) nls (3n l j ) nls (n l j) jl 4 nls (n l s)! (n j ) nls y 6n j l i s y i s i s i s Converting this into hypergeometric notation and cancelling some factors, we see that we have to check (3.4) (4 i j l 6n y) i i; 5 5 F j l 3n; j n; 4 4 j 4n; l n; i j l 3n y ; = (3 i y) i l n; 3 i j l 6n y 5 i j l 3n y ; i; 5 5 F j l 3n; j n; l n; i y 4 4 j 4n; l n; 3 i y ; i y Again, in view of Zeilberger's algorithm, this is pure routine. However, also this identity happens to be already in the literature. It is exactly identity (5.7) = 0 ;
6 6 C. Krattenthaler in [8], with a = Q 3 i j l 3n y, x = 3 j l 3n, z = j n, p = i. Thus, j= (x y)= 3n j 3 is a factor of AB(n). bj=c Step. Bounding the polynomial degrees. The degree of AB(n) as a polynomial in x is obviously at most. But the degree of the product on the n n right-hand side of (.) is exactly. Therefore it follows that x i j y i j (3.5) det 0i;j i j i j = C(n) xy j b(j)=c xy 3n j 3 bj=c ; j= with some C(n) independent of x, and, by symmetry, also independent of y. Step 3. Determining the constant. To compute C(n), on both sides of (3.5) set y = x and then compare coecients of x (n ). On the right-hand side the coecient is () (n3 mod 4) C(n), whereas on the left-hand side the coecient is det 0i;j (i j)! = n i=0 = n i=0 = n i=0 (i)! (i)! (i)! = n(n ) i=0 = (n ) i= det (i j )j 0i;j det (i) j 0i;j 0i<j i! (i)! (i) i ; (j i) where in the step from the rst to the second line we used elementary column operations, and the subsequent step is just the Vandermonde determinant evaluation. This completes the proof of (.). References [] G. E. Andrews, Plane partitions (II): The equivalence of the Bender{Knuth and the MacMahon conjectures, Pacic J. Math. 7 (977), 83{9. [] G. E. Andrews, Plane partitions (I): The MacMahon conjecture, in: Studies in Foundations and Combinatorics, G.-C. Rota (ed.), Adv. in Math. Suppl. Studies, Vol., 978, 3{50.
7 An alternative evaluation of the Andrews{Burge determinant 7 [3] G. E. Andrews, Plane partitions (III): The weak Macdonald conjecture, Inventiones Math. 53 (979), 93{5. [4] G. E. Andrews, Macdonald's conjecture and descending plane partitions, in: Combinatorics, representation theory and statistical methods in groups, oung Day Proceedings, T. V. Narayana, R. M. Mathsen, J. G. Williams (eds.), Lecture Notes in Pure Math., vol. 57, Marcel Dekker, New ork, Basel, 980, 9{06. [5] G. E. Andrews, Plane partitions (IV): A conjecture of Mills{Robbins{ Rumsey, Aequationes Math. 33 (987), 30{50. [6] G. E. Andrews, Plane partitions V: The t.s.s.c.p.p. conjecture, J. Combin. Theory Ser. A 66 (994), 8{39. [7] G. E. Andrews, Pfa's method (I): The Mills{Robbins{Rumsey determinant, preprint. [8] G. E. Andrews and D. W. Stanton, Determinants in plane partition enumeration, preprint. [9] G. E. Andrews and W. H. Burge, Determinant identities, Pacic J. Math. 58 (993), {4. [0] I. P. Goulden and D. M. Jackson, Further determinants with the averaging property of Andrews{Burge, J. Combin. Theory Ser. A 73 (996), 368{375. [] C. Krattenthaler, Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions, Elect. J. Combin. (to appear). [] C. Krattenthaler, Some q-analogues of determinant identities which arose in plane partition enumeration, Seminaire Lotharingien Combin. (to appear). [3] C. Krattenthaler, A new proof of the MRR-conjecture including a generalization, preprint. [4] G. Kuperberg, Another proof of the alternating sign matrix conjecture, Math. Research Letters (996), 39{50. [5] W. H. Mills, D. H. Robbins and H. Rumsey, Enumeration of a symmetry class of plane partitions, Discrete Math. 67 (987), 43{55. [6] M. Petkovsek and H. Wilf, A high-tech proof of the Mills-Robbins-Rumsey determinant formula, Elect. J. Combin. 3 (no., \The Foata Festschrift") (996), #R9, 3 pp. [7] B. Salvy and P. Zimmermann, GFUN A MAPLE package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 0 (994), 63{77. [8] D. Zeilberger, A fast algorithm for proving terminating hypergeometric identities, Discrete Math. 80 (990), 07{. [9] D. Zeilberger, The method of creative telescoping, J. Symbolic Comput. (99), 95{04. Institut fur Mathematik der Universitat Wien, Strudlhofgasse 4, A-090 Wien, Austria. KRATT@Pap.Univie.Ac.At
8 8 C. Krattenthaler WWW:
COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS
COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS C. Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. e-mail: KRATT@Pap.Univie.Ac.At Abstract. We derive
More informationarxiv:math/ v1 [math.co] 13 Jul 2005
A NEW PROOF OF THE REFINED ALTERNATING SIGN MATRIX THEOREM arxiv:math/0507270v1 [math.co] 13 Jul 2005 Ilse Fischer Fakultät für Mathematik, Universität Wien Nordbergstrasse 15, A-1090 Wien, Austria E-mail:
More informationA Catalan-Hankel Determinant Evaluation
A Catalan-Hankel Determinant Evaluation Ömer Eğecioğlu Department of Computer Science, University of California, Santa Barbara CA 93106 (omer@cs.ucsb.edu) Abstract Let C k = ( ) 2k k /(k +1) denote the
More informationRHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: Theresia.Eisenkoelbl@univie.ac.at
More informationC. Krattenthaler. Submitted: September 16, 1997; Accepted: November 3, 1997
DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS C Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090
More informationTHE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary
THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary (The full-length article will appear in Mem. Amer. Math. Soc.) C. Krattenthaler Institut für Mathematik
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationIt is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a
Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the
More informationEnumerating some symmetry classes of rhombus tilings of holey hexagons
FPSAC 2015, Daejeon, South Korea DMTCS proc. FPSAC 15, 2015, 487 498 Enumerating some symmetry classes of rhombus tilings of holey hexagons Tomack Gilmore Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz
More informationA SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75e A SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS JÉRÉMIE BETTINELLI ABSTRACT. A sub-problem of the open problem of finding
More informationProofs & Confirmations The story of the alternating sign matrix conjecture
Proofs & Confirmations The story of the alternating sign matrix conjecture David M. Bressoud Macalester College University of Nebraska Omaha, NE These slides are available at www.macalester.edu/~bressoud/talks
More informationA simple explicit bijection between(n,2)-gog and Magog trapezoids
A simple explicit bijection between(n,)-gog and Magog trapezoids Jérémie BETTINELLI April 0, 0 arxiv:.00v [math.co] Apr 0 Abstract A sub-problem of the open problem of finding an explicit bijection between
More informationSome Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity
J. Symbolic Computation (1994 11, 1 7 Some Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity GEORGE E. ANDREWS AND PETER PAULE Department of Mathematics, Pennsylvania State
More informationarxiv:math/ v1 [math.co] 5 Oct 1998
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL arxiv:math/98009v [math.co] 5 Oct 998 Abstract. We compute the number of rhombus tilings of a hexagon with
More informationarxiv: v1 [math.co] 18 Oct 2018
A NEW DETERMINANT FOR THE Q-ENUMERATION OF ALTERNATING SIGN MATRICES FLORIAN AIGNER arxiv:80.080v [math.co] 8 Oct 08 Abstract. Fischer provided a new type of binomial erminant for the number of alternating
More informationarxiv: v1 [math.ca] 7 Mar 2013
A SIMPLE PROOF OF ANDREWS S 5 F 4 EVALUATION IRA M. GESSEL arxiv:1303.1757v1 [math.ca] 7 Mar 2013 Department of Mathematics Brandeis University Waltham, MA 02453 gessel@brandeis.edu Abstract. We give a
More informationarxiv:math/ v2 [math.co] 11 Dec 1997
arxiv:math/97144v [math.co] 11 Dec 1997 THE NUMBER OF RHOMBUS TILINGS OF A SYMMETRIC HEXAGON WHICH CONTAIN A FIXED RHOMBUS ON THE SYMMETRY AXIS, I M. FULMEK AND C. KRATTENTHALER Abstract. WecomputethenumberofrhombustilingsofahexagonwithsidesN,M,N,
More informationarxiv:math/ v1 [math.co] 26 Nov 1997
arxiv:math/97103v1 [math.co] 6 Nov 1997 THE NUMBER OF RHOMBUS TILINGS OF A PUNCTURED HEXAGON AND THE MINOR SUMMATION FORMULA S. Okada and C. Krattenthaler Graduate School of Polymathematics, Nagoya University
More informationBINOMIAL COEFFICIENT IDENTITIES AND HYPERGEOMETRIC SERIES. Michael D. Hirschhorn
BINOMIAL COEFFICIENT IDENTITIES AND HYPERGEOMETRIC SERIES Michael D Hirschhorn In recent months I have come across many instances in which someone has found what they believe is a new result in which they
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationDepartement de mathematique, Universite Louis Pasteur, 7, rue Rene Descartes, F Strasbourg, France
GRAPHICAL MAJOR INDICES, II D. FOATA y AND C. KRATTENTHALER y Departement de mathematique, Universite Louis Pasteur, 7, rue Rene Descartes, F-67084 Strasbourg, France e-mail: foata@math.u-strasbg.fr Institut
More informationAdvanced Computer Algebra for Determinants
Advanced Computer Algebra for Determinants Christoph Koutschan Research Institute for Symbolic Computation RISC Johannes Kepler University, A-4040 Linz, Austria Thotsaporn Aek Thanatipanonda Research Institute
More informationSeveral refined conjectures on TSSCPP and ASM
0-0 Several refined conjectures on TSSCPP and ASM Masao Ishikawa Tottori University, ishikawa@fed.tottori-u.ac.jp 1 Contents of this talk 1. Preliminaries (a) Partitions (b) Symmetric functions (c) Alternating
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationA combinatorial determinant
A combinatorial erminant Herbert S Wilf Department of Mathematics, University of Pennsylvania Philadelphia, PA 19104-6395 Abstract A theorem of Mina evaluates the erminant of a matrix with entries D (f(x)
More informationENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS
ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS MANJIL P. SAIKIA Abstract. In this paper we enumerate domino tilings of an Aztec rectangle with arbitrary defects of size one on
More informationA hyperfactorial divisibility Darij Grinberg *long version*
A hyperfactorial divisibility Darij Grinberg *long version* Let us define a function H : N N by n H n k! for every n N Our goal is to prove the following theorem: Theorem 0 MacMahon We have H b + c H c
More informationNew enumeration formulas for alternating sign matrices and square ice partition functions
New enumeration formulas for alternating sign matrices and square ice partition functions Arvind Ayyer Dan Romik October 8, 01 Abstract The refined enumeration of alternating sign matrices (ASMs of given
More informationarxiv: v2 [math.co] 3 May 2017
Spiral determinants arxiv:170402859v2 [mathco 3 May 2017 G Bhatnagar and C Krattenthaler Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz 1, A-1090 Vienna, Austria WWW: http://wwwmatunivieacat/~kratt
More informationRefined Cauchy/Littlewood identities and partition functions of the six-vertex model
Refined Cauchy/Littlewood identities and partition functions of the six-vertex model LPTHE (UPMC Paris 6), CNRS (Collaboration with Dan Betea and Paul Zinn-Justin) 6 June, 4 Disclaimer: the word Baxterize
More informationarxiv: v3 [math.co] 6 Aug 2016
ANALOGUES OF A FIBONACCI-LUCAS IDENTITY GAURAV BHATNAGAR arxiv:1510.03159v3 [math.co] 6 Aug 2016 Abstract. Sury s 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and
More information1 Last time: determinants
1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More informationShifted symmetric functions II: expansions in multi-rectangular coordinates
Shifted symmetric functions II: expansions in multi-rectangular coordinates Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationA HYPERGEOMETRIC INEQUALITY
A HYPERGEOMETRIC INEQUALITY ATUL DIXIT, VICTOR H. MOLL, AND VERONIKA PILLWEIN Abstract. A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal.
More informationAn Involution for the Gauss Identity
An Involution for the Gauss Identity William Y. C. Chen Center for Combinatorics Nankai University, Tianjin 300071, P. R. China Email: chenstation@yahoo.com Qing-Hu Hou Center for Combinatorics Nankai
More informationarxiv: v1 [math.co] 25 May 2011
arxiv:1105.4986v1 [math.co] 25 May 2011 Gog and Magog triangles, and the Schützenberger involution Hayat Cheballah and Philippe Biane Abstract. We describe an approach to finding a bijection between Alternating
More informationLinear Systems. Math A Bianca Santoro. September 23, 2016
Linear Systems Math A4600 - Bianca Santoro September 3, 06 Goal: Understand how to solve Ax = b. Toy Model: Let s study the following system There are two nice ways of thinking about this system: x + y
More informationELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices
ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex
More informationarxiv: v1 [math.nt] 5 Jan 2019
POLYNOMIAL GENERALIZATIONS OF TWO-VARIABLE RAMANUJAN TYPE IDENTITIES arxiv:19010538v1 [matnt 5 Jan 019 JAMES MCLAUGHLIN AND ANDREW V SILLS Dedicated to Doron Zeilberger on te occasion of is sixtiet birtday
More informationA METHOD FOR DETERMINING THE MOD-2 k BEHAVIOUR OF RECURSIVE SEQUENCES, WITH APPLICATIONS TO SUBGROUP COUNTING
A METHOD FOR DETERMINING THE MOD-2 k BEHAVIOUR OF RECURSIVE SEQUENCES, WITH APPLICATIONS TO SUBGROUP COUNTING M. KAUERS, C. KRATTENTHALER, AND T. W. MÜLLER Dedicated to Doron Zeilberger Abstract. We present
More informationA Sumudu based algorithm for solving differential equations
Computer Science Journal of Moldova, vol.15, no.3(45), 2007 A Sumudu based algorithm for solving differential equations Jun Zhang Abstract An algorithm based on Sumudu transform is developed. The algorithm
More informationFrom alternating sign matrices to Painlevé VI
From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationCOMPUTER ALGEBRA AND POWER SERIES WITH POSITIVE COEFFICIENTS. 1. Introduction
COMPUTER ALGEBRA AND POWER SERIES WITH POSITIVE COEFFICIENTS MANUEL KAUERS Abstract. We consider the question whether all the coefficients in the series expansions of some specific rational functions are
More informationThinking and Doing. Maths in the 21st Century
Thinking and Doing Mathematics in the 21st Century Richard P. Brent MSI, Australian National University and CARMA, University of Newcastle 16 November 2018 Copyright c 2018, R. P. Brent. Maths in the 21st
More informationBeukers integrals and Apéry s recurrences
2 3 47 6 23 Journal of Integer Sequences, Vol. 8 (25), Article 5.. Beukers integrals and Apéry s recurrences Lalit Jain Faculty of Mathematics University of Waterloo Waterloo, Ontario N2L 3G CANADA lkjain@uwaterloo.ca
More informationOn Recurrences for Ising Integrals
On Recurrences for Ising Integrals Flavia Stan Research Institute for Symbolic Computation (RISC-Linz) Johannes Kepler University Linz, Austria December 7, 007 Abstract We use WZ-summation methods to compute
More informationCONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS
CONGRUENCES MODULO SQUARES OF PRIMES FOR FU S k DOTS BRACELET PARTITIONS CRISTIAN-SILVIU RADU AND JAMES A SELLERS Dedicated to George Andrews on the occasion of his 75th birthday Abstract In 2007, Andrews
More informationLinear Algebra (Math-324) Lecture Notes
Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and
More informationON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA
ON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA gl(m N E.M. MOENS Department of Applied Mathematics, Ghent University, Krijgslaan 281-S9, B-9000 Gent, Belgium. e-mail:
More informationKonrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D Berlin - Wilmersdorf
Konrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D-10711 Berlin - Wilmersdorf Wolfram Koepf REDUCE Package for the Indenite and Denite Summation Technical Report TR 94{9 (November
More informationa11 a A = : a 21 a 22
Matrices The study of linear systems is facilitated by introducing matrices. Matrix theory provides a convenient language and notation to express many of the ideas concisely, and complicated formulas are
More information4 Holonomic Recurrence Equations
44 4 Holonomic Recurrence Equations The main algorithmic idea to find hypergeometric term representations of hypergeometric series goes bac to Celine Fasenmyer (who is often called Sister Celine: Her idea
More informationThe Four Fundamental Subspaces
The Four Fundamental Subspaces Introduction Each m n matrix has, associated with it, four subspaces, two in R m and two in R n To understand their relationships is one of the most basic questions in linear
More informationEvaluating a Determinant
Evaluating a Determinant Thotsaporn Thanatipanonda Joint Work with Christoph Koutschan Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Austria June 15th, 2011 Outline of
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationAlmost Product Evaluation of Hankel Determinants
Almost Product Evaluation of Hankel Determinants Ömer Eğecioğlu Department of Computer Science University of California, Santa Barbara CA 93106 omer@csucsbedu Timothy Redmond Stanford Medical Informatics,
More informationApplications of Computer Algebra to the Theory of Hypergeometric Series
Applications of Computer Algebra to the Theory of Hypergeometric Series A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Department of Mathematics
More informationA COMPUTER PROOF OF A SERIES EVALUATION IN TERMS OF HARMONIC NUMBERS
A COMPUTER PROOF OF A SERIES EVALUATION IN TERMS OF HARMONIC NUMBERS RUSSELL LYONS, PETER PAULE, AND AXEL RIESE Abstract. A fruitful interaction between a new randomized WZ procedure and other computer
More informationThe Concept of Bailey Chains
The Concept of Bailey Chains Peter Paule 0 Introduction In his expository lectures on q-series [3] G E Andrews devotes a whole chapter to Bailey s Lemma (Th 2, 3) and discusses some of its numerous possible
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants
More informationHadamard ideals and Hadamard matrices with two circulant cores
Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 9
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationReceived: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 2007, #A34 AN INVERSE OF THE FAÀ DI BRUNO FORMULA Gottlieb Pirsic 1 Johann Radon Institute of Computational and Applied Mathematics RICAM,
More informationThe Gift Exchange Problem
The Gift Exchange Problem David Applegate and N. J. A. Sloane (a), AT&T Shannon Labs, 180 Park Ave., Florham Park, NJ 07932-0971, USA. (a) Corresponding author. Email: david@research.att.com, njas@research.att.com.
More informationExtreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order Arvind Ayyer (Bangalore) Roger E. Behrend (Cardiff) Ilse Fischer (Vienna) 1 Outline Introduction: ASMs and DASASMs
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More informationMH1200 Final 2014/2015
MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a
More information4.3 - Linear Combinations and Independence of Vectors
- Linear Combinations and Independence of Vectors De nitions, Theorems, and Examples De nition 1 A vector v in a vector space V is called a linear combination of the vectors u 1, u,,u k in V if v can be
More informationNEW CURIOUS BILATERAL q-series IDENTITIES
NEW CURIOUS BILATERAL q-series IDENTITIES FRÉDÉRIC JOUHET AND MICHAEL J. SCHLOSSER Abstract. By applying a classical method, already employed by Cauchy, to a terminating curious summation by one of the
More informationIzergin-Korepin determinant reloaded
Izergin-Korepin determinant reloaded arxiv:math-ph/0409072v1 27 Sep 2004 Yu. G. Stroganov Institute for High Energy Physics 142284 Protvino, Moscow region, Russia Abstract We consider the Izergin-Korepin
More informationReview of Matrices and Block Structures
CHAPTER 2 Review of Matrices and Block Structures Numerical linear algebra lies at the heart of modern scientific computing and computational science. Today it is not uncommon to perform numerical computations
More informationChapter 2. Ma 322 Fall Ma 322. Sept 23-27
Chapter 2 Ma 322 Fall 2013 Ma 322 Sept 23-27 Summary ˆ Matrices and their Operations. ˆ Special matrices: Zero, Square, Identity. ˆ Elementary Matrices, Permutation Matrices. ˆ Voodoo Principle. What is
More informationHomework #6 Solutions
Problems Section.1: 6, 4, 40, 46 Section.:, 8, 10, 14, 18, 4, 0 Homework #6 Solutions.1.6. Determine whether the functions f (x) = cos x + sin x and g(x) = cos x sin x are linearly dependent or linearly
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationOn Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000
On Descents in Standard Young Tableaux arxiv:math/0007016v1 [math.co] 3 Jul 000 Peter A. Hästö Department of Mathematics, University of Helsinki, P.O. Box 4, 00014, Helsinki, Finland, E-mail: peter.hasto@helsinki.fi.
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationNAME MATH 304 Examination 2 Page 1
NAME MATH 4 Examination 2 Page. [8 points (a) Find the following determinant. However, use only properties of determinants, without calculating directly (that is without expanding along a column or row
More informationA Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions
JOURNAL OF COMBINATORIAL THEORY, Series A 64, 289-310 (1993) A Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions WILLIAM F. DORAN IV* Department of
More informationSEARCHING FOR STRANGE HYPERGEOMETRIC IDENTITIES BY SHEER BRUTE FORCE. Moa APAGODU. Doron ZEILBERGER 1
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A36 1 SEARCHING FOR STRANGE HYPERGEOMETRIC IDENTITIES BY SHEER BRUTE FORCE Moa APAGODU Department of Mathematics, Virginia Commonwealth
More informationDeterminantal Identities for Modular Schur Symmetric Functions
Determinantal Identities for Modular Schur Symmetric Functions by A.M. Hamel Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand No. 129 July, 1995 MR Classification
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationA polynomial method for the enumeration of plane partitions and alternating sign matrices
A polynomial method for the enumeration of plane partitions and alternating sign matrices Habilitationsschrift zur Erlangung der Lehrbefugnis venia docendi für Mathematik an der Fakultät für Mathematik
More informationDomino tilings with barriers. In memory of Gian-Carlo Rota
Domino tilings with barriers In memory of Gian-Carlo Rota James Propp Richard Stanley University of Wisconsin, Madison, WI 53706 Massachusetts Institute of Technology, Cambridge, MA 02139 In this paper,
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationPoset and Polytope Perspectives On Alternating Sign Matrices
Poset and Polytope Perspectives On Alternating Sign Matrices A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Jessica Palencia Striker IN PARTIAL FULFILLMENT
More informationHook lengths and shifted parts of partitions
Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690
More informationThe initial involution patterns of permutations
The initial involution patterns of permutations Dongsu Kim Department of Mathematics Korea Advanced Institute of Science and Technology Daejeon 305-701, Korea dskim@math.kaist.ac.kr and Jang Soo Kim Department
More informationODD PARTITIONS IN YOUNG S LATTICE
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75g ODD PARTITIONS IN YOUNG S LATTICE ARVIND AYYER, AMRITANSHU PRASAD, AND STEVEN SPALLONE Abstract. We show that the subgraph induced in Young
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
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 informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
More informationEngel Expansions of q-series by Computer Algebra
Engel Expansions of q-series by Computer Algebra George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA andrews@math.psu.edu Arnold Knopfmacher The
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More information