Tukey morphisms between finite relations
Combinatorics
2026-02-02 v2 Logic
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 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.
Cite
@article{arxiv.2302.02772,
title = {Tukey morphisms between finite relations},
author = {Rhett Barton and Samuel Coskey and Paul Ellis},
journal= {arXiv preprint arXiv:2302.02772},
year = {2026}
}