Partitions with an arbitrary number of specified distances

DOI10.1017/S0004972719000650zbMATH Open1453.11132OpenAlexW2948966477WikidataQ127791815 ScholiaQ127791815MaRDI QIDQ5212958FDOQ5212958

Authors: Bernard L. S. Lin 

Publication date: 31 January 2020

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972719000650

Recommendations

• Partitions with fixed differences between largest and smallest parts
• Two problems of George Andrews on generating functions for partitions
• Generalisation of a result on distinct partitions with bounded part differences
• A note on partitions with short profile steps
• On a partition function of Richard Stanly

zbMATH Keywords

partition\(q\)-binomial theoremdifference between largest and smallest parts

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partition identities; identities of Rogers-Ramanujan type (11P84)

Cites Work

• Title not available (Why is that?)
• A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins
• Partitions with fixed differences between largest and smallest parts
• Partitions with bounded differences between largest and smallest parts
• A curious identity and its applications to partitions with bounded part differences
• Overpartitions with bounded part differences
• An overpartition analogue of partitions with bounded differences between largest and smallest parts

Cited In (3)

• \(k\)-regular partitions and overpartitions with bounded part differences
• A note on partitions with short profile steps
• Partitions with fixed differences between largest and smallest parts

This page was built for publication: Partitions with an arbitrary number of specified distances

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