Poset representations of distributive semilattices

dc.creatorWehrung, Friedrich
dc.date2006-01-04
dc.date2007-11-23
dc.date.accessioned2026-07-07T09:45:41Z
dc.date.available2026-07-07T09:45:41Z
dc.descriptionWe prove that for any distributive join-semilattice S, there are a meet-semilattice P with zero and a map f:PxP-->S such that f(x,z)<=f(x,y)vf(y,z) and x<=y implies that f(x,y)=0, for all x,y,z in P, together with the following conditions: (i) f(y,x)=0 implies that x=y, for all x<=y in P. (ii) For all x\leq y in P and all a,b in S, if f(y,x)=avb, then there are a positive integer n and a decomposition x=x_0<=x_1<=...<=x_n=y such that f(x_{i+1},x_i) lies either below a or below b, for all i < n. (iii) The subset {f(x,0)|x\in P} generates the semilattice S. Furthermore, any finite, bounded subset of P has a join, and P is bounded in case S is bounded. Furthermore, the construction is functorial on lattice-indexed diagrams of finite distributive (v,0,1)-semilattices.
dc.descriptionTo appear in Internat. J. Algebra Comput
dc.identifierhttps://arxiv.org/abs/math/0601058
dc.identifierhttp://arxiv.org/abs/math/0601058
dc.identifierInternational Journal of Algebra and Computation 18, 2 (2008) 321--356
dc.identifierdoi:10.1142/S0218196708004469
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163279
dc.subjectRings and Algebras
dc.subjectPrimary 06A06, 06A12. Secondary 06B10
dc.titlePoset representations of distributive semilattices
dc.typetext

Files

Collections