.png){kind=icon}
Return
Boolean algebras as a tool to implement and analyze hypercompositional structures
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2025.129840.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Any finite set equipped with a hyperoperation can be uniquely encoded as a finite binary string. • Finding particular elements in hypergroups and characterizing different types of subhypergroups by leveraging Boolean algebra isomorphisms. • Implementation of codes using Rust for testing properties of hypercompositional structures and identifying their particular elements and substructures.
Keywords:
Hypercompositional structures
Boolean algebras
Algorithm
20N20
06E05
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
No cited papers available