Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Yee a J - rial Proofs of Generating Function Identities for F-Partitions - J. Comb. Theory Ser.a 102(2003) No.1 217-228

Yee a J - rial Proofs of Generating Function Identities for F-Partitions - J. Comb. Theory Ser.a 102(2003) No.1 217-228

Ratings: (0)|Views: 4 |Likes:
Published by Renee Bravo

More info:

Published by: Renee Bravo on Aug 01, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

10/25/2012

pdf

text

original

 
Journal of Combinatorial Theory, Series A 102 (2003) 217–228
Note
Combinatorial proofs of generating functionidentities for F-partitions
Ae Ja Yee
1
Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, USA
Received 15 October 2002
Abstract
In his memoir in 1984, George E. Andrews introduces many general classes of Frobeniuspartitions (simply F-partitions). Especially, he focuses his interest on two general classes of F-partitions: one is F-partitions that allow up to
repetitions of an integer in any row, andthe other is F-partitions whose parts are taken from
copies of the nonnegative integers. Thelatter are called
colored F-partitions or F-partitions with
colors. Andrews derives thegenerating functions of the number of F-partitions with
repetitions and F-partitions with
colors of 
n
and leaves their purely combinatorial proofs as open problems. The primary goalof this article is to provide combinatorial proofs in answer to Andrews’ request.
r
2003 Elsevier Science (USA). All rights reserved.
1. Introduction
For a nonnegative integer
n
;
a generalized Frobenius partition or simply anF-partition of 
n
is a two-rowed array of nonnegative integers
a
1
a
2
?
a
r
b
1
b
2
?
b
r
;
!
;
where each row is of the same length, each is arranged in nonincreasing order and
n
¼
r
þ
P
r
¼
1
ð
a
þ
b
Þ
:
Frobenius studied F-partitions[4]in his work on group representation theoryunder the additional assumptions
a
1
4
a
2
4
?
4
a
r
X
0 and
b
1
4
b
2
4
?
4
b
r
X
0
:
Byconsidering the Ferrers graph of an ordinary partition, we see that
a
form rows to
E-mail address:
yee@math.uiuc.edu.
1
Research partially supported by a grant from the Number Theory Foundation.0097-3165/03/$-see front matter
r
2003 Elsevier Science (USA). All rights reserved.doi:10.1016/S0097-3165(03)00023-2
 
the right of the diagonal and
b
form columns below the diagonal. For example, theF-partition for 7+7+5+4+2+2 is6 5 2 05 4 1 0
!
;
as is seen easily from the Ferrers graph inFig. 1. Thus F-partitions are anotherrepresentation of ordinary partitions.In his memoir[2],Andrews introduces many general classes of F-partitions. Especially, he focuses his interest on two general classes of F-partitions: one isF-partitions that allow up to
repetitions of an integer in any row, and the other isF-partitions whose parts are taken from
copies of the nonnegative integers. Thelatter are called
colored F-partitions or F-partitions with
colors. Andrews[2]derives the generating functions of the number of F-partitions with
repetitions andF-partitions with
colors of 
n
and leaves their purely combinatorial proofs as openproblems. More precisely, he[2, p. 40]offers ten series of problems; in this paper weoffer solutions to two series of problems, comprising a total of five separateproblems. The primary goal of this article is to provide combinatorial proofs inanswer to Andrews’ request.In Section 2, we interpret the enumerative proof of Jacobi’s triple product of E. M.Wright in another way using the generating function for two-rowed arrays of nonnegative integers. In Section 3, we prove the generating function for F-partitionswith
colors in a combinatorial way, which was independently and earlierestablished by Garvan[6],and in Section 4, we prove identities arising in the study on F-partitions with
colors of Andrews. We prove the generating function forF-partitions with
repetitions combinatorially in Section 5.
2. Wright’s enumerative proof of Jacobi’s triple product
The well-known Jacobi triple product identity is
X
N
n
¼À
N
z
n
q
n
2
¼
Y
N
n
¼
1
ð
1
À
q
2
n
Þð
1
þ
zq
2
n
À
1
Þð
1
þ
z
À
1
q
2
n
À
1
Þ ð
2
:
1
Þ
for
z
a
0
;
j
q
j
o
1
:
There are two proofs of Andrews[1,2]. A proof of Wright[8]is combinatorial, and involves a direct bijection of bipartite partitions. Proofs due toCheema[3]and Sudler[7]are variations of Wright’s proof. Here we describe Wright’s proof, which we use in the following sections.
Fig. 1. Ferrers graph of 7
þ
7
þ
5
þ
4
þ
2
þ
2
:
Note / Journal of Combinatorial Theory, Series A 102 (2003) 217–228
218
 
By substituting
zq
for
z
and
q
for
q
2
in (2.1), and then dividing by
Q
N
n
¼
1
ð
1
À
q
n
Þ
onboth sides, we obtain
P
N
n
¼À
N
z
n
q
n
ð
n
þ
1
Þ
=
2
Q
N
n
¼
1
ð
1
À
q
n
Þ¼
Y
N
n
¼
1
ð
1
þ
zq
n
Þð
1
þ
z
À
1
q
n
À
1
Þ
;
ð
2
:
2
Þ
which we use below. Let
A
be the set of two-rowed arrays of nonnegative integers
ð
u
;
v
Þ
:
¼
u
1
u
2
?
u
s
v
1
v
2
?
v
t
;
!
;
where
u
1
4
u
2
4
?
4
u
s
X
0
;
v
1
4
v
2
4
?
4
v
t
X
0
;
and
s
and
t
can be distinct. We definethe weight of 
ð
u
;
v
Þ
A
A
by
u
;
v
Þj
:
¼
s
þ
X
s
¼
1
u
þ
X
t
¼
1
v
:
When
z
¼
1
;
the right-hand side of (2.2) is the generating function for
ð
u
;
v
Þ
A
A
;
X
ð
u
;
v
Þ
A
A
q
u
;
v
Þj
:
Thus, we interpret Wright’s 1-1 correspondence using
A
:
To do that, we first need todescribe a graphical representation of a two-rowed array
u
1
u
2
?
u
s
v
1
v
2
?
v
t
!
that is analogous to the Ferrers graph of an ordinary partition. Put
s
circles on thediagonal, and then put
u
 j 
nodes in row
to the right of the diagonal and
v
 j 
nodes incolumn
ð
s
À
t
þ
Þ
below the diagonal. The diagram of a two-rowed array coincideswith the Ferrers graph when the lengths of the two rows are equal.Fig. 2shows thediagram of 
à Ã
6 5 2 17 5 4 3 1 0
!
:
We are ready to construct Wright’s 1-1 correspondence. Let
r
¼
s
À
t
:
Supposethat
r
X
0
:
For the given diagram of 
ð
u
;
v
Þ
;
we separate the diagram into two sets of nodes along the vertical line between column
r
and column
r
þ
1 to obtain theFerrers graph of an ordinary partition and a right angled triangle of nodes consistingof 
r
rows. Meanwhile, if 
r
o
0
;
then we separate the diagram along the horizontal line
Fig. 2.
Note / Journal of Combinatorial Theory, Series A 102 (2003) 217–228
219

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->