Estimates of five restricted partition functions that are quasi polynomials

A function f defined on N is said to be a quasi polynomial if, f(αn+r) is a polynomial in n for each r=0,1,…,α-1, where α is a positive integer. In this article, we show that the below given restricted partition functions are quasi polynomials: (i) a(n,k)-number of partitions of n with exactly k parts and least part being less than k, (ii) aq(n,k)-number of distinct partitions (partitions with distinct parts) of n with exactly k parts and least part being less than k, (iii) Le(n,k,m)-number of partitions of n with exactly k parts and m least parts, (iv) La(n,k,1)-number of partitions of n with exactly k parts and one largest part and (v) d(n,k)-number of partitions of n with exactly k parts and difference between least part and largest part exceeds k-2. Consequently, following estimates were derived: (i) a(n,k)∼nk-2(k-2)!2(ii) aq(n,k)∼nk-2(k-2)!2(iii) Le(n,k,m)∼(k-1)!(k-m)!(k-m-2)!nk-m-1(iv) La(n,k,1)∼nk-1k!(k-1)!(v) d(n,k)∼nk-1k!(k-1)!


Introduction
A function f defined on N is said to be a quasi polynomial if, f (αn+r ) is a polynomial in n for each r = 0, 1, . . . , α − 1, where α is a positive integer. In such case, α is called quasi period of f and we term f (αn + r ) as constituent polynomial of f .
The notion of quasi polynomial seems to be subsist from the time of Bell [1], who proved that the partition function, p A (n)-number of partitions of n with parts from a finite set of positive integers A, is a quasi polynomial with each constituent polynomial being of degree at most |A| − 1 and quasi period being a positive common multiple of elements of A. This fact was also proved recently by Rødseth and Sellers [5].
In this article, we consider partition functions mentioned in the following definition and we show that they are quasi polynomials. This characteristic found in defined functions is impetus in deriving its estimates. The method followed in this article for deriving estimates can be adopted for the other functions which are not considered in this article provided they meet the requisite for derivation. Definition 1. 1 We recall that, a partition of a positive integer n is a non increasing sequence of positive integers say π = (a 1 , a 2 , . . . , a k ) such that k i=1 a i = n. Each a i is called a part of the partition π . If a i = a j ∀i = j, then π is said to be a distinct partition. The partition function, p(n), counts the number of partitions of n. The enumerative function which counts a class of partitions that have a fixed number of parts is usually called a restricted partition function.
(i) The function a(n, k) is defined to be the number of partitions of n with exactly k parts and least part being less than k, when n ≥ k. We define a(n, k) = 0, when n < k. (ii) The function aq(n, k) is defined to be the number of distinct partitions of n with exactly k parts and least part being less than k, when n ≥ k(k+1) 2 . We define aq(n, k) = 0, when n < k(k+1) 2 .
(iii) The function Le(n, k, m) is defined to be the number of partitions of n with exactly k parts and m least parts, when n ≥ 2k − m. And Le(n, k, m) = 0 otherwise. (iv) The function La(n, k, M) is defined to be the number of partitions of n with exacly k parts and M largest parts, when n ≥ M + k. And La(n, k, M) = 0 otherwise. (v) The function d(n, k) is defined to be the number of partitions of n with exactly k parts and difference between least part and largest part exceeds k − 2.

Estimates
In this section, we derive estimates for the aforementioned functions.

Pattern of derivation
First, we paraphrase the current method of calculating estimate. If f is a quasi polynomial with quasi period α and each constituent polynomial say f (αl +r ) is a polynomial in l of degree k having identical leading coefficient say c(k), then Since the limit is valid for each r = 0, 1, . . . , α − 1, we have Equivalently, In order to make use of the above limit process, we need to show that the leading coefficients of all constituent polynomials of the functions that we have considered are identical.

Main results
Theorem 2. 1 We have (2.2) Proof As first step of this proof, we establish the following relations: where q(n, k) is defined to be the number of distinct partitions of n with exactly k parts.
Let q n,k,1 and q n,k,≥2 , respectively, be the number of distinct partitions of n with exactly k parts and least part being one, and the number of distinct partitions of n with exactly k parts and least part being greater than one. We notice that, the mapping establishes one to one correspondence between the following two sets: • The set of all distinct partitions of n with exactly k parts and least part being greater than one. • The set of all distinct partitions of n − k with exactly k parts.
• The set of all distinct partitions of n with exactly k parts and least part being one.
We notice that, the mapping establishes one to one correspondence between the following two sets: • The set of all partitions of n with exactly k parts and least part being less than k.
• The set of all distinct partitions of n + (k−1)k 2 with exactly k parts and least part being less than k.
Let r be a positive integer such that r ≤ k − 1 and let q r (n, k) be the number of distinct partitions of n with exactly k parts and least part being r . We notice that, the mapping establishes one to one correspondence between the following sets: • The set of all distinct partitions of n with exactly k parts and least part being r .
• The set of all distinct partitions of n − rk with exactly k − 1 parts.
Assume that, the assertion is true up to some Here uniqueness of (r i , q i ) and the bound 0 ≤ r i ≤ (k − 1)! − 1 follows from the relation r − ik = (k − 1)!q i + r i as consequence of Division algorithm. By the induction assumption, we have that: the leading coefficient of each of the polynomial in the right side of the above equality is . Thus, the leading coefficient of Here too uniqueness of (r i , q i ) and the bound 0 ≤ r i ≤ (k − 1)! − 1 follows from the relation r − ik = (k − 1)!q i + r i as consequence of Division algorithm. Thus, the leading coefficient of aq Consequently, from the relation (2.5) it follows that the leading coefficient of a Accordingly, the estimate of both a(n, k) and aq(n, k) is Remark 2.2 (i) In the course of proof it is shown that, the leading coefficient of the constituent polynomial q(k!l + r, k) is k! k−2 (k−1)! for every r = 0, 1, . . . , k! − 1. Since each constituent polynomial is of degree k − 1, one can get the following estimate for q(n, k): (ii) Using the following easily verifiable identity: one can see that, the leading coefficient of the constituent polynomial p(k!l +r, k) This estimate is a well established one and number of proofs have been obtained for this. From the generating functions for p {1,2,...,k} (n) and p(n, k), one can see that: It is well documented that when A is a finite set of positive integers with gcd(A) = 1. Number of proofs have been obtained for the latter estimate (see [3,4,[6][7][8]). From the relation (2.9), we see that the estimate (2.8) is a particular case of the estimate (2.10). (iii) If we define a(n, k) to be the number of partitions of n with exactly k parts and least part greater than or equal to k, then we have:

p(n, k) = a(n, k) + a(n, k).
Since p(k!l +r, k) is a polynomial of degree k −1 and a(k!l +r, k) is a polynomial of degree k −2 for every r = 0, 1, . . . , k!−1, by just mentioned relation it follows that a(k!l + r, k) is a polynomial of degree k − 1 with leading coefficient k! k−2 (k−1)! for every r = 0, 1, . . . , k! − 1. Consequently, In similar fashion, if one defines aq(n, k) to be the number of distinct partitions of n with exactly k parts and least part being greater than or equal to k, then it follows that: (2.12) (iv) In [2] the partition function, u(n, k), is defined to be the number of uniform partitions of n with exactly k parts, and it is shown that: From this, we have q(n, k) ≤ u(n, k) ≤ p(n, k).

Theorem 2.3 We have
Proof First, we show that Le(n, k, m) = Le(n − k, k, m) + p(n − k, k − m). (2.14) We denote a partition say π of n by π = (a α 1 1 · · · a α r r ) when there is α i parts of size a i ; (i = 1, 2, . . . , r ). Let π = (a α 1 1 a α 2 2 · · · a α r r ) be a partition of n with α 1 + · · · + α r = k and α r = m, that is, π be a partition of n with exactly k parts and m least parts. Now, we enumerate such partitions by considering two cases.
Case (i) Assume a r > 1. We notice that, the mapping: is a bijection between the following sets: • The set of partitions of n with exactly k parts, m least parts and least part being greater than 1. • The set of partitions of n − k with exactly k parts and m least parts.
We see that, the cardinality of the latter set is Le(n − k, k, m). Case (ii) Assume a r = 1. We notice that, the mapping: (a α 1 1 · · · a α r r ) → (a 1 − 1) α 1 · · · (a r −1 − 1) α r −1 is a bijection between the following sets: • The set of partitions of n with exactly k parts, m least parts and least part being equal to 1. • The set of partitions of n − k with exactly k − m parts.
We see that, the cardinality of the latter set is p(n − k, k − m). Thus the relation (2.14) follows.
From the relation (2.14), one can get inductively that: Le(k!l + r, k, m) is a polynomial of degree k −m −1 for every r = 0, 1, . . . , k!−1. Now, we prove that, the leading coefficient of From the relation (2.14) it follows that: where r i and q i were determined uniquely by the relation:r − ik = (k − m)!q i + r i ; uniqueness of (r i , q i ) and boundedness of r i : 0 ≤ r i ≤ (k − m)! − 1 follows by Division algorithm. Then from part(ii) of Remark 2.2, it follows that, the leading coefficient of !l +r, k, m) is a polynomial of degree k −m −1 for each r = 0, 1, . . . , k! − 1, we get the estimate of Le(n, k, m) as It is not hard to see that: q(n, k) ≤ d(n, k) ≤ p(n, k).
Again, since q(n, k) ∼ n k−1 k!(k−1)! and p(n, k) ∼ n k−1 k!(k−1)! , one can get the following estimate: Though estimates for d(n, k) and La(n, k, 1) has been obtained immediately, it is the core objective of this article to show that d(n, k) and La(n, k, 1) are quasi polynomials. We accomplish the same and thereby obtain the above mentioned estimates.
Theorem 2. 4 We have Proof For instance, we call the partitions that d(n, k) enumerates as deviated partitions. First, we prove the relation: 1 , a 2 , . . . , a k ) be a deviated partition of n with exactly k parts. Now, we enumerate such partitions.
Case (i) Assume a k > 1. We notice that, the mapping (a 1 , . . . , a k ) → (a 1 − 1, . . . , a k − 1) establishes one to one correspondence between the following sets: • The set of all deviated partitions of n with exactly k parts and least part being greater than one. • The set of all deviated partitions of n − k with exactly k parts.
Case (ii) Assume a k = 1. Let π = (a 1 , . . . , a k ) be a partition of n with a k = 1. We note that: if n ≥ k(k − 1) + 1 then a 1 ≥ k. Consequently, π is a deviated partition of n when n ≥ k(k − 1) + 1. It is not hard to see that enumeration of such partitions is p(n − 1, k − 1). Whence the relation (2.16).
From the relation (2.16) one can have the following relation: where (q i , r i ) satisfying the inequality 0 ≤ r i ≤ (k −1)!−1 were uniquely determined from the relation (k −1)!q i +r i = r −ik −1. From the above equality one can calculate the leading coefficient of d(k!l +r, k) to be k! k−2 (k−1)! for every r = 0, 1, . . . , k!−1. Since d(k!l + r, k) is a polynomial of degree k − 1 for every r = 0, 1, . . . , k! − 1, we get the estimate of d(n, k) as n k−1 k! k−2 k! k−1 (k−1)! = n k−1 k!(k−1)! . This is what we wish to prove. Let π = (a 1 , . . . , a k ) be a partition of n with exactly k parts and M largest parts. Now, we count such partitions.
Case (i) Assume a k > 1. In this case, the mapping (a 1 , . . . , a k ) → (a 1 − 1, . . . , a k − 1) establishes one to one correspondence between the following sets: • The set of all partitions of n with k parts, M largest parts and least part being greater than 1. • The set of all partitions of n − k with k parts and M largest parts.
We see that, the cardinality of the latter set is La(n − k, k, M).
Case (ii) Assume a k = 1. In this case, the mapping (a 1 , . . . , a k ) → (a 1 , . . . , a k−1 ) establishes one to one correspondence between the following sets: • The set of all partitions of n with k parts, M largest parts and least part being one.
• The set of all partitions of n − 1 with k − 1 parts and M largest parts.
Since cardinality of the latter set is La(n − 1, k − 1, M), above recurrence relation follows.