Differentiated outlook to portray secondary cities in South Africa

Andre DW Brand; Johannes E Drewes; Maléne Campbell; Andre DW Brand; Johannes E Drewes; Maléne Campbell

doi:10.3934/geosci.2021026

AIMS Geosciences

2021, Volume 7, Issue 3: 457-477. doi: 10.3934/geosci.2021026

Previous Article Next Article

Research article Topical Sections

Differentiated outlook to portray secondary cities in South Africa

1.
Extra-ordinary Senior Lecturer, Urban and Regional Planning, Unit for Environmental Science and Management, North West University, Potchefstroom, South Africa
2.
Urban and Regional Planning, Unit for Environmental Science and Management, North-West University, South Africa
3.
Urban and Regional Planning, University of the Free State

Received: 07 June 2021 Accepted: 31 August 2021 Published: 06 September 2021

Cities are playing an increasingly important role in the development and growth of countries. A country's growth and prosperity is largely dependent on the efficient functioning of its cities. The reliance of countries on the ability of their cities to perform crucial central functions, for national growth, continues to rise. South Africa has a long-standing network of cities, towns and localities. These have developed and become hierarchised over the course of history during which population settlements and their distribution have been influenced by colonisation, segregation, industrialisation and globalisation. Since 1911, South Africa has undergone an extended phase of intense urban growth, with areas such as Johannesburg, Cape Town and eThekwini (Durban) agglomerating into dominating economic spaces. There are, however, no universally accepted, distinct criteria that constitute the general characteristics of secondary cities. The common assumption is that secondary cities are those cities that find themselves below the apex of what are considered primary cities. Furthermore, internationally, secondary cities appear to be considered as important catalysts for balanced and dispersed economic growth. In the South African context, the notion of what constitutes secondary cities is to a large extent underdeveloped. The aim of the paper is to appraise interconnected regional networks as a differentiated and novel outlook when determining secondary cities in South Africa. What is evident from the paper is that there are different potential alternatives with which to portray secondary cities.

Keywords:

Citation: Andre DW Brand, Johannes E Drewes, Maléne Campbell. Differentiated outlook to portray secondary cities in South Africa[J]. AIMS Geosciences, 2021, 7(3): 457-477. doi: 10.3934/geosci.2021026

Related Papers:

[1]	Xue Jiang, Yihe Gong . Algorithms for computing Gröbner bases of ideal interpolation. AIMS Mathematics, 2024, 9(7): 19459-19472. doi: 10.3934/math.2024948
[2]	Hui Chen . Characterizations of normal cancellative monoids. AIMS Mathematics, 2024, 9(1): 302-318. doi: 10.3934/math.2024018
[3]	Zaffar Iqbal, Xiujun Zhang, Mobeen Munir, Ghina Mubashar . Hilbert series of mixed braid monoid $MB_{2, 2}$ . AIMS Mathematics, 2022, 7(9): 17080-17090. doi: 10.3934/math.2022939
[4]	Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850
[5]	Alessandro Linzi . Polygroup objects in regular categories. AIMS Mathematics, 2024, 9(5): 11247-11277. doi: 10.3934/math.2024552
[6]	Haijun Cao, Fang Xiao . The category of affine algebraic regular monoids. AIMS Mathematics, 2022, 7(2): 2666-2679. doi: 10.3934/math.2022150
[7]	F. Z. Geng . Piecewise reproducing kernel-based symmetric collocation approach for linear stationary singularly perturbed problems. AIMS Mathematics, 2020, 5(6): 6020-6029. doi: 10.3934/math.2020385
[8]	Shoufeng Wang . Projection-primitive $P$ -Ehresmann semigroups. AIMS Mathematics, 2021, 6(7): 7044-7055. doi: 10.3934/math.2021413
[9]	Mohamed Obeid, Mohamed A. Abd El Salam, Mohamed S. Mohamed . A novel generalized symmetric spectral Galerkin numerical approach for solving fractional differential equations with singular kernel. AIMS Mathematics, 2023, 8(7): 16724-16747. doi: 10.3934/math.2023855
[10]	Ahmet Sinan Cevik, Ismail Naci Cangul, Yilun Shang . Matching some graph dimensions with special generating functions. AIMS Mathematics, 2025, 10(4): 8446-8467. doi: 10.3934/math.2025389

Abstract

1. Introduction and preliminaries

The Gröbner basis theory for commutative algebras was introduced by Buchberger ^[2] which provided a solution to the reduction problem for commutative algebras. In ^[3], Bergman generalized this theory to the associative algebras by proving the diamond lemma. On the other hand, the parallel theory of the Gröbner basis was developed for Lie algebras by Shirshov in ^[4]. In ^[5], Bokut noticed that Shirshov's method works for also associative algebras. Hence Shirshov's theory for Lie and their universal enveloping algebras is called the Gröbner-Shirshov basis theory. We may refer the papers ^{[6,7,8,9,10,11,12,13]} for some recent studies over Gröbner-Shirshov bases in terms of algebraic ways, the papers ^[14,15] related to Hilbert series and the paper ^[16] in terms of graph theoretic way. Furthermore citation ^[17] can be used to understand normal forms for the monoid of positive braids by using Gröbner-Shirshov basis.

The word, conjugacy and isomorphism problems (shortly decision problems) have played an important role in group theory since the work of M. Dehn in early 1900's. Among them, especially the word problem has been studied widely in groups (see ^[18]). It is well known that the word problem for finitely presented groups is not solvable in general; that is, given any two words obtained by generators of the group, there may not be an algorithm to decide whether these words represent the same element in this group.

The method Gröbner-Shirshov basis theory gives a new algorithm to obtain normal forms of elements of groups, monoids and semigroups, and hence a new algorithm to solve the word problem in these algebraic structures (see also ^[19], for relationship with word problem for semigroups and ideal membership problem for non-commutative polynomail rings). By considering this fact, our aim in this paper is to find a Gröbner-Shirshov basis of the symmetric inverse monoid in terms of the dex-leg ordering on the related words of symmetric inverse monoids.

Symmetric inverse monoids are partial bijections and they are very well known in combinatorics. Easdown et al. ^[20] studied a presentation for the symmetric inverse monoid $I_n$ . By adding relations $\sigma _1^2$ $= \sigma _2^2$ $= \cdots$ $= \sigma _{n-1}^2 = 1$ into the presentation of the braid group described in terms of Artin's Theorem, it is obtained the well-known Moore presentation for the symmetric group as defined in ^[21]. Using this in the Popova's description ^[22] for the presentation of the symmetric inverse monoid $I_n$ yields the following presentation:

$\begin{eqnarray} I_n = \left\langle {\varepsilon}, \sigma _1, \sigma _2, \cdots, \sigma _{n-1} \right. &;& \left. {\sigma _i}{\sigma _j} = {\sigma _j}{\sigma _i}\: \: \left( {\left| {i - j} \right| \gt 1} \right), \right. \\ && \left. {\sigma _i}{\sigma _{i + 1}}\sigma _{i} = {\sigma _{i + 1}}{\sigma _i}{\sigma _{i+1}}\: \: (1 \leq i \leq n - 2), \right. \\ && \left. \sigma _1^2 = \sigma _2^2 = \cdots = \sigma _{n-1}^2 = 1, \: {\varepsilon ^2} = \varepsilon, \right. \\ && \left. \varepsilon {\sigma _i} = {\sigma _i}\varepsilon \: \: (1 \leq i \leq n - 2), \right. \\ && \left. \varepsilon {\sigma _{n-1}}\varepsilon = {\sigma _{n-1}}\varepsilon {\sigma _{n-1}}\varepsilon = \varepsilon {\sigma _{n-1}}\varepsilon {\sigma _{n-1}} \right\rangle . \end{eqnarray}$

(1.1)

In ^[23], the author has also studied presentations of symmetric inverse and singular part of the symmetric inverse monoids.

2. Gröbner-Shirshov bases and the composition-diamond lemma

Let $k$ be a field and $k\langle X\rangle$ be the free associative algebra over $k$ generated by $X$ . Denote by $X^{\ast}$ the free monoid generated by $X$ , where the empty word is the identity which is denoted by $1$ . For a word $w\in X^{\ast}$ , let us denote the length of $w$ by $|w|$ . Also assume that $X^{\ast}$ is a well ordered monoid. A well-ordering $\leq$ on $X^{\ast }$ is called a monomial ordering if for $u, v\in X^{\ast }$ , we have $u\leq v\Rightarrow w_{1}uw_{2} \leq w_{1}vw_{2}$ , for all $w_{1}, w_{2}\in X^*$ . A standard example of monomial ordering on $X^*$ is the deg-lex ordering, in which two words are compared first by the degree and then lexicographically, where $X$ is a well-ordered set.

Every nonzero polynomial $f\in k\left\langle X\right\rangle$ has the leading word $\overline{f}$ . If the coefficient of $\overline{f}$ in $f$ is equal to $1$ , then $f$ is called monic. The following fundamental materials can be found in ^{[3,5,6,7,8,10,11,12,24]}.

Let $f$ and $g$ be two monic polynomials in $k\langle X\rangle$ . Therefore we have two compositions between $f$ and $g$ as follows:

$1.$ If $w$ is a word such that $w = \overline{f}b = a\overline{g}$ for some $a, b\in X^{\ast }$ with $|\overline{f}|+|\overline{g}| > |w|$ , then the polynomial $(f, g)_{w} = fb-ag$ is called the intersection composition of $f$ and $g$ with respect to $w$ (and denoted by $f\wedge g$ ). In here, the word $w$ is called an ambiguity of the intersection.

$2.$ If $w = \overline{f} = a\overline{g}b$ for some $a, b\in X^{\ast }$ , then the polynomial $(f, g)_{w} = f-agb$ is called the inclusion composition of $f$ and $g$ with respect to $w$ (and denoted by $f\vee g$ ). In this case, the word $w$ is called an ambiguity of the inclusion.

If $g$ is a monic polynomial, $\overline{f} = a\overline{g}b$ and $\alpha$ is the coefficient of the leading term $\overline{f}$ , then the transformation $f\mapsto f-\alpha agb$ is called an elimination of the leading word (ELW) of $g$ in $f$ .

Let $S\subseteq k\left\langle X\right\rangle$ with each $s\in S$ monic. Then the composition $(f, g)_{w}$ is called trivial modulo $(S, w)$ if $(f, g)_{w} = \sum\alpha_{i}a_{i}s_{i}b_{i}$ , where each $\alpha _{i}\in k, \:a_{i}, b_{i}\in X^{\ast }, \:s_{i}\in S$ and $a_{i}\overline{s_{i}}b_{i} < w$ . If this is the case, then we write $(f, g)_{w}\equiv 0\ mod(S, w)$ . In general, for $p, q\in k\langle X\rangle$ , we write $p\equiv q\ mod(S, w)$ which means that $p-q = \sum\alpha_i a_{i}s_{i}b_{i}$ , where each $\alpha _{i}\in k, \:a_{i}, b_{i}\in X^{\ast }, \:s_{i}\in S$ and $a_{i}\overline{s_{i}}b_{i} < w$ .

A set $S$ with the well ordering $\leq$ is called a Gröbner-Shirshov basis for $k\left\langle X\mid S\right\rangle$ if every composition $(f, g)_{w}$ of polynomials in $S$ is trivial modulo $S$ and the corresponding $w$ .

The following lemma was proved by Shirshov ^[4] for free Lie algebras (with deg-lex ordering) in 1962 (^[24]). In 1976, Bokut ^[5] specialized the Shirshov's approach to associative algebras (see also ^[3]). On the other hand, for commutative polynomials, this lemma is known as the Buchberger's Theorem (cf. ^[2,25]).

Lemma 1 (Composition-Diamond Lemma). Let $k$ be a field,

$A = k\left\langle X\mid S\right\rangle = \ k\langle X\rangle / Id(S)$

and $\leq$ a monomial order on $X^{\ast }$ , where $Id(S)$ is the ideal of $k\langle X\rangle$ generated by $S$ . Then the following statements are equivalent:

1. $S$ is a Gröbner-Shirshov basis.

2. $f\in Id(S)\Rightarrow \overline{f} = a\overline{s}b$ for some $s\in S$ and $a, b\in X^{\ast }$ .

3. $Irr(S) = \{u\in X^{\ast }\mid u\neq a\overline{s}b, s\in S, a, b\in X^{\ast }\}$ is a basis of the algebra $A = k\left\langle X\mid S\right\rangle$ .

If a subset $S$ of $k\langle X\rangle$ is not a Gröbner-Shirshov basis, then we can add to $S$ all nontrivial compositions of polynomials of $S$ , and by continuing this process (maybe infinitely) many times, we eventually obtain a Gröbner-Shirshov basis $S^{comp}$ . Such a process is called the Shirshov algorithm.

If $S$ is a set of "semigroup relations" (that is, the polynomials in $S$ are of the form $u-v$ , where $u, v\in X^*$ ), then a nontrivial composition will have the same form. As a result, the set $S^{comp}$ also consists of semigroup relations.

Let $M = sgp\left\langle X\mid S\right\rangle$ be a semigroup presentation. Then $S$ is a subset of $k\langle X\rangle$ and hence one can find a Gröbner-Shirshov basis $S^{comp}$ . The last set does not depend on $k$ , and as mentioned before, it consists of semigroup relations. We will call $S^{comp}$ a Gröbner-Shirshov basis of $M$ . This is the same as a Gröbner-Shirshov basis of the semigroup algebra $kM = k\left\langle X\mid S\right\rangle$ . If $S$ is a Gröbner-Shirshov basis of the semigroup $M = sgp\left\langle X\mid S\right\rangle$ , then $Irr\left(S\right)$ is a normal form for $M$ ^[9,26].

3. A Gröbner-Shirshov basis for the monoid $I_n$

The target of this section is to obtain a Gröbner-Shirshov basis for the symmetric inverse monoid $I_n$ by taking into account the presentation given in (1.1). After that we will indicate the solvability of the word problem over $I_n$ .

By ordering the generators as $\varepsilon > {\sigma _{n - 1}} > {\sigma _{n - 2}} > {\sigma _{n - 3}} > \cdots > {\sigma _2} > {\sigma _1}$ in (1.1), we have the following main result of this paper.

Theorem 2. A Gröbner-Shirshov basis for the symmetric inverse monoid consists of the following relations:

$\begin{eqnarray*} &(1)&\:\sigma _i^2 = 1\:(1 \leq i \leq n - 1), \qquad\qquad\qquad (2)\:{\sigma _i}{\sigma _j} = {\sigma _j}{\sigma _i}\:\left( {\left| {i - j} \right| \gt 1} \right), \\ &(3)&\:{\varepsilon ^2} = \varepsilon, \qquad\qquad\qquad\qquad\qquad\:\qquad (4)\:\varepsilon {\sigma _i} = {\sigma _i}\varepsilon \:(1 \leq i \leq n - 2), \\ &(5)&\:{\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}{\sigma _{i + 1}} = {\sigma _i}{\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\, \sigma _1^{{M_1}}\\ &&(1 \leq i \leq n - 2, \:{M_k} = \left\{ {0, 1} \right\}\, \left( {1 \leq k \leq i - 1\, } \right)), \\ &(6)&\:{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon \, \, \, ({P_k} = \left\{ {0, 1} \right\}\, \, \left( {1 \leq k \leq n - 2} \right)), \\ &(7)&\:{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon = \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \: (j \gt i, \, 1 \leq i \leq n - 3, \, \, \, 2 \leq j \leq n - 2, \, {Q_{{k_1}}}, {\varphi _{{k_2}}} = \left\{ {0, 1} \right\}\\ &&\left( {i \leq {k_1} \leq n - 3, \, j \leq {k_2} \leq n - 2} \right)), \\ &(7')&\:{\sigma _{n - p}}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon = \\ && \varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots \sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon \\ &&(2 \lt p \lt n, \:r = \left\{ {0, 1} \right\}, \:s\geq \cdots \geq j \geq i, \, 1 \leq i \leq n - 3, \, \, \, 2 \leq j, s \leq n - 2, \\ &&{Q_{{k_1}}}, {\varphi _{{k_2}}}, {\lambda _{{k_3}}} = \left\{ {0, 1} \right\}\: \left( {i \leq {k_1} \leq n - 4, \, j \leq {k_2} \leq n - 3, \, s \leq {k_3} \leq n - 2} \right)), \\ &(8)&\:\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}} = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon \sigma _{n - 1}^{{L_{n - 1}}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\\ &&\sigma _{n - t + 1}^{{L_{n - t + 1}}}\:(2 \leq t \leq n - 1, \:{L_k} = \left\{ {0, 1} \right\}\, \, \left( {1 \leq k \leq n - 1} \right)), \\ &(9)&\:{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\cdots\sigma _1^{{U_1}})(\sigma _{(n - k) + 2}^{{V_{(n - k) + 2}}}\sigma _{(n - k) + 1}^{{V_{(n - k) + 1}}}\cdots\sigma _1^{{V_1}})\cdots(\sigma _{n - 1}^{{S_{n - 1}}}\sigma _{n - 2}^{{S_{n - 2}}}\cdots\sigma _1^{{S_1}})\\ &&(\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\cdots\sigma _1^{{T_1}})\varepsilon = ({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) + 1}^{{U_{(n - k) + 1}}}\cdots\sigma _1^{{U_1}})(\sigma _{(n - k) + 2}^{{V_{(n - k) +2}}}\sigma _{(n - k) + 1}^{{V_{(n - k) + 1}}}\cdots\sigma _1^{{V_1}})\cdots\\ &&(\sigma _{n - 1}^{{S_{n - 1}}}\sigma _{n - 2}^{{S_{n - 2}}}\cdots\sigma _1^{{S_1}})(\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\cdots\sigma _1^{{T_1}})\varepsilon\\ &&(2 \leq k \leq n - 1, \:{U_{{k_1}}}, {V_{{k_2}}}, {S_{{k_3}}}, {T_{{k_4}}} = \left\{ {0, 1} \right\}\\ &&\left( {1 \leq {k_1} \leq (n - k) - 1, \:1 \leq {k_2} \leq (n - k) + 2}, \: {1 \leq {k_3} \leq n - 1}, \:{1 \leq {k_4} \leq n - 2})\right), \\ &(10)&\:{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\cdots\sigma _1^{{X_1}})(\sigma _{(n - k) + 2}^{{Y_{(n - k) + 2}}}\sigma _{(n - k) + 1}^{{Y_{(n - k) + 1}}}\cdots\sigma _1^{{Y_1}})\cdots(\sigma _{n - 2}^{{Z_{n - 2}}}\sigma _{n - 3}^{{Z_{n - 3}}}\cdots\sigma _1^{{Z_1}})\\ &&(\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}) (\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}})\varepsilon = ({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\cdots\sigma _1^{{X_1}})(\sigma _{(n - k) + 2}^{{Y_{(n - k) + 2}}}\\ &&\sigma _{(n - k) + 1}^{{Y_{(n - k) + 1}}}\cdots\sigma _1^{{Y_1}})\cdots(\sigma _{n - 2}^{{Z_{n - 2}}}\sigma _{n - 3}^{{Z_{n - 3}}}\cdots\sigma _1^{{Z_1}}) (\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}})(\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}})\varepsilon \\ &&(j \gt i, \:1 \leq i \leq n - 2, \:2 \leq j \leq n - 2, \:3 \leq k \leq n -1, \:{X_{{k_1}}}, {Y_{{k_2}}}, {Z_{{k_3}}}, {W_{{k_4}}}, {R_{{k_5}}} = \left\{ {0, 1} \right\}\\ &&({1 \leq {k_1} \leq (n - k) - 1, \:1 \leq {k_2} \leq (n - k) + 2, \:1 \leq {k_3} \leq n - 2, \:1 \leq {k_4} \leq n - 3, \:1 \leq {k_5} \leq n - 2}). \end{eqnarray*}$

We also have the following additional conditions.

● For the relation $(5)$ : For $1\leq k < i-1$ , to take $M_k = 1$ it is necessary $M_{k+1} = 1$ .

● For the relation $(6)$ : For $1\leq k < n-2$ , to take $P_k = 1$ it is necessary $P_{k+1} = 1$ .

● For the relation $(7)$ : For $i\leq k < n-3$ , to take $Q_k = 1$ it is necessary $Q_{k+1} = 1$ .

For $j\leq k < n-2$ , to take $\varphi_k = 1$ it is necessary $\varphi_{k+1} = 1$ .

● For the relation $(7')$ : For $i\leq k < n-4$ , to take $Q_k = 1$ it is necessary $Q_{k+1} = 1$ .

For $j\leq k < n-3$ , to take $\varphi_k = 1$ it is necessary $\varphi_{k+1} = 1$ .

For $s\leq k < n-2$ , to take $\lambda_k = 1$ it is necessary $\lambda_{k+1} = 1$ .

● For the relation $(8)$ : For $n-t\leq k < n-2$ , to take $L_k = 1$ it is necessary $L_{k+1} = 1$ .

● For the relation $(9)$ : For $1\leq t < (n-k)-1$ , to take $U_t = 1$ it is necessary $U_{t+1} = 1$ .

For $1\leq t < (n-k)+2$ , to take $V_t = 1$ it is necessary $V_{t+1} = 1$ .

For $1\leq t < n-1$ , to take $S_t = 1$ it is necessary $S_{t+1} = 1$ .

For $1\leq t < n-2$ , to take $T_t = 1$ it is necessary $T_{t+1} = 1$ .

● For the relation $(10)$ : For $1\leq t < (n-k)-1$ , to take $X_t = 1$ it is necessary $X_{t+1} = 1$ .

For $1\leq t < (n-k)+2$ , to take $Y_t = 1$ it is necessary $Y_{t+1} = 1$ .

For $1\leq t < n-2$ , to take $Z_t = 1$ it is necessary $Z_{t+1} = 1$ .

For $i\leq t < n-3$ , to take $W_t = 1$ it is necessary $W_{t+1} = 1$ .

For $j\leq t < n-2$ , to take $R_t = 1$ it is necessary $R_{t+1} = 1$ .

Proof. Relations given for $I_n$ in (1.1) provide relations among (1)–(10). Now we need to prove that all compositions among relations (1)–(10) are trivial. To do that, firstly, we consider intersection compositions of these relations. Hence we have the following ambiguties $w$ :

$\begin{eqnarray*} &(1) \wedge (1)&:\:w = \sigma _i^3\:\:(1 \leq i \leq n - 1), \qquad\quad(1) \wedge (2)\::w = \sigma _i^2{\sigma _j}\:\:(\left| {i - j} \right| \gt 1), \\ &(1) \wedge (5)&:w = \sigma _{i + 1}^2{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}\, {\sigma _{i + 1}}\:\:(1 \leq i \leq n - 2), \\ &(1) \wedge (6)&:w = \sigma _{n - 1}^2\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(1) \wedge (7)&:w = \sigma _{n - 2}^2\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\, \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon, \\ &(1) \wedge (7')&:w = \sigma _{n - p}^2\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon, \\ &(1) \wedge (9)&:w = \sigma _{n - k}^2({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon, \\ &(1) \wedge (10)&:w = \sigma _{n - k}^2({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\\ &&\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\sigma _{n - 3}^{{R_{n - 3}}}\cdots\sigma _j^{{R_j}}\varepsilon\: \:(j \gt i), \end{eqnarray*}$

$\begin{eqnarray*} &(2) \wedge (1)&:w = {\sigma _i}\, \sigma _j^2\:\:(\left| {i - j} \right| \gt 1), \\ &(2) \wedge (2)&:w = {\sigma _i}\, {\sigma _j}\, {\sigma _k}\:\:(\left| {i - j} \right| \gt 1, \left| {j - k} \right| \gt 1), \\ &(2) \wedge (5)&:w = {\sigma _i}{\sigma _{j + 1}}{\sigma _j}\sigma _{j - 1}^{{M_{j - 1}}}\cdots\sigma _1^{{M_1}}\, {\sigma _{j + 1}}\:\:\, (\, \left| {i - (j + 1) \gt 1} \right|), \\ &(2) \wedge (7')&:w = \sigma_i\sigma _{n - p}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon\quad (\, \left| {i - (n-p) \gt 1} \right|), \\ &(2) \wedge (9)&:w = {\sigma _i}{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}..\, \, \sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon\\ &&(\left| {i - (n - k) \gt 1} \right|), \\ &(2) \wedge (10)&:w = {\sigma _i}{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\\ &&\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\sigma _{n - 3}^{{R_{n - 3}}}\cdots\sigma _j^{{R_j}}\varepsilon \:\:(j \gt i, \left| {i - (n - k) \gt 1} \right|), \end{eqnarray*}$

$\begin{eqnarray*} &(3) \wedge (3)&:\, w = {\varepsilon ^3}, \qquad (3) \wedge (4):\, w = {\varepsilon ^2}{\sigma _i}\:\:(1 \leq i \leq n - 2), \\ &(3) \wedge (8)&:\, w = {\varepsilon ^2}{\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\, \sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\, \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\, \sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}, \end{eqnarray*}$

$\begin{eqnarray*} &(4) \wedge (1)&:\, w = \varepsilon \sigma _i^2\:\:\:(1 \leq i \leq n - 2), \qquad\:(4) \wedge (2):\, w = \varepsilon {\sigma _i}{\sigma _j}\, \, \, (\left| {i - j} \right| \gt 1), \\ &(4) \wedge (5)&:\, w = \varepsilon {\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\sigma _{i - 2}^{{M_{i - 2}}}\cdots\sigma _1^{{M_1}}{\sigma _{i + 1}}\:\:(1 \leq i \leq n - 3), \\ &(4) \wedge (7)&:w = \varepsilon {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\, \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon, \\ &(4) \wedge (7')&:w = \varepsilon\sigma _{n - p}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon, \\ &(4) \wedge (9)&:w = \varepsilon {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon, \\ &(4) \wedge (10)&:w = \varepsilon {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon\\ &&{\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\sigma _{n - 3}^{{R_{n - 3}}}\cdots\sigma _j^{{R_j}}\varepsilon, \end{eqnarray*}$

$\begin{eqnarray*} &(5) \wedge (1)&:w = {\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}\sigma _{i + 1}^2\:\:(1 \leq i \leq n - 2), \\ &(5) \wedge (2)&:w = {\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}{\sigma _{i + 1}}{\sigma _j}\:\:(\left| {i + 1 - j} \right| \gt 1), \\ &(5) \wedge (5)&:w = {\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}\, {\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}\, {\sigma _{i + 1}}\:\:(1 \leq i \leq n - 2), \\ &(5) \wedge (6)&:w = {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{M_{n - 3}}}\sigma _{n - 4}^{{M_{n - 4}}}\cdots\sigma _1^{{M_1}}\, {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\, \varepsilon, \\ &(5) \wedge (7)&:w = {\sigma _{n - 2}}{\sigma _{n - 3}}\sigma _{n - 4}^{{M_{n - 4}}}\sigma _{n - 5}^{{M_{n - 5}}}\cdots\sigma _1^{{M_1}}\, {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\cdots\sigma _i^{{Q_i}}\, \varepsilon {\sigma _{n - 1}} \sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \\ &&(j \gt i), \\ &(5) \wedge (7')&:w = {\sigma _{n - p}}{\sigma _{n-p-1}}\sigma _{n-p-2}^{{M_{n - p -2}}}\cdots\sigma _1^{{M_1}}\, \sigma _{n - p}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon\cdots {\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon, \\ &(5) \wedge (9)&:w = {\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{M_{(n - k) - 2}}}\sigma _{(n - k) - 3}^{{M_{(n - k) - 3}}}\cdots\sigma _1^{{M_1}}({\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon \\ &&{\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon, \\ &(5) \wedge (9)&:w = {\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{M_{(n - k) - 2}}}\sigma _{(n - k) - 3}^{{M_{(n - k) - 3}}}\cdots\sigma _1^{{M_1}}{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\\ &&\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon, \\ &(5) \wedge (10)&:w = {\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{M_{(n - k) - 2}}}\cdots\sigma _1^{{M_1}}{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\\ &&\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\sigma _{n - 3}^{{R_{n - 3}}}\cdots\sigma _j^{{R_j}}\varepsilon \:\:(j \gt i), \\ &(5) \wedge (10)&:w = {\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{M_{(n - k) - 2}}}\cdots\sigma _1^{{M_1}}{\sigma _{n - k}}{\sigma _{(n - k) - 1}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}}\\ &&\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\sigma _{n - 3}^{{R_{n - 3}}}\cdots\sigma _j^{{R_j}}\varepsilon \:\:(j \gt i), \end{eqnarray*}$

$\begin{eqnarray*} &(6) \wedge (3)&:w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\, {\varepsilon ^2}, \\ &(6) \wedge (4)&:w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon {\sigma _i}\:\:(1 \leq i \leq n - 2), \\ &(6) \wedge (6)&:\, w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\, \sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(6) \wedge (7)&:\, w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \:\:(j \gt i), \\ &(6) \wedge (8)&:\, w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\, \sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\, \sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}, \\ &(6) \wedge (8)&:\, w = {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{n-t}^{{P_{n-t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{n - t}^{{P_{n - t}}}, \end{eqnarray*}$

$\begin{eqnarray*} &(7) \wedge (3)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\cdots\sigma _i^{{Q_i}}\, \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}{\varepsilon ^2}\:\:(j \gt i), \\ &(7) \wedge (4)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon {\sigma _t}, \\ &&(j \gt i, \:1 \leq i \leq n - 2, \:2 \leq j \leq n - 2, \:1 \leq t \leq n - 2), \\ &(7) \wedge (6)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon\: \:(1 \leq i \leq n - 2), \\ &(7) \wedge (7)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon{\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon\:\:(j \gt i, \:1 \leq i \leq n - 3, \:2 \leq j \leq n - 2), \\ &(7) \wedge (8)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\:\: (j \gt i, \:1 \leq i \leq n - 2, \:2 \leq j \leq n - 2), \\ &(7) \wedge (8)&:w = {\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{Q_{n - 2}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}, \\ &(7') \wedge (7')&:w = {\sigma _{n - p}}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{\phi _{n - 2}}}\cdots\sigma _p^{{\phi _p}}\varepsilon, \\ &(7')\wedge (8)&:\, w = {\sigma _{n - p}}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}, \\ &(7')\wedge (8)&:\, w = {\sigma _{n - p}}\varepsilon^r {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}, \end{eqnarray*}$

$\begin{eqnarray*} &(8) \wedge (1)&:\, w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots{(\sigma _{n - t}^{{L_{n - t}}})^2}, \\ &(8) \wedge (2)&:\, w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}{\sigma _j}\:\:(\left| {n - t - j} \right| \gt 1), \\ &(8) \wedge (5)&:\, w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}{\sigma _{(n - t) - 1}}\sigma _{(n - t) - 2}^{{M_{(n - t) - 2}}}\cdots\sigma _1^{{M_1}}\\ &&{\sigma _{n - t}}\:\:(1 \leq t \leq n - 2), \\ &(8) \wedge (6)&:\, w = \varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(8) \wedge (6)&:\, w = \varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(8) \wedge (7)&:w = \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \:\:(j \gt i), \\ &(8) \wedge (7)&:w = \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \:\:(j \gt i), \\ &(8) \wedge (7')&:w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon^r {\sigma _{n - 1}}\\ &&{\sigma _{n - 2}}\sigma _{n - 3}\sigma _{n-4}^{{Q_{n-4}}}\cdots\sigma _i^{{Q_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon, \\ &(8) \wedge (7')&:w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}\sigma _{n - 4}^{{L_{n - 4}}}\cdots\sigma _{n - t}^{{L_{n - t}}} \varepsilon{\sigma _{n - 1}}\\ && {\sigma _{n - 2}}\sigma _{n-3}^{{\varphi _{n-3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \cdots {\sigma _{n - 1}}\sigma _{n - 2}^{{\lambda _{n - 2}}}\cdots\sigma _s^{{\lambda _s}}\varepsilon, \\ &(8) \wedge (8)&:w = \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}, \\ &(8) \wedge (9)&:w = \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\cdots{\sigma _{n - k}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\cdots{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\\ &&\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\cdots\sigma _1^{{T_1}}\varepsilon, \\ &(8) \wedge (10)&:w = \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\cdots{\sigma _{n - k}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\cdots{\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\cdots\sigma _1^{{X_1}})\\ &&\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\varepsilon \:\:(j \gt i), \end{eqnarray*}$

$\begin{eqnarray*} &(9) \wedge (3)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}{\varepsilon ^2}, \\ &(9) \wedge (4)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon {\sigma _i}\\ &&(1 \leq i \leq n - 2), \\ &(9) \wedge (6)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots(\sigma _{n - 1}^{S_{n - 1}}\sigma _{n - 2}^{{S_{n - 2}}}\sigma _{n - 3}^{{S_{n - 3}}}\cdots\sigma _1^{{S_1}})\varepsilon \\ &&{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\sigma _{n - 3}^{{P_{n - 3}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(9) \wedge (7)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots(\sigma _{n - 1}^{{S_{n - 1}}}\sigma _{n - 2}^{{S_{n - 2}}}\sigma _{n - 3}^{{S_{n - 3}}}\cdots\sigma _1^{{S_1}})\varepsilon\\ && {\sigma _{n - 1}}{\sigma _{n - 2}}\varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\sigma _{n - 4}^{{Q_{n - 4}}}\cdots\sigma _i^{{Q_i}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon\: \:(j \gt i), \\ &(9) \wedge (7)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\sigma _{n - 1}^{{S_{n - 1}}}\sigma _{n - 2}^{{S_{n - 2}}}\varepsilon\\ && {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _i^{{Q_i}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\sigma _{n - 3}^{{\varphi _{n - 3}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon\: \:(j \gt i), \\ &(9) \wedge (8)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon\\ &&{\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\sigma _{n - 3}^{{L_{n - 3}}}\cdots\sigma _{n - t}^{{L_{n - t}}}, \\ &(9) \wedge (8)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{U_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{U_{(n - k) - 2}}}\cdots\sigma _1^{{U_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}\varepsilon\\ &&{\sigma _{n - 1}}\sigma _{n - 2}^{{T_{n - 2}}}\sigma _{n - 3}^{{T_{n - 3}}}\cdots\sigma _1^{{T_1}}, \end{eqnarray*}$

$\begin{eqnarray*} &(10) \wedge (3)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon{\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}{\varepsilon ^2}\:\:(j \gt i), \\ &(10) \wedge (4)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\varepsilon {\sigma _t}\:\:(1 \leq t \leq n - 2), \\ &(10) \wedge (6)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon{\sigma _{n - 1}}\\ &&\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon, \\ &(10) \wedge (7)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\\ &&{\sigma _{n - 2}} \varepsilon {\sigma _{n - 1}}{\sigma _{n - 2}}\sigma _{n - 3}^{{Q_{n - 3}}}\cdots\sigma _t^{{Q_t}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{\varphi _{n - 2}}}\cdots\sigma _j^{{\varphi _j}}\varepsilon \:\:(j \gt t), \\ &(10) \wedge (7')&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\\ &&{\sigma _{n - 2}}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{S_{n - 2}}}\cdots\sigma _l^{{S_l}}\varepsilon \:\:(l \gt j \gt i), \\ &(10) \wedge (8)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\varepsilon {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{L_{n - 2}}}\cdots\sigma _{n - t}^{{L_{n - t}}}\:\:(j \gt i), \\ &(10) \wedge (8)&:w = {\sigma _{n - k}}({\sigma _{(n - k) + 1}}{\sigma _{n - k}}\sigma _{(n - k) - 1}^{{X_{(n - k) - 1}}}\sigma _{(n - k) - 2}^{{X_{(n - k) - 2}}}\cdots\sigma _1^{{X_1}})\cdots\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}\sigma _{n - 3}^{{W_{n - 3}}}\cdots\sigma _i^{{W_i}}\varepsilon {\sigma _{n - 1}}\\ &&\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{R_{n - 2}}}\cdots\sigma _j^{{R_j}}\:\:(j \gt i), \end{eqnarray*}$

All these ambiguities are trivial. Let us show some of them as in the following.

$\begin{eqnarray*} (1)\wedge(5):w& = &\sigma _{i + 1}^2{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}, \:(1 \leq i \leq n - 2), \\ (f, g)_{w}& = &(\sigma _{i+1}^2-1){\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}} \\ & & -{\sigma _{i + 1}}({\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\sigma _1^{{M_1}}{\sigma _{i + 1}}-{\sigma _i}{\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\, \sigma _1^{{M_1}})\\ & = &\sigma _{i + 1}^2{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}-{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}\\ && - \sigma _{i + 1}^2{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}+{\sigma _{i + 1}}{\sigma _i}{\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\, \sigma _1^{{M_1}} \end{eqnarray*}$

$\begin{eqnarray*} & = &{\sigma _{i + 1}}{\sigma _i}{\sigma _{i + 1}}{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots\, \sigma _1^{{M_1}}-{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}\\ &\equiv&{\sigma _i}{\sigma _{i+1}}{\sigma _i}^{2}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}-{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}\\ &\equiv&{\sigma _i}{\sigma _{i+1}}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}-{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}\\ &\equiv& {\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}-{\sigma _i}\sigma _{i - 1}^{{M_{i - 1}}}\cdots \sigma _1^{{M_1}}{\sigma _{i + 1}}\\ &\equiv& 0\:\: mod(S, w). \end{eqnarray*}$

$\begin{eqnarray*} (2)\wedge(2):w& = &{\sigma _i}{\sigma _j}{\sigma _k}\:(\left| {i - j} \right| \gt 1, \left| {j - k} \right| \gt 1), \\ (f, g)_{w}& = &({\sigma _i}{\sigma _j}-{\sigma _j}{\sigma _i}){\sigma _k}-{\sigma _i}({\sigma _j}{\sigma _k}-{\sigma _k}{\sigma _j})\\ & = &{\sigma _i}{\sigma _j}{\sigma _k}-{\sigma _j}{\sigma _i}{\sigma _k}-{\sigma _i}{\sigma _j}{\sigma _k}+{\sigma _i}{\sigma _k}{\sigma _j}\\ & = &{\sigma _i}{\sigma _k}{\sigma _j}-{\sigma _j}{\sigma _i}{\sigma _k}\\ &\equiv& {\sigma _k}{\sigma _i}{\sigma _j}-{\sigma _j}{\sigma _k}{\sigma _i}\\ &\equiv&{\sigma _k}{\sigma _j}{\sigma _i}-{\sigma _k}{\sigma _j}{\sigma _i}\\ &\equiv& 0\:\:mod(S, w). \end{eqnarray*}$

$\begin{eqnarray*} (6)\wedge(4):w& = &{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon {\sigma _i}\:(1 \leq i \leq n - 2), \\ (f, g)_{w}& = &({\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon - \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon){\sigma _i}\\ && -{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}(\varepsilon{\sigma _i}-{\sigma _i}\varepsilon) \\ & = &{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon {\sigma _i}-\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon{\sigma _i}\\ && -{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon {\sigma _i}+{\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}{\sigma _i}\varepsilon \\ & = & {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}{\sigma _i}\varepsilon-\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}\varepsilon{\sigma _i} \\ &\equiv& {\sigma _{n - 1}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots \sigma _{i-1}^{{P_{i-1}}}\sigma _i^{{P_i}}\sigma _{i-1}^{{P_{i-1}}}\cdots\sigma _1^{{P_1}}\varepsilon- \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i}^{{P_{i}}}\cdots\sigma _1^{{P_1}}{\sigma _i}\varepsilon \\ &\equiv& \sigma _{i-1}^{{P_{i-1}}} {\sigma _{n - 1}}\varepsilon{\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon - \varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _{i-1}^{{P_{i-1}}}\sigma _{i}^{{P_{i}}}\sigma _{i-1}^{{P_{i-1}}}\cdots\sigma _1^{{P_1}}\varepsilon \\ &\equiv& \sigma _{i-1}^{{P_{i-1}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon - \sigma _{i-1}^{{P_{i-1}}}\varepsilon {\sigma _{n - 1}}\sigma _{n - 2}^{{P_{n - 2}}}\cdots\sigma _1^{{P_1}}\varepsilon\\ &\equiv& 0\:\: mod(S, w). \end{eqnarray*}$

It is seen that there are no any inclusion compositions among relations (1)–(10). This ends up the proof.

As a consequence of Lemma 1 and Theorem 2, we have the following result.

Corollary 3. Let $C(u)$ be a normal form of a word $u\in I_{n}$ . Then $C(u)$ is of the form

$\begin{eqnarray*} {W_1}{\varepsilon ^{{k_1}}}{W_2}{\varepsilon ^{{k_2}}}\cdots{W_n}{\varepsilon ^{{k_n}}}\, , \end{eqnarray*}$

where ${{k_p} = \left\{ {0, 1} \right\}}$ $(1 \leq p \leq n)$ . In this above expression,

● if ${k_p} = 1\, \, \left({1 \leq p \leq n - 1} \right)$ then the word ${W_{p\, + 1\, }}$ which begins with ${\sigma _{n - 1}}$ and generated by $\sigma _i$ $(1 \leq i \leq n - 1)$ is actually a reduced word. Moreover the word ${W_{1}}$ generated by $\sigma _i$ $(1 \leq i \leq n - 1)$ is an arbitrary reduced word.

● if ${k_p} = 0\, \, \left({1 \leq p \leq n - 1} \right)$ then the word $W_pW_{p+1}$ is also reduced.

In addition, subwords of the forms $W_i\varepsilon^{k_i}W_{i+1}\varepsilon^{k_{i+1}}$ $\left({1 \leq i \leq n - 1} \right)$ , $W_j\varepsilon^{k_j}W_{j+1}\varepsilon^{k_{j+1}}W_{j+2}\varepsilon^{k_{j+2}}$ $\left({1 \leq j \leq n - 2} \right)$ , $W_r\varepsilon^{k_r}W_{r+1}\varepsilon^{k_{r+1}}W_{r+2}\varepsilon^{k_{r+2}}W_{r+3}\varepsilon^{k_{r+3}}$ $\left({1 \leq r \leq n - 3} \right)$ and $\varepsilon^{k_s}W_{s+1}\varepsilon^{k_{s+1}}W_{s+2}$ $\left({1 \leq s \leq n - 2} \right)$ must be reduced.

By Corollary 3, we can say that the word problem is solvable for symmetric inverse monoid $I_{n}$ .

Remark 4. We note that if we change the orderings on words we find another Gröbner-Shirshov bases related to chosen orederings. Thus we get normal form for given algebraic structure depending on ordering. To get this normal form it is used third item of Composition-Diamond Lemma. It is known that to get normal form structure implies solvability of the word problem. If one can not obtain a Gröbner-Shirshov basis according to chosen ordering on words, this does not mean that the word problem is not solvable.

4. An application

As an application of Theorem 2, we will give the following Example 5 which describes a Gröbner-Shirshov basis for the symmetric inverse monoid $I_4$ . The accuracy and efficiency of this example can be seen by " $GBNP$ package in GAP ^[1] which computes Gröbner bases of non-commutative polynomials as follows.

$\mathtt{gap \gt \ LoadPackage("GBNP",\ "0",\ {\bf{false}});}\\ \mathtt{{\bf{true}}}\\ \mathtt{gap \gt \ SetInfoLevel(InfoGBNP,\ 1);}\\ \mathtt{gap \gt \ SetInfoLevel(InfoGBNPTime,\ 1);}\\ \mathtt{gap \gt \ A: =\ FreeAssociativeAlgebraWithOne(Rationals,\ "s1",\ "s2",\ "s3",\ "e");}\\ \mathtt{ \lt algebra-with-one\ over\ Rationals,\ with\ 4\ generators \gt }\\ \mathtt{gap \gt \ g: =\ GeneratorsOfAlgebra(A);}\\ \mathtt{[\ (1)^{*} \lt identity\ ... \gt ,\ (1)^{*}s1,\ (1)^{*}s2,\ (1)^{*}s3,\ (1)^{*}e\ ]}\\ \mathtt{gap \gt \ s1: =\ g[2];;s2: =\ g[3];;s3: =\ g[4];;e: =\ g[5];;o: =\ g[1];}\\ \mathtt{(1)^{*} \lt identity\ ... \gt }\\ \mathtt{gap \gt \ GBNP.ConfigPrint(A);}\\ \mathtt{gap \gt \ twosidrels: =\ [s1} \wedge \mathtt{2-o,\ s2} \wedge \mathtt{2-o,\ s3} \wedge \mathtt{2-o,\ (s1^{*}s2)} \wedge \mathtt{3-o,\ (s2^{*}s3)} \wedge \mathtt{3-o,\ (s1^{*}s3)} \wedge \mathtt{2-o,}\\ \mathtt{e} \wedge \mathtt{2-e,\ s1^{*}e-e^{*}s1,\ s2^{*}e-e^{*}s2,\ e^{*}s3^{*}e-(e^{*}s3)} \wedge \mathtt{2,\ e^{*}s3^{*}e-(s3^{*}e)} \wedge \mathtt{2];}\\ \mathtt{[\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}s1} \wedge \mathtt{2,\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}s2} \wedge \mathtt{2,}\\ \mathtt{(-1)^{*} \lt identity\ ... \gt +(1)^{*}s3} \wedge \mathtt{2,\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}(s1^{*}s2)} \wedge \mathtt{3,}\\ \mathtt{(-1)^{*} \lt identity\ ... \gt +(1)^{*}(s2^{*}s3)} \wedge \mathtt{3,\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}(s1^{*}s3) \wedge 2,}\\ \mathtt{(-1)^{*}e+(1)^{*}e} \wedge \mathtt{2,\ (1)^{*}s1^{*}e+(-1)^{*}e^{*}s1,\ (1)^{*}s2^{*}e+(-1)^{*}e^{*}s2,}\\ \mathtt{(1)^{*}e^{*}s3^{*}e+(-1)^{*}(e^{*}s3)} \wedge \mathtt{2,\ (1)^{*}e^{*}s3^{*}e+(-1)^{*}(s3^{*}e)} \wedge \mathtt{2\ ]}\\ \mathtt{gap \gt \ prefixrels: =\ [e,\ s1-o,\ s2-o,\ s3^{*}e-s3];}\\ \mathtt{[\ (1)^{*}e,\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}s1,\ (-1)^{*} \lt identity\ ... \gt +(1)^{*}s2,\ (-1)^{*}s3+(1)^{*}s3^{*}e\ ]}\\ \mathtt{gap \gt \ PrintNPList(GBR.ts);}\\ \mathtt{s1} \wedge \mathtt{2\ -\ 1}\\ \mathtt{s2}\mathtt{\wedge\ 2\ -\ 1}\\ \mathtt{s3s1\ -\ s1s3}\\ \mathtt{s3}\mathtt{\wedge\ 2\ -\ 1}\\ \mathtt{es1\ -\ s1e}\\ \mathtt{es2\ -\ s2e}\\ \mathtt{e} \wedge \mathtt{2\ -\ e}\\ \mathtt{s2s1s2\ -\ s1s2s1}\\ \mathtt{s3s2s3\ -\ s2s3s2}\\ \mathtt{s3s2s1s3\ -\ s2s3s2s1}\\ \mathtt{s3es3e\ -\ es3e}\\ \mathtt{es3es3\ -\ es3e}\\ \mathtt{s3es3s2e\ -\ es3s2e}\\ \mathtt{s2s3s2es3e\ -\ s3s2es3e}\\ \mathtt{s3es3s2s1e\ -\ es3s2s1e}\\ \mathtt{es3s2es3s2\ -\ es3s2es3}\\ \mathtt{s2s3s2s1es3e\ -\ s3s2s1es3e}\\ \mathtt{s2s3s2es3s2e\ -\ s3s2es3s2e}\\ \mathtt{s2es3s2es3e\ -\ es3s2es3e}\\ \mathtt{s1s2s1s3s2es3e\ -\ s2s1s3s2es3e}\\ \mathtt{s2s3s2s1es3s2e\ -\ s3s2s1es3s2e}\\ \mathtt{s2s3s2es3s2s1e\ -\ s3s2es3s2s1e}\\ \mathtt{s2es3s2s1es3e\ -\ es3s2s1es3e}\\ \mathtt{es3s2s1es3s2s1\ -\ es3s2s1es3s2}\\ \mathtt{s1s2s1s3s2s1es3e\ -\ s2s1s3s2s1es3e}\\ \mathtt{s1s2s1s3s2es3s2e\ -\ s2s1s3s2es3s2e}\\ \mathtt{s1s2s1es3s2es3e\ -\ s2s1es3s2es3e}\\ \mathtt{s2s3s2s1es3s2s1e\ -\ s3s2s1es3s2s1e}\\ \mathtt{s2es3s2s1es3s2e\ -\ es3s2s1es3s2e}\\ \mathtt{s1s2s1s3s2s1es3s2e\ -\ s2s1s3s2s1es3s2e}\\ \mathtt{s1s2s1s3s2es3s2s1e\ -\ s2s1s3s2es3s2s1e}\\ \mathtt{s1s2s1es3s2s1es3e\ -\ s2s1es3s2s1es3e}\\ \mathtt{s1s3s2s1es3s2es3e\ -\ s3s2s1es3s2es3e}\\ \mathtt{s1s2s1s3s2s1es3s2s1e\ -\ s2s1s3s2s1es3s2s1e}\\ \mathtt{s1s2s1es3s2s1es3s2e\ -\ s2s1es3s2s1es3s2e}\\ \mathtt{s1s3s2s1es3s2s1es3e\ -\ s3s2s1es3s2s1es3e}\\ \mathtt{s1es3s2s1es3s2es3e\ -\ es3s2s1es3s2es3e}\\ \mathtt{s1s3s2s1es3s2s1es3s2e\ -\ s3s2s1es3s2s1es3s2e}$

We note that by $GBNP$ package program one can compute Gröbner-Shirshov basis of symmetric inverse monoids for small sizes, for example $I_4$ and $I_5$ . But there are no any other computer programs that compute a Gröbner-Shirshov basis for general size of symmetric inverse monoids. For this reason, it is worth to study and obtain a Gröbner-Shirshov basis for this important structure.

Example 5. The presentation of $I_4$ is as follows.

$\begin{eqnarray*} \left\langle {\varepsilon}, \sigma _1, \sigma _2, \sigma _{3} \right. &;& \left. \sigma _1^2 = \sigma _2^2 = \sigma _{3}^2 = 1, \: {\sigma _3}{\sigma _1} = {\sigma _1}{\sigma _3}, \:{\varepsilon ^2} = \varepsilon, \:\varepsilon {\sigma _1} = {\sigma _1}\varepsilon, \:\varepsilon {\sigma _2} = {\sigma _2}\varepsilon, \right.\\ && \left.{\sigma _3}{\sigma _{2}}\sigma _{3} = {\sigma _{2}}{\sigma _3}{\sigma _{2}}, {\sigma _2}{\sigma _{1}}\sigma _{2} = {\sigma _{1}}{\sigma _2}{\sigma _{1}}, \:{\sigma _{3}}\varepsilon {\sigma _{3}}\varepsilon = \varepsilon {\sigma _{3}}\varepsilon, \:\varepsilon {\sigma _{3}}\varepsilon{\sigma _{3}} = \varepsilon {\sigma _{3}}\varepsilon \right\rangle . \end{eqnarray*}$

We use deg-lex order induced by $\sigma _1 < \sigma _2 < \sigma _{3} < \varepsilon$ . By this ordering, a Gröbner-Shirshov basis for symmetric inverse monoid $I_4$ consists of the following $38$ relations.

$\begin{eqnarray*} &(1)&\:\sigma _1^2 = 1, \:\:\: \sigma _2^2 = 1, \:\:\: \sigma _{3}^2 = 1, \\ &(2)&\:{\sigma _3}{\sigma _1} = {\sigma _1}{\sigma _3}, \\ &(3)&\:{\varepsilon ^2} = \varepsilon, \\ &(4)&\:\varepsilon {\sigma _1} = {\sigma _1}\varepsilon, \:\:\:\varepsilon {\sigma _2} = {\sigma _2}\varepsilon, \\ &(5)&\: {\sigma _3}{\sigma _{2}}\sigma _{3} = {\sigma _{2}}{\sigma _3}{\sigma _{2}}, \:\:\: {\sigma _2}{\sigma _{1}}\sigma _{2} = {\sigma _{1}}{\sigma _2}{\sigma _{1}}, \:{\sigma _3}{\sigma _{2}}\sigma_1\sigma _{3} = {\sigma _{2}}{\sigma _3}{\sigma _{2}}\sigma_1, \\ &(6)&\:{\sigma _{3}}\varepsilon {\sigma _{3}}\varepsilon = \varepsilon {\sigma _{3}}\varepsilon, \:\:{\sigma _{3}}\varepsilon {\sigma _{3}}\sigma_2\varepsilon = \varepsilon {\sigma _{3}}\sigma_2\varepsilon, \:\: {\sigma _{3}}\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon = \varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon, \\ &(7)&\:{\sigma _{2}}\varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon = \varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon, \:\: {\sigma _{2}}\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon = \varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon, \\ &&{\sigma _{2}}\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon = \varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon, \\ &(7')&\:\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon = {\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon, \\ &&\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon = {\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon, \\ &&\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon = {\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon, \\ &&\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon = \varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon {\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon, \\ &(8)&\:\varepsilon {\sigma _{3}}\varepsilon{\sigma _{3}} = \varepsilon {\sigma _{3}}\varepsilon, \:\: \varepsilon {\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2 = \varepsilon {\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}, \\ &&\varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1 = \varepsilon {\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2, \\ &(9)&\:{\sigma _{2}}\sigma_3\sigma_2\varepsilon{\sigma _{3}}\varepsilon = {\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\varepsilon, \:\: {\sigma _{2}}\sigma_3\sigma_2\sigma_1\varepsilon{\sigma _{3}}\varepsilon = {\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\varepsilon, \\ &&{\sigma _{2}}\sigma_3\sigma_2\varepsilon{\sigma _{3}}\sigma_2\varepsilon = {\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2\varepsilon, \:\: \sigma_1{\sigma _{2}}\sigma_1\sigma_3\sigma_2\varepsilon{\sigma _{3}}\varepsilon = {\sigma _{2}}\sigma_1\sigma_3\sigma_2\varepsilon{\sigma _{3}}\varepsilon, \\ &&\sigma_2{\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon = {\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon, \:\: \sigma_2{\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon = {\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon, \\ &&\sigma_1\sigma_2\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\varepsilon = {\sigma _{2}}\sigma_1\sigma_3{\sigma _{2}}\sigma_1\varepsilon{\sigma _{3}}\varepsilon, \: \sigma_1\sigma_2\sigma_1{\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2\varepsilon = {\sigma _{2}}\sigma_1\sigma_3{\sigma _{2}}\varepsilon{\sigma _{3}}\sigma_2\varepsilon, \\ &&\sigma_2\sigma_3\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon = \sigma_3\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon, \: \sigma_1\sigma_2\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon = {\sigma _{2}}\sigma_1\sigma_3{\sigma _{2}}\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon, \\ &&\sigma_1\sigma_2\sigma_1{\sigma _{3}}\sigma_2\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon = {\sigma _{2}}\sigma_1\sigma_3{\sigma _{2}}\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon, \\ &&\sigma_1\sigma_2\sigma_1{\sigma _{3}}\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon = {\sigma _{2}}\sigma_1\sigma_3{\sigma _{2}}\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon, \\ &(10)&\: \sigma_1\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon = \sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\varepsilon\sigma_3\varepsilon, \\ &&\sigma_1\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon = \sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\varepsilon, \\ &&\sigma_1\sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon = \sigma_2\sigma_1\varepsilon{\sigma _{3}}\sigma_2\sigma_1\varepsilon\sigma_3\sigma_2\varepsilon. \end{eqnarray*}$

5. Conclusions

The idea of Gröbner-Shirshov basis theory plays a significant role in several fields of mathematics (algebra, graph theory, knot theory), computer sciences (computational algebra) and information sciences. From algebraic way the method Gröbner-Shirshov basis theory gives a new algorithm to obtain normal forms of elements of groups, monoids, semigroups and various type of algebras, and hence a new algorithm to solve the word problem in these algebraic structures.

In this study, we obtained a Gröbner-Shirshov basis for a special type of braid monoids, namely the symmetric inverse monoid $I_n$ , in terms of the dex-leg ordering on the related elements of monoid. As known symmetric inverse monoids are partial bijections and they are very well known and important in combinatorics. By taking into account the Gröbner-Shirshov basis, we achieved the normal form structure of this important monoid. This normal form gave us the solution of the word problem. At the final part of this study, we presented an application of our main result which find out a Gröbner-Shirshov basis for the symmetric inverse monoid $I_4$ by using a package program, $GBNP$ , in GAP. Since $GBNP$ is a restricted package program in point of size of symmetric inverse monoids it is worth to study and obtain a Gröbner-Shirshov basis for general size of this important structure.

In the future, the result of this work can be expanded to some other algebraic, computational structures and associated to graph theory, growth, Hilbert series and knot theory.

Acknowledgments

This work was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant No (130-211-D1439). The authors, therefore, acknowledge with thanks DSR technical and financial support. The authors would like to thank to the referees for their suggestions and valuable comments.

Conflict of interest

The authors declare that they have no conflict of interest.

References

[1]	Verdier N (2006) Hierarchy: A short history of a word in Western thought. Hierarchy in Natural and Social Sciences, 13-37.
[2]	Geyer HS Jr, Geyer HS (2015) Disaggregated population migration trends in South Africa between 1996 and 2011: a differential urbanisation approach. Urban Forum 26: 1-13. doi: 10.1007/s12132-014-9229-1
[3]	Geyer HS Jr, Geyer HS (2015) Polarisation reversal in South Africa: how widespread is the trend? S Afr Geogr J 98: 289-307. doi: 10.1080/03736245.2015.1028986
[4]	John L (2012) Secondary cities in South Africa: The start of a conversation. The Background Report. Available from: http://sacitiesnetwork.co.za/wp-content/uploads/2014/07/secondary_cities_in_south_africa_with_more_detail.pdf.
[5]	Zipf GK (1949) Human behaviour and the principle of least effort. Cambridge, MA: Addison-Wesley.
[6]	Van Huyssteen E, Mans G, Le Roux A, et al. (2016) Profiling SA system of towns-Introducing the CSIR/SACN South African Settlement typology. Pretoria: CSIR.
[7]	Bos DJ (1990) Die role in ontwikkeling van sekondere stede as deel van 'n verstedelikingstrategie vir Suid-Afrika. Potchefstroom: PU vir CHO, 228.
[8]	Marais L, Cloete C (2017) The role of secondary cities in managing urbanisation in South Africa. Dev South Afr 34: 182-195. doi: 10.1080/0376835X.2016.1259993
[9]	Friedmann J (1986) The world city hypothesis, Development and change, 17.
[10]	Jefferson M (1989) Why geography? The law of the primate city. Geogr Rev 79: 226-232. doi: 10.2307/215528
[11]	Brand A (2017) The use of corridor development as a strategic and supporting instrument towards the development of national space economies. Potchefstroom: NWU. Available from: http://repository.nwu.ac.za/handle/10394/28696.
[12]	South African Cities Network (2012) Secondary cities in South Africa: The start of a conversation. Pretoria. Available from: https://www.sacities.net/wp-content/uploads/2020/03/secondary_cities_in_south_africa.2012-2.pdf.
[13]	McKinsey Global Institute (2011) Urban world: Mapping the economic power of cities. McKinsey and Company: Washington.
[14]	Bolay J, Rabinovich A (2004) Intermediate cities in Latin America risk and opportunities of coherent urban development. Cities 21: 407–421. doi: 10.1016/j.cities.2004.07.007
[15]	Rondinelli D (1983) Dynamics of growth of secondary cities in developing countries. Geogr Rev 73: 42-57. doi: 10.2307/214394
[16]	Duranton G (2008) Cities: Engines of Growth and Prosperity for Developing Countries? Commission on Growth and Development Working Paper. World Bank, Washington. Available from: https://openknowledge.worldbank.org/handle/10986/28044 License: CC BY 3.0 IGO.
[17]	Milan V (2009) The World Bank Urban and Local Government strategy: Concept and Issues Note. World Bank: Washington.
[18]	Scott AJ (2009) World Development Report 2009: Re-shaping economic geography. J Econ Geogr 9.
[19]	World Bank (2010) Systems of Cities: Harnessing urbanization for growth and poverty alleviation. The World Bank urban and local government strategy. Available from: https://www.worldbank.org/en/topic/urbandevelopment/publication/urban-local-government-strategy.
[20]	European Union (2010) Urban and rural narratives and spatial development trends in Europe. Mcrit: Barcelona.
[21]	Giraut F, Vacchiani-Marcuzzo C (2012) Mapping places and people in a settler society: from discrepancy to good fit over one century of South African censuses. Geneva: University of Genève. Available from: https://archive-ouverte.unige.ch/unige:22753.
[22]	South Africa (2016) Statistics South Africa. The Pulse of the Organization. Internal circular 13/05/2016. Pretoria. Available from: http://www.statssa.gov.za/.
[23]	South Africa (2021) National Spatial Development Framework. Pretoria. Available from: https://drive.google.com/drive/folders/1BwT49pZIYlAxcWOAWq6Lm-5avLZQkzlm.
[24]	Todaro M (1969) A model of labour migration and urban employment in less developed countries. Am Econ Rev 59: 138-148.
[25]	Bakker JD, Parsons C, Rauch F (2016) Urbanisation in post-Apartheid South Africa. Available from: https://urbanisation.econ.ox.ac.uk/materials/papers/52/southafrica.pdf.
[26]	Van Huyssteen E, Biermann S, Naude A, et al. (2009) Advances in spatial analysis to support a more nuanced reading of the South African space economy. Urban Forum 20: 195-214. doi: 10.1007/s12132-009-9061-1
[27]	Van Huyssteen E, Green C, Sogoni Z, et al. (2018) South African Functional Town Typology (CSIR 2018 v2). Available from: http://stepsa.org/socio_econ.html#Indicator.
[28]	South Africa. The Presidency. The National Development Plan 2030. Our future-make it work, 2013. Pretoria. Available from: https://www.gov.za/sites/default/files/gcis_document/201409/ndp-2030-our-future-make-it-workr.pdf.
[29]	StepsSA (2018) The CSIR Functional Town, City and Settlement Typology. Available from: http://stepsa.org/settlement_typology.html.
[30]	Marais L, Nel V (2019) Space and Planning in Secondary Cities: Reflections from South Africa. Stellenbosch: SUN Media. doi: 10.18820/9781928424352
[31]	United Nations (2015) Habitat Ⅲ issue paper 10: Urban-rural linkages. New York: United Nations.
[32]	Cooperative Governance and Traditional Affairs (2017) Support program for intermediate city municipalities in South Africa: December 2017. Pretoria. Available from: https://www.cogta.gov.za/index.php/tag/intermediate-city-municipalities-icm-programme/.
[33]	Oranje M, Huyssteen E, Meiklejohn C (2009) National Spatial Development Perspective (NSDP) and assumptions on small town economic investment by government. Dep Sci Technol.
[34]	Pumain D (2000) Settlement Systems in the Evolution. Geografiska Annaler. Series B, Human Geography, 73-87.
[35]	Zimmer A, Guido Z, Tuholske C, et al. (2020) Dynamics of population growth in secondary cities across southern Africa. Landscape Ecol 35. Available from: https://doi10.1007/s10980-020-01086-6.
[36]	Tuholske C, Caylor K, Evans T, et al. (2019) Variability in urban population distribution across Africa. Environ Res Lett 14: 085009. doi: 10.1088/1748-9326/ab2432
[37]	Brand A, Drewes JE (2019) Identification of network cities in South Africa. GeoJournal. Available from: https://doi10.1007/s10708-019-10097-z.
[38]	Geyer HS Jr, Geyer P, Geyer M (2015) The South African functional metropolis-A synthesis. J Town Reg Plann 2015: 13-26.
[39]	Capello R, Rietveld P (1998) The concept of network synergies in economic theory: policy implications. Transport Networks in Europe. Cheltenham: Edward Elgar, 57-83.
[40]	Meijers E (2005) Polycentric urban regions and the quest for synergy: Is a network of cities more than the sum of the parts? Urban Stud 42: 765-781. doi: 10.1080/00420980500060384

Reader Comments

Your name:*

Email:*
© 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

AIMS Geosciences

0.9

Metrics

Article views(3997) PDF downloads(111) Cited by(4)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

AIMS Geosciences

Differentiated outlook to portray secondary cities in South Africa

Related Papers:

Abstract

1. Introduction and preliminaries

2. Gröbner-Shirshov bases and the composition-diamond lemma

3. A Gröbner-Shirshov basis for the monoid $I_n$

4. An application

5. Conclusions

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Catalog

Abstract

1. Introduction and preliminaries

2. Gröbner-Shirshov bases and the composition-diamond lemma

3. A Gröbner-Shirshov basis for the monoid $I_n$

4. An application

5. Conclusions

Acknowledgments

Conflict of interest

References

AIMS Geosciences

Differentiated outlook to portray secondary cities in South Africa

Related Papers:

Abstract

1. Introduction and preliminaries

2. Gröbner-Shirshov bases and the composition-diamond lemma

3. A Gröbner-Shirshov basis for the monoid In I_n

4. An application

5. Conclusions

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog

Abstract

1. Introduction and preliminaries

2. Gröbner-Shirshov bases and the composition-diamond lemma

3. A Gröbner-Shirshov basis for the monoid In I_n

4. An application

5. Conclusions

Acknowledgments

Conflict of interest

References

3. A Gröbner-Shirshov basis for the monoid $I_n$

3. A Gröbner-Shirshov basis for the monoid $I_n$