Results 51 to 60 of about 1,089 (143)

Construction of composition (m, n, k)-hyperrings

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
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

On Convex Ordered Hyperrings

open access: yesSymmetry, 2022
The concept of convex ordered hyperrings associated with a strongly regular relation was investigated in this study. In this paper, we first studied hyperatom elements of ordered hyperrings and then investigated characterizations of quotient ordered ...
Yongsheng Rao   +2 more
semanticscholar   +1 more source

On Strongly Associative (Semi)Hypergroups [PDF]

open access: yes, 2017
In this paper we introduce the notion of a strongly associative hyperoperation that we call SASS and obtain new class of semihypergroups...
Jafarpour, M. (Morteza)   +2 more
core   +1 more source

Associate, Hyperdomainlike, and Presimplifiable Hyperrings

open access: yesJournal of Mathematics, 2014
Based on the works of Axtell et al., Anderson et al., and Ghanem on associate, domainlike, and presimplifiable rings, we introduce new hyperrings called associate, hyperdomainlike, and presimplifiable hyperrings.
Agboola Adesina Abdul Akeem   +1 more
doaj   +1 more source

On S-prime hyperideals in multiplicative hyperrings

open access: yesJournal of Algebraic Hyperstructures and Logical Algebras, 2021
Let R be a multiplicative hyperring and S be a subset of R be a multiplicatively closed subset of R. In this paper, we introduce and study the concept of S-prime hyperideals which is a generalization of prime hyperideals.
P. Ghiasvand, F. Farzalipour
semanticscholar   +1 more source

Transitivity of the εm-relation on (m-idempotent) hyperrings

open access: yesOpen Mathematics, 2018
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

A Note on the w-Pseudo-Orders in Ordered (Semi)Hyperrings

open access: yesSymmetry, 2021
In this work, we study the notion of w-pseudo-order on an ordered (semi)hyperring and give some explicit examples. In addition, we give some examples to compare weak pseudo-order relations with pseudo-order relations.
Xiaoli Qiang, Hao Guan, H. Rashmanlou
semanticscholar   +1 more source

OPTIMAL HYPER-MINIMIZATION [PDF]

open access: yesInternational Journal of Foundations of Computer Science, 2011
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

Topological Krasner hyperrings with special emphasis on isomorphism theorems

open access: yesApplied General Topology, 2022
Krasner hyperring is one of the generalizations of the classical ring in literature. In this paper, the notion of topological Krasner hyperring is introduced as a generalization of topological ring and variant of isomorphism theorems are ...
M. Singha, Kousik Das
semanticscholar   +1 more source

Hyper academia [PDF]

open access: yesInternational Journal of Tourism Cities, 2019
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

Home - About - Disclaimer - Privacy