Dissecting the Stanley Partition Function

Details Dissecting the Stanley Partition Function Dissecting the Stanley Partition Function

2004-09-24

arxiv.org/abs/math/0409480v2

Mathematics

Combinatorics

13 pages, new theorems, examples and Note added, to appear in JCT(A)

Scientific paper

Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes the number of odd parts of the partition pi and pi' is the conjugate of pi. R. Stanley [13], [14] derived an infinite product representation for the generating function of p[0](n)-p[2](n). Recently, Holly Swisher[15] employed the circle method to show that limit[n->oo] p[0](n)/p(n) = 1/2 (i) and that for sufficiently large n 2 p[0](n) > p(n), if n=0,1 mod 4, 2 p[0](n) < p(n), otherwise. (ii) In this paper we study even/odd dissection of the Stanley product, and show how to use it to prove (i) and (ii) with no restriction on n. Moreover, we establish the following new result |p[0](2n) - p[2](2n)| > |p[0](2n+1) - p[2](2n+1)|, n>0. Two proofs of this surprising inequality are given. The first one uses the Gollnitz-Gordon partition theorem. The second one is an immediate corollary of a new partition inequality, which we prove in a combinatorial manner. Our methods are elementary. We use only Jacobi's triple product identity and some naive upper bound estimates.

Affiliated with

Also associated with

No associations

Rating

Dissecting the Stanley Partition Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dissecting the Stanley Partition Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dissecting the Stanley Partition Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695261