Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-10T16:28:36.318Z Has data issue: false hasContentIssue false
  • English
  • Français

On notions of genericity and mutual genericity

Published online by Cambridge University Press:  12 March 2014

J. K. Truss
J. K. Truss*
Affiliation:
Department of Pure Mathematics, University of Leeds, Leeds LS2 9JT, England, UK. E-mail: pmtjkt@leeds.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

Generic automorphisms of certain homogeneous structures are considered, for instance, the rationals as an ordered set, the countable universal homogeneous partial order, and the random graph. Two of these cases were discussed in [7], where it was shown that there is a generic automorphism of the second in the sense introduced in [10], In this paper, I study various possible definitions of ‘generic’ and ‘mutually generic’, and discuss the existence of mutually generic automorphisms in some cases. In addition, generics in the automorphism group of the rational circular order are considered.

Keywords

generic automorphismmutually genericrationalsrandom graph
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 72 , Issue 3 , September 2007 , pp. 755 - 766
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Duby, Grégory, Generic automorphisms of 1-homogeneous coloured orders. Thése de Doctorat, Université Libre de Bruxelles, 2003.Google Scholar
[2] Glass, A. M. W., Ordered permutation groups, London Mathematical Society Lecture Note Series, vol. 55, Cambridge University Press, Cambridge, 1981.Google Scholar
[3] Herwig, Bernhard, Extending partial isomorphisms for the small index property of many ω-calegorical structures, Israel Journal of Mathematics, vol. 107 (1998), pp. 93–123.CrossRefGoogle Scholar
[4] Hodges, W. A., Hodkinson, I. M., Lascar, D., and Shelah, S., The small index property for ω-stable ω-categorical structures and for the random graph, Journal of the London Mathematical Society. Second Series, vol. 48 (1993), pp. 204–218.Google Scholar
[5] Hodkinson, I. M., Proof that Aut ℚ has no two mutually generic automorphisms, unpublished typescript, 1999.Google Scholar
[6] Hrushovski, E., Extending partial isomorphisms of graphs, Combinatorica. An International Journal on Combinatorics and the Theory of Computing, vol. 12 (1992), pp. 411–416.Google Scholar
[7] Kuske, D. and Truss, J. K., Generic automorphisms of the universal partial order, Proceedings of the American Mathematical Society, vol. 129 (2001), pp. 1939–1948.Google Scholar
[8] Lascar, D., Les beaux automorphismes. Archive for Mathematical Logic, vol. 31 (1991), pp. 55–68.CrossRefGoogle Scholar
[9] Truss, J. K., The group of the countable universal graph, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 98 (1985), pp. 213–245.CrossRefGoogle Scholar
[10] Truss, J. K., Generic automorphisms of homogeneous structures, Proceedings of the London Mathematical Society. Third Series, vol. 64 (1992), pp. 121–141.Google Scholar
[11] Truss, J. K., On the automorphism group of the countable dense circular order, in preparation.Google Scholar