%0 Journal Article
%T Reducts of the Generic Digraph
%A Lovkush Agarwal
%J Mathematics
%D 2014
%I arXiv
%X The generic digraph $(D,E)$ is the unique countable homogeneous digraph that embeds all finite digraphs. In this paper, we determine the lattice of reducts of $(D,E)$, where a structure $\mathcal{M}$ is a reduct of $(D,E)$ if it has domain $D$ and all its $\emptyset$-definable relations are $\emptyset$-definable relations of $(D,E)$. As $(D,E)$ is $\aleph_0$-categorical, this is equivalent to determining the lattice of closed groups that lie in between Aut$(D,E)$ and Sym$(D)$.
%U http://arxiv.org/abs/1411.4820v1