The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBLalgebras have poset p...

A poset is called upper homogeneous (or "upho") if every principal order filter of the isomorphic to whole poset. We observe that rank and characteristic generating functions upho posets are multiplicative inverses one another.

We define a poset of partitions associated to an operad. We prove that the operad is Koszul if and only if the poset is Cohen-Macaulay. In one hand, this characterisation allows us to compute the homology of the poset. This homology is given by the Koszul dual operad. On the other hand, we get new methods for proving that an operad is Koszul.

We study flag enumeration in intervals in the uncrossing partial order on matchings. We produce a recursion for the cd-indices of intervals in the uncrossing poset Pn. We explicitly describe the matchings by constructing an order-reversing bijection. We obtain a recursion for the ab-indices of intervals in the poset P̂n, the poset Pn with a unique minimum 0̂ adjoined.

Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities...

Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...

A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...

A poset P = (X,≺) is a unit OC interval order if there exists a representation that assigns an open or closed real interval I(x) of unit length to each x ∈ P so that x ≺ y in P precisely when each point of I(x) is less than each point in I(y). In this paper we give a forbidden poset characterization of the class of unit OC interval orders and an efficient algorithm for recognizing the class. Th...