Next Article in Journal
The Impact of a Non-Uniform Magnetic Field on Mixed Convection in a Lid-Driven Cavity Filled with Fe3O4/Water Nanofluid
Previous Article in Journal
The Odd Beta Prime-G Family of Probability Distributions: Properties and Applications to Engineering and Environmental Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Proceeding Paper

A Way to Construct Commutative Hyperstructures †

Department of Sciences, Faculty of Horticulture, Iasi University of Life Sciences, 700490 Iasi, Romania
Presented at the 1st International Online Conference on Mathematics and Applications, 1–15 May 2023; Available online: https://iocma2023.sciforum.net/.
Comput. Sci. Math. Forum 2023, 7(1), 22; https://0-doi-org.brum.beds.ac.uk/10.3390/IOCMA2023-14385
Published: 28 April 2023

Abstract

:
This article aims to create commutative hyperstructures, starting with a non-commutative group. Therefore, we consider the starting group to be the dihedral group D n , where n is a natural number, n > 1 , and we determine the HX groups associated with the dihedral group. For a fixed number n, we note G n = G p 2 p 1 H X groups , for any p 1 , p 2 N * such that n = p 1 p 2 as the set of all HX groups. This paper analyses this new structure’s properties for particular cases when the dihedral group D 4 is the support group.

1. Introduction

The algebraic term hyperstructure denotes an appropriate generalization of structures of classical algebras, such as group, semigroup, and ring. In classical algebraic structures, the composition of two elements is an element, and within the algebraic hyperstructure, the hypercomposition law of two elements represents a set. F. Marty noticed many aspects of a factor group, which became the starting point within the theory of hypergroups. He introduced the concept of the hypergroup in 1934 at the Congress of Mathematicians from Scandinavian Countries. Hypergroups have been studied from the theoretically and for their applications in pure and applied mathematical problems: geometry, topology, cryptography, code theory, graphs, hypergraphs, automata theory, fuzzy degree, probability, etc. [1]. The Chinese mathematician Mi introduced the notion of HX-groups. After this, Honghai and Li Honxing contributed to the theory of HX-groups with Corsini [2,3,4]. Furthermore, Cristea analysed the connection between HX-groups and hypergroups [5]. In the article [6], we studied the form of HX-groups with a dihedral group D n as a group, where n is a natural number greater than 3. Moreover, we analysed the HX-groups’ commutativity degree and the Chinese hypergroup’s fuzzy grade associated with them. We noticed a connection between the commutativity degree of the HX-groups related to the dihedral group and its commutativity degree. In the article [7] a new concept of neutro HX-groups was defined.

2. Main Results

In this section, we recall the notions of an HX-group, and define the new set forms by HX-groups [8].
Definition 1.
Let ( G , . ) be a group and G P * ( G ) { } , where P * ( G ) is the set of non-empty subsets of G. An HX-group is a non-empty subset H of P * ( G ) which is a group with respect to the operation “∗”, defined by:
A , B G , A B = { a . b | a A , b B } .
We assume G has group G as a support.
Definition 2.
Let G , be an HX-group with the support G , . and E as the identity of group G . A Chinese hypergroupoid is a hyperstructure < G * , > , where
G * = A G A and x , y G * × G * , x y = x A y B { A , B } G A B .

Construction of G n

In the following, we consider the set of all HX groups with the dihedral group ( D 4 , · ) as a support. The dihedral group D n , where n N , n 2 , is the group generated by rotation ρ and symmetry σ , and satisfies the following properties:
ρ n = σ 2 = e ; ρ k · σ = σ · ρ n k , k n , k N .
It is denoted by D n = < ρ , σ > . Therefore, in the article [6], we determined the form of HX-groups associated with the dihedral group D n , and analysed them in particular cases for D 4 , D 5 and D 6 . For a fixed number n, we note that
G n = G p 2 p 1 | H X groups , for any p 1 , p 2 N * such that n = p 1 p 2
be the set of all HX-groups. We define the following hyperoperation
: G n × G n P * G n ;
thus,
G p 2 p 1 G p 2 p 1 = 0 s 2 p 2 1 0 t 2 p 2 1 C s , t ; C s , t = X s p 1 Y t p 1 ; X s p 1 G p 2 p 1 , Y t p 1 G p 2 p 1 , n = p 1 p 2 = p 1 p 2 , p 1 , p 2 , p 1 , p 2 N * .

3. Results and Discussion

In the following we present a particular cases for n = 4 , and analyse the hyperstructure G 4 , .
Proposition 1.
The hyperstructure G 4 , is a commutative structure, where
G 4 = G p 2 p 1 | H X groups , for any p 1 , p 2 N * such that 4 = p 1 p 2 .
Proof. 
Therefore, G 4 , is a commutative hyperstructure if and only if G p 2 p 1 G p 2 p 1 = G p 2 p 1 G p 2 p 1 , for any p 1 , p 2 , p 1 , p 2 N * , such that 4 = p 1 p 2 = p 1 p 2 . In agreement with our previous work [6], the form of the HX-groups associated with the dihedral group D 4 is:
G 2 2 = { { e , ρ 2 } , { ρ , ρ 3 } , { σ , ρ 2 σ } , { ρ σ , ρ 3 σ } } ; G 1 4 = { { e , ρ , ρ 2 , ρ 3 } , { σ , ρ σ , ρ 2 σ , ρ 3 σ } } ; G 4 1 = { { e } , { ρ } , { ρ 2 } , { ρ 3 } , { σ } , { ρ σ } , { ρ 2 σ } , { ρ 3 σ } } .
Therefore,
G 2 2 G 1 4 = { C 0 , 0 , C 1 , 0 , C 2 , 0 , C 3 , 0 , C 0 , 1 , C 1 , 1 , C 2 , 1 , C 3 , 1 }
and the sets X s p 1 and Y t p 1 are:
X 0 2 = { e , ρ 2 } , X 1 2 = { ρ , ρ 3 } , X 2 2 = { σ , ρ 2 σ } , X 3 2 = { ρ σ , ρ 3 σ } ; Y 0 4 = { e , ρ , ρ 2 , ρ 3 } , Y 1 4 = { σ , ρ σ , ρ 2 σ , ρ 3 σ } .
In calculating the elements C i , j , i { 0 , 1 , 2 , 3 } and j { 0 , 1 } , we use the rules gives by (2)
C 0 , 0 = X 0 2 Y 0 4 = { e , ρ 2 } { e , ρ , ρ 2 , ρ 3 } = e · e e · ρ e · ρ 2 e · ρ 3 ρ 2 · e ρ 2 · ρ ρ 2 · ρ 2 ρ 2 · ρ 3 = { e , ρ , ρ 2 , ρ 3 } = Y 0 4 ; C 1 , 0 = X 1 2 Y 0 4 = { ρ , ρ 3 } { e , ρ , ρ 2 , ρ 3 } = ρ · e ρ · ρ ρ · ρ 2 ρ · ρ 3 ρ 3 · e ρ 3 · ρ ρ 3 · ρ 2 ρ 3 · ρ 3 . = { e , ρ , ρ 2 , ρ 3 } = Y 0 4 C 2 , 0 = X 2 2 Y 0 4 = { σ , ρ 2 σ } { e , ρ , ρ 2 , ρ 3 } = { σ , σ ρ , σ ρ 2 , σ ρ 3 , ρ 2 σ , ρ 2 σ ρ , ρ 2 σ ρ 2 , ρ 2 σ ρ 3 } = { σ , ρ 3 σ , ρ 2 σ , ρ σ } = { σ , ρ σ , ρ 2 σ , ρ 3 σ } = Y 1 4 . C 3 , 0 = X 3 2 Y 0 4 = { ρ σ , ρ 3 σ } { e , ρ , ρ 2 , ρ 3 } = Y 1 4 .
Similarly we calculate the other elements, obtaining
C 0 , 1 = X 0 2 Y 1 4 = Y 1 4 , C 1 , 1 = X 1 2 Y 1 4 = Y 1 4 , C 2 , 1 = X 2 2 Y 1 4 = Y 0 4 , C 3 , 1 = X 3 2 Y 1 4 = Y 0 4 .
Therefore, we have
G 2 2 G 1 4 = G 1 4 .
Now, we analysed the composition
G 1 4 G 2 2 = { C 0 , 0 , C 0 , 1 , C 0 , 2 , C 0 , 3 , C 1 , 0 , C 1 , 1 , C 1 , 2 , C 1 , 3 } .
According to (2) we noticed that ρ k ρ p = ρ k + p = ρ p ρ k = ρ p + k , for any p, k N * . Therefore, we can conclude that
X 0 2 Y 0 4 = Y 0 4 X 0 2 = Y 0 4 = C 0 , 0 , X 1 2 Y 0 4 = Y 0 4 X 1 2 = C 0 , 1 = Y 0 4 , C 0 , 2 = Y 0 4 X 2 2 = C 0 , 3 = Y 0 4 X 3 2 = Y 1 4 , C 1 , 0 = Y 1 4 X 0 2 = C 1 , 1 = Y 1 4 X 1 2 = Y 1 4 , C 1 , 2 = Y 1 4 X 2 2 = C 1 , 3 = Y 1 4 X 3 2 = Y 0 4 .
Therefore, G 1 4 G 2 2 = G 2 2 G 1 4 = G 1 4 . Analogously we thus have
G 1 4 G 4 4 = G 4 1 G 1 4 = G 1 4 , G 2 2 G 4 1 = G 4 1 G 2 2 = G 2 2 .
In conclusion, G 4 , is a commutative hyperstructure. □
Remark 1.
The elements of hyperstructure G 4 , satisfy the following equality
G p 2 p 1 G p 2 p 1 = G p 2 p 1 G p 2 p 1 = G gcd { p 2 , p 2 } l c m { p 1 , p 1 } ,
for any p 1 , p 2 , p 1 , p 2 N * , such that 4 = p 1 p 2 = p 1 p 2 .
Notation 1.
l c m { p 1 , p 1 } represents the least common multiple of numbers p 1 , p 1 , and g c d { p 2 , p 2 } is the greatest common divisor of p 2 , p 2 .
Proposition 2.
The hyperstructure G 4 , is a semi-hypergroup, but not a quasi-hypergroup.
Proof. 
G 4 , is a semi-hypergroup if and only if the hyperoperation “∘” is associative, i.e.,
G p 2 p 1 G p 2 p 1 G p 2 p 1 = G p 2 p 1 G p 2 p 1 G p 2 p 1 ,
for any p 1 , p 2 , p 1 , p 2 , p 1 and p 2 N * , such that 4 = p 1 p 2 = p 1 p 2 = p 1 p 2 . We use the relation (4), and properties of gcd respectively, l c m
gcd { gcd { p 2 , p 2 } , p 2 } = gcd { p 2 , gcd { p 2 , p 2 } } ; l c m { l c m { p 1 , p 1 } , p 1 } = l c m { p 1 , l c m { p 1 , p 1 } } .
Therefore,
G p 2 p 1 G p 2 p 1 G p 2 p 1 = G gcd { p 2 , p 2 } l c m { p 1 , p 1 } G p 2 p 1 = G gcd { gcd { p 2 , p 2 } , p 2 } l c m { l c m { p 1 , p 1 } , p 1 } = = G gcd { p 2 , gcd { p 2 , p 2 } } l c m { p 1 , l c m { p 1 , p 1 } } = G p 2 p 1 G p 2 p 1 G p 2 p 1 .
To prove that the semi-hypergroup G 4 , is not a quasi-hypergroup, means that the hyperoperation does not satisfy the reproductive law, which is the following
G p 2 p 1 G 4 = G 4 G p 2 p 1 = G 4 ,
for any p 1 , p 2 N * , such that 4 = p 1 p 2 . We notice that
G 1 4 G 4 = G 1 4 G 1 4 G 1 4 G 2 2 G 1 4 G 4 1 = G 1 4 G 4 .
Therefore, the semi-hypergroup G 4 , is not a quasi-hypergroup. □
Remark 2.
The cardinality of the semi-hypergroup | G 4 | coincides with the number divisors of four.

4. Conclusions

In this paper, we presented a way to obtain a commutative hyperstructure, starting with a non-abelian group. We construct the hyperstructure G n , as a composition of the HX-groups associated with the dihedral group D n , n N * , n > 2 . In Section 2, we analysed this new structure in particular cases, n = 4 . We noticed that we have a commutative semi-hypergroup G 4 , that is not a quasi-hypergroup. Furthermore, we see that a connection exists between the composition of the HX-groups and the function l c m ,   g c d associated with them.

Funding

This research received no external funding.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Corsini, P.; Leoreanu, V. Applications of Hyperstructures Theory; Springer: New York, NY, USA, 2003. [Google Scholar]
  2. Corsini, P. HX-groups and Hypergroups. Analele Univ. Ovidius Constanţa 2016, 24, 101–121. [Google Scholar] [CrossRef]
  3. Corsini, P. Hypergroups associated with HX-groups. Analele Univ. Ovidius Constanţa 2017, 25, 49–64. [Google Scholar] [CrossRef]
  4. Corsini, P. HX-Hypergroups associated with the direct product of some Z/nZ. J. Algebr. Struct. Their Appl. 2016, 3, 1–15. [Google Scholar]
  5. Cristea, I.; Novak, M.; Onasanya, B.O. Links Between HX-Groups and Hypergroups. Algebra Colloq. 2021, 28, 441–452. [Google Scholar] [CrossRef]
  6. Sonea, A. HX-groups associated with the dihedral group Dn. Mult. Valued Log. Soft Comput. 2019, 33, 11–26. [Google Scholar]
  7. Sonea, A.; Al-Kaseasbeh, S. An Introduction to NeutroHX-Groups. In Theory and Applications of NeutroAlgebras as Generalizations of Classical Algebras; IGI Global Publisher of Timely Knowledge: New York, NY, USA, 2022. [Google Scholar]
  8. Zhenliang, Z. The properties of HX-groups. Ital. J. Pure Appl. Math. 1997, 2, 97–106. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Sonea, A. A Way to Construct Commutative Hyperstructures. Comput. Sci. Math. Forum 2023, 7, 22. https://0-doi-org.brum.beds.ac.uk/10.3390/IOCMA2023-14385

AMA Style

Sonea A. A Way to Construct Commutative Hyperstructures. Computer Sciences & Mathematics Forum. 2023; 7(1):22. https://0-doi-org.brum.beds.ac.uk/10.3390/IOCMA2023-14385

Chicago/Turabian Style

Sonea, Andromeda. 2023. "A Way to Construct Commutative Hyperstructures" Computer Sciences & Mathematics Forum 7, no. 1: 22. https://0-doi-org.brum.beds.ac.uk/10.3390/IOCMA2023-14385

Article Metrics

Back to TopTop