Skip to main content
Boundary Value Problems
Boundary Value Problems Cover Image
Download PDF

A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions

Boundary Value Problems volume 2013, Article number: 51 (2013) Cite this article

Abstract

For a minimal group (or monoid) presentation P, let us suppose that P 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 Z n ⋊Z and Z 2 ⋊Z, 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.

1 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, [1–4]), 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, [5–12]). 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

P=〈x;r〉
(1)

is a pair where x is a set (generating symbols) and r is a set of non-empty, cyclically reduced words (relators) on x. In monoids, each R∈r is actually an ordered pair ( R + , R − ), where R + and R − are distinct, positive (one of them could be empty) words on x. We say that P 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 P A =〈x;r〉 and P K =〈y;s〉, the presentation of the group (or monoid) K ⋊ θ A is defined by

P K ⋊ θ A =〈x,y;r,s,t〉,
(2)

where t is the set of relators of the form

T y x :yx=x(y θ x )

for all x∈x and y∈y (cf. [8, 9]). We remind that the homomorphism θ is defined from A to Aut(K) for the semidirect product of groups, while it is defined from A to End(K) for the product of monoids. Further, θ x 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 P in (1).

1.1 Efficiency

The subject under this title will be given over a group G with a presentation P 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 P, the Euler characteristic is defined by χ(P)=1−|x|+|r|. By [16–18], there exists a lower bound δ(G) which is equal to 1−r k Z ( H 1 (G))+d( H 2 (G)) with the condition δ(G)≤χ(P), where rk(⋅) denotes the ℤ-rank of the torsion-free part and d(⋅) denotes the minimal number of generators. Depending on these numbers, we define

χ(G)=min { χ ( P ) : P  is a finite presentation for  G } .

Therefore a presentation P is called minimal if χ(P)⩽χ( P ′ ) for all presentations P ′ of G, or is called efficient if χ(P)=δ(G). Moreover, G is called efficient if χ(G)=δ(G). In [7, 8], Cevik recalled known results for efficiency of groups and monoids. (We should remark that some authors also consider −|x|+|r| and call this the deficiency of the presentation P.)

Remark 1 In both group and monoid cases, if the presentation P 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 P given in (1). This method was constructed and first used by Pride [6, 17–20] 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
figure1

Generating pictures of P G as given in ( 6 ).

Full size image
Figure 2
figure2

The single generating picture of P M given in ( 9 ).

Full size image
Figure 3
figure3

The single generating picture of P M in ( 12 ).

Full size image

Pictures for groups: As we depicted in Remark 2, a group picture ℙ over P is a geometric configuration consisting of the following:

  • A disc D 2 with a basepoint O on the boundary ∂ D 2 of D 2 .

  • Disjoint discs Δ 1 , Δ 2 ,…, Δ n in the interior of D 2 . Each Δ i has a basepoint O i on the boundary ∂ Δ i of Δ i .

  • A finite number of disjoint arcs α 1 , α 2 ,…, α m , where each arc lies in the closure of D 2 − ⋃ i = 1 n Δ i and is either a simple closed curve having trivial intersection with ∂ D 2 ∪∂ Δ 1 ∪∂ Δ 2 ∪⋯∪∂ Δ n , or is a simple non-closed curve which joins two points of ∂ D 2 ∪∂ Δ 1 ∪∂ Δ 2 ∪⋯∪∂ Δ n , 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 x∪ x − 1 which is called the label of the arc.

  • If we travel around ∂ Δ i once in the clockwise direction starting from O i 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 x − 1 ), then we obtain a word which belongs to r∪ r − 1 . We call this word the label of Δ i . If s is a subset of r, then a disc labelled by an element of s∪ s − 1 is called an s-disc.

When we refer to the discs of ℙ, we in fact mean the discs Δ 1 , Δ 2 ,…, Δ n , and not the ambient disc D 2 . A closed arc which encircles neither a disc nor an arc of ℙ is called a floating circle. We define ∂P to be ∂ D 2 . The label on ℙ (denoted by W(P)) is the word read off by travelling around ∂P 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 ∂P (i.e. if ℙ is spherical, then ∂P is omitted). A transverse path γ in a picture ℙ is a path in the closure of D 2 − ⋃ i = 1 n Δ i 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 W(γ). 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 γ ̲ =( γ 1 , γ 2 ,…, γ n ) of simple transverse paths satisfying the following: for i=1,2,…,n, γ i starts at O and ends at the basepoint of Δ i , for 1⩽i<j⩽n, γ i and γ j intersect only at O; travelling around O clockwise in ℙ, we encounter these transverse paths γ 1 , γ 2 ,…, γ n , 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 〈P〉. The set of all equivalence classes of spherical pictures over P forms an abelian group. In addition, for a word W on x, a new spherical picture over P denoted by P W can also be obtained from W by surrounding ℙ with a collection of concentric arcs with total label W. Hence, there is a well-defined G(P)-action on equivalence classes of spherical pictures given by W ¯ ⋅〈P〉=〈 P W 〉 (where W ¯ ∈G(P)). We then obtain a ZG(P)-module π 2 (P) called the second homotopy module of P. Let X be a set of spherical pictures. Then we say that X generates π 2 (P) (or X is a set of generating pictures) if the elements 〈P〉 (where P∈X) generate π 2 (P).

For any picture ℙ over P and for any R∈r, the exponent sum of R in ℙ, denoted by exp R (P), is the number of discs of ℙ labelled by R minus the number of discs labelled by R − 1 . We remind that if pictures P 1 and P 2 are equivalent, then exp R ( P 1 )= exp R ( P 2 ) for all R∈r. Depending on the exponent sum, we have the following definition.

Definition 1 For a non-negative integer n, P is said to be n-Cockcroft if exp R (P)≡0(modn) (where congruence (mod0) is taken to be equality) for all R∈r and for all spherical pictures ℙ over P. Moreover, a group G is said to be n-Cockcroft if it admits an n-Cockcroft presentation.

Actually, to verify that the n-Cockcroft property holds, it is enough to check it only for pictures P∈X, where X is a set of generating pictures. Also, the 0-Cockcroft property is usually just called Cockcroft, and in practice, n is taken as a prime p or 0. By [16, 19], the presentation P is efficient if and only if it is p-Cockcroft for some prime p. So, this connection between efficiency and p-Cockcroft property will be one of the main ideas during the construction of this paper.

There is an embedding μ of π 2 (P) into the free module ⨁ R ∈ r ZG(P) e R defined as follows (see [6, 19]): Let 〈P〉∈ π 2 (P) and suppose that ℙ has discs Δ 1 , Δ 2 ,…, Δ n with the labels R 1 ε 1 , R 2 ε 2 ,…, R n ε n , respectively ( R i ∈r, ε i =±1, i=1,2,…,n). Let γ ̲ =( γ 1 ,…, γ n ) be a spray defined previously. Then

μ ( 〈 P 〉 ) = ∑ i = 1 n ε i W ( γ i ) ¯ e R i .
(3)

For simplicity, the notation μ(P) will be preferred instead of μ(〈P〉). For each spherical picture ℙ over P and for each R∈r, let λ P , R be the coefficients of e R in μ(P). Let I 2 (P) be the two-sided ideal in ZG generated by the set { λ P , R :P is a spherical picture, R∈r}. This ideal is called the second Fox ideal of P. 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 ε i W ( γ i ) ¯ 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 P be a monoid presentation as in (1); and let F(x) be a free monoid on x. If we have an element W=U S ε V (where U,V∈F(x), S∈r, ε=±1) of F(x), then we can replace S ε by S − ε to get a word W ′ =U S − ε V. This can be represented by a geometric object called an atomic (monoid) picture A=(U,S,ε,V) as depicted in Figure 4.

Figure 4
figure4

An atomic monoid picture.

Full size image

We remark that the disc labelled by S in an atomic picture A is said to be positive if ε=1 and is said to be negative if ε=−1.

We have a graph Γ (=Γ(P)) associated with P, called the Squier graph, which is defined as follows: The vertex set is F(x), and the edge set is the collection of all atomic monoid pictures. For an orientation of Γ, we will take all edges (U,S,+1,V). For an atomic picture A, 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 ι(A)=U S ε V, and the word we read off by travelling along the bottom gives the terminal function, denoted by τ(A)=U S − ε V. Also, the mirror image of A is denoted by A − 1 =(U,S,−ε,V). A path P= A 1 A 2 ⋯ A n (where each A i is an atomic picture for i=1,2,…,n) in Γ will also be called a monoid picture over P. If ι( A 1 )=τ( A n ), then ℙ is called a spherical monoid picture over P. Note that we also have the term subpicture of monoid pictures.

There is a left action of F(x) on Γ defined as follows. Let C∈F(x).

  1. (i)

    Let W be a vertex of Γ. Then we define CW to be C⋅W (product in F(x)).

  2. (ii)

    Let A, as in Figure 4, be an edge of Γ. Then C⋅A=(CU,S,ε,V).

We can define a similar right action of F(x) on Γ. The left and right actions of F(x) on Γ extend to actions on pictures. That is, if ℙ is a picture and W,V∈F(x), then W⋅P⋅V=(W⋅ A 1 ⋅V)(W⋅ A 2 ⋅V)⋯(W⋅ A n ⋅V).

For atomic monoid pictures A and B, 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 P denoted by D(P). Let Y be a set of spherical monoid pictures. Two spherical monoid pictures will be said to be equivalent (relative to Y) 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 D(P) 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 P and for any S∈r, 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 n-Cockcroft (in fact n is taken as a prime p or 0) property holds, it is enough to check it for pictures P∈Y, where Y is a trivializer of D(P).

Let M be a monoid with the presentation P as in (1). Let

P ( l ) = ⨁ S ∈ r ZM e S

be a free left ZM-module with basis { e S :S∈r}. For an atomic picture A=(U,S,ε,V) with U,V∈F(x), S∈r, ε=±1, we define eval ( l ) (A)=ε U ¯ e S ∈ P ( l ) , where U ¯ ∈M(P) as in Figure 4. For any spherical monoid picture ℙ, we define

eval ( l ) (P)= ∑ i = 1 n eval ( l ) ( A i )∈ P ( l ) .
(4)

Let λ P , S be the coefficient of e S in eval ( l ) (P). So, we can write

eval ( l ) (P)= ∑ S ∈ r λ P , S e S ∈ P ( l ) .
(5)

Let I 2 ( l ) (P) be the two-sided ideal of ZM generated by the elements λ P , S , where ℙ is a spherical monoid picture and S∈r. Then this ideal is called the second Fox ideal of P. More specifically, for a trivializer Y of D(P), the set I 2 ( l ) (P) is generated (as two-sided ideal) by the elements λ P , S , where P∈Y and S∈r. 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 ∑ i = 1 n ε U i ¯ part in (4) or, equivalently, to the λ P , S in (5).

2 The group case Z n ⋊ θ 1 Z

Let us consider the split extension G= Z n ⋊ θ 1 Z, where Z=〈b〉 is the a group with rank one, Z n =〈a〉 is a cyclic group of order n and θ 1 :Z→Aut( Z n ) is a homomorphism. Then, by (2), G has the presentation

P G = 〈 a , b ; a n , a b a − k b − 1 〉 ,
(6)

where k∈ Z + , gcd(k,n)=1 and k<n. In [[24], Theorem 3.2.1], the generating set of the second homotopy module π 2 ( P G ) has been constructed as drawn in Figure 1. In this generating set, there are two spherical pictures P 1 and P 2 . In P 1 , we have two a n -discs (one of them is positive and the other is negative), and in P 2 we have a negative a n -disc and k-times positive a n -discs. Furthermore, again in P 2 , there is a total of n-times ab a − k b − 1 -discs. Then, by considering the number of discs in these pictures, Baik [[24], Theorem 3.3.3] proved the following result.

Proposition 1 The presentation P G in (6) is efficient (equivalently, p-Cockcroft for any prime p) if and only if gcd(k−1,n)≠1.

Therefore, if we suppose gcd(k−1,n)=1, then we obtain an inefficient presentation. Clearly, n must be an odd prime and the P G given in (6) be an inefficient presentation. Otherwise, by setting n=2 in this inefficient case, we obtain the direct product Z n ×Z 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 [8–10]). For the group case, this important subject is investigated by the following ‘minimality test’ due to Lustig [23].

Lemma 1 ([23])

For any group G with a presentation P as in (1), suppose there is a ring homomorphism ψ from ZG into the matrix ring of all m×m-matrices (m≥1) over some commutative ring ℛ with 1. Suppose also that ψ(1)= I m × m . If ψ maps the second Fox ideal I 2 (P) to 0 (in other words, if I 2 (P) is contained in the kernel of ψ), then P is minimal.

By considering Proposition 1, the first main result of this paper is presented as follows.

Theorem 1 Let us consider the presentation P G as in (6) for the group G= Z n ⋊ θ 1 Z, where k<n and gcd(k,n)=1 but gcd(k−1,n)≠1. Then P G has a set of generating functions

p 1 (a)=a−1, p 2 (b)=kb−1, p 3 (a)= ϕ n (a),

where ϕ n denotes the nth cyclotomic polynomial over ℚ defined by

ϕ n (x)= x n − 1 x − 1
(7)

having a degree n−1.

Proof We first note that since P G is presented as in (6), the action in Aut( Z n ) is defined by a ⟶ θ 1 ( b ) θ 1 (b)= a k , where hcf(k,n)=1 and k<n.

Assume that hcf(k−1,n)≠1. Then, by Proposition 1, P G is an efficient presentation and so, by Remark 1, is minimal (i.e. has a minimal number of generators). Let us consider the pictures P 1 and P 2 in Figure 1. Now, by (3), we have

where hcf(k,n)=1, but hcf(k−1,n)≠1 and k<n. 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 a−1, kb−1 and 1+a+ a 2 +⋯+ a n − 1 . Now, we can reformulate these polynomial elements as generating functions. It is clear that p 1 (a) has the root a=1. On the other hand, since we have

p 2 ( b ) = k b − 1 ≡ 0 ( mod n ) ⇒ t ( k b − 1 ) ≡ 0 ( mod n ) ⇒ b − t ≡ 0 ( mod n ) ⇒ b ≡ t ( mod n ) ,

p 2 (b) has a root t, where t is the multiplicative inverse of k.

Finally, p 3 (a)=1+a+ a 2 +⋯+ a n − 1 ≡0(modn) has a root a=1 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 1 For an odd prime p and a positive integer k<p, the presentation P G in (6) has a set of generating functions

p 1 (a)=a−1, p 2 (b)=kb−1, p 3 (a)= ϕ p (a)= x p − 1 x − 1 ,

where ϕ p has a degree of an even number p−1.

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 2 The polynomial p 3 (a) in 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

f(x)= ζ x and ζ n =1(n∈Z)

for which f ′ (x)=0 holds. Moreover, in the meaning of group homomorphisms, each function in this family satisfies

f:(R,+)⟶(C,⋅),f(x+y)=f(x)⋅f(y).

Now, by replacing ζ x with

p 3 (ζ)= ζ n − 1 ζ − 1 ,
(8)

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 p 3 (a) of the presentation P G 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 N≥0, C p N denotes the multiplicative group of the primitive p N th roots of unity in C p ∗ = C p −{0}. Let

T p = { ξ ∈ C p : ξ p N = 1 ,  for  N ≥ 0 } = ⋃ N ≥ 0 C p N = lim N → ∞ C p N .

The dual of Z p in the sense of p-adic Pontryagin duality is T p = C p ∞ , the direct limit (under inclusion) of cyclic groups C p N of order p N with N≥0, with discrete topology. The T p admits a natural Z p -module structure which is written as ξ x for ξ∈ T p and x∈ Z p . Moreover, T p can be embedded discretely in C p as the multiplicative p-torsion subgroup. If ξ∈ T p , then ω:( Z p ,+)⟶( C p ,⋅), x↦ ξ x , is a locally constant character which is actually a locally analytic character if ξ∈{ξ∈ C p : v p (ξ−1)>0}. Then, by [4, 13, 14, 27, 28], ω ξ has a continuation to a continuous group homomorphism from ( Z p ,+) to ( C p ,⋅). We further remind that if ξ∈C, then ξ will be assumed to have an r th root of unity with r∈ Z + .

3 The monoid case Z 2 ⋊ θ 2 Z

Before presenting this special case, let us first discuss a more general situation for the p-Cockcroft property of semidirect products of monoids. In [8, 9], by considering a similar version of the picture P S , x in Figure 2, the second author investigated the p-Cockcroft property by using the trivializer for the semidirect product M=K ⋊ θ 2 A, where K and A are arbitrary monoids. (It is seen that there is a single non-spherical subpicture B S , x in P S , x . In fact, B S , x contains only S-discs. For an illustration, see Figure 3.) As a special case of it, let us assume that K is a one-relator monoid and A is an infinite cyclic monoid ℤ with presentations

P K =〈y; S + = S − 〉and P A =〈x;:〉,

respectively. Suppose ψ is an endomorphism of K. Then the mapping x↦ψ induces a homomorphism θ 2 :A→End(K), and we can form the semidirect product M=K ⋊ θ A. By (2), this product has a presentation

P M =〈y,x; S + = S − ,t〉,
(9)

where, for all y∈y, the set t is the set of relators

T y x :yx=x(y θ x )

such that the relator S satisfies the condition ι( S + )≠ι( S − ) (or τ( S + )≠τ( S − )). In [8], the necessary and sufficient conditions for P M to be efficient are determined.

In the special case above, let us take K as a free abelian monoid of rank two (i.e. K= Z 2 ) presented by P K =〈 y 1 , y 2 ; y 1 y 2 = y 2 y 1 〉, and let ψ be the endomorphism ψ M , where M is the matrix [ α α ′ β β ′ ] (α, α ′ ,β, β ′ ∈ Z + ) given by [ y 1 ]↦[ y 1 α y 2 α ′ ] and [ y 2 ]↦[ y 1 β y 2 β ′ ]. As a special case of the presentation in (9), we obtain

P M = 〈 y 1 , y 2 , x ; y 1 y 2 = y 2 y 1 , y 1 x = x y 1 α y 2 α ′ , y 2 x = x y 1 β y 2 β ′ 〉
(10)

for the monoid M= Z 2 ⋊ θ 2 Z (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 prime p, the presentation P M in (10) is p-Cockcroft if and only if detM≡1(modp).

According to Proposition 2, in particular, P M is not efficient if detM=0 or 2. Therefore the following proposition is proved in the same manner.

Proposition 3 ([9])

The presentation P M in (10) is minimal but inefficient if detM=2.

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, [8–10]).

Lemma 2 (Pride)

For any monoid M with a presentation P as in (1), let ψ be a ring homomorphism from ZM into the ring of all m×m-matrices (m≥1) over some commutative ring ℛ with 1, and suppose ψ(1)= I m × m . If the second Fox ideal I 2 ( l ) (P) is contained in the kernel of ψ, then P is 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 S k n (x) are defined by means of the following generating function:

( e t − 1 ) k e t x x ! = ∑ n = 0 ∞ S k n (x) t n n ! ,

(cf. [29–31]). According to the same references, array polynomials can also be defined in the form

S k n (x)= 1 k ! ∑ j = 0 k ( − 1 ) k − j ( k j ) ( x + j ) n .
(11)

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, Mittag-Leffler 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 2 Let us consider the monoid M= Z 2 ⋊ θ 2 Z with a presentation

P M = 〈 b 1 , b 2 , a ; b 1 b 2 = b 2 b 1 , b 1 a = a b 1 2 , b 2 a = a b 1 b 2 〉 .
(12)

Then P M has a set of generating functions

p 1 ( a ) = S n n ( a ) − 2 S 0 1 ( a ) p 2 ( b 1 ) = S n n ( b 1 ) − S 0 1 ( b 1 ) p 3 ( b 2 ) = S 0 1 ( b 2 ) − S n n ( b 2 ) } ,
(13)

where S k n (x) is defined as in (11).

Proof Let us consider the spherical picture P S , a with its non-spherical subpicture B S , a as drawn in Figure 3. In fact, by [9], this is the only picture in the trivializer of D( P M ).

In presentation (12), let us label the relators b 1 b 2 = b 2 b 1 , b 1 a=a b 1 2 and b 2 a=a b 1 b 2 by S, T b 1 , a and T b 2 , a , respectively. It is clear that exp S ( P S , a )=1−2=−1, exp T b 1 , a ( P S , a )=1−1=0 and exp T b 2 , a ( P S , a )=1−1=0. In the calculation of these exponent sums, we included the exponent sums of S-discs in the non-spherical picture B S , a . Actually, a simple calculation shows that detM= exp S ( B S , a ) and so, by our assumption about P M that is not efficient, we expect exp S ( B S , a ) to be 2.

Now, by (4) and (5), the evaluation of P S , a is determined as follows:

eval ( l ) ( P S , a )=(1− 2 ¯ a ¯ ) e S +(1− b 1 ¯ ) e T b 1 , a +( b 2 ¯ −1) e T b 2 , a .

Therefore, by the definition, the second Fox ideal I 2 ( l ) ( P M ) of the presentation P M in (12) is generated by the polynomial elements

1− 2 ¯ a ¯ ,1− b 1 ¯ , b 2 ¯ −1.

For simplicity, let us replace each of 2 ¯ a ¯ , b 1 ¯ and b 2 ¯ by 2a, b 1 and b 2 , 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

S k n (x)={ x n ; k = 0 , x ; k = 0  and  n = 1 , 1 ; k = n  or  n = k = 0 .

Then, by reformulating the elements of the second Fox ideal I 2 ( l ) ( P M ), we arrive at the functions in (13) as desired. □

By considering Proposition 2, if we take detM≠2, then we get an efficient presentation. So, for an even prime p, let detM=3. Then one of the presentations of the similar form P M as in (12) can be taken as

P M = 〈 b 1 , b 2 , a ; b 1 b 2 = b 2 b 1 , b 1 a = a b 1 3 , b 2 a = a b 1 b 2 〉 ,
(14)

which will be efficient. The same procedure in the proof of Theorem 2 gives us the set of generating functions of P M in (14) in the form p 1 (a), p 2 ( b 1 ) and p 3 ( b 2 ), where p 1 (a)= S n n (a)−3 S 0 1 (a) and the others are defined in (13) such that S k n (x) is given in (11). Nevertheless, by induction steps, we can generalise this last presentation as follows:

P M = 〈 b 1 , b 2 , a ; b 1 b 2 = b 2 b 1 , b 1 a = a b 1 det M , b 2 a = a b 1 b 2 〉 .
(15)

Hence we get the following version of Theorem 2 which deals with efficient presentations.

Theorem 3 Let us consider the presentation P M in (15) for the monoid M= Z 2 ⋊ θ 2 Z. Then P M has a set of generating functions

p 1 ( a ) = S n n ( a ) − det M S 0 1 ( a ) p 2 ( b 1 ) = S n n ( b 1 ) − S 0 1 ( b 1 ) p 3 ( b 2 ) = S 0 1 ( b 2 ) − S n n ( b 2 ) } ,
(16)

where detM≠2 and S k n (x) is 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 t 1 ≠ t 2 ∈ R + , λ∈C, k∈ N 0 , generalised array type polynomials S k n (x; t 1 , t 2 ;λ) which are related to the non-negative real parameters have been recently developed and some elementary properties including recurrence relations of these polynomials have been obtained [30]. In fact, by setting t 1 =λ=1 and t 2 =e, the equation (11) is obtained.

Remark 6 One can try to study the generalisation of Theorem 2 by using S k n (x; t 1 , t 2 ;λ).

The remaining goal of this section is to establish a connection between the presentation P M in (12) or (15) and Stirling numbers of the second kind (cf. [3, 30, 33–36]). In fact, Stirling numbers of the second kind S(n,k) are defined by means of the following generating function:

( e t − 1 ) k k ! = ∑ n = 0 ∞ S(n,k) t n n !

(see [3, 36]). According to [[30], Theorem 1, Remark 2], Stirling numbers can also be defined by

S(n,k)= 1 k ! ∑ j = 0 k ( − 1 ) j ( k j ) ( k − j ) n .

We remind that these numbers satisfy the well-known properties

S(n,k)={ 1 ; k = 1  or  k = n , ( n 2 ) ; k = n − 1 , δ n , 0 ; k = 0 ,

where δ n , 0 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 higher-order moments, etc. We finally note that since S(n,k) 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 S(n,k), by [30, 35, 36], we have

x n = ∑ k = 0 n ( x k ) k!S(n,k)
(17)

as a formula for Stirling numbers. Therefore, in equation (17) by replacing x with a, b 1 and b 2 , respectively, and taking n=1, n=0, the polynomial elements of the second Fox ideal I 2 ( l ) ( P M ) of the presentation P M in (12) can be restated as follows:

a 0 − 2 a 1 = ∑ k = 0 0 ( a k ) k ! S ( 0 , k ) − 2 ∑ k = 0 1 ( a k ) k ! S ( 1 , k ) b 1 0 − b 1 1 = ∑ k = 0 0 ( b 1 k ) k ! S ( 0 , k ) − ∑ k = 0 1 ( b 1 k ) k ! S ( 1 , k ) b 2 1 − b 2 0 = ∑ k = 0 1 ( b 2 k ) k ! S ( 1 , k ) − ∑ k = 0 0 ( b 2 k ) k ! S ( 0 , k ) } .
(18)

As a different version of Theorem 2, we express the following corollary.

Corollary 3 The presentation P M in (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 P M in (15).

Furthermore, in a recent work, Simsek [30] has constructed the generalised λ-Stirling numbers of the second kind S(n,v;a,b;λ) related to non-negative real parameters (a,b∈ R + , a≠b, λ is a complex number and v∈ N 0 ). In fact, this new generalisation is defined by the generating function

f S , v (t;a,b;λ)= ( λ b t − a t ) v v ! = ∑ n = 0 ∞ S(n,v;a,b;λ) t n n ! .
(19)

By setting a=1 and b=e in (19), one can obtain the λ-Stirling numbers of the second kind S(n,v;λ) which are defined by the generating function

( λ e t − 1 ) v v ! = ∑ n = 0 ∞ S(n,v;λ) t n n !

(see [3, 36]). By substituting λ=1 into the above equation, the Stirling numbers of the second kind S(n,v)are obtained.

By considering this new generalisation S(n,v;a,b;λ), in [[30], Theorem 1], it has been obtained that

S(n,v;a,b;λ)= 1 v ! ∑ j = 0 n ( − 1 ) j ( v j ) λ v − j ( j ln a + ( v − j ) ln b ) n ,
(20)

for λ-Stirling numbers of the second kind. In fact, by setting a=1 and b=e in (20), one can get the following equality on λ-Stirling numbers:

S(n,v;λ)= 1 v ! ∑ j = 0 v ( v j ) λ ( v − j ) ( − 1 ) j ( v − j ) n
(21)

(see [3, 36]).

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 S(n,v;λ) defined in (21) and generalised λ-Stirling numbers S(n,v;a,b;λ) defined in (20) as stated in these theorems and corollaries.

Remark 8 For a suitable M n × n matrix, it is possible to define the presentation P M in (9) (or in (10)) for the monoid Z n ⋊ θ 2 Z. 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 Z n ⋊ θ 1 Z and Z 2 ⋊ θ 2 Z. 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.

References

  1. 1.

    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.

    MATH  MathSciNet  Google Scholar 

  2. 2.

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

    Google Scholar 

  3. 3.

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

    MathSciNet  Google Scholar 

  4. 4.

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

    MATH  MathSciNet  Article  Google Scholar 

  5. 5.

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

    Google Scholar 

  6. 6.

    Bogley WA, Pride SJ:Calculating generators of π 2 . In Two Dimensional Homotopy and Combinatorial Group Theory. Edited by: Hog-Angeloni C, Metzler W, Sieradaski A. Cambridge University Press, Cambridge; 1993:157-188.

    Google Scholar 

  7. 7.

    Cevik AS: The efficiency of standard wreath product. Proc. Edinb. Math. Soc. 2000, 43(2):415-423. 10.1017/S0013091500021003

    MATH  MathSciNet  Article  Google Scholar 

  8. 8.

    Cevik AS: The p -Cockcroft property of the semidirect products of monoids. Int. J. Algebra Comput. 2003, 13(1):1-16. 10.1142/S0218196703001298

    MATH  MathSciNet  Article  Google Scholar 

  9. 9.

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

    MATH  MathSciNet  Article  Google Scholar 

  10. 10.

    Cevik AS: Minimal but inefficient presentations for self semidirect products of the free abelian monoid on two generators. Commun. Algebra 2007, 35: 2583-2587. 10.1080/00927870701327732

    MATH  MathSciNet  Article  Google Scholar 

  11. 11.

    Squier CC: Word problems and a homological finiteness condition for monoids. J. Pure Appl. Algebra 1987, 49: 201-216. 10.1016/0022-4049(87)90129-0

    MATH  MathSciNet  Article  Google Scholar 

  12. 12.

    Wang J: Finite derivation type for semi-direct products of monoids. Theor. Comput. Sci. 1998, 191(1-2):219-228. 10.1016/S0304-3975(97)00164-3

    MATH  Article  Google Scholar 

  13. 13.

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

    MATH  MathSciNet  Google Scholar 

  14. 14.

    Simsek Y: Twisted p -adic (h,q)-L -functions. Comput. Math. Appl. 2010, 59: 2097-2110. 10.1016/j.camwa.2009.12.015

    MATH  MathSciNet  Article  Google Scholar 

  15. 15.

    Brown KS Graduate Text in Mathematics 87. In Cohomology of Groups. Springer, Berlin; 1982.

    Google Scholar 

  16. 16.

    Epstein DBA: Finite presentations of groups and 3-manifolds. Q. J. Math. 1961, 12: 205-212. 10.1093/qmath/12.1.205

    MATH  Article  Google Scholar 

  17. 17.

    Pride SJ: Geometric methods in combinatorial semigroup theory. In Semigroups, Formal Languages and Groups. Edited by: Fountain J. Kluwer Academic, Norwell; 1995:215-232.

    Google Scholar 

  18. 18.

    Pride SJ: Low-dimensional homotopy theory for monoids. Int. J. Algebra Comput. 1995, 5(6):631-649. 10.1142/S0218196795000252

    MATH  MathSciNet  Article  Google Scholar 

  19. 19.

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

    Google Scholar 

  20. 20.

    Pride SJ: Low-dimensional homotopy theory for monoids II. Glasg. Math. J. 1999, 41: 1-11. 10.1017/S0017089599970179

    MATH  MathSciNet  Article  Google Scholar 

  21. 21.

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

    MATH  MathSciNet  Google Scholar 

  22. 22.

    Karpuz EG, Ates F, Cevik AS, Maden AD, Cangul IN: The next step of the word problem over monoids. Appl. Math. Comput. 2011, 218: 794-798. 10.1016/j.amc.2011.03.076

    MATH  MathSciNet  Article  Google Scholar 

  23. 23.

    Lustig M:Fox ideals, N-torsion and applications to groups and 3-manifolds. In Two-Dimensional Homotopy and Combinatorial Group Theory. Edited by: Hog-Angeloni C, Metzler W, Sieradski AJ. Cambridge University Press, Cambridge; 1993:219-250.

    Google Scholar 

  24. 24.

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

  25. 25.

    Simsek Y: Twisted (h,q) -Bernoulli numbers and polynomials related to twisted (h,q) -zeta function and L -function. J. Math. Anal. Appl. 2006, 324: 790-804. 10.1016/j.jmaa.2005.12.057

    MATH  MathSciNet  Article  Google Scholar 

  26. 26.

    Srivastava HM, Kim T, Simsek S: q -Bernoulli numbers and polynomials associated with multiple q -zeta functions and basic L -series. Russ. J. Math. Phys. 2005, 12(2):241-268.

    MATH  MathSciNet  Google Scholar 

  27. 27.

    Kim MS, Son JW: Analytic properties of the q -Volkenborn integral on the ring of p -adic integers. Bull. Korean Math. Soc. 2007, 44(1):1-12.

    MATH  MathSciNet  Article  Google Scholar 

  28. 28.

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

    MATH  Google Scholar 

  29. 29.

    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.013

    MATH  MathSciNet  Article  Google Scholar 

  30. 30.

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

  31. 31.

    Simsek Y: Interpolation function of generalized q -Bernstein type polynomials and their application. Lecture Notes in Computer Science 6920. In Curve and Surface. Springer, Berlin; 2011:647-662.

    Google Scholar 

  32. 32.

    Mismar MJ, Abu-Al-Nadi DI, Ismail TH: Pattern synthesis with phase-only control using array polynomial technique. 2007 IEEE International Conference on Signal Processing and Communications (ICSPC 2007) 2007.

    Google Scholar 

  33. 33.

    Agoh T, Dilcher K: Shortened recurrence relations for Bernoulli numbers. Discrete Math. 2009, 309: 887-898. 10.1016/j.disc.2008.01.030

    MATH  MathSciNet  Article  Google Scholar 

  34. 34.

    Carlitz L: Some numbers related to the Stirling numbers of the first and second kind. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1976, 544-576: 49-55.

    Google Scholar 

  35. 35.

    Kim T: q -Volkenborn integration. Russ. J. Math. Phys. 2002, 19: 288-299.

    Google Scholar 

  36. 36.

    Luo QM, Srivastava HM: Some generalizations of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217: 5702-5728. 10.1016/j.amc.2010.12.048

    MATH  MathSciNet  Article  Google Scholar 

  37. 37.

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

    Google Scholar 

Download references

Acknowledgements

Dedicated to Professor Hari M Srivastava.

All authors are partially supported by Research Project Offices of Uludağ (2012-15 and 2012-19), Selçuk and Akdeniz Universities.

Author information

Affiliations

  1. Department of Mathematics, Faculty of Arts and Science, Uludag University, Gorukle Campus, Bursa, 16059, Turkey

    Ismail Naci Cangül

  2. Department of Mathematics, Faculty of Science, Selçuk University, Campus, Konya, 42075, Turkey

    Ahmet Sinan Çevik

  3. Department of Mathematics, Faculty of Art and Science, Akdeniz University, Campus, Antalya, 07058, Turkey

    Yılmaz Şimşek

Authors
  1. Ismail Naci Cangül
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmet Sinan Çevik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yılmaz Şimşek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ismail Naci Cangül.

Additional information

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.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Cangül, I.N., Çevik, A.S. & Şimşek, Y. A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions. Bound Value Probl 2013, 51 (2013). https://doi.org/10.1186/1687-2770-2013-51

Download citation

Keywords

  • efficiency
  • p-Cockcroft property
  • split extension
  • generating functions
  • Stirling numbers
  • array polynomials