AbstractWe present here a new treatment of the permutation f of antichains in ranked posets moving the set of lower units of a monotone Boolean function to the set of its upper zeros. Shorter and more transparent proofs for some known properties of f are presented. The orbits of f for a direct product of three chains are considered in some detail
For two posets $(P,\le_P)$ and $(P',\le_{P'})$, we say that $P'$ contains a copy of $P$ if there exi...
Given a set of permutations ∑,Sn⊇∑, a poset P = P(∑) is chain-permutational with respect to ∑ if it ...
We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset i...
AbstractWe consider the permutation f of antichains of a ranked poset P , moving the set of lower un...
AbstractFor any finite poset P, there is a natural operator, X=XP, acting on the set of antichains o...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractIn this paper a new kind of product of ranked posets, the rankwise direct product is investi...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
AbstractFor a given poset and positive integer κ, four problems are considered. Covering: Determine ...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
AbstractLet f(n) be the smallest integer t such that a poset obtained from a Boolean lattice with n ...
The dynamics of certain combinatorial actions and their liftings to actionsat the piecewise-linear a...
For two posets $(P,\le_P)$ and $(P',\le_{P'})$, we say that $P'$ contains a copy of $P$ if there exi...
Given a set of permutations ∑,Sn⊇∑, a poset P = P(∑) is chain-permutational with respect to ∑ if it ...
We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset i...
AbstractWe consider the permutation f of antichains of a ranked poset P , moving the set of lower un...
AbstractFor any finite poset P, there is a natural operator, X=XP, acting on the set of antichains o...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.Includes bibliogr...
AbstractIn this paper a new kind of product of ranked posets, the rankwise direct product is investi...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
AbstractFor a given poset and positive integer κ, four problems are considered. Covering: Determine ...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
AbstractLet f(n) be the smallest integer t such that a poset obtained from a Boolean lattice with n ...
The dynamics of certain combinatorial actions and their liftings to actionsat the piecewise-linear a...
For two posets $(P,\le_P)$ and $(P',\le_{P'})$, we say that $P'$ contains a copy of $P$ if there exi...
Given a set of permutations ∑,Sn⊇∑, a poset P = P(∑) is chain-permutational with respect to ∑ if it ...
We construct a special type of antichain (i. e., a family of subsets of a set, such that no subset i...
DOI
Add to ORKG