Tukey morphisms between finite relations

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Barton, Rhett, Coskey, Samuel, Ellis, Paul
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910005625618432
author Barton, Rhett
Coskey, Samuel
Ellis, Paul
author_facet Barton, Rhett
Coskey, Samuel
Ellis, Paul
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2302_02772
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Tukey morphisms between finite relations
Barton, Rhett
Coskey, Samuel
Ellis, Paul
Combinatorics
Logic
05C30, 03E05, 06A06
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.
title Tukey morphisms between finite relations
topic Combinatorics
Logic
05C30, 03E05, 06A06
url https://arxiv.org/abs/2302.02772