Journal of Function Spaces
Volume 2018 (2018), Article ID 1901657, 6 pages
https://doi.org/10.1155/2018/1901657

Research Article

Some Recurrence Relations and Hilbert Series of Right-Angled Affine Artin Monoid

Young Chel Kuwn,¹ Zaffar Iqbal,² Abdul Rauf Nizami,³ Mobeen Munir,⁴ Sana Riaz,² and Shin Min Kang5,6

¹Department of Mathematics, Dong-A University, Busan 49315, Republic of Korea
²Department of Mathematics, University of Gujrat, Gujrat, Pakistan
³Faculty of Information Technology, University of Central Punjab, Lahore, Pakistan
⁴University of Education, Township Lahore, Pakistan
⁵Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jinju 52828, Republic of Korea
⁶Center for General Education, China Medical University, Taichung 40402, Taiwan

Correspondence should be addressed to Mobeen Munir; mmunir@ue.edu.pk and Shin Min Kang; smkang@gnu.ac.kr

Received 14 March 2018; Accepted 21 June 2018; Published 17 July 2018

Academic Editor: Raúl E. Curto

Copyright © 2018 Young Chel Kuwn et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We find the Hilbert series of the right-angled affine Artin monoid . We also discuss its recurrence relation and the growth rate.

1. Introduction

Coxeter groups were introduced by Coxeter in 1934 as abstract form of reflection groups. These groups were classified into two categories in 1935 also by Coxeter: spherical and affine. In the list of spherical Coxeter groups, is the first. The Artin group associated with is the braid group. Cardinality is an invariant of graded algebraic structures. Hilbert series deals with the cardinality of elements in the graded algebraic structures. In [1] Iqbal gave a linear system for the reducible and irreducible words of the braid monoid , which leads to compute the Hilbert series of . In [2] Iqbal and Yousaf computed the Hilbert series of the braid monoid in band generators. In [3] Berceanu and Iqbal proved that the growth rate of all the spherical Artin monoids is less than 4. In [4] Iqbal et al. studied the braid monoid of the affine type of the Coxeter systems. Authors also found the recurrence relations, the growth series of , and proved that the growth rate of is unbounded (see Figure 1).

Figure 1

In the present paper we study the affine-type Coxeter group and find the Hilbert series (or spherical growth series) of the associated right-angled affine Artin monoid . We also discuss its recurrence relations and the growth rate. For detailed explanation of related concepts and basic ideas about Coxeter groups and its types, readers are referred to [4] and references therein.

The affine (or infinite) Coxeter groups form another important series of Coxeter groups. These well-known affine Coxeter groups are , , , , , , , , and (for details, see [5]). In [3] authors proved that the universal upper bound for all the spherical Artin monoids is less than 4.

In this work we discuss right-angled affine Artin monoids; specifically, we study the affine monoid and compute its Hilbert series. We show that the growth of series is bounded above by 4. Along with Hilbert series we also compute the recurrence relations related to . We give a conjecture about the growth rate of , and the growth rates (maximal roots of the characteristic polynomial ) are computed using the softwares Drive6 and Mathematica.

The monoid is represented by its Coxeter graph as shown in Figure 2.

Figure 2

Here are vertices of the graph and all the labels are . If all the labels in a Coxeter diagram are replaced by , then there is no relation between the adjacent edges. Hence we have the associated right-angled Artin groups and the associated right-angled Artin monoids denoted by and , respectively.

In a monoid the relation will be written as in the length-lexicographic order. Let and ; then the word of the form is said to be an ambiguity. If is in the length-lexicographic order, then we say that the ambiguity is solvable. Such a presentation is complete if and only if all the ambiguities are solvable. Corresponding to the relation , the changes give a rewriting system. A complete presentation is equivalent to a confluent rewriting system. In a complete presentation of a monoid, word containing will be called reducible word and a word that does not contain will be called an irreducible word or canonical word. In a presentation of a monoid we fix a total order on the generators. Hence clearly we have the following.

Lemma 1. The monoid has the following presentation:

2. Recurrence Relations of the Monoid

In this section we discuss few interesting results relating to the recurrence relations of . First we talk about the solution of the system of linear recurrences.

Consider a system [6] of linear recurrences

This system can be written as , where

The solution (which we need in our work) of the homogenous equation is given by , where are the eigenvalues of and is an eigenvector corresponding to . The largest eigenvalue is the growth rate of the sequence (by the definition of growth rate).

Let words of length and words starting with of length . Then we have the following.

Lemma 2. The monoid satisfies the following recurrence relations:
(a) , , and
(b) are given by the recurrence

Let be a Coxeter diagram ( is similar to the standard Coxeter diagram but opposite in direction) (see Figure 3).

Figure 3

We use in the solution of the recurrence of . Therefore we have the following.

Lemma 3. The monoid satisfies the recurrence relations
(a) , , and
(b) are given by the recurrence

Let and denote the characteristic polynomials of the system of recurrence relations of the monoids and , respectively. Then we have the following.

Lemma 4. The polynomials satisfy the recurrence relation

with the initial values and

Proof. Let be the matrix of order of the recurrences given in the Lemma 3. Then the characteristic polynomial of is

We write , where the determinants and are obtained by splitting such that the last rows of and are and , respectively. Therefore easily we have and

Subtracting last column from 2nd last column of and after few easy computations we have the recurrence relation

Here we have an explicit formula to compute .

Lemma 5. Let ; then we have the following:
(‍1)  ,
(‍2)  , where

Proof. Let . Then can be written as ; i.e., This characteristic equation has the roots Let and Then we have the solution of the recurrence given by , where and are constants to determine. Since and , therefore

Solving these equations we get and . Hence

For even and odd values of we have

Theorem 6. The polynomials satisfy the recurrence relation

with , , , , and being the initial values.

Proof. Let be the matrix of order of the recurrences given in Lemma 2. Then the characteristic polynomial of is

Write , where the determinants and are obtained by splitting such that the last row of is and the last row of is . Hence easily we have . Subtracting last column from 3rd last and 2nd last columns of , respectively, we have . Hence

3. The Hilbert Series of the Monoid

Now we compute the Hilbert series of . For this we need to fix some notations first. Let denote the Hilbert series of , where words of length , and denote the Hilbert series of of words starting with , where words starting with of length .

Theorem 7. The Hilbert series of is given by the following:
(1) ,
(2) ,
(3) ,
(4) ,
(5)

Proof. From Lemma 2 we have Therefore

From Lemma 2 we have . Hence

Similarly we can easily prove (3), (4), and (5).

The system of equations in Theorem 7 can be written in matrix form as , where

Lemma 8. In the monoid

Proof. The result follows immediately by factoring out from each row of .

Lemma 9. In

Proof. The system given in Theorem 7 of equations in variables is already written in the form , where , , and . Here we have only two cases.
Case I. By using Cramer’s rule we have

where is a determinant obtained by replacing th column of by column of ; i.e.,

Let denote the th column of . Adding in of and simplifying it we have a determinant of order . Hence

Now by adding th column of the last determinant in its th column and simplifying it we finally have

Case II. Using again Cramer’s rule, we have

Adding in and simplifying we have the result

Now we have our main result.

Theorem 10. The Hilbert series of the monoid is

Proof. From Theorem 7 we have

4. Conjecture on the Upper Bound of Growth Rate of

In this section we compute the growth rates of and show them on the graph. We see that the growth rate is bounded above by 4. Let be the growth rate or the maximal root of the polynomial . We compute few initial growth rates (using Mathematica and derive 6) for . Let denote the growth rate of ; then we have the following few initial values of : , , , , , , , , , , , , , , , . We also compute , , , , and (using Mathematica). We have Figure 4 representing the growth rate of .

Figure 4

We observe that the growth rate for approaching 4 as approaches . Hence at the end we have the following.

Conjecture. The growth rate of is bounded above by 4.

Data Availability

No such data has been used to prove these results.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Authors’ Contributions

All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.

Acknowledgments

This study was supported by research funds from Dong-A University.

References

Z. Iqbal, “Hilbert series of positive braids,” Algebra Colloquium, vol. 18, no. Special Issue 1, pp. 1017–1028, 2011.

Z. Iqbal and S. Yousaf, “Hilbert series of the braid monoid in band generators,” Turkish Journal of Mathematics, vol. 38, no. 6, pp. 977–984, 2014.

B. Berceanu and Z. Iqbal, “Universal upper bound for the growth of artin monoids,” Communications in Algebra, vol. 43, no. 5, pp. 1967–1982, 2015.

Z. Iqbal, S. Batool, and M. Akram, “Hilbert series of right-angled Affine Artin Monoid ),” Kuwait Journal of Science, vol. 44, no. 4, pp. 19–27, 2017.

H. S. Coxeter, Regular Complex Polytopes, Cambridge University Press, 2nd edition, 1991.

W. G. Kelley and A. C. Peterson, Difference Equations: An Introduction with Applications, Academic Press, New York, NY, USA, 2nd edition, 2001.