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

Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures

Author

Listed:
  • Irina Cristea

    (Centre for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia)

  • Juš Kocijan

    (Centre for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia
    Department of Systems and Control, Jožef Stefan Institut, Jamova Cesta 39, 1000 Ljubljana, Slovenia)

  • Michal Novák

    (Faculty of Electrical Engineering and Communication, Brno University of Technology, Technická 10, 61600 Brno, Czech Republic)

Abstract

The aim of this paper is to study, from an algebraic point of view, the properties of interdependencies between sets of elements (i.e., pieces of secrets, atmospheric variables, etc.) that appear in various natural models, by using the algebraic hyperstructure theory. Starting from specific examples, we first define the relation of dependence and study its properties, and then, we construct various hyperoperations based on this relation. We prove that two of the associated hypergroupoids are H v -groups, while the other two are, in some particular cases, only partial hypergroupoids. Besides, the extensivity and idempotence property are studied and related to the cyclicity. The second goal of our paper is to provide a new interpretation of the dependence relation by using elements of the theory of algebraic hyperstructures.

Suggested Citation

  • 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.
  • Handle: RePEc:gam:jmathe:v:7:y:2019:i:10:p:885-:d:269936
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/10/885/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/7/10/885/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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:7:y:2019:i:10:p:885-:d:269936. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.