Treffer: Algorithms for Finding Specific Elements in Algebraic Hyperstructures with One Hyperoperation.

In this paper, first, we show how to define an algebraic hyperstructure by using algorithms. Then, we present algorithms that calculate specific elements in algebraic hyperstructures. These specific elements are: scalars, scalar identities, identities, inverses, zero elements, right simplifiable elements, left simplifiable elements, left absorbing-like elements and right absorbing-like elements. We also introduce some algorithms in algebraic hyperstructures to check properties or calculate specific members. These algorithms are presented for algebraic hyperstructures with one hyperoperation, i.e. hypergroupoids. However, they can be developed for other algebraic hyperstructures. [ABSTRACT FROM AUTHOR]

Copyright of Mathematics Interdisciplinary Research is the property of University of Kashan Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)