Enumeration of Rosenberg-type hypercompositional structures defined by binary relations.
From MaRDI portal
Publication:449204
DOI10.1016/j.ejc.2012.03.032zbMath1250.20063OpenAlexW2150174285MaRDI QIDQ449204
Ch. G. Massouros, Ch. Tsitouras
Publication date: 12 September 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.032
Symbolic computation and algebraic computation (68W30) Relational systems, laws of composition (08A02) Hypergroups (20N20)
Related Items (3)
Advanced results in enumeration of hyperfields ⋮ About the fundamental relations defined on the hypergroupoids associated with binary relations. ⋮ Enumeration of Rosenberg hypergroups.
Uses Software
Cites Work
- About the fundamental relations defined on the hypergroupoids associated with binary relations.
- Fortified join hypergroups
- Binary relations and reduced hypergroups.
- On enumeration of hypergroups of order 3.
- On the semi-sub-hypergroups of a hypergroup
- Hypergroups and binary relations
- Strong identities and fortification in transposition hypergroups
- Hypergroups Associated with Graphs and Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumeration of Rosenberg-type hypercompositional structures defined by binary relations.