IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i22p3492-d1516994.html
   My bibliography  Save this article

Optimizing HX-Group Compositions Using C ++: A Computational Approach to Dihedral Group Hyperstructures

Author

Listed:
  • Andromeda Pătraşcu Sonea

    (“Ion Ionescu de la Brad” Iasi University of Life Sciences, 700490 Iași, Romania
    These authors contributed equally to this work.)

  • Ciprian Chiruţă

    (“Ion Ionescu de la Brad” Iasi University of Life Sciences, 700490 Iași, Romania
    These authors contributed equally to this work.)

Abstract

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 ( G , · ) , they constructed another group ( G , ∗ ) ⊂ P ∗ ( G ) , where P ∗ ( G ) is the set of non-empty subsets of G . The hypercomposition “ ∗ ” is thus defined for any A , B from G , A ∗ B = { a · b | a ∈ A , b ∈ B } . In this article, we consider a particular group, G , to be the dihedral group D n , n is a natural number, greater than 3, and we analyze the HX-groups with the dihedral group D n 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 C + + . 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 D n as a support for a natural fixed number n . In the second part, we present the C + + 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.

Suggested Citation

  • Andromeda Pătraşcu Sonea & Ciprian Chiruţă, 2024. "Optimizing HX-Group Compositions Using C ++: A Computational Approach to Dihedral Group Hyperstructures," Mathematics, MDPI, vol. 12(22), pages 1-14, November.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3492-:d:1516994
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/22/3492/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/22/3492/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Irina Cristea & Juš Kocijan & Michal Novák, 2019. "Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures," Mathematics, MDPI, vol. 7(10), pages 1-14, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gerasimos G. Massouros & Christos G. Massouros, 2022. "State Machines and Hypergroups," Mathematics, MDPI, vol. 10(14), pages 1-25, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3492-:d:1516994. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.