•  
  •  
 

Abstract

Let 𝐺 be a group. A subset 𝐷 of 𝐺 is called a π’Ÿ-set if every element π‘₯ ∈ 𝐺\𝐷, π‘₯βˆ’1 ∈ 𝐷. If 𝐴 is a nonempty subset of 𝐺, then the smallest 𝐷-set that contains 𝐴 is called the π’Ÿ-set generated by 𝐴 and is denoted by 〈𝐴βŒͺ. This paper re-investigates more properties of the π’Ÿ-sets generated by a nonempty subset 𝐴 of 𝐺 and shows proofs of some identities using the concept of π’Ÿ-sets.

Share

COinS