Results 31 to 40 of about 462 (185)
Properties of products for flatness in the category of $S$-posets [PDF]
This paper is devoted to the study of products of classes of right $S$-posets possessing one of the flatness properties and preservation of such properties under products.
Roghaieh Khosravi, Mojtaba Sedaghatjoo
doaj
Poset limits and exchangeable random posets [PDF]
36 ...
openaire +2 more sources
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices generalize distributive lattices by removing the graded hypothesis: a graded trim lattice is a distributive lattice,
Thomas, Hugh, Williams, Nathan
openaire +3 more sources
The aim of this paper is to generalize fuzzy continuous posets. The concept of fuzzy subset system on fuzzy posets is introduced; some elementary definitions such as fuzzy -continuous posets and fuzzy -algebraic posets are given.
S. P. Rao, Q. G. Li
doaj +1 more source
AbstractHirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite chains and antichains, in infinite computable stable and weakly stable posets.
Jockusch, Jr., Carl G. +4 more
openaire +3 more sources
On a generalization of I-regularity
Let SS be a pomonoid. The projectivity and strong flatness of right SS-posets have been central topics in the homological classification of pomonoids in recent decades. In 2005, Shi et al. introduced II-regular SS-posets and proved that all its cyclic SS-
Qiao Husheng, Feng Leting
doaj +1 more source
AmS-LaTeX, 36 pages; references added, discussion of the Babson-Hersh result in Section 3 ...
Hetyei, Gábor, Krattenthaler, Christian
openaire +4 more sources
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
S-limit defined on s_2-continuous posets is an important convergence structure. In this paper , we define s_2MS-continuous posets and MS-limit by replacing the directed set with set family.
WANG Wu, ZHANG Shun, TAN Bin
doaj
36 pages, 1 figure. Added a reference to Daykin--Daykin--Paterson inequality that were previously presented as Conjecture 4.19 in ...
Swee Hong Chan, Igor Pak, Greta Panova
openaire +2 more sources

