The conjugacy problem for the automorphism group of the random graph

@article{Coskey2009TheCP,
  title={The conjugacy problem for the automorphism group of the random graph},
  author={Samuel Coskey and Paul Ellis and Scott Schneider},
  journal={Archive for Mathematical Logic},
  year={2009},
  volume={50},
  pages={215-221}
}
We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures. 

The conjugacy problem for automorphism groups of countable homogeneous structures

In each case, the precise complexity of the conjugacy relation in the sense of Borel reducibility of automorphism groups of a number of countable homogeneous structures is found.

Conjugacy for homogeneous ordered graphs

It is shown that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms of G is Borel complete and each such G satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of G are Borel reducible to the conjugal relation on automorphism of G.

Conjugacy for homogeneous ordered graphs

We show that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms of G is Borel complete. In fact we establish that each such G satisfies a strong extension property

On the classification of automorphisms of trees

The complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy is identified and the complexity ofThe conjugate problem in the case of automorphism of several non-regularly branching trees is calculated.

The conjugacy problem for automorphism groups of homogeneous digraphs

The Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs is decided, and a dichotomy theorem is established that this complexity is either the minimum or the maximum among relations which are classifiable by countable structures.

The Complexity of Classification Problems for Models of Arithmetic

It is shown that the classification problem for countable models of arithmetic is Borel complete and for automorphisms of a fixed recursively saturated model are Borelcomplete.

Elements of finite order in automorphism groups of homogeneous structures

These constructions enable us to compute the Borel complexity of the relation of conjugacy between automorphisms of the Henson graphs, and to obtain some new results about the structure of the isometry group of the Urysohn space and the URYsohn sphere.

RESEARCH PROPOSAL: BOREL EQUIVALENCE RELATIONS

The study of definable equivalence relations on complete separable metric spaces (i.e., Polish spaces) has emerged as a new direction of research in descriptive set theory over the past twenty years.

Polish groups and Baire category methods

This memoir presents my work since the end of my doctoral work. The unifying theme is the use of Baire category methods in various domains where Polish groups appear naturally.

References

SHOWING 1-10 OF 19 REFERENCES

The permutation group induced on a moiety

We consider closed permutation groups on a countably infinite set, and look at the permutation group induced on an infinite coinfinite subset. The automorphism group of the random graph has nice

The automorphism group of the random graph: four conjugates good, three conjugates better

Borel Equivalence Relations and Classifications of Countable Models

The group of almost automorphisms of the countable universal graph

  • J. Truss
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1989
The group Aut Γ of automorphisms of Rado's universal graph Γ (otherwise known as the ‘random’ graph: see [1]) and the corresponding groups Aut Γc for C a set of ‘colours’ with 2 ≤ |C| ≤ ℵ0, were

The group of the countable universal graph

  • J. Truss
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1985
Let C be a set with at least two, and at most ℵ0, members, and for any set X let [X]2 denote the set of its 2-element subsets. If Γ is a countable set, and Fc is a function from [Γ]2 into C, then the

The completeness of the isomorphism relation for countable Boolean algebras

We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable

london mathematical society lecture note series

Denis Benois. Trivial zeros of p-adic L-functions and Iwasawa theory. We prove that the expected properties of Euler systems imply quite general MazurTate-Teitelbaum type formulas for derivatives of

A Borel reductibility theory for classes of countable structures

Abstract We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to

Ordered permutation groups

In this chapter and some others (if necessary) capital Latin letters are used to denote groups, lattices, l-groups, o-groups; small Latin letters a, b, c, x, y , z, k, f, g, h,… their elements.