Tukey morphisms between finite relations

Abstract

We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to classify all binary relations with at most 6 points in the domain and codomain up to bimorphism. Finally we give a construction of finite binary relations with arbitrary dominating number and dual dominating number.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…