Some array polynomials over special monoid presentations
© Cevik et al.; licensee Springer 2013
Received: 2 December 2012
Accepted: 10 February 2013
Published: 28 February 2013
In a recent joint paper (Cevik et al. in Hacet. J. Math. Stat., acceptted), the authors have investigated the p-Cockcroft property (or, equivalently, efficiency) for a presentation, say , of the semi-direct product of a free abelian monoid rank two by a finite cyclic monoid. Moreover, they have presented sufficient conditions on a special case for to be minimal whilst it is inefficient. In this paper, by considering these results, we first show that the presentations of the form can actually be represented by characteristic polynomials. After that, some connections between representative characteristic polynomials and generating functions in terms of array polynomials over the presentation will be pointed out. Through indicated connections, the existence of an equivalence among each generating function in itself is claimed studied in this paper.
MSC:11B68, 11S40, 12D10, 20M05, 20M50, 26C05, 26C10.
1 Introduction and preliminaries
In a recently published joint paper , the authors computed algebraic relations in terms of Ramanujan-Eisenstein series. Furthermore, although there are so many similar studies about figuring out the relationship between algebraic relations (or algebraic structures) and special generating functions (cf., for instance, [2–5]; see also the references cited in each of them for other works) in the literature, we have not seen any such studies of relationship between (or monoid) presentations and generating functions. In fact, in terms of efficiency and inefficiency (while satisfying minimality) over group and monoid presentations, very important characterizations are given for related algebraic structures (see, for instance, [6–9]; see also the references cited in each of these earlier works). It is also well known that generating functions still attract much interest from all mathematicians and physicians (see, for instance, [3, 10] in addition to the above citations). Thus, it would be quite interesting for future studies to connect these two important areas and then search for possible properties about this linkage.
A similar connection exists between graphs and special functions since the number of vertex-colorings of a graph is given by a polynomial based on the number of used colors (see ). Based on this polynomial, one can define the chromatic number as the minimum number of colors such that the chromatic polynomial is positive. Recently, the paper  has come to our attention. It is a generalization on the chromatic polynomial of a graph subdivision, and basically the authors determine the chromatic number for a simple graph and then present a generalized polynomial for the particular case of graph subdivision. In this reference, the main idea was to express some graph theoretical parameters in terms of special functions. In a similar manner within algebra, by considering a group or a monoid presentation , an approximation from algebra to analysis has been recently developed . In this reference, the authors supposed that satisfies the special algebraic properties either efficiency or inefficiency while it is minimal. (The reason for choosing efficiency or (minimal) inefficiency was to have an advantage to work on a minimal number of generators.) Then it was investigated whether some generating functions can be applied, and then studied what kind of new properties can be obtained by considering special generating functions over . Since the results in  imply a new studying area for graphs in the meaning of representation of parameters by generating functions, the results in  will also give an opportunity to make a new classification of infinite groups and monoids by using generating functions.
There has been also some interest in equivalence relations among generating functions (see, for instance, [14, 15]). However in these studies, the authors were mainly interested in an equivalence relation that gives an opportunity to obtain generating functions one from another. In the literature, we have not seen any other paper that presents such a relation inside the related generating function. So, we believe that it is worth investigating whether there exist equivalence (or maybe congruence) relations among special generating functions depicted in here.
The ingredient of this paper should be thought of as not only computational but also theoretical. Hence it will be presented as three main parts including introduction. In Section 2, by reminding the results in , we will define characteristic polynomials related to the efficient and inefficient presentations, and then we will investigate the generating functions (in terms of array polynomials) over both these presentations and characteristic polynomials. In Section 3, we will provide some conclusions that will be studied as future projects.
2 Generators for the semi-direct product of free abelian monoids rank two by finite cyclic monoids
This main section will be given as three subsections under the names of Generating pictures (as Part I), Characteristic polynomials (as Part II) and Array polynomials (as Part III). In our study, we will consider a special presentation (see (2) below). Since we will define characteristic polynomials and generating functions by considering the exponent sums of the generating pictures over , the first subsection is aimed at presenting these generating pictures and the related results about them.
2.1 Part I: Generating pictures of
where , , and , respectively.
In the rest of this paper, we will assume that Equality (1) always holds when we talk about the semi-direct product E of by A.
Suppose that the positive integer d, defined in (1), is equal to a prime p such that . Then, in , the following result has been recently obtained.
Proposition 1 ()
Suppose that p is an odd prime. Then, in particular, in (4) is not efficient if is either equivalent to 0 or by modulo p. Therefore one of the consequences of Proposition 1 is the following.
Proposition 2 ()
2.2 Part II: Characteristic polynomials over
Let us reconsider the semi-direct product of by A with a presentation as defined in (2). Now it is well known that if one wants to define such a presentation , then it must satisfy condition (1). Therefore we certainly have -matrices ℳ, and , and so we can consider the related characteristic polynomials of these matrices.
Now let us think of (5) as a piece of the system of characteristic polynomials that are obtained from any -matrix. In fact, there are an infinite number of polynomials of the type (5) since one can find an infinite number of matrices having positive integer entries that satisfy condition (1). On the other hand, by the definition of finite monogenic monoids and semigroups (see ), for a fixed value of k, one can choose the value l from the set . It is clear that each of these systems in (5) will be constructed as a choice of l in this set, and so we will have times different systems of characteristic polynomials as in (5) such that each of them contains an infinite number of polynomials. The following proposition will be based on this fact.
Proposition 3 Each characteristic polynomial obtained from matrices, as in system (5), appears to be a congruence class.
Proof Before giving the proof, we note that this result can of course be adapted to matrices, which will not be needed in here.
The normal form theorem , NFT for short, basically says that each congruence class contains a unique reduced word. It is well known in the branch of combinatorial group theory that the idea of this theorem is the main point when one tries to define a presentation for the related algebraic structure. Therefore, since each presentation and has been obtained by considering NFT, the presentation in (2) must also satisfy NFT. (Although we reminded this theorem by considering only the words over free generators, the idea of NFT can actually be seen in ℚ as fractals or in matrix theory as echelon forms.)
For a fixed modulo d, let us think about the set, say , of all characteristic polynomials, written as in system (5), having the condition , where and . We note that the cardinality .
each of these l-classes contains the characteristic polynomials having eigenvalues , and (for ). On the other hand, by (6), can be taken as the simplest element (characteristic polynomial) having eigenvalues and in each l-class.
such that and .
Hence the result. □
As a next step of Proposition 3, the following result basically states that each semi-direct product presentation as in (2) which is obtained by condition (1) has a characteristic polynomial.
Theorem 1 The presentation in (2) is represented by a unique (up to equivalence) characteristic polynomial defined as in system (5).
can be chosen as a representative characteristic polynomial for the presentation in (2) since all these polynomials are in the same l-class. As a result, since is obtained by using both unique reduced words (according to NFT) and the matrix ℳ as the endomorphism , polynomial (8) represents this presentation uniquely as a characteristic polynomial. □
As a consequence of Theorem 1 and Proposition 1, we can give the following result which is a simpler version of Proposition 1 since the efficiency conditions can be expressed as a unique statement.
Theorem 2 For any prime p or 0, the presentation in (2) is p-Cockcroft if and only if , where are the eigenvalues of the -matrix ℳ.
Proof Now, by Theorem 1, it is known that in (2) has a characteristic polynomial as in (8) with a base -matrix ℳ. Let p be any prime or 0, and let be the eigenvalues of ℳ. Thus, we clearly have and . By Proposition 1, since the sufficiency part is clear, let us show the necessity of the proof.
which actually implies the truthfulness of the second part of (7).
since each characteristic polynomial in system (5) must be in the same l-class. From the above equivalence, we definitely get and since our assumption does not permit another equivalence option. Furthermore, by keeping in our mind these last equivalences, if we consider (9) again, then we can get and since again the assumption on the determinant is enforced to not get another equivalence option.
Notice that the above processes show that this unique assumption on the determinant of ℳ implies the remaining conditions of Proposition 1. Thus, as a next step of Proposition 1, we clearly get is p-Cockcroft (equivalently, efficient) for any prime p or 0. □
For an odd prime p, if we take , (), and , then we get while . Hence, we get an efficient presentation. However, for even prime, we can still get a semi-direct product presentation for the same matrix entries since . But the presentation will be inefficient.
- (ii)For any prime p and , again by taking
Similarly, for any prime p, by choosing either (), , and or , , and (), we can still obtain efficient presentations with the equivalence . Further, the representative characteristic polynomial for the related presentation is of the form .
The above examples can be extended for , where .
As another consequence of Theorem 1, we obtain the following result by considering Proposition 2.
Theorem 3 For an odd prime p, the presentation in (4) is minimal but inefficient if ℳ is a diagonal matrix and the representative characteristic polynomial is of the form which has a strict ordering between roots.
Proof Let ℳ be a diagonal matrix. For an odd prime p, let be the representative characteristic polynomial for . Clearly, the roots 1 and will be the eigenvalues and of ℳ. Then, by (8), we have and . By Proposition 2, this determinant value implies that is inefficient. Notice that since in (4) is a semi-direct product presentation, must be held. Therefore we have . So, by Proposition 3, the polynomial with roots and is in the same congruence class as the simplest characteristic polynomial . In addition, by the assumption, the entries of ℳ should be either , or vice versa . Then, again by Proposition 2, is minimal, as required. □
Example 2 Let and with determinant 2. Thus holds, and the relators of the semi-direct product presentation, as in (4), will be , , and . By Theorem 3, the simplest (unique) characteristic polynomial represents this inefficient but minimal presentation. A similar example can also be obtained by considering the matrix .
2.3 Part III: Array polynomials over
In this section, we are mainly interested in the generating functions (in terms of array polynomials) related to the presentations defined in (2) and (4). In [13, 19], by considering the generating pictures in two different group and monoid extensions, the authors have investigated the related generating functions over the presentations of them. However, in a different manner, here we will investigate the array polynomials (as generating functions) in the meaning of characteristic polynomials obtained in the previous section. In other words, by taking into account Proposition 3 and Theorems 1, 2 and 3, we will reach our aim using semi-direct products of monoids studied in this paper.
As noted in [, Remark 1.1], if a monoid presentation satisfies efficiency or inefficiency (while it is minimal), then it always contains a minimal number of generators. Working with a minimal number of elements gives a great opportunity to define related generating functions over this presentation. This will be one of the key points in our results.
Therefore we have the following theorem.
where and are defined as in (11), ’s are the entries of ℳ and ,.
where x is the unique generator of A. In this relator, by replacing x by an array polynomial and also considering the status modulo d, we can get as a generating function. Basically, the function must exist in all such sets that contain generating functions of the presentation in (2).
have been obtained by the meaning of endomorphism on the base matrix ℳ, it is clearly seen that while the first row of ℳ gives the above first composite relator, the second row gives the second one. Thus, by replacing by the array polynomial and by the array polynomial into the above relators, we get the required functions. Notice that although in monoids we are not allowed to apply the inverse element , by the meaning of functions, we can use this inverse element as a fractal of the form .
Notice also that in the light of the above material, for the relator , the generating function will only be the zero function. □
Nevertheless, by considering Theorem 1 and Equation (8), we can also get the following result.
where ν represents three-ordered variables and , are the eigenvalues of ℳ.
Proof Since, by Theorem 1, the presentation can be represented by a unique characteristic polynomial as in (8), the function obtained from this polynomial should be the unique generating function. However, since this unique function must represent the whole presentation, it should be constructed by all generators of . In other words, the required function should be defined as multi-variable . Hence, by replacing variables by array polynomials as previously, we can get the generating function as given in (12). □
By considering Proposition 1, Theorem 2 and Theorem 4, respectively, we further obtain the following corollary.
as a generating function including the functions defined in Theorem 4, where is defined as in (11) and , are the eigenvalues of ℳ.
Proof By Theorem 4, we have the generating functions and (). However, since is given as an efficient presentation, we also need to add a function related to its efficiency. At this stage, we can think about Theorem 2 which basically says that is efficient if . Moreover, this condition is directly related to the generator x in (cf. [, Theorem 2.4]). Therefore this last generating function should be of the form , as required. □
The following corollary is a consequence of Theorem 5 which states that the expression of Theorem 6 can also be given as a single condition.
Corollary 1 Suppose in (2) is an efficient presentation. Then it accepts as a generating function, where ν represents three-ordered variables and , are the eigenvalues of ℳ.
The sketch of proof Since the efficiency of a presentation implies for any prime p or 0, we can take in (12) because, by NFT, the simplest (reduced) form represents all other generating functions . Thus, depending on the constants, the function in the result can be thought to be in the congruence class of all such functions. □
Remark 1 From Corollary 1 and by considering Theorem 1, we can easily deduce that the set of generating functions for an efficient presentation can be presented as a single element. This actually shows the importance of efficiency during the study of generating functions.
In Proposition 2 and also in Theorem 3, we expressed the minimality (while satisfying inefficiency) of the presentation in (4) in two different versions, respectively. As a next step of Theorem 6 and as a consequence of Theorem 4, we will deal with the array polynomials which are obtained from a minimal but inefficient presentation. The following lemma will be needed in the proof of our next result.
Lemma 1 There always exists for any prime p.
Proof We first note that the lemma is clear for . So, let us assume that p is an odd prime.
In this sum, each term except the last one, which is 1, is congruent to 0 by modulo p since each of them contains p as a factor. Thus, cannot be congruent to 0 by modulo p unless we add −1 to both sides of this congruence. Therefore , as required. □
where and are defined as in (11).
Proof Let p be an odd prime. We first need to show that in the theorem actually presents a semi-direct product of a free abelian monoid rank two by a finite cyclic monoid as defined in (2). To do that, we just have to ensure that Equation (1) holds.
which implies that actually presents the required semi-direct product. Hence, as indicated in the proof of Theorem 6, we have the generating functions and for (by Theorem 4).
However, again as in the proof of Theorem 6, we need to find a new function (array polynomial) which is related to the minimality (having inefficiency) status of . To do that, we will take into account the same way which was obtaining the function in Theorem 6. From Proposition 1, we know that any semi-direct product presentation is not efficient if the determinant of the base matrix ℳ is equivalent to 0 or by modulo p, and also by Proposition 2, this presentation is minimal (whilst it is efficient) if the prime p is odd and the entries of the main diagonal are and 1 (or vice versa) in the diagonal matrix. It is clear that all these situations are suitable for our case in this proof. Therefore, since we have , there must exist as a generating function.
Hence the result. □
By Theorem 5, one can express Theorem 7 as in the following corollary. In fact, this result is the minimality version of Corollary 1. We will again omit the proof since it is quite clear by taking and in (12).
Corollary 2 Let us consider the minimal but inefficient presentation in Theorem 7. Then it accepts as a generating function, where ν represents three-ordered variables .
Similarly to Corollary 1, the function in the above corollary can be taken as the simplest (reduced) form being in the same congruence class as all other generating functions that represent this minimal presentation.
Remark 2 From Corollary 2 and by considering Theorem 1, we can easily deduce that the set of generating functions for a minimal but inefficient presentation can be presented as a single element. Therefore, as pointed out in Remark 1, this shows the importance of minimality (even holding inefficiency) in the meaning of the study of generating functions.
As a result of Theorem 5 and Corollaries 1, 2, we can state that array polynomials obtained in this paper are congruent to each other and so they construct congruence classes. Since these results are based on the characteristic polynomials, the proof of the following main theorem of this paper can be seen quite similar to the proofs of Proposition 3 and Theorem 1.
Theorem 8 Each array polynomial obtained from the presentation in (2) appears to be a congruence class. Moreover, this presentation is represented by a single type of array polynomials depending on this congruence. This single type may contain a unique congruence class of array polynomials in the case of efficiency or minimality status of .
In this part of the paper, we will discuss some problems which can be thought of as conjectures or conclusions and so can be studied in the future projects.
for an -matrix ℳ, then this would cover a more general situation.
The equivalence indicated in Conjecture 2 can probably be obtained by the following idea. Let us think about the generating functions defined in Theorem 4 as of the elements of a topological space and, similarly, the generating functions defined in Theorem 5 as of the elements of a topological space . Then, by investigating the homotopy equivalence between and , we can check the existence of required equivalence.
Another outcome of this paper can be seen in Remarks 1 and 2. It is understood that to study efficient or minimal presentations (and so with the minimal number of generators) implies the minimal number of generating functions. In addition to the material given in the above paragraph, one can also investigate whether the set, say B, of this minimal number of generating functions can be a generating set of this type of functions. Mathematically, we can study whether there exists an equality , where each represents the set of generating functions obtained from the related presentation.
After all the above discussions, as a general case, one may ask whether the equivalence of constants of generating functions implies the equivalence of generating functions directly.
Dedicated to Professor Hari M Srivastava.
The first, third and fourth authors are partially supported by Research Project Offices of Selcuk (13701071), Uludag (2012-15 and 2012-19) and Akdeniz Universities, respectively. Also the second author is supported by Sungkyunkwan University BK21 Project, BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea.
- Elsner C, Shiokawa I: On algebraic relations for Ramanujan’s functions. Ramanujan J. 2012, 29: 273–294. 10.1007/s11139-012-9384-8MATHMathSciNetView ArticleGoogle Scholar
- Simsek Y, Kim T, Park DW, Ro YS, Jang LJ, Rim SH: An explicit formula for the multiple Frobenius-Euler numbers and polynomials. JP J. Algebra Number Theory Appl. 2004, 4: 519–529.MATHMathSciNetGoogle Scholar
- Srivastava HM, Coi J: Series Associated with the Zeta and Related Functions. Kluwer Academic, Dordrecht; 2001.MATHView ArticleGoogle Scholar
- Srivastava HM: Some generalizations and basic (or q -) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inf. Sci. 2011, 5: 390–444.MathSciNetGoogle Scholar
- Woodcock CF: Convolutions on the ring of p -adic integers. J. Lond. Math. Soc. 1979, 20(2):101–108.MATHMathSciNetView ArticleGoogle Scholar
- Ateş F, Cevik AS: The p -Cockcroft property of central extensions of groups II. Monatshefte Math. 2007, 150: 181–191. 10.1007/s00605-006-0435-3MATHView ArticleGoogle Scholar
- Cevik AS: The p -Cockcroft property of the semi-direct products of monoids. Int. J. Algebra Comput. 2003, 13(1):1–16. 10.1142/S0218196703001298MATHMathSciNetView ArticleGoogle Scholar
- Cevik AS: Minimal but inefficient presentations of the semi-direct products of some monoids. Semigroup Forum 2003, 66: 1–17.MATHMathSciNetView ArticleGoogle Scholar
- Cevik, AS, Das, KC, Cangul, IN, Maden, AD: Minimality over free monoid presentations. Hacet. J. Math. Stat. (acceptted)Google Scholar
- Shiratani K, Yokoyama S: An application of p -adic convolutions. Mem. Fac. Sci., Kyushu Univ., Ser. A, Math. 1982, 36(1):73–83.MATHMathSciNetGoogle Scholar
- Birkhoff GD, Lewis D: Chromatic polynomials. Trans. Am. Math. Soc. 1946, 60: 355–451.MATHMathSciNetView ArticleGoogle Scholar
- Cardoso DM, Silva ME, Szymanski J: A generalization of chromatic polynomial of a graph subdivision. J. Math. Sci. 2012, 182(2):246–254. 10.1007/s10958-012-0745-zMATHMathSciNetView ArticleGoogle Scholar
- Cangul IN, Cevik AS, Simsek Y: A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions. Bound. Value Probl. 2013., 2013: Article ID 51. doi:10.1186/1687–2770–2013–51Google Scholar
- Remmel J, Riehl M: Generating functions for permutations which contain a given descent set. Electron. J. Combin. 2010., 17(1): Article ID R27Google Scholar
- Srivastava HM: An equivalence theorem on generating functions. Proc. Am. Math. Soc. 1975, 52(1):159–165. 10.1090/S0002-9939-1975-0379931-2MATHView ArticleGoogle Scholar
- Ivanov SV: Relation modules and relation bimodules of groups, semigroups and associative algebras. Int. J. Algebra Comput. 1991, 1: 89–114. 10.1142/S0218196791000055MATHView ArticleGoogle Scholar
- Clifford AH, Preston GB: The Algebraic Theory of Semigroups. Volumes I and II. 2nd edition. Am. Math. Soc., Providence; 1964.Google Scholar
- Cohen DE London Mathematical Society Student Texts 14. In Combinatorial Group Theory: A Topological Approach. Cambridge University Press, Cambridge; 1989.View ArticleGoogle Scholar
- Cangul IN, Cevik AS, Simsek Y: Analysis approach to finite monoids. Fixed Point Theory Appl. 2013., 2013: Article ID 15. doi:10.1186/1687–1812–2013–15Google Scholar
- Chang CH, Ha CW: A multiplication theorem for the Lerch zeta function and explicit representations of the Bernoulli and Euler polynomials. J. Math. Anal. Appl. 2006, 315: 758–767. 10.1016/j.jmaa.2005.08.013MATHMathSciNetView ArticleGoogle Scholar
- Simsek, Y: Generating functions for generalized Stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. arXiv:1111.3848v2 [math.NT] 23 Nov 2011Google Scholar
- Simsek Y: Interpolation function of generalized q -Bernstein type polynomials and their application. LNCS 6920. In Curve and Surface. Springer, Berlin; 2011:647–662.Google Scholar
- Mismar MJ, Abu-Al-Nadi DI, Ismail TH: Pattern synthesis with phase-only control using array polynomial technique. In: 2007 IEEE International Conference on Signal Processing and Communications (ICSPC 2007), Dubai, UAE, 24-27 November 2007 (2007)Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.