Enumeration of hypercompositional structures defined by binary relations.

zbMATH Open1244.20065MaRDI QIDQ2890645FDOQ2890645

Ch. G. Massouros, Ch. Tsitouras

Publication date: 11 June 2012

Published in: Italian Journal of Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://ijpam.uniud.it/online_issue/201128/06-MassourosTsitouras.pdf

zbMATH Keywords

binary relationshypercompositionshyperoperationsnumbers of hypergroupoids

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Relational systems, laws of composition (08A02) Hypergroups (20N20)

Cited In (8)

• Fully simple semihypergroups.
• Enumeration of Rosenberg-type hypercompositional structures defined by binary relations.
• Hyperstructures associated with binary relations
• BinaryTest
• Title not available (Why is that?)
• On \(EL\)-semihypergroups.
• \(n\)-ary Cartesian composition of automata
• Classification of Krasner hyperfields of order 4

Uses Software

• Mathematica

Recommendations

• Enumerations in computable structure theory 👍 👎
• Hyperstructures associated with binary relations 👍 👎
• Enumeration of Rosenberg-type hypercompositional structures defined by binary relations. 👍 👎
• Advanced results in enumeration of hyperstructures. 👍 👎
• Compositions and decompositions of binary relations 👍 👎
• The concept of a binary relation over partial enumerated sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Enumeration of hypercompositional structures defined by binary relations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890645)