Counting partitions on the abacus
Tóm tắt
In 2003, Maróti showed that one could use the machinery of ℓ-cores and ℓ-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case ℓ=2, using them to give a largely combinatorial proof of an effective upper bound on p(n), and to prove asymptotic formulae for the number of self-conjugate partitions, and the number of partitions with distinct parts. In a further application we give a combinatorial proof of an identity originally due to Gauss.
Tài liệu tham khảo
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatorial analysis. Proc. London Math. Soc. (2) 17, 75–113 (1917)
Erdős, P.: On an elementary proof of some asymptotic formulas in the theory of partitions. Ann. Math. (2) 43, 437–450 (1942)
Gauss, C.F.: Zur Theorie der Transcendenten Functionen Gehörig. In: Werke, vol. III, pp. 435–446. Königslichen Gesellschaft der Wissenschaften zu Göttingen, Göttingen (1886)
Newman, D.J.: The evaluation of the constant in the formula for the number of partitions of n. Am. J. Math. 73, 599–601 (1951)
James, G., Kerber, A.: The Representation Theory of The Symmetric Group. Encyclopedia of Mathematics and its Applications, vol. 16. Addison-Wesley, Reading (1981)
Andrews, G.E.: Two theorems of Gauss and allied identities proved arithmetically. Pac. J. Math. 41, 563–578 (1972)
Pak, I.: Partition bijections, a survey. Ramanujan J. 12, 5–75 (2006)
Maróti, A.: On elementary lower bounds for the partition function. Integers 3, A10 (2003) (electronic, 9 pp.)
Külshammer, B., Olsson, J.B., Robinson, G.R.: Generalized blocks for symmetric groups. Invent. Math. 151(3), 513–552 (2003)