Results 21 to 30 of about 532 (199)

The Category of $S$-Fuzzy Posets [PDF]

open access: yesSahand Communications in Mathematical Analysis, 2023
In this paper, we define and consider, the category {\bf FPos}-$S$ of all $S$-fuzzy posets and action-preserving monotone maps between them. $S$-fuzzy poset congruences which play an important role in studying thecategorical properties of $S$-fuzzy ...
Leila Shahbaz
doaj   +1 more source

On direct products of S-posets satisfying flatness properties

open access: bronzeTURKISH JOURNAL OF MATHEMATICS, 2013
In this paper we characterize pomonoids over which various flatness properties of S-posets are preserved under direct products.
Roghaieh Khosravi
openalex   +3 more sources

ORDER DENSE ESSENTIALITY AND BEHAVIOR OF ORDER DENSE INJECTIVITY [PDF]

open access: yesJournal of Algebraic Systems, 2020
In this paper, we study the categorical and algebraic properties, such as limits and colimits of the category Pos-S with respect to order dense embeddings. Injectivity with respect to this class of monomorphisms has been studied by the author and used to
L. Shahbaz
doaj   +1 more source

The coefficients of transitivity of the posets of MM-type being the highest supercritical poset

open access: yesНауковий вісник Ужгородського університету. Серія: Математика і інформатика, 2022
The representations of partially ordered sets (abbreviated as posets), introduced by L. A. Nazarova and A. V. Roiter (in matrix form) in 1972, play an important role in the modern representation theory. In his first paper on this topic M. M.
В. М. Бондаренко   +2 more
doaj   +1 more source

Categorical Properties of Down Closed Embeddings [PDF]

open access: yesSahand Communications in Mathematical Analysis, 2022
Let $\mathcal M$ be a  class of (mono)morphisms in a category $\mathcal A$. To study mathematical notions, such as injectivity, tensor products, flatness, one needs to have some categorical and algebraic information about the pair (${\mathcal A ...
Leila Shahbaz
doaj   +1 more source

An extension of Tamari lattices [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
For any finite path $v$ on the square lattice consisting of north and east unit steps, we construct a poset Tam$(v)$ that consists of all the paths lying weakly above $v$ with the same endpoints as $v$.
Louis-François Préville-Ratelle   +1 more
doaj   +1 more source

On Condition $(PWP)_{w}$ for $S$-posets

open access: bronzeCategories and General Algebraic Structures with Applications, 2015
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. Specifically, we characterize a pomonoid $S$ over which its nonempty products as right $S$-posets satisfy some known flatness properties.
Xingliang Liang, Yanfeng Luo
openalex   +4 more sources

A birational lifting of the Stanley-Thomas word on products of two chains [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of periodicity, orbit structure, and invariants.
Michael Joseph, Tom Roby
doaj   +1 more source

A two-sided analogue of the Coxeter complex [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
For any Coxeter system (W, S) of rank n, we introduce an abstract boolean complex (simplicial poset) of dimension 2n − 1 which contains the Coxeter complex as a relative subcomplex.
T. Kyle Petersen
doaj   +1 more source

Paths to Understanding Birational Rowmotion on Products of Two Chains [PDF]

open access: yes, 2018
Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivariantly on antichains) of a poset $P ...
Musiker, Gregg, Roby, Tom
core   +3 more sources

Home - About - Disclaimer - Privacy