Results 231 to 240 of about 823,935 (279)

BAAR: A framework for blockchain-based anonymous and revocable user authentication scheme. [PDF]

PLoS One
Ahmed M, Ahmad A, Zeshan F, Akram S.
europepmc   +1 more source

Resistance gene against <i>Xanthomonas oryzae pv. Oryzae (Xoo</i>) in rice: molecular mechanisms and breeding strategies for bacterial leaf blight. [PDF]

Front Plant Sci
Jiang H, Huang Q, Yang C, Liang Y.
europepmc   +1 more source

Efficient computation and design of high speed double precision Vedic multiplier architecture. [PDF]

Sci Rep
Kumar AS, Sahitya G, Kusuma R, Krishna MS, Reddy BNK, Tripathi SL.   +5 more
europepmc   +1 more source

Mesolithic Hunter-Gatherer Adaptations to Small Mediterranean Island Ecosystems

Mata-González M, Stewart M, Blinkhorn J, Blackwood A, Dijen Jv, Peters C, Allué E, Burguet-Coca A, Currás A, Groucutt H, Vella N, Scerri EML.   +11 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

s-Prime elements in multiplicative lattices

Periodica Mathematica Hungarica, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jayaram, C., Johnson, E. W.
openaire   +1 more source

Prime elements from prime ideals

Order, 1985
In the summer of 1984 A. R. Blass proved that the ''Almost Maximal Ideal Theorem'' which had been introduced by the reviewer [Fundam. Math. 123, 197-209 (1984; Zbl 0552.06004)] - and which he had previously believed to be a choice principle intermediate between the Prime Ideal Theorem and the Axiom of Choice - was in fact logically equivalent to the ...
openaire   +2 more sources

Elements Weakly Prime and Weakly Primary to Another Element

British Journal of Mathematics & Computer Science, 2016
Let L be a compactly generated multiplicative lattice with 1 compact in which every nite product of compact elements is compact and M be a module over L. In this paper we generalize the concepts of an element prime to another element and an element primary to another element in a lattice module M and obtain the characterizations of an element prime to ...
C Manjarekar, A Chavan
openaire   +1 more source

Minimal Elements for the Prime Numbers

Experimental Mathematics, 2016
We say a string of symbols s is minimal for a language L if s is a member of L, and it is not possible to obtain another member of L by striking out one or more symbols from s. Although the set M(L) of minimal strings is necessarily finite, determining it explicitly for a given L can be a difficult computational problem.
Bright, Curtis, Devillers, Raymond, Shallit, Jeffrey   +2 more
openaire   +1 more source

Join-prime elements in semidistributive lattices

Algebra Universalis, 1981
In this paper we shall discuss some aspects of the relation between the structure of a finite semidistributive lattice L and the set P(L) of its join-prime elements. These investigations were motivated in part by the results of the first author in [2] and [3], wherein finite sublattices of a free lattice which are generated by both their join-prime and
Gaskill, H. S., Nation, J. B.
openaire   +2 more sources

Prime elements in a localic topos

Algebra Universalis, 1989
The notion of prime filter is studied in the context of sheaves of boolean algebras on a given locale. Unlike the classical case, this notion is no longer equivalent to that of ultrafilter. A rather mild condition, satisfied by all topological spaces, is introduced on the locale and ensures that the classical Stone embedding theorem for boolean ...
Borceux, Francis, Pedicchio, Maria-Cristina   +1 more
openaire   +2 more sources