Abstract
A -ary chain is a special type of chain partition of integers with parts of the form for some fixed integers and . In this note, we are interested in the maximal weight of such partitions when their parts are distinct and cannot exceed a given bound . Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of , asymptotically independent of , and we provide an efficient algorithm to compute it.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.