Combinatorial proofs of two Euler-type identities due to Andrews

DOI10.1007/s00026-019-00449-4zbMath1433.05028arXiv1803.06394OpenAlexW2979678060WikidataQ113906311 ScholiaQ113906311MaRDI QIDQ2299116

Richard Bielak, Cristina M. 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

partitionsoverpartitionsEuler identitybit strings

Mathematics Subject Classification ID

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

Related Items (9)

Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts ⋮ On a partition identity of Lehmer ⋮ On certain partition bijections related to Euler's partition problem ⋮ Beck-type identities: new combinatorial proofs and a modular refinement ⋮ Unnamed Item ⋮ Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k ⋮ Beck-type companion identities for Franklin's identity via a modular refinement ⋮ On identities of Watson type ⋮ Beck-type identities for Euler pairs of order \(r\)

Uses Software

• OEIS

Cites Work

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

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