Abstract

This paper introduces a method for finding uniformly random second-order restricted k-compositions of N. This method involves a new algorithm which maps an integer to a composition, and uses a uniform random integer as the input for this mapping. The paper also examines existing methods to randomly select a composition, and discusses the benefits of the new algorithm over those methods.