Counting partitions on the abacus

DOI10.1007/S11139-006-9013-5zbMATH Open1188.05019arXivmath/0609175OpenAlexW2114289002MaRDI QIDQ2269012FDOQ2269012

Authors: Mark Wildon 

Publication date: 15 March 2010

Published in: The Ramanujan Journal (Search for Journal in Brave)

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.

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

Recommendations

• A simplified proof of the partition formula
• scientific article; zbMATH DE number 1944014
• A Combinatorial Proof of a Partition Function Limit
• scientific article; zbMATH DE number 1989999
• A Tauberian theorem for partitions

zbMATH Keywords

partitionsabacus2-core

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75)

Cites Work

• On an elementary proof of some asymptotic formulas in the theory of partitions
• Two theorems of Gauss and allied identities proved arithmetically
• Title not available (Why is that?)
• Partition bijections, a survey
• Generalized blocks for symmetric groups.
• Title not available (Why is that?)
• The Evaluation of the Constant in the Formula for the Number of Partitions of n

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
• Addition and counting: The arithmetic of partitions
• A simplified proof of the partition formula
• 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)