On non-squashing partitions

N. J.A. Sloane; James A. Sellers

doi:10.1016/j.disc.2004.11.014

On non-squashing partitions

N. J.A. Sloane, James A. Sellers

Mathematics

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

A partition n=p1+p2+⋯+pk with 1≤p1≤p2≤⋯≤pk is called non-squashing if p1+⋯+pj≤pj+1 for 1≤j≤k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the number of binary partitions of n. Here we exhibit an explicit bijection between the two families, and determine the number of non-squashing partitions with distinct parts, with a specified number of parts, or with a specified maximal part. We use the results to solve a certain box-stacking problem.

Original language	English (US)
Pages (from-to)	259-274
Number of pages	16
Journal	Discrete Mathematics
Volume	294
Issue number	3
DOIs	https://doi.org/10.1016/j.disc.2004.11.014
State	Published - May 6 2005

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2004.11.014

Cite this

@article{5d282278895942ea8f59d429fd9a8420,

title = "On non-squashing partitions",

abstract = "A partition n=p1+p2+⋯+pk with 1≤p1≤p2≤⋯≤pk is called non-squashing if p1+⋯+pj≤pj+1 for 1≤j≤k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the number of binary partitions of n. Here we exhibit an explicit bijection between the two families, and determine the number of non-squashing partitions with distinct parts, with a specified number of parts, or with a specified maximal part. We use the results to solve a certain box-stacking problem.",

author = "Sloane, {N. J.A.} and Sellers, {James A.}",

year = "2005",

month = may,

day = "6",

doi = "10.1016/j.disc.2004.11.014",

language = "English (US)",

volume = "294",

pages = "259--274",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - On non-squashing partitions

AU - Sloane, N. J.A.

AU - Sellers, James A.

PY - 2005/5/6

Y1 - 2005/5/6

N2 - A partition n=p1+p2+⋯+pk with 1≤p1≤p2≤⋯≤pk is called non-squashing if p1+⋯+pj≤pj+1 for 1≤j≤k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the number of binary partitions of n. Here we exhibit an explicit bijection between the two families, and determine the number of non-squashing partitions with distinct parts, with a specified number of parts, or with a specified maximal part. We use the results to solve a certain box-stacking problem.

AB - A partition n=p1+p2+⋯+pk with 1≤p1≤p2≤⋯≤pk is called non-squashing if p1+⋯+pj≤pj+1 for 1≤j≤k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the number of binary partitions of n. Here we exhibit an explicit bijection between the two families, and determine the number of non-squashing partitions with distinct parts, with a specified number of parts, or with a specified maximal part. We use the results to solve a certain box-stacking problem.

UR - http://www.scopus.com/inward/record.url?scp=17644420358&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17644420358&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2004.11.014

DO - 10.1016/j.disc.2004.11.014

M3 - Article

AN - SCOPUS:17644420358

SN - 0012-365X

VL - 294

SP - 259

EP - 274

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

On non-squashing partitions

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this