A Polyhedral Model of Partitions with Bounded Differences and a Bijective Proof of a Theorem of Andrews, Beck, and Robbins

Felix Breuer, James Brandt Kronholm

Research output: Working paper and reportsPreprint

Abstract

The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of partitions with fixed differences between largest and smallest parts which has recently been studied through analytic methods by Andrews, Beck, and Robbins. Our approach is geometric: We model partitions with bounded differences as lattice points in an infinite union of polyhedral cones. Surprisingly, this infinite union tiles a single simplicial cone. This construction then leads to a bijection that can be interpreted on a purely combinatorial level.
Original languageEnglish
Place of PublicationRISC Hagenberg
PublisherRISC
Number of pages12
DOIs
Publication statusPublished - 2015

Publication series

NameRISC Report Series

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this