The Group of Recursive Amorphisms of the Universal Random Graph
Loading...
Authors
Mulder, Kenneth
Issue Date
1991
Type
Thesis
Language
en_US
Keywords
Alternative Title
Abstract
The random graph is an interesting mathematical structure which was
discovered by Renyi and Erdos in 1963. The group of the automorphisms
of the random graph was studied in depth by Truss in 1985 and
turns out to be what is known as an oligomorphic permutation group, and
as such was studied by Peter Cameron in 1990. In that work, he raised
the question: what is the structure of the recursive automorphisms of a
recursive model of the random graph. This paper partially answers this
question by showing that the group in question is countable, primitive
and simple, as well as explores some of the group's topological properties.
The group of primitive recursive automorphisms is studied as well.
Description
ii, 22 p.
Citation
Publisher
Kalamazoo College
License
U.S. copyright laws protect this material. Commercial use or distribution of this material is not permitted without prior written permission of the copyright holder.