Partition Functions in Numeration Systems With Bounded Multiplicity

For a given increasing sequence of positive integers A = (a k)k≥0 and for q, an integer ≥ 2 or eventually q = ∞, let MA,q(n) denote the num- ber of representations of a given integer n by sums k≥0 e k a k with integers e k in [0, q). If a 0 = 1, the sequence A constitutes a numeration system for the natural numbers and A takes the name of scale. The partition problem con- sists in studying the asymptotic behavior of M A,q(·) and its summation function ΓA,q(·). In this paper we study various aspects of this problem. In the first part we recall important results and methods developed in the literature with atten- tions to the binary numeration system, the d-ary numeration system and also the Fibonacci and the m-bonacci scales. These cases show that M A,q(·) can be very irregular. In the second part, miscellaneous general results are proved and we in- vestigate in more details sequences A which grow exponentially. In particular, we generalize a result of Dumont-Sidorov-Thomas in proving that if a k ∼ cγk (with the only natural restriction γ > 1) then ΓA,q(x) = xlogγ qH(logγ x) + o(xlogγ q ) where H is a function strictly positive, continuous, periodic of period 1 and al- most everywhere differentiable. The final part is devoted to a particular family of recurrent sequences G called Pisot scales. We prove in that case that for any suitable q, there exists a set S G,q of positive integers with natural density 1 such that lims→∞, s∈ SG,q log M G,q(s)/ log s exists. The proof uses a previous work of D.-J. Feng and N. Sidorov related to the multiplicity of the radix θ-expansions of real numbers using digits 0, 1, . . . , q − 1, where θ is any positive Pisot number.