Abstract
Given two structures and on the same domain, we say that is a reduct of if all -definable relations of are -definable in . In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are -categorical, determining their reducts is equivalent to determining all closed supergroups Sym of their automorphism groups. A consequence of the classification is that there are pairwise non-isomorphic Henson digraphs which have no proper non-trivial reducts. Taking their automorphisms groups gives a positive answer to a question of Macpherson that asked if there are pairwise non-conjugate maximal-closed subgroups of Sym. By the reconstruction results of Rubin, these groups are also non-isomorphic as abstract groups.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.