Abstract
A function defined on is said to be a quasi polynomial if, is a polynomial in for each , where is a positive integer. In this article, we show that the below given restricted partition functions are quasi polynomials: (i) -number of partitions of with exactly parts and least part being less than , (ii) -number of distinct partitions (partitions with distinct parts) of with exactly parts and least part being less than , (iii) -number of partitions of with exactly parts and least parts, (iv) -number of partitions of with exactly parts and one largest part and (v) -number of partitions of with exactly parts and difference between least part and largest part exceeds . Consequently, following estimates were derived: (i)
(ii)
(iii)
(iv)
(v)
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
A function defined on is said to be a quasi polynomial if, is a polynomial in for each , where is a positive integer. In such case, is called quasi period of and we term as constituent polynomial of .
The notion of seems to be subsist from the time of Bell [1], who proved that the partition function, -number of partitions of with parts from a finite set of positive integers , is a quasi polynomial with each constituent polynomial being of degree at most 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 is a non increasing sequence of positive integers say such that . Each is called a part of the partition . If , then is said to be a distinct partition. The partition function, , counts the number of partitions of . 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 is defined to be the number of partitions of with exactly parts and least part being less than , when . We define , when .
-
(ii)
The function is defined to be the number of distinct partitions of with exactly parts and least part being less than , when . We define , when .
-
(iii)
The function is defined to be the number of partitions of with exactly parts and least parts, when . And otherwise.
-
(iv)
The function is defined to be the number of partitions of with exacly parts and largest parts, when . And otherwise.
-
(v)
The function is defined to be the number of partitions of with exactly parts and difference between least part and largest part exceeds .
2 Estimates
In this section, we derive estimates for the aforementioned functions.
2.1 Pattern of derivation
First, we paraphrase the current method of calculating estimate. If is a quasi polynomial with quasi period and each constituent polynomial say is a polynomial in of degree having identical leading coefficient say , then
Since the limit is valid for each , 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.
2.2 Main results
Theorem 2.1
We have
-
(i)
(2.1)
-
(ii)
(2.2)
Proof
As first step of this proof, we establish the following relations:
-
(i)
(2.3)
where is defined to be the number of distinct partitions of with exactly parts.
-
(ii)
(2.4)
-
(iii)
(2.5)
Let and , respectively, be the number of distinct partitions of with exactly parts and least part being one, and the number of distinct partitions of with exactly 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 with exactly parts and least part being greater than one.
-
The set of all distinct partitions of with exactly parts.
Thus, we have . Further, we notice that, the mapping
establishes one to one correspondence between the following two sets:
-
The set of all distinct partitions of with exactly parts.
-
The set of all distinct partitions of with exactly parts and least part being one.
Thus, we have . Since ; we get the relation (2.3).
We notice that, the mapping
establishes one to one correspondence between the following two sets:
-
The set of all partitions of with exactly parts and least part being less than .
-
The set of all distinct partitions of with exactly parts and least part being less than .
Thus the relation (2.5) follows.
Let be a positive integer such that and let be the number of distinct partitions of with exactly parts and least part being . We notice that, the mapping
establishes one to one correspondence between the following sets:
-
The set of all distinct partitions of with exactly parts and least part being .
-
The set of all distinct partitions of with exactly parts.
provided . Accordingly, we have the relation . Since ; the relation (2.4) follows.
Since , from the relation (2.3) it follows inductively that: is a polynomial of degree for every . Consequently, from the relations (2.4) and (2.5) it follows that and are polynomials, each of which is of degree for every . Now, we show that the leading coefficient of is . We adopt proof by induction on . Since the leading coefficient of the polynomial and is 1, the aforesaid assertion is true for .
Assume that, the assertion is true up to some . Let be the leading coefficient of for every . We notice that, the leading coefficient of is . By the relation (2.3), we have
Here uniqueness of and the bound follows from the relation 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 is . This gives as desired.
From the relation (2.4) it follows that
Here too uniqueness of and the bound follows from the relation as consequence of Division algorithm. Thus, the leading coefficient of is . Consequently, from the relation (2.5) it follows that the leading coefficient of is .
Accordingly, the estimate of both and is = , as desired.
Remark 2.2
-
(i)
In the course of proof it is shown that, the leading coefficient of the constituent polynomial is for every . Since each constituent polynomial is of degree , one can get the following estimate for :
(2.7)
-
(ii)
Using the following easily verifiable identity:
one can see that, the leading coefficient of the constituent polynomial is for every . Consequently, we have
(2.8)This estimate is a well established one and number of proofs have been obtained for this. From the generating functions for and , one can see that:
(2.9)It is well documented that
(2.10)when is a finite set of positive integers with . Number of proofs have been obtained for the latter estimate (see [3, 4, 6–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 to be the number of partitions of with exactly parts and least part greater than or equal to , then we have:
Since is a polynomial of degree and is a polynomial of degree for every , by just mentioned relation it follows that is a polynomial of degree with leading coefficient for every . Consequently,
(2.11)In similar fashion, if one defines to be the number of distinct partitions of with exactly parts and least part being greater than or equal to , then it follows that:
(2.12) -
(iv)
In [2] the partition function, , is defined to be the number of uniform partitions of with exactly parts, and it is shown that:
From this, we have
As we have and , it follows that:
Theorem 2.3
We have
Proof
First, we show that
We denote a partition say of by when there is parts of size ; . Let be a partition of with and , that is, be a partition of with exactly parts and least parts. Now, we enumerate such partitions by considering two cases.
Case (i) Assume . We notice that, the mapping:
is a bijection between the following sets:
-
The set of partitions of with exactly parts, least parts and least part being greater than 1.
-
The set of partitions of with exactly parts and least parts.
We see that, the cardinality of the latter set is .
Case (ii) Assume . We notice that, the mapping:
is a bijection between the following sets:
-
The set of partitions of with exactly parts, least parts and least part being equal to 1.
-
The set of partitions of with exactly parts.
We see that, the cardinality of the latter set is . Thus the relation (2.14) follows.
From the relation (2.14), one can get inductively that: is a polynomial of degree for every . Now, we prove that, the leading coefficient of is for every . From the relation (2.14) it follows that:
where and were determined uniquely by the relation:; uniqueness of and boundedness of : follows by Division algorithm. Then from part(ii) of Remark 2.2, it follows that, the leading coefficient of is . Consequently, the leading coefficient of is , which on simplification gives . Since is a polynomial of degree for each , we get the estimate of as =. The proof is now completed.
It is not hard to see that:
Since and , one can get the following estimate:
Also, we see that:
Again, since and , one can get the following estimate:
Though estimates for and has been obtained immediately, it is the core objective of this article to show that and 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 enumerates as deviated partitions. First, we prove the relation:
when .
Let be a deviated partition of with exactly parts. Now, we enumerate such partitions.
Case (i) Assume . We notice that, the mapping
establishes one to one correspondence between the following sets:
-
The set of all deviated partitions of with exactly parts and least part being greater than one.
-
The set of all deviated partitions of with exactly parts.
Case (ii) Assume . Let be a partition of with . We note that: if then . Consequently, is a deviated partition of when . It is not hard to see that enumeration of such partitions is . Whence the relation (2.16).
From the relation (2.16) one can have the following relation:
where satisfying the inequality were uniquely determined from the relation . From the above equality one can calculate the leading coefficient of to be for every . Since is a polynomial of degree for every , we get the estimate of as . This is what we wish to prove.
Theorem 2.5
We have
Proof
We define to be the number of partitions of with exactly parts and largest parts. We show that
Let be a partition of with exactly parts and largest parts. Now, we count such partitions.
Case (i) Assume . In this case, the mapping
establishes one to one correspondence between the following sets:
-
The set of all partitions of with parts, largest parts and least part being greater than 1.
-
The set of all partitions of with parts and largest parts.
We see that, the cardinality of the latter set is .
Case (ii) Assume . In this case, the mapping
establishes one to one correspondence between the following sets:
-
The set of all partitions of with parts, largest parts and least part being one.
-
The set of all partitions of with parts and largest parts.
Since cardinality of the latter set is , above recurrence relation follows.
In this proof, we are concerned with the case . We see that , and . Thus, one can get inductively that: is a quasi polynomial of degree with quasi period . We show that the leading coefficient of the polynomial is for every . By previous observation, the aforesaid assertion is true for .
Assume that, the assertion is true up to some . Let be the leading coefficient of for every . We notice that, the leading coefficient of is . By above recurrence relation, we have
where were determined uniquely from the relation with . By the induction assumption, the leading coefficient of each of the polynomial in the right side of the above equality is . Thus the leading coefficient of is . This gives .
Consequently, the estimate of is , as desired.
References
Bell, E.T.: Interpolated denumerants and Lambert series. Am. J. Math. 65, 382–386 (1943)
David Christopher, A., et al.: Relatively prime uniform partitions. Gen. Math. Notes 13(2), 1–12 (2012)
Nathanson, M.B.: Partition with parts in a finite set. Proc. Am. Math. Soc. 128, 1269–1273 (2000)
Netto, E.: Le hrbuch der Combinatorik. Teubner, Leipzig (1927)
Rødseth, O.J., Sellers, J.: Partition with parts in a finite set. Int. J. Numb. Theory 02, 455 (2006)
Polya, G., Szegö, G.: Aufgaben and Lehrsätze aus der analysis. Springer, Berlin (1925) Problems and Theorems in Analysis, Springer-Verlag, New York, English translation 1972
Sertöz, S., Özlük, A.: On the number of representations of an integer by a linear form. İstanbul Üniv. Fen Fak. Mat. Derg. 50(1991), 67–77 (1993)
Wright, E.M.: A simple proof of a known result in partitions. Am. Math. Monthly 68, 144–145 (1961)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ari Laptev.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Christopher, A.D., Christober, M.D. Estimates of five restricted partition functions that are quasi polynomials. Bull. Math. Sci. 5, 1–11 (2015). https://doi.org/10.1007/s13373-014-0053-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13373-014-0053-7