= (q) M+N (q) M (q) N
|
|
- Trevor Floyd
- 6 years ago
- Views:
Transcription
1 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS JEHAE DOUSSE AD BYUGCHA KIM Abstract We define an overpartition analogue of Gaussian polynomials (also known as -binomial coefficients) as a generating function for the number of overpartitions fitting inside the M rectangle We call these new polynomials over Gaussian polynomials or over -binomial coefficients We investigate basic properties and applications of over -binomial coefficients In particular, via the recurrences and combinatorial interpretations of over -binomial coefficients, we prove a Rogers-Ramauan type partition theorem 1 introduction Gaussian polynomials are defined by M + G(M, ) () M+ () M (), where (a) n (a; ) n : n k1 (1 ak 1 ) for n 0 { } These polynomials (also known as -binomial coefficients) have played many roles in combinatorics and number theory For example, Gaussian polynomials serve as generating functions for the number of inversions in permutations of a multi-set, the number of restricted partitions and the number of dimensional subspaces of M + dimensional vector spaces over F Our interest in this paper is to study an overpartition analogue of Gaussian polynomials Recall G(M, ) is the generating function for the number of partitions of n fitting inside an M rectangle, ie with largest part M and number of parts (For example, see [1]) In this light, we define our overpartition analogue of Gaussian polynomials, which we will call over -binomial coefficients, as the generating function for the number of overpartitions fitting inside an M rectangle An overpartition [9] is a partition in which the last occurrence of each distinct number Date: April 29, Mathematics Subect Classification 05A17, 11P81, 11P84 This research was supported by the International Research & Development Program of the ational Research Foundation of Korea (RF) funded by the Ministry of Education, Science and Technology(MEST) of Korea (RF-2014K1A3A1A ), and the STAR program number 32142ZM 1
2 2 JEHAE DOUSSE AD BYUGCHA KIM may be overlined For example, the 8 overpartitions of 3 are 3, 3, 2 + 1, 2 + 1, 2 + 1, 2 + 1, , Overpartitions have recently played an important role in the construction of weight 3/2 mock modular forms [5] and in the combinatorial proof of the 1 ψ 1 summation formula [17], and their arithmetic properties have been of great interest [4, 6, 14, 16] Our first result is an expression for over -binomial coefficients M+ Theorem 11 For positive integers M and, min{m,} M + k(k+1) () M+ k 2 () k () M k () k k0 Remarks 1 (i) The above expression can be rewritten by employing -trinomial coefficients a + b + c () a+b+c a, b, c () a () b () c (ii) We have an obvious symmetry M + M + M (iii) We will omit from the notation if it is clear from the context that the base is For example, from Theorem 11 we find that , 3 and we can check that there are 12 overpartitions of 5 fitting inside a 3 3 rectangle as follows 3 + 2, 3 + 2, 3 + 2, 3 + 2, , , , , , , Just as -binomial coefficients satisfy simple recurrences, which are the -analogues of Pascal s identity [M ] + M + 1 M M, 1 M + M + 1 M + 1 +, 1 over -binomial coefficients also satisfy similar recurrences Theorem 12 For positive integers M and, we have
3 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 3 (i) M + M (ii) M + M + 1 M + 1 M (11) 1 M + 1 M M + M (12) 1 1 By employing over -binomial coefficients, we can establish various identities We discuss these applications in Section 3 Here, we highlight that over -binomial coefficients can be used to derive a Rogers-Ramanuan type theorem for overpartitions The first Rogers-Ramanuan identity is given by n0 n2 () n 1 (; 5 ) ( 4 ; 5 ) The left-hand side can be interpreted as the generating function for partitions with a gap 2 between two successive parts, and the right-hand side as the generating function for partitions into parts 1, 4 (mod 5) Rogers-Ramanuan identities have been proved via various methods Among them, one of the most elementary and beautiful is a proof by Andrews which uses recurrence relations of -binomial coefficients [2, 3] Motivated by this proof, we find a Rogers-Ramanuan type identity for overpartitions Before stating the result, we define three partition functions Let A(n) be the number of overpartitions λ λ l of n satisfying the following gap conditions { 1, if λ i is not overlined, λ i λ i+1 2, if λ i is overlined (If there are l parts in the overpartition, we define λ l+1 0 for convenience, thus 1 cannot be a part) We define B(n) as the number of overpartitions of n with nonoverlined parts 2 (mod 4) and C(n) as the number of partitions into parts 0 (mod 4), ie the number of 4-regular partitions of n Theorem 13 For all non-negative integers n, A(n) B(n) C(n) Remark 1 This is a special case of [12, Theorem 12], which is generalized by Chen, Sang, and Shi [8] While the previous results are obtained by employing Bailey chain machinery, we use the recurrence formulas for over -binomial coefficients The euality B(n) C(n) is clear from Euler s partition theorem (the number of partitions into odd parts euals the number of partitions into distinct parts), thus
4 4 JEHAE DOUSSE AD BYUGCHA KIM the important euality is A(n) B(n) Here we illustrate Theorem 13 for the case n 8 There are 16 overpartitions satisfying the gap conditions: 8, 8, 7 + 1, 7 + 1, 6 + 2, 6 + 2, 6 + 2, 6 + 2, 5 + 3, 5 + 3, 5 + 3, 5 + 3, , , , , and there are also 16 overpartitions satisfying the congruence conditions: 8, 7 + 1, 6 + 2, 6 + 2, 6 + 2, 6 + 2, 5 + 3, , , , , , , , , The rest of paper is organized as follows In Section 2, we prove Theorem 11 and the recurrence formulas of Theorem 12 In Section 3, we give several applications of over -binomial coefficients In Section 4, by using recurrence formulas we prove a Rogers-Ramauan type identity for overpartitions 2 Basic Properties of over -binomial coefficients We start with the proof of Theorem 11 Proof of Theorem 11 Let G(M,, k) be the generating function for overpartitions fitting inside an M rectangle and having exactly k overlined parts Such an overpartition can be decomposed as a partition into k distinct parts, each of which is at most M, and a partition fitting inside an M ( k) box By appending a partition fitting into an (M k) k box (generated by M ) to the right of the k staircase partition (k, k 1,, 1) (generated by k(k+1) 2 ), we see that k(k+1) M 2 k generates partitions into k distinct parts M As [ +M k k fitting inside M ( k) box, we see that G(M,, k) k(k+1) 2 [ M k ] + M k k k(k+1) 2 ] generates the partitions () M+ k () k () M k () k Since G(M,, k) is non-zero if and only if 0 k min{m, }, we have + M min{m,} k0 G(M,, k) ow we turn to proving the recurrences min{m,} k0 k(k+1) 2 () M+ k () k () M k () k
5 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 5 Combinatorial proof of Theorem 12 Let O(M,, n) denote the number of overpartitions of n fitting inside an M rectangle ote that O(M,, n) O(M, 1, n) is the number of overpartitions of n fitting inside an M rectangle having exactly parts Let λ be such an overpartition If the smallest part of λ is 1, then by removing 1 from every part we obtain an overpartition of n fitting inside (M 1) ( 1) rectangle If the smallest part of λ is different from 1, by removing 1 from every part we arrive at an overpartition of n fitting inside an (M 1) rectangle Therefore, we find that O(M,, n) O(M, 1, n) O(M 1, 1, n ) + O(M 1,, n ) By rewriting the above identity in terms of generating functions we obtain the first recurrence The second recurrence follows from a similar argument by tracking the size of the maximum part instead of the number of parts ote that O(M,, n) O(M 1,, n) is the number of overpartitions of n fitting inside an M rectangle with largest part eual to M If the largest part is overlined, then by removing it we obtain an overpartition of n M fitting inside a (M 1) ( 1) rectangle If the largest part is not overlined, then by removing it we obtain an overpartition of n M fitting inside a M ( 1) rectangle Therefore, we find that O(M,, n) O(M 1,, n) O(M 1, 1, n M) + O(M, 1, n M) By rewriting the above identity in terms of generating functions we obtain the second recurrence Analytic Proof of Theorem 12 We first note that -trinomial coefficients satisfy the following recurrence a + b + c a + b + c 1 a + b + c 1 a + b + c 1 + a + a+b a, b, c a 1, b, c a, b 1, c a, b, c 1 Therefore, we find that min{m,} M + ( M + k 1 k(k+1)/2 k 1, k, M k k0 ) M + k 1 + k, k, M k 1 min{m, 1} M + k 1 k(k+1)/2 k, M k, 1 + k0 min{m 1, 1} k0 [ ] k(k+1)/2+ M + k 2 k, M 1 k, 1 k M + k 1 + k k, k 1, M k
6 6 JEHAE DOUSSE AD BYUGCHA KIM min{m 1,} M + k 1 + k(k+1)/2+ k, M 1 k, 1 k0 M + 1 M + 2 M , 1 1 where we have made a change of variable k k + 1 in the second sum The second recurrence can be proved similarly Throughout the paper, we use the following asymptotic behaviour freuently Proposition 21 For a non-negative integer, lim ( ) () Proof When goes to the infinity, the restriction on the number of parts disappears Proposition 21 is useful to obtain new identities For example, by taking a limit in Theorem 11, we find that k(k+1)/2 ( ), () k () k () k0 which gives an alternative generating function for overpartitions into parts This identity is also a special case of the finite -binomial theorem [11, Exer 12(vi)] 3 Applications By tracking the number of parts in the overpartitions, we prove the following identity Proposition 31 For a positive integer, ( z) (z) 1 + k 1 ( [ ] + k 1 z k k k + ) + k 2 k 1 Proof Let p (n, k) be the number of overpartitions of n into parts with k parts Then, it is not hard to see that ( z) p (z) (n, k)z k n n 0 k 0 Let λ be an overpartition counted by p (n, k) Discussing whether the smallest part of λ is eual to 1 and removing 1 from each part as in the proof of Theorem 12, we have p (n, k) O( 1, k, n k) + O( 1, k 1, n k)
7 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 7 Thus n 0 The claimed identity follows ( [ ] + k 1 p (n, k) n k + k ) + k 2 k 1 By taking the limit as in the above proposition, we find the following generating function Corollary 32 Let p(n, k) be the number of overpartitions of n with k parts Then, n 0 k 0 p(n, k)z k n ( z) (z) k 1 z k k ( ) k 1 () k Remark 2 The above identity is a special case of the -binomial theorem [11, (II3)] ote that k 1 k ( ) k 1 () k k 1 k k 1 n 1 τ(n) n (mod 2), where τ(n) is the number of divisors of n This recovers a well known congruence Corollary 33 For all non-negative integers n, p(n) 2τ(n) (mod 4) Our next application is finding an analogue of Sylvester s identity [15]: ( x; ) 1 x 3( 1)/2 1 + ( x; ) 1 x +1 3(+1)/2 1 We define S(; x; ) as S(; x, ) : Then we have the following identity Theorem 34 For a positive integer, ( [ ] ) 1 1 x x (x) 1 2 (x) S(; x; ) (x)
8 8 JEHAE DOUSSE AD BYUGCHA KIM Proof Let us consider an overpartition into parts, generated by (x) The variable counts the size of the Durfee suare of the overpartition The Durfee suare is generated x 2 Then either the corner at the bottom right of the Durfee suare is overlined or it is not If it is overlined, then we have an overpartition generated by [ 1 1 ] at the right of the Durfee suare, and an overpartition generated by 1 (x) 1 under it If it is not overlined, then we have an overpartition generated by to the right of the Durfee suare, and an overpartition generated by (x) two cases correspond to the two sums in S(; x; ) under it These By taking a limit and using Proposition 21, we obtain the following identity Corollary 35 We have (x) ( ( ) 1 () 1 1 x 2 + ( ) (x) 1 () ) x 2 (x) In particular, by setting x 1 we obtain a well known theta function identity () n n2 ( ) n Z As another application, we obtain the overpartition rank generating function To explain Ramanuan s famous three partition congruences, Dyson [10] introduced the rank for the partition as the difference between the size of the largest part and the number of parts For an overpartition, we can define a rank in the same way [7] Let (m, n) be the number of overpartitions of n with rank m Then, we can express the generating function in terms of over -binomial coefficients Theorem 36 For a non-negative integer m, m () : n 0 (m, n) n 2 1+m + k 2 2k + m 3 + k 2 ( [2k ] + m 2 2k+m 1 + k 1 ) 2k + m 4 k 2 2k + m 3 + k 1 Proof If there is only one part in the overpartition, m + 1 and m + 1 are the only two such overpartitions with rank m, which corresponds to 2 m+1 ow we assume that an overpartition has at least two parts and the rank of the overparition is m
9 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 9 Under this assumption, the largest part would be m + k and the number of part is k, this corresponds to m+2k 1 inside the summation ow the first sum counts the case where the largest part is not overlined and there is no 1 The second sum counts the case where the largest part is overlined and there is no 1 The third sum counts the case where the largest part is not overlined and the smallest part is 1 The last sum corresponds to the case where the largest part is overlined and the smallest part is 1 By comparing the known generating function for m () [13, Proposition 32] m () 2 ( ) () we derive the following identity n 1 Corollary 37 For a non-negative integer m, 2 ( ) n 1 n2 + m n (1 n ) () 1 + n n 1 n 1 n2 + m n (1 n ) 1 + n, ( [2k ] + m 2 2k+m 1 + k m + k 2 2k + m k 2 2k + m 3 k 1 ) 2k + m 4 k 2 4 Proof of a Rogers-Ramanuan type identity We first define two functions D(, x; ) : [ 0 ] x (+1)/2 and C(, x; ) : 0 [ ] (x) x 2 ( (2+1) x (+1)(2+1)) The following observation is the key for obtaining a Rogers-Ramanuan type identity Theorem 41 For a positive integer, (x) D(, x; ) C(, x; ) x 2 +3 Z[[x, ]] By taking the limit as, we obtain the following corollary
10 10 JEHAE DOUSSE AD BYUGCHA KIM Corollary 42 We have (x) D(, x; ) C(, x; ) In particular, the case x 1 is a Rogers-Ramanuan type identity, where we applied Lemma 21 to evaluate the limit Corollary 43 We have () D(, 1; ) n n(2n+1) (, 3, 4 ; 4 ) ( ) n Z Proof of Theorem 13 After multiplying ( ) () we obtain that k0 k(k+1)/2 ( ) k () k ( ) ( 2 ; 4 ) to both sides and from the definitions, 1 (, 2, 3 ; 4 ) A basic partition theoretic interpretation of the above identity gives the desired result ow we turn to proving Theorem 41 Let g(, x) : (x) D(, x) The key idea of the proof is that g(, x) and C(, x) satisfy the same recurrence (up to a high power of times a polynomial in x and ) as follows Lemma 44 Lemma 45 g(, x) (1 x)g( 1, x) + (x) 2 2 x 2 g( 2, x 2 ) C(, x) (1 x)c( 1, x) (x) 2 2 x 2 C( 2, x 2 ) x 2 +3 Z[[x, ]] (41) Theorem 41 follows immediately from these two recurrences and an induction over We now need to prove these lemmas Proof of Lemma 44 By applying the first recurrence in Theorem 12, we find that D(, x) ( [ ] ) x 1 (+1)/2 0 1 x +1 (+1)(+2)/2 + D( 1, x) + 2 x +1 (+1)(+4)/2 0 0 (1 + x)d( 1, x) + x 2 D( 2, x 2 ), where we replace 1 by in the first and the third sum for the second identity After multiplying by (x) we get the desired recurrence
11 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 11 Proof of Lemma 45 We calculate each term in (41) By the definition of C, we find that (1 x)c( 1, x) (1+x) 1 (x)+1 ( ) x x Expanding and making the change of variable 1 in the fourth sum, we get (1 x)c( 1, x) 1 (x)+1 x (x) x (x)+1 x (42) (x) 1 x (x) By the change of variable 1 in the definition of 2 2 x 2 C( 2, x 2 ), we obtain (x) 2 x 2 C( 2, x 2 ) 2 (x) x (43) 2 (x)+1 1 x Using the first recurrence (11) on the first sum in (42) and the second sum in (43) and extracting the term 0 in the first and third sums of (42) leads to (1 x)c( 1, x) + (x) 2 x 2 C( 2, x 2 ) 2 1 x + (x)+1 x (x) x (x)+1 +1 x (44)
12 12 JEHAE DOUSSE AD BYUGCHA KIM (x)+1 x (x) 1 x (x) x ow we want to write both C(, x) and (1 x)c( 1, x)+ (x) 2 2 x 2 C( 2, x 2 ) as sums involving the product to be able to make cancellations We have (x) +1 C(, x) (x) ( ) 1 + x +1 x (x) ( ) 1 + x x Extracting the terms 0 of each sum and expanding, we get C(, x) 1 x + (x) x (x) x (x) +1 x (x) +1 x (45) Rewriting all the sums in (44) except the third one in terms of (x) +1 leads to (1 x)c( 1, x) + (x) 2 x 2 C( 2, x 2 ) (46) 2 1 x + (x) x (x) +1 x
13 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS (x) 1 +1 x (x) 1 x (x)+1 +1 x (47) (x) x (x) +1 x (x) 1 x (x) 1 x (x) 1 +1 x (x) 1 x Subtracting (45) from (47) and noting that the third sum of (45) cancels with the second sum of (47) we obtain C(, x) (1 x)c( 1, x) (x) 2 x 2 C( 2, x 2 ) 2 (x) x (x) x (x) +1 x (48) (49) (410)
14 14 JEHAE DOUSSE AD BYUGCHA KIM (x) +1 x (x) 1 x (x) 1 +1 x (x)+1 x (x) +1 x (x) x (x) 1 +1 x (x) 1 +1 x (x) 1 x (411) (412) (413) (414) (415) (416) (417) (418) (419) (x) 1 +1 x (420) +1 By the second recurrence (12), we observe that the sum (413) is eual to 2 (x) 1 +1 x O ( x 3 +5), (421) +1 where we define f(x, ) O(x k l ) to mean that f(x, ) x k l Z[[x, ]] Thus by the first recurrence (11), the sum of (49), (413), (415) and (418) is eual to O ( x 3 +5) Furthermore, by the second recurrence (12), the sum of (410) and (416) is O ( x 4 +7) Finally again by the second recurrence (12), the sum (411) is eual to 1 (x) +1 x O ( x 2 +3) +1 1
15 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 15 Thus by the first recurrence (11), the sum of (48), (411), (417) and (420) is eual to O ( x 2 +3) Hence we are left with the following C(, x) (1 x)c( 1, x) (x) 2 x 2 C( 2, x 2 ) 2 1 (x) 1 x (x)+1 x (x) 1 x O ( x 2 +3) By the second recurrence (12), the third sum is eual to 1 (x) 1 x O ( x 3 +7) +1 1 Factorising it with the first sum we get C(, x) (1 x)c( 1, x) (x) 2 x 2 C( 2, x 2 ) 2 1 (x)+1 x (x) 1 x O ( x 2 +3) ow by a simple change of variable 1 we see that the two sums are cancelled, and this completes the proof 5 Concluding Remarks In this paper, we introduced a polynomial version of the overpartition generating function and its applications in the theory The main theme is emphasizing combinatorial motivations and roles of recurrence formulas to derive results In this sense, the finite form of the identities are the main obects of this paper The limiting version of the identities can also be proven using well-known transformation formulas in the theory of basic hypergeometric series We can recover Corollary 35 by setting a x,
16 16 JEHAE DOUSSE AD BYUGCHA KIM b, and c, d in the very-well-poised 6 φ 5 summation [11, (II20)] Corollary 42 can also be proven via employing 8 φ 7 summation and Heine s transformation By setting a x, b, and c, d, e, f in 8 φ 7 summation [11, (III23)], we find that C(, x; ) (x) lim e,f 2 φ 1 (e, f; x;, x 2 /ef) By employing Heine s transformation [11, (III2)], we can derive that the limit in the above euation is the same as 1 D(, x; ) Acknowledgement The authors thank Jeremy Loveoy for the valuable discussions and comments at every stage of this paper References [1] G E Andrews, The Theory of Partitions, Addison Wesley, Reading, MA, 1976; reissued: Cambridge University Press, Cambridge, 1998 [2] G E Andrews, J J Sylvester, Johns Hopkins and partitions, in A Century of Mathematics in America, Part I, P Duren, ed, American Mathematical Society, Providence, RI, 1988, [3] G E Andrews, On the proofs of the Rogers Ramanuan identities, in -Series and Partitions, D Stanton, ed, Springer-Verlag, ew York, 1989, 1âĂŞ14 [4] GE Andrews, SH Chan, B Kim, R Osburn, The first positive rank and crank moments for overpartitions, preprint [5] K Bringmann, J Loveoy, Overpartitions and class numbers of binary uadratic forms, Proc atl Acad Sci USA 106 (2009), no 14, [6] K Bringmann, J Loveoy, Rank and congruences for overpartition pairs, Int J umber Theory 4 (2008), [7] K Bringmann, J Loveoy, Dyson s rank, overpartitions, and weak Maass forms Int Math Res ot (2007), rnm063 [8] WYC Chen, DDM Sang, and DYH Shi, The Rogers-Ramanuan-Gordon theorem for overpartitions, Proc London Math Soc 106 (2013) [9] S Corteel, J Loveoy Overpartitions, Trans Amer Math Soc 356 (2004), no 4, [10] FJ Dyson, Some guesses in the theory of partitions, Eureka 8 (1944), [11] G Gasper and M Rahman, Basic Hypergeometric Series, 2nd Edition, Cambridge Univ Press, Cambridge, 2004 [12] J Loveoy, Gordon s theorem for overpartitions, J Combin Theory Ser A 103 (2003), [13] J Loveoy, Rank and conugation for the Frobenius representation of an overpartition, Ann Combin 9 (2005) [14] K Mahlburg, The overpartition function modulo small powers of 2, Discrete Mathematics 286 (2004), [15] J J Sylvester, A constructive theory of partitions, arranged in three acts, an interact, and an exodion, in The Collected Papers of J J Sylvester, Vol 3, Cambridge University Press, London, 1 83; reprinted by Chelsea, ew York, 1973
17 A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS 17 [16] S Treneer, Congruences for the coefficients of weakly holomorphic modular forms, Proc London Math Soc (3) 93 (2006), [17] AJ Yee, Combinatorial proofs of Ramanuan s 1 ψ 1 summation and the -Gauss summation, J Combin Theory Ser A, 105 (2004), LIAFA, Universite Paris Diderot - Paris 7, Paris Cedex 13, FRACE address: ehannedousse@liafauniv-paris-diderotfr School of Liberal Arts, Seoul ational University of Science and Technology, 232 Gongreung-ro, owon-gu, Seoul, , Korea address: bkim4@seoultechackr
THE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS
THE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS GEORGE ANDREWS, SONG HENG CHAN, BYUNGCHAN KIM, AND ROBERT OSBURN Abstract. In 2003, Atkin Garvan initiated the study of rank crank moments for
More informationarxiv: v1 [math.co] 25 Nov 2018
The Unimodality of the Crank on Overpartitions Wenston J.T. Zang and Helen W.J. Zhang 2 arxiv:8.003v [math.co] 25 Nov 208 Institute of Advanced Study of Mathematics Harbin Institute of Technology, Heilongjiang
More informationIDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS
IDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS MIN-JOO JANG AND JEREMY LOVEJOY Abstract. We prove several combinatorial identities involving overpartitions whose smallest parts are even. These
More informationA PARTITION IDENTITY AND THE UNIVERSAL MOCK THETA FUNCTION g 2
A PARTITION IDENTITY AND THE UNIVERSAL MOCK THETA FUNCTION g KATHRIN BRINGMANN, JEREMY LOVEJOY, AND KARL MAHLBURG Abstract. We prove analytic and combinatorial identities reminiscent of Schur s classical
More informationOVERPARTITIONS AND GENERATING FUNCTIONS FOR GENERALIZED FROBENIUS PARTITIONS
OVERPARTITIONS AND GENERATING FUNCTIONS FOR GENERALIZED FROBENIUS PARTITIONS SYLVIE CORTEEL JEREMY LOVEJOY AND AE JA YEE Abstract. Generalized Frobenius partitions or F -partitions have recently played
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 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 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 information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
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 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 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 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 informationSOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.
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 2 Abstract. Combinatorial proofs
More informationRANK DIFFERENCES FOR OVERPARTITIONS
RANK DIFFERENCES FOR OVERPARTITIONS JEREMY LOVEJOY AND ROBERT OSBURN Abstract In 1954 Atkin Swinnerton-Dyer proved Dyson s conjectures on the rank of a partition by establishing formulas for the generating
More informationCOMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION
COMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION AE JA YEE 1 Abstract. Theorems in the theory of partitions are closely related to basic hypergeometric series. Some identities
More informationarxiv: v2 [math.nt] 9 Apr 2015
CONGRUENCES FOR PARTITION PAIRS WITH CONDITIONS arxiv:408506v2 mathnt 9 Apr 205 CHRIS JENNINGS-SHAFFER Abstract We prove congruences for the number of partition pairs π,π 2 such that π is nonempty, sπ
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 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 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 informationArithmetic properties of overcubic partition pairs
Arithmetic properties of overcubic partition pairs Bernard L.S. Lin School of Sciences Jimei University Xiamen 3101, P.R. China linlsjmu@13.com Submitted: May 5, 014; Accepted: Aug 7, 014; Published: Sep
More informationElementary proofs of congruences for the cubic and overcubic partition functions
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 602) 204), Pages 9 97 Elementary proofs of congruences for the cubic and overcubic partition functions James A. Sellers Department of Mathematics Penn State
More informationRamanujan-type congruences for overpartitions modulo 16. Nankai University, Tianjin , P. R. China
Ramanujan-type congruences for overpartitions modulo 16 William Y.C. Chen 1,2, Qing-Hu Hou 2, Lisa H. Sun 1,2 and Li Zhang 1 1 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
More informationq-pell Sequences and Two Identities of V. A. Lebesgue
-Pell Seuences and Two Identities of V. A. Lebesgue José Plínio O. Santos IMECC, UNICAMP C.P. 6065, 13081-970, Campinas, Sao Paulo, Brazil Andrew V. Sills Department of Mathematics, Pennsylvania State
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit and Yee introduced partition
More informationNew congruences for overcubic partition pairs
New congruences for overcubic partition pairs M. S. Mahadeva Naika C. Shivashankar Department of Mathematics, Bangalore University, Central College Campus, Bangalore-560 00, Karnataka, India Department
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
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 informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationTwo truncated identities of Gauss
Two truncated identities of Gauss Victor J W Guo 1 and Jiang Zeng 2 1 Department of Mathematics, East China Normal University, Shanghai 200062, People s Republic of China jwguo@mathecnueducn, http://mathecnueducn/~jwguo
More informationSELF-CONJUGATE VECTOR PARTITIONS AND THE PARITY OF THE SPT-FUNCTION
SELF-CONJUGATE VECTOR PARTITIONS AND THE PARITY OF THE SPT-FUNCTION GEORGE E ANDREWS FRANK G GARVAN AND JIE LIANG Abstract Let sptn denote the total number of appearances of the smallest parts in all the
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 informationRANK AND CONGRUENCES FOR OVERPARTITION PAIRS
RANK AND CONGRUENCES FOR OVERPARTITION PAIRS KATHRIN BRINGMANN AND JEREMY LOVEJOY Abstract. The rank of an overpartition pair is a generalization of Dyson s rank of a partition. The purpose of this paper
More informationThe spt-crank for Ordinary Partitions
The spt-crank for Ordinary Partitions William Y.C. Chen a,b, Kathy Q. Ji a and Wenston J.T. Zang a a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.R. China b Center for Applied
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 informationQuadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7. Tianjin University, Tianjin , P. R. China
Quadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7 Qing-Hu Hou a, Lisa H. Sun b and Li Zhang b a Center for Applied Mathematics Tianjin University, Tianjin 30007, P. R. China b
More informationOn an identity of Gessel and Stanton and the new little Göllnitz identities
On an identity of Gessel and Stanton and the new little Göllnitz identities Carla D. Savage Dept. of Computer Science N. C. State University, Box 8206 Raleigh, NC 27695, USA savage@csc.ncsu.edu Andrew
More informationCONGRUENCES IN ORDERED PAIRS OF PARTITIONS
IJMMS 2004:47, 2509 252 PII. S0672043439 http://ijmms.hindawi.com Hindawi Publishing Corp. CONGRUENCES IN ORDERED PAIRS OF PARTITIONS PAUL HAMMOND and RICHARD LEWIS Received 28 November 2003 and in revised
More informationON CONGRUENCE PROPERTIES OF CONSECUTIVE VALUES OF P(N, M) Brandt Kronholm Department of Mathematics, University at Albany, Albany, New York, 12222
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007), #A16 ON CONGRUENCE PROPERTIES OF CONSECUTIVE VALUES OF P(N, M) Brandt Kronholm Department of Mathematics, University at Albany, Albany,
More informationTHE METHOD OF WEIGHTED WORDS REVISITED
THE METHOD OF WEIGHTED WORDS REVISITED JEHANNE DOUSSE Abstract. Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur s partition identity.
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 informationColored Partitions and the Fibonacci Sequence
TEMA Tend. Mat. Apl. Comput., 7, No. 1 (006), 119-16. c Uma Publicação da Sociedade Brasileira de Matemática Aplicada e Computacional. Colored Partitions and the Fibonacci Sequence J.P.O. SANTOS 1, M.
More information= i 0. a i q i. (1 aq i ).
SIEVED PARTITIO FUCTIOS AD Q-BIOMIAL COEFFICIETS Fran Garvan* and Dennis Stanton** Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved
More informationA lattice path approach to countingpartitions with minimum rank t
Discrete Mathematics 249 (2002) 31 39 www.elsevier.com/locate/disc A lattice path approach to countingpartitions with minimum rank t Alexander Burstein a, Sylvie Corteel b, Alexander Postnikov c, d; ;1
More informationarxiv: v1 [math.co] 25 Dec 2018
ANDREWS-GORDON TYPE SERIES FOR SCHUR S PARTITION IDENTITY KAĞAN KURŞUNGÖZ arxiv:1812.10039v1 [math.co] 25 Dec 2018 Abstract. We construct an evidently positive multiple series as a generating function
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
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 informationREFINEMENTS OF SOME PARTITION INEQUALITIES
REFINEMENTS OF SOME PARTITION INEQUALITIES James Mc Laughlin Department of Mathematics, 25 University Avenue, West Chester University, West Chester, PA 9383 jmclaughlin2@wcupa.edu Received:, Revised:,
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 informationNew infinite families of congruences modulo 8 for partitions with even parts distinct
New infinite families of congruences modulo for partitions with even parts distinct Ernest X.W. Xia Department of Mathematics Jiangsu University Zhenjiang, Jiangsu 212013, P. R. China ernestxwxia@13.com
More informationASYMPTOTICS FOR RANK AND CRANK MOMENTS
ASYMPTOTICS FOR RANK AND CRANK MOMENTS KATHRIN BRINGMANN, KARL MAHLBURG, AND ROBERT C. RHOADES Abstract. Moments of the partition rank and crank statistics have been studied for their connections to combinatorial
More informationApplicable Analysis and Discrete Mathematics available online at ABEL S METHOD ON SUMMATION BY PARTS.
Applicable Analysis and Discrete Mathematics available online at http://pefmathetfrs Appl Anal Discrete Math 4 010), 54 65 doi:1098/aadm1000006c ABEL S METHOD ON SUMMATION BY PARTS AND BALANCED -SERIES
More informationCOMBINATORICS OF GENERALIZED q-euler NUMBERS. 1. Introduction The Euler numbers E n are the integers defined by E n x n = sec x + tan x. (1.1) n!
COMBINATORICS OF GENERALIZED q-euler NUMBERS TIM HUBER AND AE JA YEE Abstract New enumerating functions for the Euler numbers are considered Several of the relevant generating functions appear in connection
More informationThe part-frequency matrices of a partition
J. Algebra Comb. Discrete Appl. 3(3) 77 86 Received: 03 November 20 Accepted: 04 January 206 Journal of Algebra Combinatorics Discrete Structures and Applications The part-frequency matrices of a partition
More informationAlexander Berkovich and Frank G. Garvan Department of Mathematics, University of Florida, Gainesville, Florida
Journal of Combinatorics and Number Theory JCNT 2009, Volume 1, Issue # 3, pp. 49-64 ISSN 1942-5600 c 2009 Nova Science Publishers, Inc. THE GBG-RANK AND t-cores I. COUNTING AND 4-CORES Alexander Berkovich
More informationSome Combinatorial and Analytical Identities
Some Combinatorial and Analytical Identities Mourad EH Ismail Dennis Stanton November 6, 200 Abstract We give new proofs and explain the origin of several combinatorial identities of Fu and Lascoux, Dilcher,
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/
More informationMODULAR FORMS ARISING FROM Q(n) AND DYSON S RANK
MODULAR FORMS ARISING FROM Q(n) AND DYSON S RANK MARIA MONKS AND KEN ONO Abstract Let R(w; q) be Dyson s generating function for partition ranks For roots of unity ζ it is known that R(ζ; q) and R(ζ; /q)
More informationCOMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION MARIE JAMESON AND ROBERT P. SCHNEIDER (Communicated
More informationArithmetic Properties for Ramanujan s φ function
Arithmetic Properties for Ramanujan s φ function Ernest X.W. Xia Jiangsu University ernestxwxia@163.com Nankai University Ernest X.W. Xia (Jiangsu University) Arithmetic Properties for Ramanujan s φ function
More informationarxiv: v2 [math.co] 3 May 2016
VARIATION ON A THEME OF NATHAN FINE NEW WEIGHTED PARTITION IDENTITIES arxiv:16050091v [mathco] 3 May 016 ALEXANDER BERKOVICH AND ALI KEMAL UNCU Dedicated to our friend Krishna Alladi on his 60th birthday
More informationWhat is the crank of a partition? Daniel Glasscock, July 2014
What is the crank of a partition? Daniel Glasscock, July 2014 These notes complement a talk given for the What is...? seminar at the Ohio State University. Introduction The crank of an integer partition
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES. James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 19383, USA
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationLaura Chihara* and Dennis Stanton**
ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.
More informationDIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A60 DIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS Neil Calkin Department of Mathematical Sciences, Clemson
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 informationA P-ADIC SUPERCONGRUENCE CONJECTURE OF VAN HAMME
A P-ADIC SUPERCONGRUENCE CONJECTURE OF VAN HAMME ERIC MORTENSON Abstract. In this paper we prove a p-adic supercongruence conjecture of van Hamme by placing it in the context of the Beuers-lie supercongruences
More informationTHE BAILEY TRANSFORM AND FALSE THETA FUNCTIONS
THE BAILEY TRANSFORM AND FALSE THETA FUNCTIONS GEORGE E ANDREWS 1 AND S OLE WARNAAR 2 Abstract An empirical exploration of five of Ramanujan s intriguing false theta function identities leads to unexpected
More informationCranks in Ramanujan s Lost Notebook
Cranks in Ramanujan s Lost Notebook Manjil P. Saikia Department of Mathematical Sciences, Tezpur University, Napaam Dist. - Sonitpur, Pin - 784028 India manjil@gonitsora.com January 22, 2014 Abstract We
More informationOn integral representations of q-gamma and q beta functions
On integral representations of -gamma and beta functions arxiv:math/3232v [math.qa] 4 Feb 23 Alberto De Sole, Victor G. Kac Department of Mathematics, MIT 77 Massachusetts Avenue, Cambridge, MA 239, USA
More informationarxiv:math/ v2 [math.co] 19 Sep 2005
A COMBINATORIAL PROOF OF THE ROGERS-RAMANUJAN AND SCHUR IDENTITIES arxiv:math/04072v2 [math.co] 9 Sep 2005 CILANNE BOULET AND IGOR PAK Abstract. We give a combinatorial proof of the first Rogers-Ramanujan
More informationRamanujan-type congruences for broken 2-diamond partitions modulo 3
Progress of Projects Supported by NSFC. ARTICLES. SCIENCE CHINA Mathematics doi: 10.1007/s11425-014-4846-7 Ramanujan-type congruences for broken 2-diamond partitions modulo 3 CHEN William Y.C. 1, FAN Anna
More informationOn m-ary Overpartitions
On m-ary Overpartitions Øystein J. Rødseth Department of Mathematics, University of Bergen, Johs. Brunsgt. 1, N 5008 Bergen, Norway E-mail: rodseth@mi.uib.no James A. Sellers Department of Mathematics,
More informationRamanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3
Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3 William Y.C. Chen 1, Anna R.B. Fan 2 and Rebecca T. Yu 3 1,2,3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071,
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 informationAn identity of Andrews and the Askey-Wilson integral
Ramanujan J DOI 0.007/s39-008-922-4 An identity of Andrews and the Askey-Wilson integral Zhi-Guo Liu Received: 6 July 2007 / Accepted: 7 January 2008 Springer Science+Business Media, LLC 2008 Abstract
More informationCombinatorial Analysis of the Geometric Series
Combinatorial Analysis of the Geometric Series David P. Little April 7, 205 www.math.psu.edu/dlittle Analytic Convergence of a Series The series converges analytically if and only if the sequence of partial
More informationA COMBINATORIAL PROOF AND REFINEMENT OF A PARTITION IDENTITY OF SILADIĆ
A COMBINATORIAL PROOF AND REFINEMENT OF A PARTITION IDENTITY OF SILADIĆ JEHANNE DOUSSE Abstract. In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationTHE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5
THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number
More informationCONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS
Bull. Aust. Math. Soc. 9 2016, 400 409 doi:10.1017/s000497271500167 CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS M. S. MAHADEVA NAIKA, B. HEMANTHKUMAR H. S. SUMANTH BHARADWAJ Received 9 August
More informationPartitions, permutations and posets Péter Csikvári
Partitions, permutations and posets Péter Csivári In this note I only collect those things which are not discussed in R Stanley s Algebraic Combinatorics boo Partitions For the definition of (number) partition,
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationm=1 . ( bzq; q2 ) k (zq 2 ; q 2 ) k . (1 + bzq4k 1 ) (1 + bzq 2k 1 ). Here and in what follows, we have made use of the standard notation (a) n = j=0
PARTITIONS WITH NON-REPEATING ODD PARTS AND COMBINATORIAL IDENTITIES Krishnaswami Alladi* Abstract: Continuing our earlier work on partitions with non-repeating odd parts and q-hypergeometric identities,
More informationPartitions With Parts Separated By Parity
Partitions With Parts Separated By Parity by George E. Andrews Key Words: partitions, parity of parts, Ramanujan AMS Classification Numbers: P84, P83, P8 Abstract There have been a number of papers on
More informationarxiv: v1 [math.co] 18 Sep 2014
BRESSOUD STYLE IDENTITIES FOR REGULAR PARTITIONS AND OVERPARTITIONS KAĞAN KURŞUNGÖZ arxiv:1409.5221v1 [math.co] 18 Sep 2014 Abstract. We construct a family of partition identities which contain the following
More informationOn a certain vector crank modulo 7
On a certain vector crank modulo 7 Michael D Hirschhorn School of Mathematics and Statistics University of New South Wales Sydney, NSW, 2052, Australia mhirschhorn@unsweduau Pee Choon Toh Mathematics &
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 informationarxiv:math/ v1 [math.ca] 8 Nov 2003
arxiv:math/0311126v1 [math.ca] 8 Nov 2003 PARTIAL SUMS OF HYPERGEOMETRIC SERIES OF UNIT ARGUMENT 1 WOLFGANG BÜHRING Abstract. The asymptotic behaviour of partial sums of generalized hypergeometric series
More informationThe part-frequency matrices of a partition
The part-frequency matrices of a partition William J. Keith, Michigan Tech Michigan Technological University Kliakhandler Conference 2015 August 28, 2015 A partition of an integer n is a sequence λ = (λ
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationUNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES
UNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES RICHARD P. STANLEY AND FABRIZIO ZANELLO Abstract. We investigate the rank-generating function F λ of the poset of partitions contained
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationHECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.
HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS. MATTHEW BOYLAN AND KENNY BROWN Abstract. Recent works of Garvan [2] and Y. Yang [7], [8] concern a certain family of half-integral
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 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 informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationarxiv: v1 [math.nt] 22 Jan 2019
Factors of some truncated basic hypergeometric series Victor J W Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an 223300, Jiangsu People s Republic of China jwguo@hytceducn arxiv:190107908v1
More information