Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups of the endomorphism monoid of R isomorphic to the automorphism group of Γ. Further structural information about End R is established including that Aut Γ arises in uncountably many ways as a Schützenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph.
Dolinka , I , Gray , R D , McPhee , J D , Mitchell , J D & Quick , M 2016 , ' Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph ' , Mathematical Proceedings of the Cambridge Philosophical Society , vol. 160 , no. 3 , pp. 437-462 . https://doi.org/10.1017/S030500411500078X
Mathematical Proceedings of the Cambridge Philosophical Society
© 2016, Publisher / the Author(s). This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at journals.cambridge.org / https://dx.doi.org/10.1017/S030500411500078X
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Showing items related by title, author, creator and subject.
Synch-Graph : multisensory emotion recognition through neural synchrony via graph convolutional networks Mansouri Benssassi, Esma; Ye, Juan (AAAI Press, 2020-04-03) - Conference itemHuman emotions are essentially multisensory, where emotional states are conveyed through multiple modalities such as facial expression, body language, and non-verbal and verbal signals. Therefore having multimodal or ...
Cameron, Peter J.; Kuzma, Bojan (2023-02) - Journal articleThe purpose of this note is to define a graph whose vertex set is a finite group G, whose edge set is contained in that of the commuting graph of G and contains the enhanced power graph of G. We call this graph the deep ...
Carey, Rachael Marie (University of St Andrews, 2016-06-24) - ThesisIn this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider the properties of graph ...