MACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS
|
|
- Helena Owens
- 5 years ago
- Views:
Transcription
1 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 portion of Volume II of his famous boo Combinatory Analysis to the introduction of Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. In a series of papers we have shown that MacMahon s method turns into an extremely powerful tool when implemented in computer algebra. In this note we explain how the use of the pacage Omega developed by the authors has led to a generalization of a classical counting problem related to triangles with sides of integer length.. Introduction In his famous boo Combinatory Analysis [2, Vol. II, Sect. 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. We will use MacMahon s method and the Omega pacage for a study of a classical combinatorial problem related to triangles with sides of integer size. We start out by stating the well-nown base case which has been discussed at various places; see e.g. [, 9,, 0, 8], and [3, Ch. 4, Ex. 6]. Problem. Let t 3 n be the number of non-congruent triangles whose sides have integer length and whose perimeter is n. For instance, t 3 9 3, corresponding to , , Find n 3 t 3nq n. Obviously the corresponding generating function is T 3 q : n 3 t 3 n q n q a +a 2+a 3 where is the restricted summation over all positive integer triples a, a 2, a 3 satisfying a a 2 a 3 and a + a 2 > a 3. In order to see how Partition Analysis can be used to compute a closed form representation for n 3 t 3nq n, we need to recall the ey ingredient of MacMahon s method, the Omega operator. Date: February 22, 200. The first author was partially supported by NSF Grant DMS The third author was supported by SFB Grant F305 of the Austrian FWF.
2 2 GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Definition. The operator is given by s s r A s,...,s r λ s λsr r : s 0 A s,...,s r, 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. 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 [2, Vol. II, pp ] of fundamental evaluations. Subsequently he extends this table by new rules whenever he is enforced to do so. Once found, most of these fundamental rules are easy to prove. This is illustrated by the following examples which are taen from MacMahon [2, Vol. II, Art. 354, p. 06]. s r0 Proposition. For integer s 0 and variables A, B being free of λ, λ s λa B λ λ s λa B λ i,j 0 A s A AB ; 2 AB Bs+ + AB s+ A B AB. 3 Proof. Rule 3 is a special case of the more general rule 3; see Lemma 2. Rule 2 is proved as follows. By geometric series expansion the left-hand side equals λ i j s A i B j λ A +j+s B j, j, 0 where the summation parameter i has then been replaced by + j + s. But now sets λ to, which completes the proof. Now we are ready for deriving the closed form expression for T 3 q with Partition Analysis. First, in order to get rid of the diophantine constraints, one rewrites the restricted sum expression in into what MacMahon has called the crude form of the generating function, T 3 q a, a 2,a 3 0 λ a2 a λ a3 a2 2 λ a+a2 a3 3 q a+a2+a3 qλ q λ q λ q, where the last line is by geometric series summation.
3 MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS 3 Next by applying again rule 2 we eliminate successively, λ, and, T 3 q qλ q λ q q2 λ q 3 q 2 q 3 q q 3 q 2 q 3 q 4. 4 This completes the generating function computation and Problem is solved. With our pacage Omega the whole computation can be done automatically and in one stroe. Note that setting-up the crude generating function is done also by the pacage: In[]: <<Omega2.m Out[] Axel Riese s Omega implementation version 2.33 loaded In[2]: OSum[q a+a2+a3, {a 2 a, a 3 a 2, a +a 2 > a 3, a }, λ] Out[2] Assuming a 2 0 Assuming a 3 0 In[3]: OR[%] Out[4] λ,, Eliminating... Eliminating... Eliminating λ... q λ q q λ q λ q 3 q 2 q 3 q 4 As already pointed out in [2], with Partition Analysis one is able to derive much more information. Namely, we can consider the full generating function S 3 x, x 2, x 3 : x a xa2 2 xa3 3, where denotes again the restricted summation over all positive integer triples a, a 2, a 3 satisfying a a 2 a 3 and a + a 2 > a 3. On this expression we can carry out essentially the same Partition Analysis steps as above for obtaining a closed form expression for it. For the crude form one gets S 3 x, x 2, x 3 a, a 2,a 3 0 λ a2 a λ a3 a2 2 λ a+a2 a3 3 x a xa2 2 xa3 3 x λ x λ x2 λ x3. available at
4 4 GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Next by applying again rule 2, we eliminate successively, λ, and as above and obtain S 3 x, x 2, x 3 x λ x λ x 3 x2 x 3 λ x x 2 x 3 x 2 x 3 x x 2 x 3 x3 x x 2 x 3 x 2 x 3 x x 2 x 3 x x 2 x This not only generalizes the generating function T 3 q, i.e. T 3 q S 3 q, q, q, but gives rise also to a complete, parameterized solution of the underlying diophantine set of equations a, a a 2, a 2 a 3, and a + a 2 > a 3. This can be seen by geometric series expansion of 5, namely S 3 x, x 2, x 3 x n2+n3+ x n+n2+n3+ 2 x n+n2+2n3+ 3. In other words, by choosing n,n 2,n 3 0 a n 2 + n 3 +, a 2 n + n 2 + n 3 +, and a 3 n + n 2 + 2n 3 +, and running through all non-negative integers n, n 2, n 3, one constructs in a oneto-one fashion all non-degenerate triangles with sides of integer size. In [3] we considered the following generalization of the triangle problem to -gons where 3. Definition 2. As the set of non-degenerate -gon partitions into positive parts we define τ : {a,..., a Z a a 2 a and a + + a > a }. As the set of non-degenerate -gon partitions of n into positive parts we define τ n : {a,..., a τ a + + a n}. The corresponding cardinality is denoted by t n : τ n. The term non-degenerate refers to the restriction to strict inequality, i.e. to a + + a > a. In the form of 4 we computed a rational expression for T 3 q n 3 t 3nq n. With the Omega pacage in hand, we are able to compute also the next cases in a purely mechanical manner. For instance, t 4 n q n q 4 + q + q 5 q 2 q 3 q 4 q 6, 6 and n 4 t 5 n q n q 5 q q q 2 q 4 q 5 q 6 q 8, 7 n 5 t 6 n q n q 6 q 4 + q 5 + q 7 q 8 q 3 q q 2 q 3 q 4 q 6 q 8 q 0. 8 n 6
5 MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS 5 From these results we were able to derive a number of partition theoretical consequences. However, despite the fact that the particular instances of n t nq n can be computed so easily, we were not able to find a common underlying pattern. So we stated as an open problem: Problem 2. In view of the generating function representations 4, 6, 7, and 8: Is it possible to find a common pattern for all possible choices of? In Section 2 we provide an affirmative answer to this problem. More precisely, we give closed form expressions for T q as well as for the corresponding general version S x,..., x defined as follows: Definition 3. For integer 3, T q : n t n q n, and S x,..., x : x a xa. a,...,a τ Finally, Section 3 provides some concluding remars. 2. Generating Functions for -Gon Partitions In this section we prove the following main result for -gon partitions. Theorem. Let 3 and X i x i x for i. Then S x,..., x X X X 2 X X X 2 X X X 2 X X 3 X 2 X X 2. Since T q S q,..., q, Theorem implies the desired generating function representation. Corollary. For 3, T q q q q 2 q q2 2 q 9 q 2 q 4 q Remar. It is easily verified that 0 is bringing the representations 4, 6, 7, and 8 of the special cases 3, 4, 5, 6 under one umbrella. We shall prove Theorem with Partition Analysis. To this end we first need the crude form of S x,..., x. Proposition 2. For 3, S x,..., x x λ λ x2 λ λ x λ x3 λ x λ 2 λ λ x λ λ.
6 6 GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Proof. For fixed integer 3, S x,..., x a a 2,...,a 0 x a xa λa2 a λ a a λ a+ +a a by the definition of. The rest follows by geometric series summation. The next step is the successive elimination of λ,,..., λ from the crude form. For this it is convenient to introduce a lemma. Lemma. Let 3 and let y,..., y be free of λ,..., λ. Then y λ y λ y2 λ y λ 2 λ y λ y y y y y y y. Proof. We proceed by induction on. For 3, y λ y λ y2 λ y3 y λ y λ y3 y 2 y 3 λ by 2 with s 0 y y 2 y 3. y 2 y 3 y 3 y y 2 y 3 by 2 with s For the induction step we apply again rule 2 with s 0, y λ y λ y2 λ y λ 2 λ y λ λ y+ λ y + y λ y λ y2 λ y λ 2 λ y y + λ y + y y + y y + y y y + y y + ; for the last line we used the induction hypothesis. Now we are in the position to state the crude form of S x,..., x. Proposition 3. Let 3 and X i x i x for i. Then S x,..., x X X Proof. By Proposition 2, S x,..., x λ 3 X λ X 2 λ X 3 X λ 2 y λ λ. 2 y λ y2 λ y λ 2 λ y λ, where y x λ,..., y x λ and y x /λ. By Lemma this is equal to x x λ 3 x λ x x x 2 x x λ x x λ 2
7 MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS 7 which is the right-hand side of 2. In order to complete the proof of Theorem we need another elementary lemma; namely, the special case m,, and j i i of our reduction algorithm described in [4]. However, for the sae of better readability we state and prove it explicitly. Lemma 2. Let, a 0, and let y, y,..., y be free of λ. Then λ a y λ y λ y 2 y λ y y y y a+ y y y 2 y 2 y y y. Remar. Formula 3 of Proposition is the special case. Proof. The left hand-side of 3 equals s,...,s 0 r 0 s,...,s 0 y s ys yr λ s+2 s2+ + s +a r y s ys s + + s +a and the lemma follows by applying m r0 yr y m+ / y. Finally we come to the proof of Theorem. Proof of Theorem. By Proposition 3, S x,..., x X X X X r0 λ 3 X λ X 2 λ X 3 X λ 2 X X 2 X 2 X X 2 X 2 X X 3 X 2 X X 2 y r X where the last equality is by Lemma 2 with a 3 and y X, y X 2, y 2 X 3,..., y 2 X. This completes the proof of Theorem. 3. Conclusion As shown in a series of articles [3, 4, 5, 6, 7], Partition Analysis is ideally suited for being supplemented by computer algebra methods. In these papers the Mathematica pacage Omega which had been developed by the authors, was used as an essential tool. The Omega pacage played a crucial role also in discovering Theorem above. However, it is important to note that the computations 4, 6, 7, and 8 for T q with 3, 4, 5, 6 have not led us to Theorem. Rather than this, the main point in the study of -gon partitions was the careful Omega investigation of the full generating function S x,..., x ; only in this generality the underlying pattern was finally revealed. 3,
8 8 GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Another remar concerns the constructive use of Theorem. As a matter of fact, formula 9 can be used to construct -gon partitions in the same way as explained in the introduction with the special case 5. In [2] refinements of the base case 3 of Theorem and Corollary have been considered. We expect that experiments with the Omega pacage will lead to more general results in this direction. References [] G.E. Andrews, A note on partitions and triangles with integer sides, Amer. Math. Monthly , [2], MacMahon s partition analysis II: Fundamental theorems, Ann. Comb [3] G.E. Andrews, P. Paule and A. Riese, MacMahon s partition analysis III: The Omega pacage, SFB Report 99-24, J. Kepler University, Linz, 999. to appear [4], MacMahon s partition analysis VI: A new reduction algorithm, SFB Report 0-4, J. Kepler University, Linz, 200. to appear [5], MacMahon s partition analysis VII: Constrained compositions, SFB Report 0-5, J. Kepler University, Linz, 200. to appear [6], MacMahon s partition analysis VIII: Plane Partition Diamonds, SFB Report 0-6, J. Kepler University, Linz, 200. to appear [7] 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, to appear [8] R. Honsberger, Mathematical Gems III, Math. Assoc. of America, Washington, 985. [9] J.H. Jordan, R. Walsh and R.J. Wisner, Triangles with integer sides, Notices Amer. Math. Soc , A-450. [0] J.H. Jordan, R. Walsh, and R.J. Wisner, Triangles with integer sides, Amer. Math. Monthly , [] C.I. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New Yor, 968. [2] P.A. MacMahon, Combinatory Analysis, 2 vols., Cambridge University Press, Cambridge, Reprinted: Chelsea, New Yor, 960 [3] R.P. Stanley, Enumerative Combinatorics Volume, Wadsworth, Monterey, California, 986. Department of Mathematics, The Pennsylvania State University, University Par, PA 6802, USA address: andrews@math.psu.edu Research Institute for Symbolic Computation, Johannes Kepler University Linz, A 4040 Linz, Austria address: Peter.Paule@risc.uni-linz.ac.at Research Institute for Symbolic Computation, Johannes Kepler University Linz, A 4040 Linz, Austria address: Axel.Riese@risc.uni-linz.ac.at
MacMahon s Partition Analysis VIII: Plane Partition Diamonds
MacMahon s Partition Analysis VIII: Plane Partition Diamonds George E. Andrews * Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA E-mail: andrews@math.psu.edu Peter
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 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 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 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 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 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 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 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 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 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 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 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 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 informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
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 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 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 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 informationBilateral truncated Jacobi s identity
Bilateral truncated Jacobi s identity Thomas Y He, Kathy Q Ji and Wenston JT Zang 3,3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 30007, PR China Center for Applied Mathematics Tianjin
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 informationGeneralized Akiyama-Tanigawa Algorithm for Hypersums of Powers of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 16 (2013, Article 1332 Generalized Aiyama-Tanigawa Algorithm for Hypersums of Powers of Integers José Luis Cereceda Distrito Telefónica, Edificio Este
More informationOn the possible quantities of Fibonacci numbers that occur in some type of intervals
On the possible quantities of Fibonacci numbers that occur in some type of intervals arxiv:1508.02625v1 [math.nt] 11 Aug 2015 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
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 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 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 information, when k is fixed. We give a number of results in. k q. this direction, some of which involve Eulerian polynomials and their generalizations.
SOME ASYMPTOTIC RESULTS ON -BINOMIAL COEFFICIENTS RICHARD P STANLEY AND FABRIZIO ZANELLO Abstract We loo at the asymptotic behavior of the coefficients of the -binomial coefficients or Gaussian polynomials,
More information4-Shadows in q-series and the Kimberling Index
4-Shadows in q-series and the Kimberling Index By George E. Andrews May 5, 206 Abstract An elementary method in q-series, the method of 4-shadows, is introduced and applied to several poblems in q-series
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 informationCongruences modulo high powers of 2 for Sloane s box stacking function
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume (009), Pages 55 6 Congruences modulo high powers of for Sloane s box stacking function Øystein J. Rødseth Department of Mathematics University of Bergen, Johs.
More informationTHE LECTURE HALL PARALLELEPIPED
THE LECTURE HALL PARALLELEPIPED FU LIU AND RICHARD P. STANLEY Abstract. The s-lecture hall polytopes P s are a class of integer polytopes defined by Savage and Schuster which are closely related to the
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More 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 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 informationNEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE
NEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE To George Andrews, who has been a great inspiration, on the occasion of his 70th birthday Abstract.
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 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 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 Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.3 A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! Ira M. Gessel 1 and Guoce Xin Department of Mathematics Brandeis
More informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
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 informationarxiv: v1 [math.co] 18 Dec 2018
A Construction for Difference Sets with Local Properties Sara Fish Ben Lund Adam Sheffer arxiv:181.07651v1 [math.co] 18 Dec 018 Abstract We construct finite sets of real numbers that have a small difference
More information1. Introduction
Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
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 informationThe Bhargava-Adiga Summation and Partitions
The Bhargava-Adiga Summation and Partitions By George E. Andrews September 12, 2016 Abstract The Bhargava-Adiga summation rivals the 1 ψ 1 summation of Ramanujan in elegance. This paper is devoted to two
More informationWieland drift for triangular fully packed loop configurations
Wieland drift for triangular fully packed loop configurations Sabine Beil Ilse Fischer Fakultät für Mathematik Universität Wien Wien, Austria {sabine.beil,ilse.fischer}@univie.ac.at Philippe Nadeau Institut
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
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 informationADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE
ADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE ANDREAS LEOPOLD KNUTSEN Abstract. These notes are written as supplementary notes for the course MAT11- Real Analysis, taught at the University
More informationAn Algebraic Identity of F.H. Jackson and its Implications for Partitions.
An Algebraic Identity of F.H. Jackson and its Implications for Partitions. George E. Andrews ( and Richard Lewis (2 ( Department of Mathematics, 28 McAllister Building, Pennsylvania State University, Pennsylvania
More informationCOMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS
COMPOSITIONS PARTITIONS AND FIBONACCI NUMBERS ANDREW V. SILLS Abstract. A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions
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 informationEnumeration Problems for a Linear Congruence Equation
Enumeration Problems for a Linear Congruence Equation Wun-Seng Chou Institute of Mathematics Academia Sinica and Department of Mathematical Sciences National Chengchi University Taipei, Taiwan, ROC E-mail:
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 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 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 informationAsymptotic Counting Theorems for Primitive. Juggling Patterns
Asymptotic Counting Theorems for Primitive Juggling Patterns Erik R. Tou January 11, 2018 1 Introduction Juggling patterns are typically described using siteswap notation, which is based on the regular
More informationThe Truncated Pentagonal Number Theorem
The Truncated Pentagonal Number Theorem George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 16802 USA Mircea Merca Doctoral School in Applied Mathematics University
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 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 informationCOMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS
COMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS AE JA YEE 1 Abstract In his memoir in 1984 George E Andrews introduces many general classes of Frobenius partitions (simply F-partitions)
More informationUnbounded Regions of Infinitely Logconcave Sequences
The University of San Francisco USF Scholarship: a digital repository @ Gleeson Library Geschke Center Mathematics College of Arts and Sciences 007 Unbounded Regions of Infinitely Logconcave Sequences
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 informationMINIMAL NORMAL AND COMMUTING COMPLETIONS
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 4, Number 1, Pages 5 59 c 8 Institute for Scientific Computing and Information MINIMAL NORMAL AND COMMUTING COMPLETIONS DAVID P KIMSEY AND
More informationOn a Balanced Property of Compositions
On a Balanced Property of Compositions Miklós Bóna Department of Mathematics University of Florida Gainesville FL 32611-8105 USA Submitted: October 2, 2006; Accepted: January 24, 2007; Published: March
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 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 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 informationSymmetric functions and the Vandermonde matrix
J ournal of Computational and Applied Mathematics 172 (2004) 49-64 Symmetric functions and the Vandermonde matrix Halil Oruç, Hakan K. Akmaz Department of Mathematics, Dokuz Eylül University Fen Edebiyat
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 informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More informationA multiplicative deformation of the Möbius function for the poset of partitions of a multiset
Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered
More informationCAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS
CAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS MATJAŽ KONVALINKA AND IGOR PAK Abstract. In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationINTERVAL PARTITIONS AND STANLEY DEPTH
INTERVAL PARTITIONS AND STANLEY DEPTH CSABA BIRÓ, DAVID M. HOWARD, MITCHEL T. KELLER, WILLIAM. T. TROTTER, AND STEPHEN J. YOUNG Abstract. In this paper, we answer a question posed by Herzog, Vladoiu, and
More informationInteger partitions into Diophantine pairs
Availaible on line at http://www.liforce.usthb.dz bulletin-liforce@usthb.dz Bulletin du Laboratoire 04 (015) 8-35 Integer partitions into Diophantine pairs Zahra YAHI 1, Nesrine BENYAHIA TANI, Sadek BOUROUBI
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 informationSome Generalized Fibonomial Sums related with the Gaussian q Binomial sums
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103 No. 1, 01, 51 61 Some Generalized Fibonomial Sums related with the Gaussian q Binomial sums by Emrah Kilic, Iler Aus and Hideyui Ohtsua Abstract In this
More informationTHE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS
THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical
More informationApplication of Logic to Generating Functions. Holonomic (P-recursive) Sequences
Application of Logic to Generating Functions Holonomic (P-recursive) Sequences Johann A. Makowsky Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel http://www.cs.technion.ac.il/
More informationMOCK THETA FUNCTIONS AND THETA FUNCTIONS. Bhaskar Srivastava
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 36 (2007), 287 294 MOCK THETA FUNCTIONS AND THETA FUNCTIONS Bhaskar Srivastava (Received August 2004). Introduction In his last letter to Hardy, Ramanujan gave
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationExplicit formulas using partitions of integers for numbers defined by recursion
Explicit formulas using partitions of integers for numbers defined by recursion Giuseppe Fera, Vittorino Talamini, arxiv:2.440v2 [math.nt] 27 Feb 203 DCFA, Sezione di Fisica e Matematica, Università di
More informationOn the Ordinary and Signed Göllnitz-Gordon Partitions
On the Ordinary and Signed Göllnitz-Gordon Partitions Andrew V. Sills Department of Mathematical Sciences Georgia Southern University Statesboro, Georgia, USA asills@georgiasouthern.edu Version of October
More informationResearch Article On Maslanka s Representation for the Riemann Zeta Function
International Mathematics and Mathematical Sciences Volume 200, Article ID 7447, 9 pages doi:0.55/200/7447 Research Article On Maslana s Representation for the Riemann Zeta Function Luis Báez-Duarte Departamento
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 informationNew infinite families of Candelabra Systems with block size 6 and stem size 2
New infinite families of Candelabra Systems with block size 6 and stem size 2 Niranjan Balachandran Department of Mathematics The Ohio State University Columbus OH USA 4210 email:niranj@math.ohio-state.edu
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationRAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS
RAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS BRUCE C. BERNDT, BYUNGCHAN KIM, AND AE JA YEE Abstract. Combinatorial proofs
More informationCOMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia
#A2 INTEGERS 9 (209) COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia imartinjak@phy.hr Helmut Prodinger Department of Mathematics,
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 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 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 informationAdvances in Applied Mathematics
Advances in Applied Mathematics 45 (010) 334 345 Contents lists available at ScienceDirect Advances in Applied Mathematics www.elsevier.com/locate/yaama On recurrences for Ising integrals Flavia Stan 1
More information