English

Another Problem of J\'onsson and McKenzie from 1982: Refinement Properties for Connected Powers of Posets

Combinatorics 2020-05-19 v1

Abstract

In 1982, J\'onsson and McKenzie posed the following problem: "Find counter examples (or prove that none exist) to the refinement of ACBDA^C\cong B^D [AA, BB, CC, and DD non-empty posets] under" the condition "CC, DD, and ACA^C are finite and connected." That is, in this situation, are there posets EE, XX, YY, and ZZ such that AEXA\cong E^X, BEYB\cong E^Y, CY×ZC\cong Y\times Z, and DX×ZD\cong X\times Z? In this note, this problem is solved.

Keywords

Cite

@article{arxiv.2005.08477,
  title  = {Another Problem of J\'onsson and McKenzie from 1982: Refinement Properties for Connected Powers of Posets},
  author = {Jonathan David Farley},
  journal= {arXiv preprint arXiv:2005.08477},
  year   = {2020}
}

Comments

4 pages, 1 figure