Compatible orders of semilattices

Rok, strany: 1995, 177 - 187

Two discrete semimodular semilattices $\boldkey S$ and $\boldkey S₁$ have isomorphic graphs if and only if $\boldkey S$ is of the form $\boldkey A× \boldkey B$ and $\boldkey S₁$ is of the form $\boldkey A^∂×\boldkey B$ for a lattice $\boldkey A$ and a semilattice $\boldkey B$. We prove that for discrete semilattices $\boldkey S$ and $\boldkey S₁$ this latter condition holds if and only if $\boldkey S$ and $\boldkey S₁$ have isomorphic graphs and the isomorphism preserves the order on some special types of cells and proper cells.

ISO 690:

Ratanaprasert, C. 1995. Compatible orders of semilattices. In Tatra Mountains Mathematical Publications, vol. 5, no.1, pp. 177-187. 1210-3195.

APA:

Ratanaprasert, C. (1995). Compatible orders of semilattices. Tatra Mountains Mathematical Publications, 5(1), 177-187. 1210-3195.