Algorithms for determining the type of algebraic hyperstructures and morphisms

Document Type : Original Article

Authors

Department of Mathematical Sciences, Yazd University, Yazd, Iran

Abstract
In this paper, we present some primary methods to define a hypergroupoid by algorithm. Then, we present algorithms for checking if it is closed under ο, associativity, weak associativity, commutativity, weak commutativity, establishing the reproduction axiom, determining the type of a hypergroupoid  (H,ο) and the type of a morphism f in a hypergroupoid (H,ο). The goal of this paper is to provide algorithms for checking the basic features and morphisms in algebraic hyperstructures. Our attention is on algorithms for algebraic hyperstructures with one hyperoperation (i.e. hypergroupoids). The algorithms can be developed for other algebraic hyperstructures. 

Keywords

Subjects


[1] Aghabozorgi, H., Jafarpour, M., Dolatabadi, M. K., Cristea, I. (2019). An algorithm to compute the number of Rosenberg hypergroups of order less than 7. Italian journal of pure and applied mathematics, 42, 262–270.
[2] Cristea, I., Jafarpour, M., Mousavi, S. S., Soleymani, A. (2010). Enumeration of Rosenberg hypergroups. Computers & Mathematics with Applications, 60(10), 2753–2763.
[3] Davvaz, B. (2016). Semihypergroup Theory. Cambridge, MA, USA: Academic Press.
[4] Davvaz, B., Dehghan Nezhad, A., Heidari, M. (2013). Inheritance examples of algebraic hyperstructures. Information Sciences, 224, 180–187.
[5] Davvaz, B., Leoreanu-Fotea, V. (2022). Hypergroup Theory. World Scientific.
[6] Davvaz, B., Leoreanu-Fotea, V. (2024). Krasner Hyperring Theory. World Scientific.
[7] Davvaz, B., Vougiouklis, T. (2018). A Walk Through Weak Hyperstructures. Singapore: World Scientific Publishing Company.
[8] GAP (2022). GAP – Groups, Algorithms, and Programming, Version 4.12.2. The GAP Group.
[9] Marty, F. (1934). Sur une generalization de la notion de groups. 8th congress Math. Scandinaves, Stockholm, (pp. 45–49).
[10] Massouros, C. G., Tsitouras, C. (2011). Enumeration of hypercompositional structures defined by binary relations. Italian Journal of Pure and Applied Mathematics, 28, 51–62.
[11] Nordo, G. (1997). An algorithm on number of isomorphism classes of hypergroups of order 3. Italian J. Pure Appl. Math, 2, 37–42.
[12] Park, J., Chung, S.-C. (2000). On algorithms to compute some Hv-groups. Korean J. Comput. & Appl. Math., 7(2), 433–453.
[13] Safari, M., Davvaz, B., Leoreanu-Fotea, V. (2015). Enumeration of 3- and 4-hypergroups on sets with two elements. European Journal of Combinatorics, 44, 298–306. Recent Researches in Hyperstructures.
[14] Spartalis, S., Mamaloukas, C. (2006). Hyperstructures associated with binary relations. Computers & Mathematics with Applications, 51(1), 41–50.
[15] Tsitouras, C., Massouros, C. (2012). Enumeration of Rosenberg-type hypercompositional structures defined by binary relations. European Journal of Combinatorics, 33(8), 1777–1786.
[16] Tsitouras, C., Massouros, C. G. (2010). On enumeration of hypergroups of order 3. Computers & Mathematics with Applications, 59(1), 519–523.
Volume 6, Issue 1
Winter 2025
Pages 67-88

  • Receive Date 07 July 2024
  • Revise Date 07 January 2025
  • Accept Date 08 January 2025