Let/. It :0 ---0 G be any two self maps of a compact connected oriented Lie group G. In this paper, for each positive integer k , we associate an integer with fk,hi . We relate this number with Lefschetz coincidence number. We deduce that for any two differentiable maps f, there exists a positive integer k such that k 5.2+1 , and there is a point x C G such that ft (x) = (x) , where A is the rank of G . Introduction Let G be an n-dimensional com -pact connected Lie group with multip-lication p ( .e 44:0 xG--+G such that p ( x , y) = x.y ) and unit e . Let [G, G] be the set of homotopy classes of maps G G . Given two maps f , f G ---• Jollowing [3], we write f. f 'to denote the map G-.Gdefined by 01.11® =A/WO= fiat® ,sea Given a point g

For any group G, we define G/H (read” G mod H”) to be the set of left cosets of H in G and this set forms a group under the operation (a)(bH) = abH. The character table of rational representations study to gain the K( SL(2,81)) and K( SL(2, 729)) in this work.

The group for the multiplication of closets is the set G|N of all closets of N in G, if G is a group and N is a normal subgroup of G. The term “G by N factor group” describes this set. In the quotient group G|N, N is the identity element. In this paper, we procure K(SL(2,125)) and K(SL(2,3125)) from the character table of rational representations for each group.

A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .