Abstract
For a minimal group (or monoid) presentation , let us suppose that satisfies the algebraic property of either being efficient or inefficient. Then one can investigate whether some generating functions can be applied to it and study what kind of new properties can be obtained by considering special generating functions. To establish that, we will use the presentations of infinite group and monoid examples, namely the split extensions and , respectively. This study will give an opportunity to make a new classification of infinite groups and monoids by using generating functions.
MSC: 11B68, 11S40, 12D10, 20M05, 20M50, 26C05, 26C10.
Keywords:
efficiency; pCockcroft property; split extension; generating functions; Stirling numbers; array polynomials1 Introduction and preliminaries
In the literature, although there are so many studies about figuring out the relationship between rings (or fields) and special generating functions (cf., for instance, [14]), there are no such studies about the relationship between group (or monoid) presentations and generating functions. In fact, the studies on the efficient and inefficient (but minimal) group and monoid presentations gave very important characterisations for groups and monoids in the branch of combinatorial group theory of mathematics (see, for instance, [512]). It is known that generating functions are still interesting for many mathematicians and physicians (see, for instance, [2,13,14] in addition to above). Thus, it would be quite interesting for future studies to connect these two important areas and then search for possible properties.
In the light of this thought, in this paper, a connection between special (efficient and inefficient) presentations defined on infinite groups (and monoids) and some generating functions related to the special polynomials and numbers will be investigated. (These special polynomials are chosen by their integer coefficients. Of course, one can choose some other polynomials used in this paper.) Another aim of this paper is to try to make a classification of infinite groups and monoids.
This paper is divided into four sections. Main results are presented specially in Sections 2 and 3. In the remaining parts of this section, we will present some fundamental material related to the group or monoid presentations that will be needed in later sections of this paper.
A group (or a monoid) presentation
is a pair where x is a set (generating symbols) and r is a set of nonempty, cyclically reduced words (relators) on x. In monoids, each is actually an ordered pair , where and are distinct, positive (one of them could be empty) words on x. We say that is finite if x and r are both finite. Further, all results in this paper are related to split extensions and their presentations. In [15], a split extension is also named a semidirect product and detailed properties of this product can be found in elementary algebra textbooks. Here, we will just remind the presentation of a semidirect product of arbitrary groups (or monoids). Therefore, for arbitrary groups (or monoids) A and K with presentations and , the presentation of the group (or monoid) is defined by
where t is the set of relators of the form
for all and (cf.[8,9]). We remind that the homomorphism θ is defined from A to for the semidirect product of groups, while it is defined from A to for the product of monoids. Further, is an isomorphism of the group K and a homomorphism in a monoid case.
In the next two subsections, we will give some other preliminary material that will be needed for the construction of the results in this paper by considering the presentation in (1).
1.1 Efficiency
The subject under this title will be given over a group G with a presentation as defined in (1). But we should note that the following material will be completely the same if the group G is replaced by a monoid M.
For the presentation , the Euler characteristic is defined by . By [1618], there exists a lower bound which is equal to with the condition , where denotes the ℤrank of the torsionfree part and denotes the minimal number of generators. Depending on these numbers, we define
Therefore a presentation is called minimal if for all presentations of G, or is called efficient if . Moreover, G is called efficient if . In [7,8], Cevik recalled known results for efficiency of groups and monoids. (We should remark that some authors also consider and call this the deficiency of the presentation .)
Remark 1 In both group and monoid cases, if the presentation in (1) is efficient or inefficient while it is minimal, then it always has a minimal number of generators. So, this fact affects positively the use of generating functions for this type of presentations since we have a great advantage to work with quite a limited number of variables in such a generating function.
1.2 Pictures
There exists a geometric method called spherical group (or monoid) pictures related to the presentation given in (1). This method was constructed and first used by Pride [6,1720] for both groups and monoids, and since then it has still been in use for the solution of many important combinatorial problems such as word problems (cf.[21,22]). Here, we will recall a brief description of pictures for groups and monoids in separate cases. Before that, we express the following remark.
Remark 2 Similarly to (undirected) graphs, this geometric configuration has a large application area, especially in engineering sciences. For example, the plan of electrical network for a city or the behaviour of DNA molecules in a human body can be figured out with pictures (see Figures 1, 2 and 3).
Figure 1. Generating pictures ofas given in (6).
Figure 2. The single generating picture ofgiven in (9).
Figure 3. The single generating picture ofin (12).
Pictures for groups: As we depicted in Remark 2, a group picture ℙ over is a geometric configuration consisting of the following:
• A disc with a basepoint O on the boundary of .
• Disjoint discs in the interior of . Each has a basepoint on the boundary of .
• A finite number of disjoint arcs , where each arc lies in the closure of and is either a simple closed curve having trivial intersection with , or is a simple nonclosed curve which joins two points of , neither point being a basepoint. Each arc has a normal orientation indicated by a short arrow meeting with the arc transversely and is labelled by an element of which is called the label of the arc.
• If we travel around once in the clockwise direction starting from and read off the labels on arcs encountered (if we cross an arc, labelled x say, in the direction of its normal orientation, then we read x, whereas if we cross the arc in the direction of its opposite orientation, then we read ), then we obtain a word which belongs to . We call this word the label of . If s is a subset of r, then a disc labelled by an element of is called an sdisc.
When we refer to the discs of ℙ, we in fact mean the discs , and not the ambient disc . A closed arc which encircles neither a disc nor an arc of ℙ is called a floating circle. We define to be . The label on ℙ (denoted by ) is the word read off by travelling around once in the clockwise direction starting from O. (In fact, this fact on pictures implies the fundamentals of solving the word problem [21,22].)
Further, ℙ is called spherical if no arcs meet (i.e. if ℙ is spherical, then is omitted). A transverse pathγ in a picture ℙ is a path in the closure of which intersects the arcs of ℙ only finitely many times. Reading off the labels on the arcs encountered while travelling along a transverse path from its initial point to its terminal point gives a word on x denoted by . Let γ be a simple closed transverse path in ℙ. The part of ℙ enclosed by γ is called a subpicture of ℙ. If γ intersects no arcs, then the part of ℙ enclosed by γ is called a spherical subpicture of ℙ. A cancelling pair in ℙ is a spherical subpicture with exactly two discs whose basepoints lie in the same region.
A spray for ℙ is a sequence of simple transverse paths satisfying the following: for , starts at O and ends at the basepoint of , for , and intersect only at O; travelling around O clockwise in ℙ, we encounter these transverse paths , respectively.
There are some elementary operations (deletion and insertion of a floating circle, deletion and insertion of a cancelling pair, bridge move) on spherical pictures. Then two spherical pictures are called equivalent if one can be obtained from the other by a finite number of above operations. These operations imply an equivalence relation and the equivalence class containing ℙ which is denoted by . The set of all equivalence classes of spherical pictures over forms an abelian group. In addition, for a word W on x, a new spherical picture over denoted by can also be obtained from W by surrounding ℙ with a collection of concentric arcs with total label W. Hence, there is a welldefined action on equivalence classes of spherical pictures given by (where ). We then obtain a module called the second homotopy module of . Let X be a set of spherical pictures. Then we say that X generates (or X is a set of generating pictures) if the elements (where ) generate .
For any picture ℙ over and for any , the exponent sum of R in ℙ, denoted by , is the number of discs of ℙ labelled by R minus the number of discs labelled by . We remind that if pictures and are equivalent, then for all . Depending on the exponent sum, we have the following definition.
Definition 1 For a nonnegative integer n, is said to be nCockcroft if (where congruence is taken to be equality) for all and for all spherical pictures ℙ over . Moreover, a group G is said to be nCockcroft if it admits an nCockcroft presentation.
Actually, to verify that the nCockcroft property holds, it is enough to check it only for pictures , where X is a set of generating pictures. Also, the 0Cockcroft property is usually just called Cockcroft, and in practice, n is taken as a prime p or 0. By [16,19], the presentation is efficient if and only if it is pCockcroft for some prime p. So, this connection between efficiency and pCockcroft property will be one of the main ideas during the construction of this paper.
There is an embedding μ of into the free module defined as follows (see [6,19]): Let and suppose that ℙ has discs with the labels , respectively (, , ). Let be a spray defined previously. Then
For simplicity, the notation will be preferred instead of . For each spherical picture ℙ over and for each , let be the coefficients of in . Let be the twosided ideal in generated by the set . This ideal is called the second Fox ideal of . The concept of Fox ideals has been discussed in [23]. In fact, we need this concept for our studies in this paper as our main goal in this paper is to establish a relationship between generating functions and presentations. For the group case in Section 2, the generating functions will be labelled by defined in (3).
Pictures for monoids. As we pointed out in the beginning of this section, some of the following material may also be found in [11,17,18,20]. For a monoid M, let be a monoid presentation as in (1); and let be a free monoid on x. If we have an element (where , , ) of , then we can replace by to get a word . This can be represented by a geometric object called an atomic (monoid) picture as depicted in Figure 4.
Figure 4. An atomic monoid picture.
We remark that the disc labelled by S in an atomic picture is said to be positive if and is said to be negative if .
We have a graph Γ () associated with , called the Squier graph, which is defined as follows: The vertex set is , and the edge set is the collection of all atomic monoid pictures. For an orientation of Γ, we will take all edges . For an atomic picture , as in Figure 4, the word we read off by travelling along the top of the atomic picture from left to right gives the initial function, denoted by , and the word we read off by travelling along the bottom gives the terminal function, denoted by . Also, the mirror image of is denoted by . A path (where each is an atomic picture for ) in Γ will also be called a monoid picture over . If , then ℙ is called a spherical monoid picture over . Note that we also have the term subpicture of monoid pictures.
There is a left action of on Γ defined as follows. Let .
(i) Let W be a vertex of Γ. Then we define CWto be (product in ).
(ii) Let , as in Figure 4, be an edge of Γ. Then .
We can define a similar right action of on Γ. The left and right actions of on Γ extend to actions on pictures. That is, if ℙ is a picture and , then .
For atomic monoid pictures and , one can introduce some operations (deletion and insertion of inverse pairs of atomic pictures and a replacement operation (cf.[17,18])) on spherical monoid pictures. These operations imply an equivalence relation on paths. Therefore the graph Γ with this equivalence relation on paths is called the Squier complex of denoted by . Let Y be a set of spherical monoid pictures. Two spherical monoid pictures will be said to be equivalent (relative toY) if one can be transformed into the other by a finite number of above operations. By [20], the set Y is called a trivializer of if every spherical picture is equivalent to an empty picture (relative to Y). Some examples and the details of the trivializer can be found, for instance, in [11,12]. Similarly as in the group case, for any monoid picture ℙ over and for any , the exponent sum of S in ℙ is the number of positive discs labelled by S minus the number of negative discs labelled by S. Then the monoid version of Definition 1 can be obtained in completely the same way by replacing the term group with monoid. To verify that the nCockcroft (in fact n is taken as a prime p or 0) property holds, it is enough to check it for pictures , where Y is a trivializer of .
Let M be a monoid with the presentation as in (1). Let
be a free left module with basis . For an atomic picture with , , , we define , where as in Figure 4. For any spherical monoid picture ℙ, we define
Let be the coefficient of in . So, we can write
Let be the twosided ideal of generated by the elements , where ℙ is a spherical monoid picture and . Then this ideal is called the second Fox ideal of . More specifically, for a trivializer Y of , the set is generated (as twosided ideal) by the elements , where and . We note that all this above material given with the consideration ‘left’ can also be applied to ‘right’ for a monoid M.
In Section 3, the generating functions will be connected to the part in (4) or, equivalently, to the in (5).
2 The group case
Let us consider the split extension , where is the a group with rank one, is a cyclic group of order n and is a homomorphism. Then, by (2), G has the presentation
where , and . In [[24], Theorem 3.2.1], the generating set of the second homotopy module has been constructed as drawn in Figure 1. In this generating set, there are two spherical pictures and . In , we have two discs (one of them is positive and the other is negative), and in we have a negative disc and ktimes positive discs. Furthermore, again in , there is a total of ntimes discs. Then, by considering the number of discs in these pictures, Baik [[24], Theorem 3.3.3] proved the following result.
Proposition 1The presentationin (6) is efficient (equivalently, pCockcroft for any primep) if and only if.
Therefore, if we suppose , then we obtain an inefficient presentation. Clearly, n must be an odd prime and the given in (6) be an inefficient presentation. Otherwise, by setting in this inefficient case, we obtain the direct product which is a special case of the semidirect products and will not be considered in this paper. By Remark 1, it is always true that efficient presentations (even for groups or monoids) are minimal. But to check the minimality of a presentation while it is inefficient is important, because in this case we obtain the inefficiency of the related group that has this presentation (see [810]). For the group case, this important subject is investigated by the following ‘minimality test’ due to Lustig [23].
Lemma 1 ([23])
For any groupGwith a presentationas in (1), suppose there is a ring homomorphismψfrominto the matrix ring of allmatrices () over some commutative ring ℛ with 1. Suppose also that. Ifψmaps the second Fox idealto 0 (in other words, ifis contained in the kernel ofψ), thenis minimal.
By considering Proposition 1, the first main result of this paper is presented as follows.
Theorem 1Let us consider the presentationas in (6) for the group, whereandbut. Thenhas a set of generating functions
wheredenotes thenth cyclotomic polynomial over ℚ defined by
Proof We first note that since is presented as in (6), the action in is defined by , where and .
Assume that . Then, by Proposition 1, is an efficient presentation and so, by Remark 1, is minimal (i.e. has a minimal number of generators). Let us consider the pictures and in Figure 1. Now, by (3), we have
where , but and . For simplicity, by omitting the overlines on the elements in the above equalities, we obtain that the second Fox ideal is generated by the polynomial elements , and . Now, we can reformulate these polynomial elements as generating functions. It is clear that has the root . On the other hand, since we have
has a root t, where t is the multiplicative inverse of k.
Finally, has a root modulo n which gives (7) directly. □
Let us take n as an odd prime p. Then, by Proposition 1 and Lemma 1, we get an inefficient but minimal presentation. Thus we have the following corollary.
Corollary 1For an odd primepand a positive integer, the presentationin (6) has a set of generating functions
wherehas a degree of an even number.
Remark 3 Theorem 1 and Corollary 1 imply that by choosing the efficient or inefficient minimal presentations, we can get different constants (i.e. the cases of k in both results) and different powers (i.e.n to be a positive integer or an odd prime) in the set of generating functions. Therefore, the structure of the presentation (i.e. efficient or inefficient) affects getting different types of generating functions.
The following consequence of Theorem 1 points out another connection between the presentation in (6) as defined in either Theorem 1 or Corollary 1 and generating functions.
Corollary 2The polynomialin Theorem 1 (or Corollary 1) is actually a ‘locally constant function’.
Proof We recall that the family of locally constant functions [14] is defined as
for which holds. Moreover, in the meaning of group homomorphisms, each function in this family satisfies
it is clear that we get a locally constant function, as required. □
After Theorem 1, Corollary 1 and Corollary 2, we can express the following connection between the generating functions and (twisted) Bernoulli numbers.
Remark 4 The locally constant function corresponding to the generating function of the presentation given in (6) is related to the twisted Bernoulli numbers and polynomials. (We may refer the reader, for example, to [3,14,25,26] for the twisted Bernoulli numbers and polynomials.) In the next paragraph, we give a brief description.
According to [4,13,14], for each integer , denotes the multiplicative group of the primitive th roots of unity in . Let
The dual of in the sense of padic Pontryagin duality is , the direct limit (under inclusion) of cyclic groups of order with , with discrete topology. The admits a natural module structure which is written as for and . Moreover, can be embedded discretely in as the multiplicative ptorsion subgroup. If , then , , is a locally constant character which is actually a locally analytic character if . Then, by [4,13,14,27,28], has a continuation to a continuous group homomorphism from to . We further remind that if , then ξ will be assumed to have an rth root of unity with .
3 The monoid case
Before presenting this special case, let us first discuss a more general situation for the pCockcroft property of semidirect products of monoids. In [8,9], by considering a similar version of the picture in Figure 2, the second author investigated the pCockcroft property by using the trivializer for the semidirect product , where K and A are arbitrary monoids. (It is seen that there is a single nonspherical subpicture in . In fact, contains only Sdiscs. For an illustration, see Figure 3.) As a special case of it, let us assume that K is a onerelator monoid and A is an infinite cyclic monoid ℤ with presentations
respectively. Suppose ψ is an endomorphism of K. Then the mapping induces a homomorphism , and we can form the semidirect product . By (2), this product has a presentation
where, for all , the set t is the set of relators
such that the relator S satisfies the condition (or ). In [8], the necessary and sufficient conditions for to be efficient are determined.
In the special case above, let us take K as a free abelian monoid of rank two (i.e.) presented by , and let ψ be the endomorphism , where M is the matrix () given by and . As a special case of the presentation in (9), we obtain
for the monoid (see [9]). Again, in the same reference, the second author figured out the efficiency of the above presentation as in the following proposition.
Proposition 2 ([9])
For any primep, the presentationin (10) ispCockcroft if and only if.
According to Proposition 2, in particular, is not efficient if or 2. Therefore the following proposition is proved in the same manner.
Proposition 3 ([9])
The presentationin (10) is minimal but inefficient if.
The proof of Proposition 3 is based on the following Pride result, which is a monoid version of Lemma 1. Although this result has not been published yet, it has been used in many papers (see, for instance, [810]).
Lemma 2 (Pride)
For any monoidMwith a presentationas in (1), letψbe a ring homomorphism frominto the ring of allmatrices () over some commutative ring ℛ with 1, and suppose. If the second Fox idealis contained in the kernel ofψ, thenis minimal.
From now on, by considering Propositions 2 and 3, we will reach our main aim of this paper for monoids.
Our first result in this section gives the connection between a monoid presentation and array polynomials. In fact the array polynomials are defined by means of the following generating function:
(cf.[2931]). According to the same references, array polynomials can also be defined in the form
Since the coefficients of array polynomials are integers, these polynomials find a very large application area, especially in engineering. Array polynomials are used, for instance, in system control (cf.[32]).
In fact these integer coefficients give us an opportunity to use these polynomials in our case. We should note that there also exist some other polynomials, namely Dickson, Bell, Abel, MittagLeffler etc., which have integer coefficients. But, since array polynomials have a larger application area in science, we have preferred them. Hence, by considering Proposition 3, we obtain the following theorem as another main result.
Theorem 2Let us consider the monoidwith a presentation
Thenhas a set of generating functions
Proof Let us consider the spherical picture with its nonspherical subpicture as drawn in Figure 3. In fact, by [9], this is the only picture in the trivializer of .
In presentation (12), let us label the relators , and by S, and , respectively. It is clear that , and . In the calculation of these exponent sums, we included the exponent sums of Sdiscs in the nonspherical picture . Actually, a simple calculation shows that and so, by our assumption about that is not efficient, we expect to be 2.
Now, by (4) and (5), the evaluation of is determined as follows:
Therefore, by the definition, the second Fox ideal of the presentation in (12) is generated by the polynomial elements
For simplicity, let us replace each of , and by 2a, and , respectively. In [9], by considering Lemma 2, it has been showed that this presentation in (12) is minimal.
Now, by using (11) and keeping in our mind that the coefficients of array polynomials are integer, we clearly have
Then, by reformulating the elements of the second Fox ideal , we arrive at the functions in (13) as desired. □
By considering Proposition 2, if we take , then we get an efficient presentation. So, for an even prime p, let . Then one of the presentations of the similar form as in (12) can be taken as
which will be efficient. The same procedure in the proof of Theorem 2 gives us the set of generating functions of in (14) in the form , and , where and the others are defined in (13) such that is given in (11). Nevertheless, by induction steps, we can generalise this last presentation as follows:
Hence we get the following version of Theorem 2 which deals with efficient presentations.
Theorem 3Let us consider the presentationin (15) for the monoid. Thenhas a set of generating functions
whereandis defined as in (11).
Remark 5 According to the expression in Remark 1, presentations given in (12), (14) or (15) have a minimal number of generators. But we classified these presentations according to their efficiency status separately in Theorem 2 and Theorem 3. The aim of this separation is to find a solution for a general remark depicted in the final section about obtaining a method for a minimality test by using generating functions (see Section 4 below).
At this point, we should note that for , , , generalised array type polynomials which are related to the nonnegative real parameters have been recently developed and some elementary properties including recurrence relations of these polynomials have been obtained [30]. In fact, by setting and , the equation (11) is obtained.
Remark 6 One can try to study the generalisation of Theorem 2 by using .
The remaining goal of this section is to establish a connection between the presentation in (12) or (15) and Stirling numbers of the second kind (cf.[3,30,3336]). In fact, Stirling numbers of the second kind are defined by means of the following generating function:
(see [3,36]). According to [[30], Theorem 1, Remark 2], Stirling numbers can also be defined by
We remind that these numbers satisfy the wellknown properties
where denotes the Kronecker symbol (see [3,36]). It is known that Stirling numbers are used in combinatorics, in number theory, in discrete probability distributions for finding higherorder moments, etc. We finally note that since is the number of ways to partition a set of n objects into k groups, these numbers find an application area in combinatorics and in the theory of partitions.
In addition to the above formulas for , by [30,35,36], we have
as a formula for Stirling numbers. Therefore, in equation (17) by replacing x with a, and , respectively, and taking , , the polynomial elements of the second Fox ideal of the presentation in (12) can be restated as follows:
As a different version of Theorem 2, we express the following corollary.
Corollary 3The presentationin (12) has a set of generating functions in terms of Stirling numbers as given in (18).
We note that the above corollary can also be stated for the presentation in (15).
Furthermore, in a recent work, Simsek [30] has constructed the generalisedλStirling numbers of the second kind related to nonnegative real parameters (, , λ is a complex number and ). In fact, this new generalisation is defined by the generating function
By setting and in (19), one can obtain the λStirling numbers of the second kind which are defined by the generating function
(see [3,36]). By substituting into the above equation, the Stirling numbers of the second kind are obtained.
By considering this new generalisation , in [[30], Theorem 1], it has been obtained that
for λStirling numbers of the second kind. In fact, by setting and in (20), one can get the following equality on λStirling numbers:
Hence we can present the following notes about this section:
Remark 7 It is clearly seen that in Theorems 2, 3 and Corollary 3, only Stirling numbers are considered. However, one can also study the λStirling numbers defined in (21) and generalised λStirling numbers defined in (20) as stated in these theorems and corollaries.
Remark 8 For a suitable matrix, it is possible to define the presentation in (9) (or in (10)) for the monoid . Thus one can try to transform all studies in Section 3 to this general case.
4 Final remarks
In this section we will express some other remarks depicted in the previous sections. We hope that the following material will be used as new study areas:
– The first general note would be as follows. The studies here can be thought of as the initial step of a general idea, namely constructing a new method (or a test) for the minimality (while the inefficiency holds) of group (in Section 2) and monoid (in Section 3) presentations other than the methods presented in Lemma 1 and Lemma 2, respectively. Especially for the monoid case, although Lemma 2 has not been published, the theory of it has been used widely in last ten years. Therefore, by using generating functions, to obtain a new test on the minimality of monoids would be an interesting and important result.
– As we noted in Remark 1, to study with the minimal presentations has an advantage for our aim in this paper. Conversely, the use of generating functions to obtain a presentation with a minimal number of generators is still an open question.
– Until now, any result to check whether a semigroup presentation is minimal while it is inefficient has not been published. Therefore the whole idea of this paper can also be used for this case.
– It is known that the chemical energy is one of most important application areas of graph theory (cf.[37]). So, as a next step of the expressions in Remark 2, it is worth studying whether this chemical energy can also be obtained from pictures.
– We believe that the same approximation between presentations and generating functions as done in this paper can also be applied to some other special cases of groups and monoids other than and . Moreover, one can investigate which type of polynomials (other than depicted in here) can be used for the general case.
– Here we used exponent sums of pictures as a method to obtain constants of functions. What other methods other than this geometric way can be used could be studied.
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors completed the paper together. All authors read and approved the final manuscript.
Acknowledgements
Dedicated to Professor Hari M Srivastava.
All authors are partially supported by Research Project Offices of Uludağ (201215 and 201219), Selçuk and Akdeniz Universities.
References

Simsek, Y, Kim, T, Park, DW, Ro, YS, Jang, LJ, Rim, SH: An explicit formula for the multiple FrobeniusEuler numbers and polynomials. JP J. Algebra Number Theory Appl.. 4, 519–529 (2004)

Srivastava, HM, Coi, J: Series Associated with the Zeta and Related Functions, Kluwer Academic, Dordrecht (2001)

Srivastava, HM: Some generalizations and basic (or q) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inf. Sci.. 5, 390–444 (2011)

Woodcock, CF: Convolutions on the ring of padic integers. J. Lond. Math. Soc.. 20(2), 101–108 (1979)

Adian, SI: Defining Relations and Algorithmic Problems for Groups and Semigroups English translation: Trans. Amer. Math. Soc., vol. 152 (1967) (1966)

Bogley, WA, Pride, SJ: Calculating generators of . In: HogAngeloni C, Metzler W, Sieradaski A (eds.) Two Dimensional Homotopy and Combinatorial Group Theory, pp. 157–188. Cambridge University Press, Cambridge (1993)

Cevik, AS: The efficiency of standard wreath product. Proc. Edinb. Math. Soc.. 43(2), 415–423 (2000). Publisher Full Text

Cevik, AS: The pCockcroft property of the semidirect products of monoids. Int. J. Algebra Comput.. 13(1), 1–16 (2003). Publisher Full Text

Cevik, AS: Minimal but inefficient presentations of the semidirect products of some monoids. Semigroup Forum. 66, 1–17 (2003)

Cevik, AS: Minimal but inefficient presentations for self semidirect products of the free abelian monoid on two generators. Commun. Algebra. 35, 2583–2587 (2007). Publisher Full Text

Squier, CC: Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra. 49, 201–216 (1987). Publisher Full Text

Wang, J: Finite derivation type for semidirect products of monoids. Theor. Comput. Sci.. 191(12), 219–228 (1998). Publisher Full Text

Shiratani, K, Yokoyama, S: An application of padic convolutions. Mem. Fac. Sci., Kyushu Univ., Ser. A, Math.. 36(1), 73–83 (1982)

Simsek, Y: Twisted padic functions. Comput. Math. Appl.. 59, 2097–2110 (2010). Publisher Full Text

Epstein, DBA: Finite presentations of groups and 3manifolds. Q. J. Math.. 12, 205–212 (1961). Publisher Full Text

Pride, SJ: Geometric methods in combinatorial semigroup theory. In: Fountain J (ed.) Semigroups, Formal Languages and Groups, pp. 215–232. Kluwer Academic, Norwell (1995)

Pride, SJ: Lowdimensional homotopy theory for monoids. Int. J. Algebra Comput.. 5(6), 631–649 (1995). Publisher Full Text

Pride, SJ: Identities among relations of group presentations. In: Ghys E, Haefliger A, Verjovsky A (eds.) Group Theory from a Geometrical Viewpoint (Trieste, 1990), pp. 687–717. World Scientific, Singapore (1991)

Pride, SJ: Lowdimensional homotopy theory for monoids II. Glasg. Math. J.. 41, 1–11 (1999). Publisher Full Text

Cevik, AS: One dimension higher of the word problem. Math. Scand.. 95(2), 161–171 (2004)

Karpuz, EG, Ates, F, Cevik, AS, Maden, AD, Cangul, IN: The next step of the word problem over monoids. Appl. Math. Comput.. 218, 794–798 (2011). Publisher Full Text

Lustig, M: Fox ideals, torsion and applications to groups and 3manifolds. In: HogAngeloni C, Metzler W, Sieradski AJ (eds.) TwoDimensional Homotopy and Combinatorial Group Theory, pp. 219–250. Cambridge University Press, Cambridge (1993)

Baik, YG: Generators of the second homotopy module of group presentations with applications. Ph.D. thesis, University of Glasgow (1992)

Simsek, Y: Twisted Bernoulli numbers and polynomials related to twisted zeta function and Lfunction. J. Math. Anal. Appl.. 324, 790–804 (2006). PubMed Abstract  Publisher Full Text  PubMed Central Full Text

Srivastava, HM, Kim, T, Simsek, S: qBernoulli numbers and polynomials associated with multiple qzeta functions and basic Lseries. Russ. J. Math. Phys.. 12(2), 241–268 (2005)

Kim, MS, Son, JW: Analytic properties of the qVolkenborn integral on the ring of padic integers. Bull. Korean Math. Soc.. 44(1), 1–12 (2007)

Kim, T: An analogue of Bernoulli numbers and their congruences. Rep. Fac. Sci. Eng. Saga Univ., Math.. 22(2), 21–26 (1994)

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.. 315, 758–767 (2006). Publisher Full Text

Simsek, Y: Generating functions for generalized Stirling type numbers, Array type polynomials, Eulerian type polynomials and their applications. arXiv:1111.3848v2 [math.NT] (2011)

Simsek, Y: Interpolation function of generalized qBernstein type polynomials and their application. Curve and Surface, pp. 647–662. Springer, Berlin (2011)

Mismar, MJ, AbuAlNadi, DI, Ismail, TH: Pattern synthesis with phaseonly control using array polynomial technique. Dubai, UAE, 2427 November 2007. (2007)

Agoh, T, Dilcher, K: Shortened recurrence relations for Bernoulli numbers. Discrete Math.. 309, 887–898 (2009). Publisher Full Text

Carlitz, L: Some numbers related to the Stirling numbers of the first and second kind. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz.. 544576, 49–55 (1976)

Kim, T: qVolkenborn integration. Russ. J. Math. Phys.. 19, 288–299 (2002)

Luo, QM, Srivastava, HM: Some generalizations of the ApostolGenocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput.. 217, 5702–5728 (2011). Publisher Full Text

Gutman, I: The energy of a graph: old and new results. In: Betten A, Kohnert A, Laue R, Wassermann A (eds.) Algebraic Combinatorics and Applications, Springer, Berlin (2001)