Optimizing HX-Group Compositions Using <i>C</i>++: A Computational Approach to Dihedral Group Hyperstructures
The HX-groups represent a generalization of the group notion. The Chinese mathematicians Mi Honghai and Li Honxing analyzed this theory. Starting with a group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow&g...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/22/3492 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The HX-groups represent a generalization of the group notion. The Chinese mathematicians Mi Honghai and Li Honxing analyzed this theory. Starting with a group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mi>G</mi><mo>,</mo><mo>·</mo><mo>)</mo></mrow></semantics></math></inline-formula>, they constructed another group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mrow><mo>(</mo><mi mathvariant="script">G</mi><mo>,</mo><mo>∗</mo><mo>)</mo></mrow><mo>⊂</mo><msup><mi mathvariant="script">P</mi><mo>∗</mo></msup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></semantics></math></inline-formula>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi mathvariant="script">P</mi><mo>∗</mo></msup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></semantics></math></inline-formula> is the set of non-empty subsets of <i>G</i>. The hypercomposition “<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>∗</mo></mrow></semantics></math></inline-formula>” is thus defined for any <i>A</i>, <i>B</i> from <i>G</i>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mo>∗</mo><mi>B</mi><mo>=</mo><mo>{</mo><mi>a</mi><mo>·</mo><mi>b</mi><mo>|</mo><mi>a</mi><mo>∈</mo><mi>A</mi><mo>,</mo><mi>b</mi><mo>∈</mo><mi>B</mi><mo>}</mo><mo>.</mo></mrow></semantics></math></inline-formula> In this article, we consider a particular group, <i>G</i>, to be the dihedral group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>D</mi><mi>n</mi></msub><mo>,</mo><mspace width="3.33333pt"></mspace><mi>n</mi></mrow></semantics></math></inline-formula> is a natural number, greater than 3, and we analyze the HX-groups with the dihedral group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>D</mi><mi>n</mi></msub></semantics></math></inline-formula> as a support. The HX-groups were studied algebraically, but the novelty of this article is that it is a computer analysis of the HX-groups by creating a program in <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>C</mi><mo>+</mo><mo>+</mo></mrow></semantics></math></inline-formula>. This code aims to improve the calculation time regarding the composition of the HX-groups. In the first part of the paper, we present some results from the hypergroup theory and HX-groups. We create another hyperstructure formed by reuniting all the HX-groups associated with a dihedral group <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>D</mi><mi>n</mi></msub></semantics></math></inline-formula> as a support for a natural fixed number <i>n</i>. In the second part, we present the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>C</mi><mo>+</mo><mo>+</mo></mrow></semantics></math></inline-formula> code created in the Microsoft Visual Studio program, and we provide concrete examples of the program’s application. We created this program because the code aims to improve the calculation time regarding the composition of HX-groups. |
|---|---|
| ISSN: | 2227-7390 |