A COMBINATORIAL PROOF OF A PARTITION PERIMETER INEQUALITY

Document Type

Article

Publication Date

1-1-2024

Abstract

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher’s theorem: for all m ≥ 2 and n ≥ 1, there are at least as many partitions with perimeter n and parts repeating fewer than m times as there are partitions with perimeter n with parts not divisible by m. In this work, we provide a combinatorial proof of their theorem by relating the combinatorics of the partition perimeter to that of compositions. Using this technique, we also show that a composition theorem of Huang implies a refinement of another perimeter theorem of Fu and Tang.

Publication Title

Integers

Link to Full Text

Share

COinS