The poset of copies for automorphism groups of countable relational structures
Combinatorics
2020-02-13 v1 Group Theory
Logic
Abstract
Let be a subgroup of the symmetric group of all permutations of a countable set . Let be the topological closure of in the function topology on . We initiate the study of the poset of images of the functions in , being ordered under inclusion. This set of subsets of the set will be called the \emph{poset of copies for} the group . A denomination being justified by the fact that for every subgroup of the symmetric group there exists a homogeneous relational structure on such that is the set of embeddings of the homogeneous structure into itself and is the set of copies of in and that the set of bijections of to forms the group of automorphisms of .
Keywords
Cite
@article{arxiv.2002.04771,
title = {The poset of copies for automorphism groups of countable relational structures},
author = {Claude Laflamme and Maurice Pouzet and Norbert Sauer and Robert Woodrow},
journal= {arXiv preprint arXiv:2002.04771},
year = {2020}
}