Refinements of Beck-type partition identities
From MaRDI portal
Publication:2675868
DOI10.1016/J.DISC.2022.113110zbMATH Open1497.05016arXiv2204.00105OpenAlexW4292022490MaRDI QIDQ2675868FDOQ2675868
Cristina Ballantine, T. Amdeberhan, George E. Andrews
Publication date: 26 September 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Franklin's identity generalizes Euler's identity and states that the number of partitions of with different parts divisible by equals the number of partitions of with repeated parts. In this article, we give a refinement of Franklin's identity when . We prove Franklin's identity when , for partitions with fixed perimeter, i.e., fixed largest hook. We also derive a Beck-type identity for partitions with fixed perimeter: the excess in the number of parts in all partitions into odd parts with perimeter over the number of parts in all partitions into distinct parts with perimeter equals the number of partitions with perimeter whose set of even parts is a singleton. We provide analytic and combinatorial proofs of our results.
Full work available at URL: https://arxiv.org/abs/2204.00105
Recommendations
Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Elementary theory of partitions (11P81)
Cites Work
- Some observations on Dyson's new symmetries of partitions
- Overpartitions
- Title not available (Why is that?)
- Core partitions into distinct parts and an analog of Euler's theorem
- The On-Line Encyclopedia of Integer Sequences
- Partitions with fixed largest hook length
- Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
- Beck-type companion identities for Franklin's identity via a modular refinement
Cited In (3)
Uses Software
This page was built for publication: Refinements of Beck-type partition identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675868)