Results 171 to 180 of about 48,121,096 (211)
Some of the next articles are maybe not open access.
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partial order set). This algorithm is based on the chromatic number of a graph instead of the classical approach based on the chromatic number of some ...
Javier Montero, Javier Yáñez
exaly +2 more sources
Δ1-Completions of a Poset [PDF]
A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems
Alessandra Palmigiano +2 more
exaly +4 more sources
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 +2 more sources
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 +2 more sources
Groups of Linear Isometries on Poset Structures
Let V be an n-dimensional vector space over a finite field Fq and P={1,2,…,n} a poset. We consider on V the poset-metric dP. In this paper, we give a complete description of groups of linear isometries of the metric space (V,dP), for any poset-metric ...
Marcelo Firer +2 more
exaly +2 more sources
On Conditions (P′) and (Pw′) for S-posets
Journal of Algebra and Its Applications, 2023Partially ordered monoids (or pomonoids) [Formula: see text] acting on a partially ordered set (or poset), briefly [Formula: see text]-posets, appear naturally in the study of mappings between posets, and play an essential role in pomonoid theory. The study of flatness properties of [Formula: see text]-posets was initiated by Fakhruddin in the 1980s ...
Xingliang Liang +2 more
openaire +1 more source
On injective hulls of $$S$$ S -posets
Semigroup Forum, 2014The authors describe injectives in the category of \(S\)-posets with \(S\)-submultiplicative morphisms and construct injective hulls of \(S\)-posets with respect to a specific class \({\mathcal E}_{\leq}\) of morphisms. The main theorem reads as follows: For every \(S\)-poset \(A_S\), the quantal \({\mathcal Q}(A)_S\) is the \({\mathcal E}_{\leq ...
Zhang, Xia, Laan, Valdis
openaire +2 more sources
On a generalization of principal weak (po-)flatness of S-posets
Asian-European Journal of Mathematics, 2021In [H. Rashidi, A. Golchin and H. Mohammadzadeh saany, On [Formula: see text]-flat acts, Categ. Gen. Algebr. Struct. Appl. 12(1) (2020) 175–197], the study of [Formula: see text]-flatness property of right acts [Formula: see text] over a monoid [Formula: see text] that can be described by means of when the functor [Formula: see text]-preserves some ...
Hamideh Rashidi +2 more
openaire +1 more source
Error-Block Codes and Poset Metrics [PDF]
Let P = ({1, 2,..., n},
Marcelo Firer +2 more
exaly +2 more sources
Semigroup Forum, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

