AbstractA notion of reducibility in finite posets is studied. Deletable elements in upper semimodular posets are characterized. Though it is known that the class of upper semimodular lattices is reducible, we construct an example of an upper semimodular poset that is not reducible. Reducibility of pseudocomplemented posets is studied
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
AbstractA notion of reducibility in finite posets is studied. Deletable elements in upper semimodula...
AbstractLet P be a poset in a class of posets P. A smallest positive integer r is called reducibilit...
AbstractLet P be a poset in a class of posets P. A smallest positive integer r is called reducibilit...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet adm...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
What is cyclic reducibility? Cyclically fully commutative (CFC) elements 3 Toric posets Ordinary par...
AbstractIn this note we are dealing with Ulam's reconstruction conjecture applied to finite partiall...
The notion of reducibility for a pseudovariety has been introduced as an abstract property which may...
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet adm...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
AbstractA notion of reducibility in finite posets is studied. Deletable elements in upper semimodula...
AbstractLet P be a poset in a class of posets P. A smallest positive integer r is called reducibilit...
AbstractLet P be a poset in a class of posets P. A smallest positive integer r is called reducibilit...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet adm...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
What is cyclic reducibility? Cyclically fully commutative (CFC) elements 3 Toric posets Ordinary par...
AbstractIn this note we are dealing with Ulam's reconstruction conjecture applied to finite partiall...
The notion of reducibility for a pseudovariety has been introduced as an abstract property which may...
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet adm...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractThis paper is concerned with homotopy properties of partially ordered sets, in particular co...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
DOI
Add to ORKG