Results 181 to 190 of about 354,394 (221)
Self-generating autocatalytic networks: structural results, algorithms and their relevance to early biochemistry. [PDF]
J R Soc InterfaceHuson D, Xavier JC, Steel M.
europepmc +1 more source
Semigroup actions on ordered groupoids
Mathematica Slovaca, 2013 In this paper we prove that if S is a commutative semigroup acting on an ordered groupoid G, then there exists a commutative semigroup S̃ acting on the ordered groupoid G̃:=(G × S)/ρ̄ in such a way that G is embedded in G̃.
Niovi Kehayopulu
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Semigroup Forum, 2009
A semigroup algebra \(kS\) admits a total ordering if and only if the field \(k\) is formally real and \(S\) is a cancellative orderable semigroup. The case of \(*\)-orderability of \(kS\) is much harder. The notion of a \(*\)-ordering has been extended from division rings to general noncommutative rings in a series of papers by \textit{M.
Klep, Igor, Moravec, Primož
openaire +2 more sources
A semigroup algebra \(kS\) admits a total ordering if and only if the field \(k\) is formally real and \(S\) is a cancellative orderable semigroup. The case of \(*\)-orderability of \(kS\) is much harder. The notion of a \(*\)-ordering has been extended from division rings to general noncommutative rings in a series of papers by \textit{M.
Klep, Igor, Moravec, Primož
openaire +2 more sources
Information Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Shabir, Asghar Khan
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Shabir, Asghar Khan
openaire +2 more sources
Mathematical Logic Quarterly, 2010
AbstractMolodtsov introduced 1999 the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to ordered semigroups.
Young Bae Jun +2 more
openaire +2 more sources
AbstractMolodtsov introduced 1999 the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to ordered semigroups.
Young Bae Jun +2 more
openaire +2 more sources
2012
The number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed Constraint Satisfaction to show that the ...
Andreas Distler +3 more
openaire +2 more sources
The number of finite semigroups increases rapidly with the number of elements. Since existing counting formulae do not give the complete number of semigroups of given order up to equivalence, the remainder can only be found by careful search. We describe the use of mathematical results combined with distributed Constraint Satisfaction to show that the ...
Andreas Distler +3 more
openaire +2 more sources
Bisimple Inverse Semigroups as Semigroups of Ordered Triples
Canadian Journal of Mathematics, 1968In (8) and (13) it has been shown that certain bisimple inverse semigroups, called bisimple ω-semigroups and bisimple Z-semigroups, can be represented as semigroups of ordered triples. In these cases, two of the components of each triple are integers, and the third is drawn from a fixed group.
Reilly, N. R., Clifford, A. H.
openaire +1 more source