Results 111 to 120 of about 402 (157)

Absolutely closed semigroups. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Banakh T, Bardyla S.
europepmc   +1 more source

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. [PDF]

Algorithmica
Benford A, Lehre PK.
europepmc   +1 more source

More minimal non- σ -scattered linear orders. [PDF]

Eur J Math
Shalev R.
europepmc   +1 more source

The Abelian group structure of full factorial designs. [PDF]

Front Psychol
Altieri NA.
europepmc   +1 more source

Algebraic Representations of Entropy and Fixed-Sign Information Quantities. [PDF]

Entropy (Basel)
Down KJA, Mediano PAM.
europepmc   +1 more source

A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees. [PDF]

Discrete Appl Math
Lappo E, Rosenberg NA.
europepmc   +1 more source

Methods for Analyzing RNA Pseudoknots via Chord Diagrams and Intersection Graphs. [PDF]

Bull Math Biol
Ibrahim R, Moore AH.
europepmc   +1 more source

Lorentzian bordisms in algebraic quantum field theory. [PDF]

Lett Math Phys
Bunk S, MacManus J, Schenkel A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Basic theory of s-posets

Soft Computing, 2023
In this paper, we have established the notions of soft order relations and studied its basic structural properties. We give the concepts of soft maximum, soft minimum, soft maximal, soft minimal, soft infimum and soft supremum in any s-poset. Then, the concept of soft order preserving mapping is defined and given some basic results.
openaire   +1 more source