A characterization of permutability of 2-uniform tolerances on posets
Abstract
Tolerance relations were investigated by several authors in various algebraic structures, see e.g. the monograph by I. Chajda. Recently G. Cz\'edli studied so-called 2-uniform tolerances on lattices, i.e. tolerances that are compatible with the lattice operations and whose blocks are of cardinality 2. He showed that two such tolerances on a lattice containing no infinite chain permute if and only if they are amicable (a concept introduced in his paper). We extend this study to tolerances on posets. Since in posets we have no lattice operations, we must modify the notion of amicability. We modified it in such a way that in case of lattices it coincides with the original definition. With this new definition we can prove that two tolerances on a poset containing no infinite chain permute if and only if they are amicable in the new sense.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.