Results 11 to 20 of about 730 (54)
Soft Substructures in Quantales and Their Approximations Based on Soft Relations. [PDF]
The aim of this research article is to derive a new relation between rough sets and soft sets with an algebraic structure quantale by using soft binary relations. The aftersets and foresets are utilized to define lower approximation and upper approximation of soft subsets of quantales.
Zhou H +5 more
europepmc +2 more sources
On Multiplicative (Generalized)‐Derivation Involving Semiprime Ideals
Let A be any arbitrary associative ring, P a semiprime ideal, and J a nonzero ideal of A. In this study, using multiplicative (generalized)‐derivations, we explore the behavior of semiprime ideals that satisfy certain algebraic identities. Moreover, examples are provided to demonstrate that the restrictions imposed on the hypotheses of the various ...
Hafedh M. Alnoghashi +3 more
wiley +1 more source
Centralizing n‐Homoderivations of Semiprime Rings
We introduce the notion of n‐homoderivation on a ring ℜ and show that a semiprime ring ℜ must have a nontrivial central ideal if it admits an appropriate n‐homoderivation which is centralizing on some nontrivial one‐sided ideal. Under similar hypotheses, we prove commutativity in prime rings.
M. S. Tammam El-Sayiad +3 more
wiley +1 more source
Centrally Extended α‐Homoderivations on Prime and Semiprime Rings
We present a new type of mappings called centrally extended α‐homoderivations of a ring ℜ (i.e., a map H from ℜ into ℜ which satisfies H(x + y) − H(x) − H(y) ∈ Z(ℜ) and H(xy) − H(x)H(y) − H(x)α(y) − α(x)H(y) ∈ Z(ℜ) for any x, y ∈ ℜ) where α is a mapping of ℜ and discuss the relationship between these mappings and other related mappings.
Mahmoud M. El-Soufi +2 more
wiley +1 more source
Cryptographic Accumulator and Its Application: A Survey
Since the concept of cryptographic accumulators was first proposed in 1993, it has received continuous attention from researchers. The application of the cryptographic accumulator is also more extensive. This paper makes a systematic summary of the cryptographic accumulator.
Yongjun Ren +5 more
wiley +1 more source
2‐Prime Hyperideals of Multiplicative Hyperrings
Multiplicative hyperrings are an important class of algebraic hyperstructures which generalize rings further to allow multiple output values for the multiplication operation. Let R be a commutative multiplicative hyperring. A proper hyperideal I of R is called 2‐prime if x∘y⊆I for some x, y ∈ R, then, x2⊆I or y2⊆I.
Mahdi Anbarloei, Xiaogang Liu
wiley +1 more source
Lattice Points on the Fermat Factorization Method
In this paper, we study algebraic properties of lattice points of the arc on the conics x2 − dy2 = N especially for d = 1, which is the Fermat factorization equation that is the main idea of many important factorization methods like the quadratic field sieve, using arithmetical results of a particular hyperbola parametrization.
Regis Freguin Babindamana +3 more
wiley +1 more source
Characterizing Jordan Derivable Maps on Triangular Rings by Local Actions
Suppose that T=TriA,ℳ,ℬ is a 2‐torsion free triangular ring, and S=A,B|AB=0,A,B∈T∪A,X|A∈T, X∈P,Q, where P is the standard idempotent of T and Q = I − P. Let δ:T⟶T be a mapping (not necessarily additive) satisfying, A,B∈S⇒δA∘B=A∘δB+δA∘B, where A∘B = AB + BA is the Jordan product of T.
Hoger Ghahramani +3 more
wiley +1 more source
A Class of Nonlinear Nonglobal Semi‐Jordan Triple Derivable Mappings on Triangular Algebras
In this paper, we proved that each nonlinear nonglobal semi‐Jordan triple derivable mapping on a 2‐torsion free triangular algebra is an additive derivation. As its application, we get the similar conclusion on a nest algebra or a 2‐torsion free block upper triangular matrix algebra, respectively.
Xiuhai Fei, Haifang Zhang, Wenpeng Zhang
wiley +1 more source
Prime Graphs of Polynomials and Power Series Over Noncommutative Rings
The prime graph PG(R) of a ring R is a graph whose vertex set consists of all elements of R. Two elements x, y ∈ R are adjacent in the graph if and only if xRy = 0 or yRx = 0. An element a ∈ R is called a strong zero divisor in R if 〈a〉〈b〉 = 0 or 〈b〉〈a〉 = 0 for some nonzero element b ∈ R. The set of all strong zero divisors is denoted by S(R).
Walaa Obaidallah Alqarafi +3 more
wiley +1 more source

