Hossein Doostie

  • Citations Per Year
Learn More
For a finitely generated group G = 〈A〉, where A = {a1, a2, . . . , an}, the sequence xi = ai, 1 ≤ i ≤ n, xi+n = ∏n j=1 xi+j−1, i ≥ 1, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). In(More)
For a finitely generated group G = 〈A〉 where A = {a1, a2, . . . , an} the sequence xi = ai+1, 0 ≤ i ≤ n − 1, xi+n = ∏n j=1 xi+j−1, i ≥ 0, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G).(More)
For a finite group G= 〈X〉 (X = G), the least positive integer MLX(G) is called the maximum length of G with respect to the generating set X if every element of G may be represented as a product of at most MLX(G) elements of X . The maximum length of G, denoted by ML(G), is defined to be the minimum of {MLX(G) | G = 〈X〉, X = G, X = G−{1G}}. The well-known(More)
For a given integer n = p1 1 p α2 2 . . . p αk k , (k ≥ 2), we give here a class of finitely presented finite monoids of order n. Indeed the monoids Mon(π), where π = 〈a1, a2, . . . , ak|a p αi i i = ai, (i = 1, 2, . . . , k), aiai+1 = ai, (i = 1, 2, . . . , k − 1)〉. As a result of this study we are able to classify a wide family of the kgenerated p-monoids(More)
The sequence {gi}i=1 is the sequence of Lucas numbers g1 = 2, g2 = 1, gi+2 = gi+1 + gi, (i ≥ 1), and ` ≥ 2 is an integer. In this paper we consider the group G(`) with an efficient presentation 〈x, y | x = y = xyx ` 2 y 3` 2 〉 where, [x] is used for the integer part of a real x, and prove that G(`) is finite of order |G(`)| =    `(`+2) 2 (1 + 3 ` 2 ), `(More)
  • 1