×

Enumeration of Rosenberg-type hypercompositional structures defined by binary relations. (English) Zbl 1250.20063

Summary: Every binary relation \(\rho\) on a set \(H\) (\(\text{card}(H)>1\)) can define a hypercomposition and thus endow \(H\) with a hypercompositional structure. In this paper, binary relations are represented by Boolean matrices. With their help, the hypercompositional structures (hypergroupoids, hypergroups, join hypergroups) that emerge with the use of the Rosenberg’s hyperoperation are characterized, constructed and enumerated using symbolic manipulation packages. Moreover, the hyperoperation given by \(x\circ x=\{z\in H\mid (z,x)\in\rho\}\) and \(x\circ x=x\circ x\cup y\circ y\) is introduced and connected to Rosenberg’s hyperoperation, which assigns to every \((x,y)\) the set of all \(z\) such that either \((x,z)\in\rho\) or \((y,z)\in\rho\).

MSC:

20N20 Hypergroups
08A02 Relational systems, laws of composition
68W30 Symbolic computation and algebraic computation
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Corsini, P., Binary relations and hypergroupoids, Ital. J. Pure Appl. Math., 7, 11-18 (2000) · Zbl 0972.20042
[2] Corsini, P., On the hypergroups associated with a binary relation, Multi.-Val. Logic, 5, 407-419 (2000) · Zbl 0999.20055
[3] Corsini, P.; Leoreanu, V., Hypergroups and binary relations, Algebra Universalis, 43, 321-330 (2000) · Zbl 1016.20056
[4] Cristea, I., Several aspects on the hypergroups associated with \(n\)-ary relations, An. Stiint. Univ. “Ovidius” Constanta Ser. Mat., 17, 3, 99-110 (2009) · Zbl 1199.20131
[5] Cristea, I.; Jafarpour, M.; Mousavi, S. S.; Soleymani, A., Enumeration of Rosenberg hypergroups, Comput. Math. Appl., 32, 72-81 (2011)
[6] Cristea, I.; Stefanescu, M., Binary relations and reduced hypergroups, Discrete Math., 308, 3537-3544 (2008) · Zbl 1148.20051
[7] Cristea, I.; Stefanescu, M.; Angheluta, C., About the fundamental relations defined on the hypergroupoids associated with binary relations, Electron. J. Combin., 32, 72-81 (2011) · Zbl 1209.20073
[8] De Salvo, M.; Lo Faro, G., Hypergroups and binary relations, Multi.-Val. Logic, 8, 645-657 (2002) · Zbl 1044.20043
[9] De Salvo, M.; Lo Faro, G., A new class of hypergroupoids associated to binary relations, J. Mult.-Valued Logic Soft Comput., 9, 361-375 (2003) · Zbl 1049.20043
[10] Jantosciak, J.; Massouros, Ch. G., Strong identities and fortification in transposition hypergroups, J. Discrete Math. Sci. Cryptogr., 6, 169-193 (2003) · Zbl 1051.20039
[11] F. Marty, Sur une gènèralisation de la notion de groupe, Huitième Congres des Mathématiciens Scad, Stockholm, 1934, pp. 45-59.; F. Marty, Sur une gènèralisation de la notion de groupe, Huitième Congres des Mathématiciens Scad, Stockholm, 1934, pp. 45-59. · JFM 61.1014.03
[12] Massouros, Ch. G., Hypergroups and convexity, Riv. Mat. Pura ed Appl., 4, 7-26 (1989) · Zbl 0798.20063
[13] Massouros, Ch. G., Quasicanonical hypergroups, (Proc. of the 4th Internat. Cong. on Algebraic Hyperstructures and Applications (1990), World Scientific), 129-136 · Zbl 0791.20088
[14] Massouros, Ch. G., On the semi-subhypergroups of a hypergroup, Int. J. Math. Math. Sci., 14, 293-304 (1991) · Zbl 0789.20086
[15] G.G. Massouros, Automata-languages and hypercompositional structures, Doctoral Thesis, NTUA 1993.; G.G. Massouros, Automata-languages and hypercompositional structures, Doctoral Thesis, NTUA 1993. · Zbl 0745.20062
[16] Massouros, G. G., Hypercompositional structures in the theory of the languages and automata, An. Ştiinţ. Univ. Al. I. Cuza Iaşi Tom. III, Informat., 65-73 (1994) · Zbl 0840.68066
[17] Massouros, G. G., The subhypergroups of the fortified join hypergroup, Ital. J. Pure Appl. Math., 2, 51-63 (1997) · Zbl 0952.20052
[18] Massouros, Ch. G.; Massouros, G. G., Hypergroups associated with graphs and automata, AIP Conf. Proc., 1168, 380-383 (2009) · Zbl 1183.20071
[19] Massouros, G. G.; Massouros, Ch. G.; Mittas, J. D., Fortified join hypergroups, Ann. Math. Blaise Pascal, 3, 155-169 (1996) · Zbl 0870.20054
[20] Massouros, Ch. G.; Tsitouras, Ch., Enumeration of hypercompositional structures defined by binary relations, Ital. J. Pure Appl. Math., 28, 43-54 (2011) · Zbl 1244.20065
[21] Ch.G. Massouros, Ch. Tsitouras, S. Voliotis, Square roots of total Boolean matrices—enumeration issues, in: 16th International Conference on Systems, Signals and Image Processing, IWSSIP 2009, pp. 1-4.; Ch.G. Massouros, Ch. Tsitouras, S. Voliotis, Square roots of total Boolean matrices—enumeration issues, in: 16th International Conference on Systems, Signals and Image Processing, IWSSIP 2009, pp. 1-4.
[22] Rosenberg, I. G., Hypergroups and join spaces determined by relations, Ital. J. Pure Appl. Math., 4, 93-101 (1998) · Zbl 0962.20055
[23] Tsitouras, Ch.; Massouros, Ch. G., On enumerating hypergroups of order 3, Comput. Math. Appl., 59, 519-523 (2010) · Zbl 1189.20067
[24] Wolfram Research, Inc., Mathematica, Version 7.0, Champaign, IL, 2008.; Wolfram Research, Inc., Mathematica, Version 7.0, Champaign, IL, 2008.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.