On the maximal weight of (p,q)(p,q)-ary chain partitions with bounded parts

preprint2013arXivOpen access

Abstract

A (p,q)(p,q)-ary chain is a special type of chain partition of integers with parts of the form paqbp^aq^b for some fixed integers pp and qq. In this note, we are interested in the maximal weight of such partitions when their parts are distinct and cannot exceed a given bound mm. Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of mm, asymptotically independent of max⁡(p,q)\max(p,q), and we provide an efficient algorithm to compute it.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.