Dissecting the Stanley partition function

DOI10.1016/J.JCTA.2005.03.001MaRDI QIDQ2575807zbMATH OpenOpenAlexFDO

Authors Alexander Berkovich, Frank G. Garvan

Publication date 6 December 2005

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0409480

zbMATH Keywords

asymptotic formulasgenerating functionspartition inequalitiesupper boundseven/odd dissectionStanley partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) (q)-calculus and related topics (05A30) Combinatorial inequalities (05A20)

Abstract: 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.

Recommendations

• On Stanley's partition function
• On a partition function of Richard Stanly
• Some generating functions and inequalities for the Andrews-Stanley partition functions
• On the parity of partition functions
• The Andrews-Stanley partition function and \(p(n)\): congruences

Cites work

• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• A combinatorial proof of a partition identity of Andrews and Stanley
• A four-parameter partition identity
• Analytic methods in asymptotic enumeration
• On a partition function of Richard Stanly
• On an elementary proof of some asymptotic formulas in the theory of partitions
• On partition functions of Andrews and Stanley
• On the Andrews-Stanley refinement of Ramanujan’s partition congruence modulo 5 and generalizations
• Some New Observations on the Gollnitz-Gordon and Rogers-Ramanujan Identities
• Some remarks on sign-balanced and maj-balanced posets
• The Andrews-Stanley partition function and \(p(n)\): congruences
• Über das asymptotische Verhalten von Iterationsfolgen

Cited in

(11)

• Differences of partition functions: the anti-telescoping method
• On Stanley's partition function
• On the class of dominant and subordinate products
• Partition inequalities and applications to sum-product conjectures of Kanade-Russell
• Marking and shifting a part in partitions
• Some generating functions and inequalities for the Andrews-Stanley partition functions
• Some elementary partition inequalities and their implications
• A variation of the Andrews-Stanley partition function and two interesting \(q\)-series identities
• Races among products
• An analytic proof of the Borwein conjecture
• An analogue of Alder-Andrews conjecture generalizing the 2nd Rogers-Ramanujan identity

Describes a project that uses

Uses Software

• StanBij.mws

This page was built for publication: Dissecting the Stanley partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575807)