Abstract: In 2003, Maroti showed that one could use the machinery of l-cores and l-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 l=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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 1989999 (Why is no real title available?)
- Generalized blocks for symmetric groups.
- On an elementary proof of some asymptotic formulas in the theory of partitions
- Partition bijections, a survey
- The Evaluation of the Constant in the Formula for the Number of Partitions of n
- Two theorems of Gauss and allied identities proved arithmetically
Cited in
(11)- Character values and decomposition matrices of symmetric groups.
- On identities of Watson type
- The refined lecture hall theorem via abacus diagrams
- 4-regular partitions and the pod function
- Rational solutions of the fifth Painlevé equation. Generalized Laguerre polynomials
- A simplified proof of the partition formula
- Addition and counting: The arithmetic of partitions
- On certain unimodal sequences and strict partitions
- Automorphism Orbits and Element Orders in Finite Groups: Almost-Solubility and the Monster
- A Chinese remainder theorem for partitions
- A Combinatorial Proof of a Partition Function Limit
This page was built for publication: Counting partitions on the abacus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269012)
