EL-hyperstructures revisited

An Overview of the Foundations of the Hypergroup Theory

This paper is written in the framework of the Special Issue of Mathematics entitled “Hypercompositional Algebra and Applications”, and focuses on the presentation of the essential principles of the hypergroup, which is the prominent structure of hypercompositional algebra. In the beginning, it reveals the structural relation between two fundamental entities of abstract algebra, the group and the hypergroup. Next, it presents the several types of hypergroups, which derive from the enrichment of the hypergroup with additional axioms besides the ones it was initially equipped with, along with their fundamental properties. Furthermore, it analyzes and studies the various subhypergroups that can be defined in hypergroups in combination with their ability to decompose the hypergroups into cosets. The exploration of this far-reaching concept highlights the particularity of the hypergroup theory versus the abstract group theory, and demonstrates the different techniques and special tools that must be developed in order to achieve results on hypercompositional algebra.

Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators

The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders. By using a suitable ordering or preordering of groups linear differential operators we construct hypercompositional structures of linear differential operators. Moreover, we construct actions of groups of differential operators on rings of polynomials of one real variable including diagrams of actions–considered as special automata. Finally, we obtain sequences of hypergroups and automata. The examples, we choose to explain our theoretical results with, fall within the theory of artificial neurons and infinite cyclic groups.

Hypercompositional Algebra, Computer Science and Geometry

The various branches of Mathematics are not separated between themselves. On the contrary, they interact and extend into each other’s sometimes seemingly different and unrelated areas and help them advance. In this sense, the Hypercompositional Algebra’s path has crossed, among others, with the paths of the theory of Formal Languages, Automata and Geometry. This paper presents the course of development from the hypergroup, as it was initially defined in 1934 by F. Marty to the hypergroups which are endowed with more axioms and allow the proof of Theorems and Propositions that generalize Kleen’s Theorem, determine the order and the grade of the states of an automaton, minimize it and describe its operation. The same hypergroups lie underneath Geometry and they produce results which give as Corollaries well known named Theorems in Geometry, like Helly’s Theorem, Kakutani’s Lemma, Stone’s Theorem, Radon’s Theorem, Caratheodory’s Theorem and Steinitz’s Theorem. This paper also highlights the close relationship between the hyperfields and the hypermodules to geometries, like projective geometries and spherical geometries.

n-Ary Cartesian Composition of Multiautomata with Internal Link for Autonomous Control of Lane Shifting

In this paper, which is based on a real-life motivation, we present an algebraic theory of automata and multi-automata. We combine these (multi-)automata using the products introduced by W. Dörfler, where we work with the cartesian composition and we define the internal links among multiautomata by means of the internal links’ matrix. We used the obtained product of n-ary multi-automata as a system that models and controls certain traffic situations (lane shifting) for autonomous vehicles.

The Symmetry of Lower and Upper Approximations, Determined by a Cyclic Hypergroup, Applicable in Control Theory

In the first part of our paper, we construct a cyclic hypergroup of matrices using the Ends Lemma. Its properties are then, in the second part of the paper, used to describe the symmetry of lower and upper approximations in certain rough sets with respect to invertible subhypergroups of this cyclic hypergroup. Since our approach is widely used in autonomous robotic systems, we suggest an application of our results for the study of detection sensors, which are used especially in mobile robot mapping.

Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures

The aim of this paper is to study, from an algebraic point of view, the properties of interdependencies between sets of elements (i.e., pieces of secrets, atmospheric variables, etc.) that appear in various natural models, by using the algebraic hyperstructure theory. Starting from specific examples, we first define the relation of dependence and study its properties, and then, we construct various hyperoperations based on this relation. We prove that two of the associated hypergroupoids are H v -groups, while the other two are, in some particular cases, only partial hypergroupoids. Besides, the extensivity and idempotence property are studied and related to the cyclicity. The second goal of our paper is to provide a new interpretation of the dependence relation by using elements of the theory of algebraic hyperstructures.

Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, E L -hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.

Analysis of Topological Endomorphism of Fuzzy Measure in Hausdorff Distributed Monoid Spaces

The concepts of fuzzy sets and topology are widely applied to model various algebraic structures and computations. The dynamics of fuzzy measures in topological spaces having distributed monoid embeddings is an interesting topic in the presence of topological endomorphism. This paper presents the analysis of topological endomorphism and the properties of topological fuzzy measures in distributed monoid spaces. The topological space is considered to be Hausdorff and second countable in nature. The analysis of consistency of fuzzy measure in endomorphic topological spaces is formulated. The algebraic structures of endomorphic topological spaces having distributed cyclic monoids are constructed. The cyclic monoids contain specific generators, and a related cyclic topological endomorphism within the subspace is formulated. The analytical properties of fuzzy topological measures in the presence of cyclic topological endomorphism are presented. A comparative analysis of this proposed work with other related work in the domain is included.

Cyclicity in EL–Hypergroups

In the algebra of single-valued structures, cyclicity is one of the fundamental properties of groups. Therefore, it is natural to study it also in the algebra of multivalued structures (algebraic hyperstructure theory). However, when one considers the nature of generalizing this property, at least two (or rather three) approaches seem natural. Historically, all of these had been introduced and studied by 1990. However, since most of the results had originally been published in journals without proper international impact and later—without the possibility to include proper background and context-synthetized in books, the current way of treating the concept of cyclicity in the algebraic hyperstructure theory is often rather confusing. Therefore, we start our paper with a rather long introduction giving an overview and motivation of existing approaches to the cyclicity in algebraic hyperstructures. In the second part of our paper, we relate these to E L -hyperstructures, a broad class of algebraic hyperstructures constructed from (pre)ordered (semi)groups, which were defined and started to be studied much later than sources discussed in the introduction were published.