Results 171 to 180 of about 881 (228)
CS-indecomposable ordered semigroups
An ordered semigroup S is called CS-indecomposable if the set S × S is the only complete semilattice congruence on S. In the present paper we prove that each ordered semigroup is, uniquely, a complete semilattice of CS-indecomposable semigroups, which ...
Tsingelis, M., Kehayopulu, N.
core
Dynamics of a reaction-diffusion SIRS model with general incidence rate in a heterogeneous environment. [PDF]
Avila-Vales E, Pérez ÁGC.
europepmc +1 more source
Geometric Scattering on Measure Spaces. [PDF]
Chew J +7 more
europepmc +1 more source
Encoding multistate charge order and chirality in endotaxial heterostructures. [PDF]
Husremović S +11 more
europepmc +1 more source
Congruency, Homomorphism and Isomorphism on Autometrized Algebras. [PDF]
Tilahun GY.
europepmc +1 more source
Spatial and temporal dynamics of SARS-CoV-2: Modeling, analysis and simulation. [PDF]
Wu P, Wang X, Feng Z.
europepmc +1 more source
Evaluation of disposal techniques for electronic circuit board waste based on fuzzy multi-criteria decision analysis. [PDF]
Ijaz B +6 more
europepmc +1 more source
Embeddings into left-orderable simple groups. [PDF]
Darbinyan A, Steenbock M.
europepmc +1 more source
Constructing Number Field Isomorphisms from *-Isomorphisms of Certain Crossed Product C*-Algebras. [PDF]
Bruce C, Takeishi T.
europepmc +1 more source

