Results 41 to 50 of about 411 (135)
Semi-derivation on prime hyperrings [PDF]
In this paper, we study the notion of semi-derivation in Krasner hyperring and present some examples of them.We intro-duce the concept of generalized semi-derivation in Krasner hyper-ring and present some examples.Then, we derive some properties of semi ...
Nikhil D. Sonone, Kishor F. Pawar
doaj +1 more source
Topological Structures of Lower and Upper Rough Subsets in a Hyperring
In this paper, we study the connection between topological spaces, hyperrings (semi-hypergroups), and rough sets. We concentrate here on the topological parts of the lower and upper approximations of hyperideals in hyperrings and semi-hypergroups.
Nabilah Abughazalah +2 more
doaj +1 more source
Existence theorem of finite krasner hyperfields [PDF]
The concern of this paper is to show that there always exist Krasner hyperfields of order n, where n is an integer greaterthan or equal to 2.
Yuming Feng +3 more
doaj +1 more source
Some Results on the Divisible Hyperrings
A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element.
Mayssam Fadel Abood +1 more
doaj +1 more source
Construction of composition (m, n, k)-hyperrings
In this paper, our aim is to introduce the notion of a composition (m, n, k)-hyperring and to analyze its properties. We also consider the algebraic structure of (m, n, k) hyperrings which is a generalization of composition rings and composition ...
Davvaz B. +2 more
doaj +1 more source
Transitivity of the εm-relation on (m-idempotent) hyperrings
On a general hyperring, there is a fundamental relation, denoted γ*, such that the quotient set is a classical ring. In a previous paper, the authors defined the relation εm on general hyperrings, proving that its transitive closure εm∗$\begin{array}{} \
Norouzi Morteza, Cristea Irina
doaj +1 more source
OPTIMAL HYPER-MINIMIZATION [PDF]
Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the input DFA, by [GAWRYCHOWSKI and JEŻ: Hyper-minimisation made efficient. Proc. MFCS, LNCS 5734, 2009] and [HOLZER and
Maletti, Andreas, Quernheim, Daniel
openaire +2 more sources
Regular Parameter Elements and Regular Local Hyperrings
Inspired by the concept of regular local rings in classical algebra, in this article we initiate the study of the regular parameter elements in a commutative local Noetherian hyperring.
Hashem Bordbar, Irina Cristea
doaj +1 more source
Purpose What ought we morally to do in a tourism academia dominated by metrics, quantification and digital codification? The purpose of this paper is to address this question by presenting the idea of “hyper academia” and exploring ethical perspectives and values related to hyper-digital cultures.
openaire +2 more sources
HYPER PATHS AND HYPER CYCLES [PDF]
In graphs, paths are walks with no repeated vertex. A fortiori, paths cannot have any repeated edge. But in hypergraphs, hyperedges can re- peat in vertex-to-vertex walks without causing repetition of any vertex. This is the crux of the idea of generalizing paths and cycles (from graphs to hyper- graphs) presented in this short article.
R. Dharmarajan, K. Kannan
openaire +1 more source

