MacMahon s Partition Analysis VIII: Plane Partition Diamonds
|
|
- Mary Todd
- 6 years ago
- Views:
Transcription
1 MacMahon s Partition Analysis VIII: Plane Partition Diamonds George E. Andrews * Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA andrews@math.psu.edu Peter Paule Research Institute for Symbolic Computation Johannes Kepler University Linz A 4040 Linz, Austria Peter.Paule@risc.uni-linz.ac.at and Axel Riese Research Institute for Symbolic Computation Johannes Kepler University Linz A 4040 Linz, Austria Axel.Riese@risc.uni-linz.ac.at DEDICATED TO DOMINIQUE FOATA ON THE OCCASION OF HIS 65TH BIRTHDAY In his famous book Combinatory Analysis MacMahon introduced Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. However, MacMahon failed in his attempt to use his method for a satisfactory treatment of plane partitions. It is the object of this article to show that nevertheless Partition Analysis is of significant value when treating non-standard types of plane partitions. To this end plane partition diamonds are introduced. Applying Partition Analysis a simple closed form for the full generating function is derived. In the discovering process the Omega package developed by the authors has played a fundamental rôle. * Partially supported by NSF Grant DMS Supported by SFB Grant F305 of the Austrian FWF.
2 2 G.E. ANDREWS, P. PAULE, AND A. RIESE. INTRODUCTION In his famous book Combinatory Analysis [6, Vol. II, Section VIII, pp. 9 70] MacMahon introduced Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. In Chapter II of Section IX he starts out to consider plane partitions as a natural application domain for his method. MacMahon begins by discussing the most simple case [6, Vol. II, p. 83], namely where non-negative integers a i are placed at the corner of a square such that the following order relations are satisfied: a a 2, a a 3, a 2 a 4 and a 3 a 4. ( By using Partition Analysis he derives that D := x a xa2 2 xa3 3 xa4 4 = x 2 x 2 x (2 3 ( x x x 2 x x 3 x x 2 x 3 x x 2 x 3 x 4, where the sum is taken over all non-negative integers a i satisfying (. Furthermore, he observes that if x = x 2 = x 3 = x 4 = q, the resulting generating function is ( q q 2 2 ( q 3. In order to see how Partition Analysis works on (2 we need to recall the key ingredient of MacMahon s method, the Omega operator Ω. Definition.. The operator Ω is given by Ω s = s r= A s,...,s r λ s λsr r := s =0 A s,...,s r, s r=0 where the domain of the A s,...,s r is the field of rational functions over C in several complex variables and the λ i are restricted to a neighborhood of the circle λ i =. In addition, the A s,...,s r are required to be such that any of the series involved is absolute convergent within the domain of the definition of A s,...,s r. We emphasize that it is essential to treat everything analytically rather than formally because the method relies on unique Laurent series representations of rational functions.
3 PLANE PARTITION DIAMONDS 3 Another fundamental aspect of Partition Analysis is the use of elimination rules which describe the action of the Omega operator on certain base cases. MacMahon begins the discussion of his method by presenting a catalog [6, Vol. II, pp ] of twelve fundamental evaluations. Subsequently he extends this table by new rules whenever he is forced to do so. Once found, most of these fundamental rules are easy to prove. This is illustrated by the following examples which are taken from MacMahon s list. Proposition.. For integer s, Ω Ω ( λa ( B λ s = ( λa λb ( C λ = ( A A s B ; (3 ABC ( A B AC BC. (4 We prove (3; the proof of (4 is analogous and is left to the reader. Proof (of (3. By geometric series expansion the left hand side equals Ω i,j 0 λ i sj A i B j = Ω j,k 0 λ k A sj+k B j, where the summation parameter i has been replaced by sj +k. But now Ω sets λ to which completes the proof. Now we are ready for deriving the closed form expression for D with Partition Analysis. Proof (of (2. First, in order to get rid of the diophantine constraints, one rewrites the sum expression in (2 into what MacMahon called the crude form of the generating function, D = Ω = Ω a,a 2,a 3,a 4 0 λ a a2 λ a a3 2 λ a2 a4 3 λ a3 a4 4 x a xa2 2 xa3 3 xa4 4 ( λ λ 2 x λ 3 λ x 2 λ 4 λ 2 x 3 x 4. λ 3λ 4 Next by rule (3 we eliminate successively λ, λ 3, and λ 4, D = Ω ( λ2 x λ2 λ 3 x x 2 λ 4 λ 2 x 3 x 4 λ 3λ 4 = Ω ( λ2 x λ2 x x 2 λ 4 λ 2 x 3 λ 2x x 2x 4 λ 4 (5
4 4 G.E. ANDREWS, P. PAULE, AND A. RIESE = Ω ( λ2 x λ2 x x 2 x 3. λ 2 x x 2 x 3 x 4 Finally, applying rule (4 eliminates λ 2 and completes the proof of (2. After considering some further questions about plane partitions on a square, MacMahon writes down the crude form for the general case, i.e. the Ω expression for the full generating function for plane partitions of m rows, l columns and each part not exceeding n; see [6, Vol. II, p. 86] and also []. But a few lines later MacMahon writes: Our knowledge of the Ω operation is not sufficient to enable us to establish the final form of result. This will be accomplished by the aid of new ideas which will be brought forward in the following chapters. Despite MacMahon s negative statement, in this article our object is to show that Partition Analysis nevertheless is an extremely valuable tool in studying plane partitions of non-standard type. In Section 2 we will consider plane partition diamonds for which Partition Analysis enables to derive an elegant expression for the full generating function. In the concluding Section 3 we present two further types of possible plane partition generalizations. 2. PLANE PARTITION DIAMONDS It will be convenient to introduce alternative descriptions for relations. For instance, an alternative description of the inequalities ( is Figure below. It is understood that an arrow pointing from a i to a j is a 2 a a 4 a 3 FIG.. The inequalities ( interpreted as a i a j. In the spirit of MacMahon s Partition Analysis we introduce another equivalent description of the inequalities (, namely λ a a2 λ a a3 2 λ a2 a4 3 λ a3 a4 4. (6
5 PLANE PARTITION DIAMONDS 5 Each λ variable stands for an arrow, i.e. if its exponent is a i a j, it is interpreted as a i a j. Now we are in the position to describe plane partition diamonds. Instead of gluing such squares together as in the case of standard plane partitions, we consider the configurations shown in Figure 2. Note that a 2 a 5 a 8 a 3n a... a 3n+ a 4 a 7 a 0 a 3n 2 a 3 a 6 a 9 a 3n FIG. 2. Diamond of length n the arrows can be also interpreted as a flow, so a is considered as the source and a 3n+ as the sink. For n we call such a configuration a diamond of length n. A more formal description can be given as follows. Definition 2.. For n, Λ n := λ a3n 2 a3n 4n 3 λ a3n 2 a3n 4n 2 λ a3n a3n+ 4n λ a3n a3n+ 4n. Obviously, Λ is the product in (6 and represents one-to-one the four inequalities (. In view of Figure 2 this leads to the following definition. Definition 2.2. is called diamond of length n. For n the product D n := Λ Λ 2 Λ n Obviously, Λ Λ 2 Λ n gives a precise description of the 4n inequalities described by Figure 2. Definition 2.3. For n we define D n := D n (x,..., x 3n+ := x a xa3n+ 3n+, where the sum ranges over all non-negative integers a,..., a 3n+ which satisfy the inequalities encoded by D n.
6 6 G.E. ANDREWS, P. PAULE, AND A. RIESE Thus D n is the full generating function for all diamonds of fixed length n. We are also interested in diamonds with sink ρ, ρ N. Definition 2.4. D (ρ n For n, ρ 0 we define := D n (ρ (x,..., x 3n+ := x a xa3n+, where the sum ranges over all non-negative integers a,..., a 3n+ which satisfy the inequalities encoded by D n and where a 3n+ ρ. Ω 2.. The Crude Generating Function In this subsection we will define the crude forms of D n and D n (ρ, i.e. the expressions for D n and D n (ρ. To this end we need a few definitions. and Definition 2.5. For k, n, f k := ( λ 4k λ 4k 3 x 3k λ 4k λ 4k 2 x 3k λ 4k+ λ 4k+2, λ 4k λ 4k x 3k+ g n := λ4n+λ 4n+2 λ 4n λ 4n x 3n+, x3n+ λ 4n λ 4n h := λ λ 2 x. Note that if x 3n+ is replaced by λ 4n+ λ 4n+2 x 3n+ then Proposition 2.. For n, f n g n turns into f n. (7 D n = Ω h f f n g n. (8 Proof. We proceed by induction on n. The case n = corresponds to the most simple plane partition case (5. Suppose (8 is true for n, then D n+ = Ω Λ Λ n+ x a xa3n+4 a i 0
7 PLANE PARTITION DIAMONDS 7 = Ω Λ Λ n x a xa3n (λ 4n+λ 4n+2 x 3n+ a3n+ a i 0 ( λ4n+3 ( a3n+2 λ a3n+3 4n+4 x 3n+2 x 3n+3 λ 4n+ λ 4n+2 ( x a3n+4 3n+4 λ 4n+3 λ 4n+4 = Ω h f f n f n+ g n+, where the last line is by the induction hypothesis and by (7. Proposition 2.2. For n and ρ 0, D (ρ n = Ω h f f n g n ( x3n+ λ 4n λ 4n ρ. (9 Proof. The induction proof with respect to n is entirely analogous to the proof of Proposition 2. and is left to the reader The Diamond Generating Function In this subsection we will prove our main theorem. Theorem 2.. For n, D n (x,..., x 3n+ = where X k = x x 2 x k, k. ( X X 2 ( X 3n+ X X 3 X 4X 6 X3 x 2 X6 x 5 X 3n 2X 3n, X3n x 3n Before we turn to the proof of Theorem 2., we introduce two corollaries. Corollary 2.. For n, D n (q,..., q = ( + q2 + q 5 + q 8 ( + q 3n ( q q 2 q 3 ( q 3n+. Proof. The proof is immediate from Theorem 2.. Corollary 2.2. For n and ρ 0, D (ρ n (x,..., x 3n+ = X ρ 3n+ D n(x,..., x 3n+, (0
8 8 G.E. ANDREWS, P. PAULE, AND A. RIESE where X k = x x 2 x k as in Theorem 2.. Proof. We fix n and prove the statement by induction on ρ. For ρ = 0 the assertion is trivial. Suppose (0 is true for ρ. Obviously, D (ρ+ n = D (ρ n x ρ 3n+ xρ 3n+ D(ρ n, where x ρ k F (x,..., x m stands for the coefficient of x ρ k in F (x,..., x m. From (9, x ρ 3n+ D(ρ But by Theorem 2. we have n = x ρ 3n+ Xρ 3n+ D n = Xρ 3n+ x 0 3n+ D n. x ρ 3n+ x 0 3n+ D n = ( X 3n+ D n x 0 3n+ X 3n+ = ( X 3n+ D n. Collecting these facts and applying (9 we obtain D (ρ+ n = X ρ 3n+ D n X ρ 3n+ ( X 3n+D n = X ρ+ 3n+ D n, which completes the proof. Basically we are ready for the proof of Theorem 2.. However, it will be convenient to introduce an elementary lemma. Definition 2.6. Let k, and y,..., y k, z 0 be distinct elements from a suitable field. Define p(y; z := k ( i= y i z where y = (y,..., y k. For j k define p j (y; z := k ( i= i j y i z,. Lemma 2.. Let k and y = (y,..., y k, then p(y; z = k j= p j (y; y j. yj z
9 PLANE PARTITION DIAMONDS 9 Proof. The assertion is immediate by partial fraction decomposition. Proof (of Theorem 2.. We proceed by induction on n. For n = the statement corresponds to the simplest case of classical plane partitions, namely (2. Suppose the theorem holds for n. By Proposition 2., D n+ = Ω h f f n+ g n+ = Ω h f f n ( λ 4n λ 4n 3 x 3n ( λ 4n+λ 4n+2 λ 4n λ 4n x 3n+ λ 4n+3 λ 4n+ x 3n+2 ( λ 4n+4 λ 4n+2 x 3n+3 x 3n+4. λ 4n+3λ 4n+4 λ 4n λ 4n 2 x 3n By applying case n = of Theorem 2. to the last four factors we obtain, with D n+ = Ω h f f n x2 3n+ x3n+2x3n+3 λ 2 4n λ2 4n p(y; λ 4n λ 4n ( λ 4n λ 4n 3 x 3n λ 4n λ 4n 2 x 3n y = (y, y 2, y 3, y 4, y 5 = (x 3n+, x 3n+ x 3n+2, x 3n+ x 3n+3, x 3n+ x 3n+2 x 3n+3, x 3n+ x 3n+2 x 3n+3 x 3n+4. ( Now applying Lemma 2. yields D n+ = p j (y; y j D n (x,..., x 3n, y j j= x 2 3n+x 3n+2 x 3n+3 j= p j (y; y j y 2 j D (2 n (x,..., x 3n, y j. By Corollary 2.2 with ρ = 2 (implied by the induction hypothesis, D n+ = p j (y; y j D n (x,..., x 3n, y j j=
10 0 G.E. ANDREWS, P. PAULE, AND A. RIESE Observing that we obtain (x x 3n 2 x 2 3n+x 3n+2 x 3n+3 p j (y; y j D n (x,..., x 3n, y j j= = ( X 3n+ X 3n+3 p j (y; y j D n (x,..., x 3n, y j. j= D n (x,..., x 3n, y = X 3n+ X 3n y D n(x,..., x 3n, x 3n+ D n+ = ( X 3n+ X 3n+3 X 3n+ j= But it is routine (computer algebra computation that j= p j (y; y j X 3n y j p j (y; y j X 3n y j D n. = ( X 3n+ X 3n+2 X 3n+3 X 3n+4 ( X3n+3 x 3n+2 for y = (y,..., y 5 as in (. Hence, D n+ = ( X 3n+2 X 3n+3 X 3n+4 X 3n+ X 3n+3 X3n+3 x 3n+2 D n and the proof of Theorem 2. is completed. 3. CONCLUSION As shown in a series of articles [2, 3, 4, 5] Partition Analysis is ideally suited for being supplemented by computer algebra methods. In these papers the Mathematica package Omega which had been developed by the authors, was used as an essential tool. The package is freely available from the Web via Omega. The Omega package played a crucial rôle also in discovering Theorem 2. above. For instance, the simplest case (2 is treated automatically by the package as follows.
11 PLANE PARTITION DIAMONDS After loading the file Omega2.m by In[]:= <<Omega2.m Out[]= Axel Riese s Omega implementation version 2.30 loaded one computes the crude form of the generating function D as follows: In[2]:= OSum[x a x a2 2 x a3 3 x a4 4, {a a 2, a a 3, a 2 a 4, a 3 a 4 }, λ] Assuming a 0 Assuming a 2 0 Assuming a 3 0 Assuming a 4 0 Out[2]= Ω λ,λ 2,λ 3,λ 4 ( x λ λ 2 ( ( x2 λ3 λ x 4 ( λ 3 λ 4 x 3 λ 4 λ 2 Finally, elimination can be done in one stroke and within a second: In[3]:= OR[%] Eliminating λ 4... Eliminating λ 3... Eliminating λ 2... Eliminating λ... Out[3]= x 2 x 2 x 3 ( x ( x x 2 ( x x 3 ( x x 2 x 3 ( x x 2 x 3 x 4 Already this elementary application indicates the usefulness of the Omega package for a further, more detailed study of possible new plane partition generalizations. We conclude by mentioning two further examples which have been found experimentally. The first example is a variation of the diamond theme. Instead of arranging diamonds in a row, we arrange them in hook shape as shown in Figure 3. Note that the ordering imposed is such that we now have 2 sources, a and a 0, and sink, namely a 5. The corresponding full
12 2 G.E. ANDREWS, P. PAULE, AND A. RIESE a 6 a 8 a 5 a 0 a 7 a 4 a 9 a 2 a 3 a FIG. 3. Diamond hook generating function turns out to be x a xa0 ( x 2 = x 2 x 3 x 8 x 9 x 2 0 ( x x 0 x x 2 x x 3 x 8 x 0 ( x 9 x 0 x x 2 x 3 x 8 x 9 x 0 x x 2 x 3 x 4 ( x x 2 x 3 x 4 x 7 x 8 x 9 x 0 x x 2 x 3 x 4 x 6 x 7 x 8 x 9 x 0 ( x x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 0. If we set all x i to q the product turns into + q 2 ( q 2 ( q 2 3 ( q 3 2 ( q 8 q 9 q 0. Other types of generalized plane partitions can be obtained by a variation of the order taken in the classical case. Consider, for instance, the reversed hook from Figure 4. Here we have again 2 sources, a and a 8, and sink, namely a 5. Despite the fact that the full generating function does not factor, the case x i = q, i 8, again is nice: ( q 2 ( q 2 2 ( q 3 q 4 2 ( q 5. We conclude by the remark that without the Omega package such observations can hardly be made.
13 PLANE PARTITION DIAMONDS 3 a 5 a 4 a 2 a a 3 6 a a 7 a 8 FIG. 4. Reversed standard hook REFERENCES. G.E. Andrews, MacMahon s partition analysis II: Fundamental theorems, Ann. Comb. 4 ( G.E. Andrews, P. Paule and A. Riese, MacMahon s partition analysis III: The Omega package, SFB Report 99-24, J. Kepler University, Linz, 999, (to appear. 3. G.E. Andrews, P. Paule and A. Riese, MacMahon s partition analysis VI: A new reduction algorithm, (to appear. 4. G.E. Andrews, P. Paule and A. Riese, MacMahon s partition analysis VII: Constrained compositions, (to appear. 5. G.E. Andrews, P. Paule, A. Riese and V. Strehl, MacMahon s partition analysis V: Bijections, recursions, and magic squares, SFB Report 00-8, J. Kepler University, Linz, 2000, (to appear. 6. P.A. MacMahon, Combinatory Analysis, 2 vols., Cambridge University Press, Cambridge, (Reprinted: Chelsea, New York, 960.
MACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS
MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Dedicated to George Szeeres on the occasion of his 90th birthday Abstract. MacMahon devoted a significant
More informationMacMahon s Partition Analysis V: Bijections, Recursions, and Magic Squares
MacMahon s Partition Analysis V: Bijections, Recursions, and Magic Squares George E. Andrews, Peter Paule 2, Axel Riese 3, and Volker Strehl 4 Department of Mathematics The Pennsylvania State University
More informationINFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS
December 1, 2009 INFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS PETER PAULE AND SILVIU RADU Dedicated to our friend George E. Andrews on the occasion of his 70th birthday Abstract.
More informationCombinatorics, Modular Forms, and Discrete Geometry
Combinatorics, Modular Forms, and Discrete Geometry / 1 Geometric and Enumerative Combinatorics, IMA University of Minnesota, Nov 10 14, 2014 Combinatorics, Modular Forms, and Discrete Geometry Peter Paule
More informationA Fast Algorithm for MacMahon s Partition Analysis
A Fast Algorithm for MacMahon s Partition Analysis Guoce Xin Department of Mathematics Brandeis University, Waltham, USA maxima@brandeis.edu Submitted: Aug 26, 2004; Accepted: Aug 30, 2004; Published:
More informationA Computer Proof of Moll s Log-Concavity Conjecture
A Computer Proof of Moll s Log-Concavity Conjecture Manuel Kauers and Peter Paule Research Institute for Symbolic Computation (RISC-Linz) Johannes Kepler University Linz, Austria, Europe May, 29, 2006
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
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 informationA LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES
A LATTICE POINT ENUMERATION APPROACH TO PARTITION IDENTITIES A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master of Arts
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 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 informationPARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND (2k + 1) CORES
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this paper we prove several new parity results for broken k-diamond partitions introduced in
More informationA COMPUTER PROOF OF MOLL S LOG-CONCAVITY CONJECTURE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 135, Number 12, December 2007, Pages 3847 3856 S 0002-99390708912-5 Article electronically published on September 10, 2007 A COMPUTER PROOF OF MOLL
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 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 informationDedicated to our friend Krishna Alladi on his 60th birthday
A NEW WITNESS IDENTITY FOR 11 p(11n + 6) PETER PAULE AND CRISTIAN-SILVIU RADU Dedicated to our friend Krishna Alladi on his 60th birthday Abstract. Let p(n) be the number of partitions of the positive
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 informationFACTORIZATION AND THE PRIMES
I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary
More informationThe Rogers-Ramanujan Functions and Computer Algebra
Ramanujan Congruences / 1 Joint Mathematics Meetings AMS Special Session in honor of Dennis Stanton s 65th Birthday San Diego, Jan 10 13, 2018 The Rogers-Ramanujan Functions and Computer Algebra Peter
More informationA Fine Dream. George E. Andrews (1) January 16, 2006
A Fine Dream George E. Andrews () January 6, 2006 Abstract We shall develop further N. J. Fine s theory of three parameter non-homogeneous first order q-difference equations. The obect of our work is to
More informationarxiv: v1 [math.co] 25 Oct 2018
AN IMPROVED BOUND FOR THE SIZE OF THE SET A/A+A OLIVER ROCHE-NEWTON arxiv:1810.10846v1 [math.co] 25 Oct 2018 Abstract. It is established that for any finite set of positive real numbers A, we have A/A+A
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 informationCombinatorics, Modular Functions, and Computer Algebra
Combinatorics, Modular Functions, and Computer Algebra / 1 Combinatorics and Computer Algebra (CoCoA 2015) Colorado State Univ., Fort Collins, July 19-25, 2015 Combinatorics, Modular Functions, and Computer
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
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 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 informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
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 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 informationSingular Overpartitions
Singular Overpartitions George E. Andrews Dedicated to the memory of Paul Bateman and Heini Halberstam. Abstract The object in this paper is to present a general theorem for overpartitions analogous to
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 informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationOn q-series Identities Arising from Lecture Hall Partitions
On q-series Identities Arising from Lecture Hall Partitions George E. Andrews 1 Mathematics Department, The Pennsylvania State University, University Par, PA 16802, USA andrews@math.psu.edu Sylvie Corteel
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationInvariant Generation for P-solvable Loops with Assignments
Invariant Generation for P-solvable Loops with Assignments Laura Kovács EPFL, Swizterland laura.kovacs@epfl.ch Abstract. We discuss interesting properties of a general technique for inferring polynomial
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationINFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3
INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 SILVIU RADU AND JAMES A. SELLERS Abstract. In 2007, Andrews and Paule introduced the family of functions k n) which enumerate the number
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
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 informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationLinear algebra. S. Richard
Linear algebra S. Richard Fall Semester 2014 and Spring Semester 2015 2 Contents Introduction 5 0.1 Motivation.................................. 5 1 Geometric setting 7 1.1 The Euclidean space R n..........................
More informationNilpotency and the number of word maps of a finite group
Nilpotency and the number of word maps of a finite group arxiv:1704.08214v1 [math.gr] 26 Apr 2017 Alexander Bors September 20, 2018 Abstract For a finite group G and a non-negative integer d, denote by
More informationInteger Partitions With Even Parts Below Odd Parts and the Mock Theta Functions
Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions by George E. Andrews Key Words: Partitions, mock theta functions, crank AMS Classification Numbers: P84, P83, P8, 33D5 Abstract
More informationarxiv: v1 [math.cv] 23 Jan 2019
SHARP COMPLEX CONVEXIY ESIMAES ALEXANDER LINDENBERGER, PAUL F. X. MÜLLER, AND MICHAEL SCHMUCKENSCHLÄGER Abstract. In this paper we determine the value of the best constants in the -uniform P L-convexity
More informationPARTITIONS AND (2k + 1) CORES. 1. Introduction
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007
More informationON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS
ON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS C. BESSENRODT AND S. VAN WILLIGENBURG Abstract. Confirming a conjecture made by Bessenrodt and Kleshchev in 1999, we classify
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationa 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 informationCHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998
CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More information1 On the Jacobi-Trudi formula for dual stable Grothendieck polynomials
1 On the Jacobi-Trudi formula for dual stable Grothendieck polynomials Francisc Bozgan, UCLA 1.1 Review We will first begin with a review of the facts that we already now about this problem. Firstly, a
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationOn Turán s inequality for Legendre polynomials
Expo. Math. 25 (2007) 181 186 www.elsevier.de/exmath On Turán s inequality for Legendre polynomials Horst Alzer a, Stefan Gerhold b, Manuel Kauers c,, Alexandru Lupaş d a Morsbacher Str. 10, 51545 Waldbröl,
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
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 informationIndefinite Summation with Unspecified Summands
Indefinite Summation with Unspecified Summands Manuel Kauers 1 and Carsten Schneider 2 Research Institute for Symbolic Computation Johannes Kepler Universität A-4040 Linz, Austria Abstract We provide a
More informationFactorial Schur functions via the six vertex model
Factorial Schur functions via the six vertex model Peter J. McNamara Department of Mathematics Massachusetts Institute of Technology, MA 02139, USA petermc@math.mit.edu October 31, 2009 Abstract For a
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationSome Remarks on the Discrete Uncertainty Principle
Highly Composite: Papers in Number Theory, RMS-Lecture Notes Series No. 23, 2016, pp. 77 85. Some Remarks on the Discrete Uncertainty Principle M. Ram Murty Department of Mathematics, Queen s University,
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 informationMassachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra
Massachusetts Institute of Technology Department of Economics 14.381 Statistics Guido Kuersteiner Lecture Notes on Matrix Algebra These lecture notes summarize some basic results on matrix algebra used
More informationNearly Equal Distributions of the Rank and the Crank of Partitions
Nearly Equal Distributions of the Rank and the Crank of Partitions William Y.C. Chen, Kathy Q. Ji and Wenston J.T. Zang Dedicated to Professor Krishna Alladi on the occasion of his sixtieth birthday Abstract
More informationAn Algebraic Characterization of the Halting Probability
CDMTCS Research Report Series An Algebraic Characterization of the Halting Probability Gregory Chaitin IBM T. J. Watson Research Center, USA CDMTCS-305 April 2007 Centre for Discrete Mathematics and Theoretical
More informationPrimary classes of compositions of numbers
Annales Mathematicae et Informaticae 41 (2013) pp. 193 204 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Applications Institute of Mathematics and Informatics, Eszterházy
More informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
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 informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationPowers of the Vandermonde determinant, Schur functions, and the dimension game
FPSAC 2011, Reykjavík, Iceland DMTCS proc. AO, 2011, 87 98 Powers of the Vandermonde determinant, Schur functions, and the dimension game Cristina Ballantine 1 1 Department of Mathematics and Computer
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More informationThe natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction.
More informationOn a Conjectured Inequality for a Sum of Legendre Polynomials
On a Conjectured Inequality for a Sum of Legendre Polynomials Stefan Gerhold sgerhold@fam.tuwien.ac.at Christian Doppler Laboratory for Portfolio Risk Management Vienna University of Technology Manuel
More informationNew upper bound for sums of dilates
New upper bound for sums of dilates Albert Bush Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303, USA albertbush@gmail.com yzhao6@gsu.edu Submitted: Nov 2, 2016;
More informationA PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction
A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO 1 ERNIE CROOT NEIL LYALL ALEX RICE Abstract. Using purely combinatorial means we obtain results on simultaneous Diophantine
More informationAn Introduction to Tropical Geometry
An Introduction to Tropical Geometry Ryan Hart Doenges June 8, 2015 1 Introduction In their paper A Bit of Tropical Geometry [1], Erwan Brugallé and Kristin Shaw present an elementary introduction to the
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
More informationarxiv: v1 [math.co] 28 Feb 2012
Computational and Theoretical Challenges On Counting Solid Standard Young Tableaux Shalosh B. EKHAD and Doron ZEILBERGER 1 Very Important: This article is accompanied by the Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/solidsyt.
More informationThe Class Equation X = Gx. x X/G
The Class Equation 9-9-2012 If X is a G-set, X is partitioned by the G-orbits. So if X is finite, X = x X/G ( x X/G means you should take one representative x from each orbit, and sum over the set of representatives.
More informationOrdinary Differential Equation Introduction and Preliminaries
Ordinary Differential Equation Introduction and Preliminaries There are many branches of science and engineering where differential equations arise naturally. Now days, it finds applications in many areas
More informationq GAUSS SUMMATION VIA RAMANUJAN AND COMBINATORICS
q GAUSS SUMMATION VIA RAMANUJAN AND COMBINATORICS BRUCE C. BERNDT 1 and AE JA YEE 1. Introduction Recall that the q-gauss summation theorem is given by (a; q) n (b; q) ( n c ) n (c/a; q) (c/b; q) =, (1.1)
More informationNecessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix.
arxiv:math/0506382v1 [math.na] 19 Jun 2005 Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix. Adviser: Charles R. Johnson Department of Mathematics College
More informationGaussian elimination
Gaussian elimination October 14, 2013 Contents 1 Introduction 1 2 Some definitions and examples 2 3 Elementary row operations 7 4 Gaussian elimination 11 5 Rank and row reduction 16 6 Some computational
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationStandard paths in another composition poset
Standard paths in another composition poset Jan Snellman Department of Mathematics, Stockholm University SE-10691 Stockholm, Sweden Jan.Snellmanmath.su.se Submitted: Oct 8, 2003; Accepted: Oct 17, 2004;
More informationMaths for Signals and Systems Linear Algebra for Engineering Applications
Maths for Signals and Systems Linear Algebra for Engineering Applications Lectures 1-2, Tuesday 11 th October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON
More informationExercises for Chapter 1
Solution Manual for A First Course in Abstract Algebra, with Applications Third Edition by Joseph J. Rotman Exercises for Chapter. True or false with reasons. (i There is a largest integer in every nonempty
More informationStanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures
2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon
More informationRecovery Based on Kolmogorov Complexity in Underdetermined Systems of Linear Equations
Recovery Based on Kolmogorov Complexity in Underdetermined Systems of Linear Equations David Donoho Department of Statistics Stanford University Email: donoho@stanfordedu Hossein Kakavand, James Mammen
More informationA Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group
A Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group Cyrus Hettle (cyrus.h@uky.edu) Robert P. Schneider (robert.schneider@uky.edu) University of Kentucky Abstract We define
More information). In an old paper [11], I. N. Sanov
ON TWO-GENERATOR SUBGROUPS IN SL 2 (Z), SL 2 (Q), AND SL 2 (R) ANASTASIIA CHORNA, KATHERINE GELLER, AND VLADIMIR SHPILRAIN ABSTRACT. We consider what some authors call parabolic Möbius subgroups of matrices
More informationDecidability of Sub-theories of Polynomials over a Finite Field
Decidability of Sub-theories of Polynomials over a Finite Field Alla Sirokofskich Hausdorff Research Institute for Mathematics Poppelsdorfer Allee 45, D-53115, Bonn, Germany Department of Mathematics University
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More informationA NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9
A NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9 ERIC C. ROWELL Abstract. We consider the problem of decomposing tensor powers of the fundamental level 1 highest weight representation V of the affine Kac-Moody
More informationAlternative Characterization of Ergodicity for Doubly Stochastic Chains
Alternative Characterization of Ergodicity for Doubly Stochastic Chains Behrouz Touri and Angelia Nedić Abstract In this paper we discuss the ergodicity of stochastic and doubly stochastic chains. We define
More informationSOLUTION SETS OF RECURRENCE RELATIONS
SOLUTION SETS OF RECURRENCE RELATIONS SEBASTIAN BOZLEE UNIVERSITY OF COLORADO AT BOULDER The first section of these notes describes general solutions to linear, constant-coefficient, homogeneous recurrence
More information