Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

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


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

Similar works

Full text



Last time updated on 14/04/2021

This paper was published in Hal-Diderot.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.