Results 111 to 120 of about 6,492 (203)
Operad Structure of Poset Matrices [PDF]
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the construction ...
Giraudo, Samuele +3 more
core +1 more source
A symmetric chain decomposition of L(5,n) [PDF]
Enumerative Combinatorics and Applications, 2023 Xiangdong Wen
doaj +1 more source
Going down in (semi)lattices of finite Moore families and convex geometries [PDF]
In this paper we first study the changes occuring in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the ...
Gabriela Bordalo +2 more
core
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
Ural Mathematical JournalFor a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj +1 more source
Modeling Poset Convex Subsets [PDF]
, 2015 A subset S of a poset (partially ordered set) is convex if and only if S contains every poset element which is between any two elements in S. Poset convex subsets arise in applications that involve precedence constraints, such as in project scheduling ...
Wolsey, Laurence, Queyranne, Maurice
core
Journal of Combinatorial Theory, Series A, 1985 If P is a finite poset with maximal elements \(X_ N\), then for certain posets it is possible to decompose \(L^ 2(X_ N)=\oplus^{N}_{n=0}Harm(n)| X_ N\), where \(L^ 2(X_ N)\) is the set of complex valued functions defined on \(X_ N\) acted on by the automorphism group G of P via the permutation representation induced from the stabilizer H of a fixed ...
openaire +2 more sources
Discrete Mathematics, 2000 As there is a theory of random graphs, there is a theory of random posets based on a variety of models trickier to produce because of transitivity. One of these is the Brightwell-model \(O(W_1, \dots, W_n)=O (S_1, \dots,S_n)\), \(|W_i|=S_i\), where \(\{W_1,\dots,W_n\}\) partitions the set \(W\) on which the random posets \(P\) are defined.
openaire +2 more sources
Discrete Mathematics, 1988 Let \((X,\leq)\) be an ordered set. A pair \((a,b)\) of elements of \(X\) is a covering pair if \(b\) covers \(a\). The set \(C(X)\) of all covering pairs of \(X\) can be naturally ordered by \((a,b)\leq (c,d)\) iff \((a,b)=(c,d)\) or \(b\leq c\). The poset \((C(X),\leq)\) is called the covering poset of \((X,\leq)\).
openaire +2 more sources
On Quillenʼs Theorem A for posets
Journal of Combinatorial Theory, Series A, 2011 7 pages.
openaire +2 more sources