Results 91 to 100 of about 141 (119)
Evolverator: An engineered in cellulo yeast system to drive rapid continuous evolution of proteins
Azizoglu A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Height of Prime and Weakly Prime Submodules
Mediterranean Journal of Mathematics, 2010This article introduces and studies new definitions for the height of prime submodules and weakly prime submodules. New versions of catenary modules are discussed.
A Azizi
exaly +2 more sources
Classical and Weakly Prime L-Submodules
Most of problems in biology, economics, ecology, engineering, environmental science, medical science, social science etc. have various uncertainties. Fuzzy set theory, rough set theory, vague set theory, interval mathematics probability, soft set theory are different ways of expressing uncertainty. Let L be a complete lattice.
Razieh Mahjoob, Shaheen Qiami
openaire +2 more sources
SOME PROPERTIES OF GRADED PRIME AND GRADED WEAKLY PRIME SUBMODULES
Khaldoun Al-Zoubi, Boshra Rabab’a
openaire +2 more sources
Almost prime and weakly prime submodules
Journal of Algebra and Its Applications, 2019Let [Formula: see text] be an arbitrary ring and [Formula: see text] be a right [Formula: see text]-module. A proper submodule [Formula: see text] of [Formula: see text] is called almost prime (respectively, weakly prime) if for each submodule [Formula: see text] of [Formula: see text] and each ideal [Formula: see text] of [Formula: see text] that ...
Beiranvand, P. Karimi, Beyranvand, R.
openaire +2 more sources
AIP Conference Proceedings, 2021
Cryptography is a branch of mathematics used in digital security systems. Some cryptographic algorithms, such as RSA, depending on the prime factorization of integers. However, quantum computers might be a threat to some algorithms in cryptography.
Rina Juliana +2 more
openaire +1 more source
Cryptography is a branch of mathematics used in digital security systems. Some cryptographic algorithms, such as RSA, depending on the prime factorization of integers. However, quantum computers might be a threat to some algorithms in cryptography.
Rina Juliana +2 more
openaire +1 more source
On \((n -1, n)\)-\(Phi_m\)-prime and \((n -1, n)\)-weakly prime submodules
2018Summary: Let \(m\), \(n \geq 2\) be two positive integers, \(R\) a commutative ring with identity and \(M\) a unitary \(R\)-module. A proper submodule \(P\) of \(M\) is an \((n-1, n)\)-\(\Phi_{m}\)-prime (\((n-1, n)\)-weakly prime) submodule if \(a_1, \ldots, a_{n-1}\in R\), \(x\in M\) with \(a_1 \ldots a_{n-1} x\in P\backslash (P:M)^{m-1} P(0\neq a_1 ...
Ebrahimpour, M., Mirzaee, F.
openaire +2 more sources
Weakly Prime Radical of Submodules
2023In this paper, some properties of weakly prime radical are stated. The characterization of weakly prime radical for finitely generated modules is given. Also, the relationship between the weakly prime radical of a submodule and the ideals of the ring T is considered. © 2023, Prof. Dr. Mehmet Zeki SARIKAYA. All rights reserved.
openaire +2 more sources

