A Generalization of the Euler-Glaisher Bijection
|
|
- Samuel Miles
- 5 years ago
- Views:
Transcription
1 A Generalization of the Euler-Glaisher Bijection p.1/48 A Generalization of the Euler-Glaisher Bijection Andrew Sills Georgia Southern University
2 A Generalization of the Euler-Glaisher Bijection p.2/48 joint work with James Sellers and Gary Mullen Penn State University Electronic Journal of Combinatorics 11(1) (2004) #R43
3 PARTITION definition A Generalization of the Euler-Glaisher Bijection p.3/48 A partition λ of the integer n is a representation of n as an unordered sum of positive integers λ 1 + λ λ r = n.
4 PARTITION definition A Generalization of the Euler-Glaisher Bijection p.3/48 A partition λ of the integer n is a representation of n as an unordered sum of positive integers λ 1 + λ λ r = n. Each summand λ i is called a part of the partition λ.
5 PARTITION definition A Generalization of the Euler-Glaisher Bijection p.3/48 A partition λ of the integer n is a representation of n as an unordered sum of positive integers λ 1 + λ λ r = n. Each summand λ i is called a part of the partition λ. Often a canonical ordering of parts is imposed: λ 1 λ 2 λ r.
6 The Partitions of 6 A Generalization of the Euler-Glaisher Bijection p.4/
7 Euler s partition identity A Generalization of the Euler-Glaisher Bijection p.5/48
8 Euler s partition identity A Generalization of the Euler-Glaisher Bijection p.6/48 The number of partitions of n into odd parts equals the number of partitions of n into distinct parts.
9 Euler s partition identity Example A Generalization of the Euler-Glaisher Bijection p.7/48 Of the eleven partitions of 6, four of them have only odd parts:
10 Euler s partition identity Example A Generalization of the Euler-Glaisher Bijection p.7/48 Of the eleven partitions of 6, four of them have only odd parts: and four of them have distinct parts:
11 Frequency Notation for Partitions A Generalization of the Euler-Glaisher Bijection p.8/48 Any partition λ 1 + λ 2 + λ λ r may be written in the form f f f f ,
12 Frequency Notation for Partitions A Generalization of the Euler-Glaisher Bijection p.8/48 Any partition λ 1 + λ 2 + λ λ r may be written in the form or more briefly, as f f f f , {f 1,f 2,f 3,f 4,...}, where f i represents the number of appearances of the positive integer i in the partition.
13 Frequency Notation for Partitions A Generalization of the Euler-Glaisher Bijection p.9/48 For example, the partition
14 Frequency Notation for Partitions A Generalization of the Euler-Glaisher Bijection p.10/48 For example, the partition =
15 Frequency Notation for Partitions A Generalization of the Euler-Glaisher Bijection p.11/48 For example, the partition = may be represented by the frequency sequence {2, 4, 1, 2, 0, 4, 0, 0, 0, 0, 0, 0,... }.
16 A Generalization of the Euler-Glaisher Bijection p.12/48 Thus each sequence {f i } i=1, where each f i is a nonnegative integer and only finitely many of the f i are nonzero, represents a partition of the integer i=1 if i.
17 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.13/48
18 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.14/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r odd parts.
19 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.14/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r odd parts. Rewrite λ in the form f f f
20 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.14/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r odd parts. Rewrite λ in the form f f f Replace each f i with its binary expansion + a i3 8 + a i2 4 + a i1 2 + a i0 1.
21 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.15/48 So, f f f f 7 7 +
22 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.16/48 So, f f f f = ( + a 1,3 8 + a 1,2 4 + a 1,1 2 + a 1,0 1) 1 +( + a 3,3 8 + a 3,2 4 + a 3,1 2 + a 3,0 1) 3 +( + a 5,3 8 + a 5,2 4 + a 5,1 2 + a 5,0 1) 5.
23 Glaisher s proof of Euler s identity A Generalization of the Euler-Glaisher Bijection p.17/48 So, f f f f = ( + a 1,3 8 + a 1,2 4 + a 1,1 2 + a 1,0 1) 1 +( + a 3,3 8 + a 3,2 4 + a 3,1 2 + a 3,0 1) 3 +( + a 5,3 8 + a 5,2 4 + a 5,1 2 + a 5,0 1) 5. = a 1,0 + 2a 1,1 + 3a 3,0 + 4a 1,2 + 5a 5,0 + 6a 3,1 + 7a 7, where each a i,j {0, 1}.
24 Euler s partition identity A Generalization of the Euler-Glaisher Bijection p.18/48 The number of partitions of n into odd parts equals the number of partitions of n into distinct parts.
25 Euler s partition identity A Generalization of the Euler-Glaisher Bijection p.19/48 The number of partitions of n into nonmultiples of 2 equals the number of partitions of n where no part appears more than once.
26 Glaisher s partition identity A Generalization of the Euler-Glaisher Bijection p.20/48 The number of partitions of n into nonmultiples of m equals the number of partitions of n where no part appears more than m 1 times.
27 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.21/48
28 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.22/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r nonmultiples of m.
29 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.22/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r nonmultiples of m. Rewrite λ in the form where f i =0 if m i. f f f 3 3 +,
30 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.22/48 Let λ 1 + λ λ r be a partition λ of some positive integer n into r nonmultiples of m. Rewrite λ in the form where f i =0 if m i. f f f 3 3 +, Replace each f i with its base m expansion + a i3 m 3 + a i2 m 2 + a i1 m + a i0 1.
31 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.23/48 So, f f f f 4 4 +
32 Proof of Glaisher s identity A Generalization of the Euler-Glaisher Bijection p.24/48 So, f f f f = ( + a 1,3 m 3 + a 1,2 m 2 + a 1,1 m + a 1,0 1) 1 +( + a 2,3 m 3 + a 2,2 m 2 + a 2,1 m + a 2,0 1) 2 +( + a 3,3 m 3 + a 3,2 m 2 + a 3,1 m + a 3,0 1) 3. where each 0 a i,j m 1.
33 Partition Ideals A Generalization of the Euler-Glaisher Bijection p.25/48
34 Partition Ideals A Generalization of the Euler-Glaisher Bijection p.26/48 Informal Definition A partition ideal C is a set of partitions such that for each λ C, if one or more parts is removed from λ, the resulting partition is also in C.
35 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.27/48
36 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.28/48 Let R 1 (n) denote the number of partitions of n into parts congruent to ±1 (mod 5).
37 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.28/48 Let R 1 (n) denote the number of partitions of n into parts congruent to ±1 (mod 5). Let R 2 (n) denote the number of partitions λ λ r of n such that λ i λ i+1 2.
38 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.28/48 Let R 1 (n) denote the number of partitions of n into parts congruent to ±1 (mod 5). Let R 2 (n) denote the number of partitions λ λ r of n such that λ i λ i+1 2. Then R 1 (n) = R 2 (n) for all n.
39 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.29/48
40 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.30/48 The partitions enumerated by R 1 (n) are those for which f i = 0 whenever i ±1 (mod 5).
41 The First Rogers-Ramanujan Identity A Generalization of the Euler-Glaisher Bijection p.30/48 The partitions enumerated by R 1 (n) are those for which f i = 0 whenever i ±1 (mod 5). The partitions enumerated by R 2 (n) are those for which f i + f i+1 1.
42 Minimal Bounding Sequence A Generalization of the Euler-Glaisher Bijection p.31/48 Let the sequence {d C 1,d C 2,d C 3,...} be defined by d C j = sup f j, {f i } i=1 C
43 Minimal Bounding Sequence A Generalization of the Euler-Glaisher Bijection p.31/48 Let the sequence {d C 1,d C 2,d C 3,...} be defined by d C j = sup f j, {f i } i=1 C each d i is a nonnegative integer or +.
44 Euler s Theorem Revisited A Generalization of the Euler-Glaisher Bijection p.32/48 Let O denote the set of all partitions with only odd parts.
45 Euler s Theorem Revisited A Generalization of the Euler-Glaisher Bijection p.32/48 Let O denote the set of all partitions with only odd parts. {d O j } j=1 = {, 0,, 0,, 0,... }
46 Euler s Theorem Revisited A Generalization of the Euler-Glaisher Bijection p.32/48 Let O denote the set of all partitions with only odd parts. {d O j } j=1 = {, 0,, 0,, 0,... } Let D denote the set of all partitions with distinct parts.
47 Euler s Theorem Revisited A Generalization of the Euler-Glaisher Bijection p.32/48 Let O denote the set of all partitions with only odd parts. {d O j } j=1 = {, 0,, 0,, 0,... } Let D denote the set of all partitions with distinct parts. {d D j } j=1 = {1, 1, 1, 1, 1, 1,... }.
48 Equivalent Partition Ideals A Generalization of the Euler-Glaisher Bijection p.33/48 Let p(c,n) denote the number of partitions of an integer n in the partition ideal C.
49 Equivalent Partition Ideals A Generalization of the Euler-Glaisher Bijection p.33/48 Let p(c,n) denote the number of partitions of an integer n in the partition ideal C. We say that two partition ideals C 1 and C 2 are equivalent, and write C 1 C 2, if p(c 1,n) = p(c 2,n) for all integers n.
50 Euler s Partition Identity A Generalization of the Euler-Glaisher Bijection p.34/48 O D.
51 The Multiset Associated with a Partition Ideal of Order 1 A Generalization of the Euler-Glaisher Bijection p.35/48 Define the multiset associated with C, M(C), as follows: M(C) := {j(d C j + 1) j Z + and d C j < }.
52 The Multiset Associated with a Partition Ideal of Order 1 A Generalization of the Euler-Glaisher Bijection p.35/48 Define the multiset associated with C, M(C), as follows: M(C) := {j(d C j + 1) j Z + and d C j < }. Andrews proved C 1 C 2 if and only if M(C 1 ) = M(C 2 ).
53 The Multiset Associated with a Partition Ideal of Order 1 A Generalization of the Euler-Glaisher Bijection p.36/48 M(O) = M(D) = {2, 4, 6, 8, 10, 12,... }
54 Partitions of Infinity A Generalization of the Euler-Glaisher Bijection p.37/48 MacMahon defined a partition of infinity to be a formal expression of the form (g 1 1) 1+(g 2 1) g 1 +(g 3 1) (g 1 g 2 )+(g 4 1) (g 1 g 2 g 3 )+... where each g i 2 or for some fixed k, g 1,g 2,g 3,...,g k 1 > 1, g k =, and g k+1 = g k+2 = g k+3 = = 1.
55 Partitions of Infinity A Generalization of the Euler-Glaisher Bijection p.38/48 Note that a partition of infinity may be thought of as a minimal bounding sequence for a partition ideal of order one with d 1 = g 1 1 d g1 = g 2 1 d g1 g 2 = g 3 1 d g1 g 2 g 3 = g 4 1. and d i = 0 if i {1,g 1,g 1 g 2,g 1 g 2 g 3,...}.
56 Partitions of Infinity A Generalization of the Euler-Glaisher Bijection p.39/48 If g i = m for all i, we have a minimal bounding sequence for the partition ideal of the base m expansion.
57 A Generalization of the Euler-Glaisher Bijection p.40/48 All partitions of infinity have generating function 1 1 q.
58 Given any partition ideal of order 1 C for which each term in the minimal bounding sequence is 0 or, A Generalization of the Euler-Glaisher Bijection p.41/48
59 A Generalization of the Euler-Glaisher Bijection p.41/48 Given any partition ideal of order 1 C for which each term in the minimal bounding sequence is 0 or, and any equivalent partition ideal of order 1 C,
60 A Generalization of the Euler-Glaisher Bijection p.41/48 Given any partition ideal of order 1 C for which each term in the minimal bounding sequence is 0 or, and any equivalent partition ideal of order 1 C, there exists a collection of partitions of infinity which gives rise to a Glaisher-type bijection from C to C.
61 A Generalization of the Euler-Glaisher Bijection p.41/48 Given any partition ideal of order 1 C for which each term in the minimal bounding sequence is 0 or, and any equivalent partition ideal of order 1 C, there exists a collection of partitions of infinity which gives rise to a Glaisher-type bijection from C to C. Further, there is an explicit algorithm for finding the required partitions of infinity.
62 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.42/48 Let C denote the set of partitions into parts not equal to 2, 9, 10, 12, 18 or 20.
63 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.42/48 Let C denote the set of partitions into parts not equal to 2, 9, 10, 12, 18 or 20. Let C denote the set of partitions where the parts 1, 9, and 10 may appear at most once, 3 and 4 may appear at most twice, 2 may appear at most four times, and all other positive integers may appear without restriction.
64 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.42/48 Let C denote the set of partitions into parts not equal to 2, 9, 10, 12, 18 or 20. Let C denote the set of partitions where the parts 1, 9, and 10 may appear at most once, 3 and 4 may appear at most twice, 2 may appear at most four times, and all other positive integers may appear without restriction. C C.
65 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.43/48 d C j = { 0 if j {2, 9, 10, 12, 18, 20} otherwise. {d C j } j=1 = {1, 4, 2, 2,,,,, 1, 1,,,,,... }.
66 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.43/48 d C j = { 0 if j {2, 9, 10, 12, 18, 20} otherwise. {d C j } j=1 = {1, 4, 2, 2,,,,, 1, 1,,,,,... }. Any partition of n in C can be written in the form 8 n = f f i i + f i=3 +f f i i, i=21 17 i=13 f i i where each f i is a nonnegative integer.
67 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.44/48 Expand f 1 by the partition of infinity defined by g 1,1 = 2, g 1,2 = 5, g 1,3 = 2, g 1,4 =, g 1,k = 1 if k > 4.
68 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.44/48 Expand f 1 by the partition of infinity defined by g 1,1 = 2, g 1,2 = 5, g 1,3 = 2, g 1,4 =, g 1,k = 1 if k > 4. Expand f 3 by the partition of infinity defined by g 3,1 = 3, g 3,2 = 2, g 3,3 =, g 3,k = 1 if k > 3.
69 An Inelegant Partition Identity A Generalization of the Euler-Glaisher Bijection p.44/48 Expand f 1 by the partition of infinity defined by g 1,1 = 2, g 1,2 = 5, g 1,3 = 2, g 1,4 =, g 1,k = 1 if k > 4. Expand f 3 by the partition of infinity defined by g 3,1 = 3, g 3,2 = 2, g 3,3 =, g 3,k = 1 if k > 3. Expand f 4 by the partition of infinity defined by g 4,1 = 3, g 4,2 =, g 4,k = 1 if k > 2.
70 n = ( a1,0 (1) + a 1,1 (2) + a 1,2 (2 5) + a 1,3 (2 5 2) ) 1 + ( a 2,0 (1) + a 2,1 (3) + a 2,2 (3 2) ) 3 + ( a 4,0 (1) + a 4,1 (3) ) 4 + ( a 5,0 (1) ) 5 + ( a 6,0 (1) ) 6 + ( a 7,0 (1) ) 7 + ( a 8,0 (1) ) 8 + ( a 11,0 (1) ) 11. where 0 a j,k g j,k+1 1 = d jgj,1 g j,2...g j,k. A Generalization of the Euler-Glaisher Bijection p.45/48
71 A Generalization of the Euler-Glaisher Bijection p.46/48 Apply the distributive property to obtain n = a 1,0 (1) + a 1,1 (2) + a 1,2 (10) + a 1,4 (20) + a 2,0 (3) + a 2,1 (9) + a 2,2 (18) + a 4,0 (4) + a 4,1 (12) + a 5,0 (5) + a 6,0 (6) where, in particular,. a 1,0 1, a 1,1 4, a 1,2 2, a 2,0 2, a 2,1 1, a 4,0 2.
72 Canonical Bijections A Generalization of the Euler-Glaisher Bijection p.47/48 Any C for which each term in {d C j } j=1 an M(C) with no repeated elements. is 0 or has
73 Canonical Bijections A Generalization of the Euler-Glaisher Bijection p.47/48 Any C for which each term in {d C j } j=1 an M(C) with no repeated elements. is 0 or has If for some C, M(C ) has no repeated elements, it is equivalent to some C with minimal bounding sequence consisting of only 0 s and s.
74 Canonical Bijections A Generalization of the Euler-Glaisher Bijection p.47/48 Any C for which each term in {d C j } j=1 an M(C) with no repeated elements. is 0 or has If for some C, M(C ) has no repeated elements, it is equivalent to some C with minimal bounding sequence consisting of only 0 s and s. This C maps bijectively to C via the Glaisher-type bijection where the role of the base m expansion is played by an appropriate partition of infinity.
75 Canonical Bijections A Generalization of the Euler-Glaisher Bijection p.47/48 Any C for which each term in {d C j } j=1 an M(C) with no repeated elements. is 0 or has If for some C, M(C ) has no repeated elements, it is equivalent to some C with minimal bounding sequence consisting of only 0 s and s. This C maps bijectively to C via the Glaisher-type bijection where the role of the base m expansion is played by an appropriate partition of infinity. If C C and M(C ) = M(C ) has no repeated elements, there is a canonical bijection between them.
76 Further Canonical Bijections for Equivalent Partition Ideals A Generalization of the Euler-Glaisher Bijection p.48/48 Max Kanovich Professor of Computer Science Queen Mary, University of London
COMBINATORICS 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 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 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 informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationPartition Identities
Partition Identities Alexander D. Healy ahealy@fas.harvard.edu May 00 Introduction A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ, λ,..., λ k ) of
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationarxiv: v1 [math.co] 24 Jan 2017
CHARACTERIZING THE NUMBER OF COLOURED m ARY PARTITIONS MODULO m, WITH AND WITHOUT GAPS I. P. GOULDEN AND PAVEL SHULDINER arxiv:1701.07077v1 [math.co] 24 Jan 2017 Abstract. In a pair of recent papers, Andrews,
More informationON THE SLACK EULER PAIR FOR VECTOR PARTITION
#A7 INTEGERS 18 (2018 ON THE SLACK EULER PAIR FOR VECTOR PARTITION Shishuo Fu College of Mathematics and Statistics, Chongqing University, Huxi Campus, Chongqing, P.R. China. fsshuo@cqu.edu.cn Ting Hua
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 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 informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
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 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 informationSYLVESTER S WAVE THEORY OF PARTITIONS
SYLVESTER S WAVE THEORY OF PARTITIONS Georgia Southern University DIMACS July 11, 2011 A partition of an integer n is a representation of n as a sum of positive integers where order of summands (parts)
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 informationCompositions, Bijections, and Enumerations
Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations COGS- Jack N. Averitt College of Graduate Studies Fall 2012 Compositions, Bijections, and Enumerations Charles
More informationGEOMETRY AND COMPLEXITY OF O HARA S ALGORITHM
GEOMETRY AND COMPLEXITY OF O HARA S ALGORITHM MATJAŽ KONVALINKA AND IGOR PAK Abstract. In this paper we analyze O Hara s partition bijection. We present three type of results. First, we show that O Hara
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 informationFURTHER RESULTS FOR PARTITIONS INTO FOUR SQUARES OF EQUAL PARITY. Michael D. Hirschhorn and James A. Sellers
FURTHER RESULTS FOR PARTITIONS INTO FOUR SQUARES OF EQUAL PARITY Michael D. Hirschhorn James A. Sellers School of Mathematics UNSW Sydney 2052 Australia Department of Mathematics Penn State University
More informationMichael D. Hirschhorn and James A. Sellers. School of Mathematics UNSW Sydney 2052 Australia. and
FURTHER RESULTS FOR PARTITIONS INTO FOUR SQUARES OF EQUAL PARITY Michael D. Hirschhorn James A. Sellers School of Mathematics UNSW Sydney 2052 Australia Department of Mathematics Penn State 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 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 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 informationResearch Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities
International Combinatorics Volume 2012, Article ID 409505, 6 pages doi:10.1155/2012/409505 Research Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities A. K. Agarwal and M.
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 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 informationCHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m Mathematics Subject Classification: 05A17, 11P83
CHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m GEORGE E. ANDREWS, AVIEZRI S. FRAENKEL, AND JAMES A. SELLERS Abstract. Motivated by a recent conjecture of the second author related to the ternary
More informationCourse : Algebraic Combinatorics
Course 18.31: Algebraic Combinatorics Lecture Notes # 10 Addendum by Gregg Musiker (Based on Lauren Williams Notes for Math 19 at Harvard) February 5th - 7th, 009 1 Introduction to Partitions A partition
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 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 informationcongruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn
s s m.hirschhorn@unsw.edu.au Let p(n) be the number of s of n. For example, p(4) = 5, since we can write 4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1 and there are 5 such representations. It was known to Euler
More informationBinary Partitions Revisited
Binary Partitions Revisited Øystein J. Rødseth and James A. Sellers Department of Mathematics University of Bergen Johs. Brunsgt. N 5008 Bergen, Norway rodseth@mi.uib.no Department of Science and Mathematics
More informationARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS
ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS Kevin M. Courtright Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 kmc260@psu.edu James A. Sellers Department
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 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 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 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 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 informationSOME CONGRUENCES ASSOCIATED WITH THE EQUATION X α = X β IN CERTAIN FINITE SEMIGROUPS
SOME CONGRUENCES ASSOCIATED WITH THE EQUATION X α = X β IN CERTAIN FINITE SEMIGROUPS THOMAS W. MÜLLER Abstract. Let H be a finite group, T n the symmetric semigroup of degree n, and let α, β be integers
More informationA REFINEMENT OF THE ALLADI-SCHUR THEOREM
A REFINEMENT OF THE ALLADI-SCHUR THEOREM GEORGE E. ANDREWS Abstract. K. Alladi first observed a variant of I. Schur s 1926 partition theore. Namely, the number of partitions of n in which all parts are
More informationSome Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh , India
Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh - 160010, India Abstract. Anand and Agarwal, (Proc. Indian Acad. Sci.
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 informationC-COLOR COMPOSITIONS AND PALINDROMES
CAROLINE SHAPCOTT Abstract. An unepected relationship is demonstrated between n-color compositions compositions for which a part of size n can take on n colors) and part-products of ordinary compositions.
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 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 informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
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 informationThe Kth M-ary Partition Function
Indiana University of Pennsylvania Knowledge Repository @ IUP Theses and Dissertations (All) Fall 12-2016 The Kth M-ary Partition Function Laura E. Rucci Follow this and additional works at: http://knowledge.library.iup.edu/etd
More informationA note on partitions into distinct parts and odd parts
c,, 5 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A note on partitions into distinct parts and odd parts DONGSU KIM * AND AE JA YEE Department of Mathematics Korea Advanced
More informationArticle 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS
Article 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS William J. Keith Department of Mathematics, Drexel University, Philadelphia, PA 19104, USA wjk26@math.drexel.edu
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 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 informationCONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS
#A7 INTEGERS 14 (2014) CONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS Frank G. Garvan Department of Mathematics, University of Florida, Gainesville, Florida
More informationThesis submitted in partial fulfillment of the requirement for The award of the degree of. Masters of Science in Mathematics and Computing
SOME n-color COMPOSITION Thesis submitted in partial fulfillment of the requirement for The award of the degree of Masters of Science in Mathematics and Computing Submitted by Shelja Ratta Roll no- 301203014
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 informationWarm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov
Writing more proofs Misha Lavrov ARML Practice 3/16/2014 and 3/23/2014 Warm-up Using the quantifier notation on the reference sheet, and making any further definitions you need to, write the following:
More informationInteger Partitions: An Overview
Integer Partitions: An Overview D Singh, PhD, A M Ibrahim, PhD, J N Singh, Ph D, S M Ladan,PhD, Abstract This paper describes fundamentals of integer partitions and basic tools for their construction and
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 informationArithmetic Properties for a Certain Family of Knot Diagrams
Arithmetic Properties for a Certain Family of Knot Diagrams Darrin D. Frey Department of Science and Math Cedarville University Cedarville, OH 45314 freyd@cedarville.edu and James A. Sellers Department
More informationInteger Partitions. Student ID: Tutor: Roman Kotecky\Neil O Connell April 22, 2015
Integer Partitions Student ID: 35929 Tutor: Roman Kotecky\Neil O Connell April 22, 205 My study of Integer partitions came from a particular algebra assignment in which we were asked to find all the isomorphism
More informationGeneralization of a few results in integer partitions
Notes on Number Theory and Discrete Mathematics Vol. 9, 203, No. 2, 69 76 Generalization of a few results in integer partitions Manosij Ghosh Dastidar and Sourav Sen Gupta 2, Ramakrishna Mission Vidyamandira,
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 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 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 informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp November 8, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct
More informationEuler s partition theorem and the combinatorics of l-sequences
Euler s partition theorem and the combinatorics of l-sequences Carla D. Savage North Carolina State University June 26, 2008 Inspiration BME1 Mireille Bousquet-Mélou, and Kimmo Eriksson, Lecture hall partitions,
More informationRamanujan-Slater Type Identities Related to the Moduli 18 and 24
Ramanujan-Slater Type Identities Related to the Moduli 18 and 24 James McLaughlin Department of Mathematics, West Chester University, West Chester, PA; telephone 610-738-0585; fax 610-738-0578 Andrew V.
More informationPLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK
PLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK Abstract. Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular,
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 informationArithmetic Relations for Overpartitions
Arithmetic Relations for Overpartitions Michael D. Hirschhorn School of Mathematics, UNSW, Sydney 2052, Australia m.hirschhorn@unsw.edu.au James A. Sellers Department of Mathematics The Pennsylvania State
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More informationARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3
ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3 JOHN J WEBB Abstract. Let b 13 n) denote the number of 13-regular partitions of n. We study in this paper the behavior of b 13 n) modulo 3 where
More informationStanton Graph Decompositions
Stanton Graph Decompositions Hau Chan and Dinesh G. Sarvate Abstract. Stanton graphs S k (in honor of professor Ralph G. Stanton) are defined, and a new graph decomposition problem for Stanton graphs is
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationN E W S A N D L E T T E R S
N E W S A N D L E T T E R S 74th Annual William Lowell Putnam Mathematical Competition Editor s Note: Additional solutions will be printed in the Monthly later in the year. PROBLEMS A1. Recall that a regular
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 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 informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More information1 Introduction 1. 5 Rooted Partitions and Euler s Theorem Vocabulary of Rooted Partitions Rooted Partition Theorems...
Contents 1 Introduction 1 Terminology of Partitions 1.1 Simple Terms.......................................... 1. Rank and Conjugate...................................... 1.3 Young Diagrams.........................................4
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 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 informationCONGRUENCES FOR BROKEN k-diamond PARTITIONS
CONGRUENCES FOR BROKEN k-diamond PARTITIONS MARIE JAMESON Abstract. We prove two conjectures of Paule and Radu from their recent paper on broken k-diamond partitions. 1. Introduction and Statement of Results
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 informationarxiv: v2 [math.nt] 2 Aug 2017
TRAPEZOIDAL NUMBERS, DIVISOR FUNCTIONS, AND A PARTITION THEOREM OF SYLVESTER arxiv:1601.07058v [math.nt] Aug 017 MELVYN B. NATHANSON To Krishnaswami Alladi on his 60th birthday Abstract. A partition of
More informationSrinivasa Ramanujan Life and Mathematics
Life and Mathematics Universität Wien (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) born 22 December 1887 in Erode (Madras Presidency = Tamil Nadu) named Iyengar (1887
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
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 informationIAP LECTURE JANUARY 28, 2000: THE ROGERS RAMANUJAN IDENTITIES AT Y2K
IAP LECTURE JANUARY 28, 2000: THE ROGERS RAMANUJAN IDENTITIES AT Y2K ANNE SCHILLING Abstract. The Rogers-Ramanujan identities have reached the ripe-old age of one hundred and five and are still the subject
More informationMath 4400 First Midterm Examination September 21, 2012 ANSWER KEY. Please indicate your reasoning and show all work on this exam paper.
Name: Math 4400 First Midterm Examination September 21, 2012 ANSWER KEY Please indicate your reasoning and show all work on this exam paper. Relax and good luck! Problem Points Score 1 20 20 2 20 20 3
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
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 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 informationRademacher-Type Formulas for Partitions and Overpartitions
Georgia Southern University Digital Commons@Georgia Southern Mathematical Sciences Faculty Publications Mathematical Sciences, Department of 2010 Rademacher-Type Formulas for Partitions and Overpartitions
More informationTHE NATURE OF PARTITION BIJECTIONS II. ASYMPTOTIC STABILITY. Introduction
THE NATURE OF PARTITION BIJECTIONS II. ASYMPTOTIC STABILITY IGOR PAK Abstract. We introduce a notion of asymptotic stability for bijections between sets of partitions and a class of geometric bijections.
More informationPractice Exam 1 CIS/CSE 607, Spring 2009
Practice Exam 1 CIS/CSE 607, Spring 2009 Problem 1) Let R be a reflexive binary relation on a set A. Prove that R is transitive if, and only if, R = R R. Problem 2) Give an example of a transitive binary
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More information