Combinatorial proofs of two Euler-type identities due to Andrews

DOI10.1007/S00026-019-00449-4MaRDI QIDQ2299116zbMATH OpenOpenAlexWikidataFDO

Authors Richard Bielak, Cristina Ballantine

Publication date 20 February 2020

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

bit stringsEuler identityoverpartitionspartitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Abstract: We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews via generating functions. Let $a(n)$ be the number of partitions of $n$ such that the set of even parts has exactly one element, $b(n)$ be the difference between the number of parts in all odd partitions of $n$ and the number of parts in all distinct partitions of $n$, and $c(n)$ be the number of partitions of $n$ in which exactly one part is repeated. Then, $a(n)=b(n)=c(n)$. The identity $a(n)=c(n)$ was proved combinatorially (in greater generality) by Fu and Tang. We prove combinatorially that $a(n)=b(n)$ and $b(n)=c(n)$. Our proof relies on bijections between a set and a multiset, where the partitions in the multiset are decorated with bit strings. Let $c_1(n)$ be the number of partitions of $n$ such that there is exactly one part occurring three times while all other parts occur only once and let $b_1(n)$ to be the difference between the total number of parts in the partitions of $n$ into distinct parts and the total number of different parts in the partitions of $n$ into odd parts. We prove combinatorially that $c_1(n)=b_1(n)$. In addition to these results by Andrews, we prove combinatorially that $b_1(n)=a_1(n)$, where $a_1(n)$ counts partitions of $n$ such that the set of even parts has exactly one element and satisfying some additional conditions. We also treat the case when exactly one part occurs twice while all other parts occur only once.

Recommendations

• Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
• Beck-type identities for Euler pairs of order r
• On a partition identity of Lehmer
• On the combinatorics of the number of even parts in all partitions with distinct parts
• Beck-type identities: new combinatorial proofs and a modular refinement

Cites work

• Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem

Cited in

(16)

• Beck-type companion identities for Franklin's identity via a modular refinement
• Beck-type identities for Euler pairs of order r
• On a partition identity of Lehmer
• Compositions with restricted parts
• Generalization of two problems of George Beck
• On certain partition bijections related to Euler's partition problem
• Beck-type identities: new combinatorial proofs and a modular refinement
• Euler-type identities for integer compositions via zig-zag graphs
• Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k
• On identities of Watson type
• scientific article; zbMATH DE number 7720721 (Why is no real title available?)
• Generalizing a partition theorem of Andrews
• Euler's partition identity and two problems of George Beck
• Generalizations of POD and PED partitions
• Mock theta functions and related combinatorics
• Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Combinatorial proofs of two Euler-type identities due to Andrews

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