Homogeneous Permutations
Open Access
- 31 October 2002
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (2) , R2
Abstract
There are just five Fraïssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraïssé's theory of countable homogeneous structures, and states a few open problems. Links with enumeration results, and the analogous result for circular permutations, are also described.Keywords
This publication has 7 references indexed in Scilit:
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournamentsMemoirs of the American Mathematical Society, 1998
- Counting Two-graphs Related to TreesThe Electronic Journal of Combinatorics, 1995
- Reducts of the random graphThe Journal of Symbolic Logic, 1991
- A Universal Structure for N -Free GraphsProceedings of the London Mathematical Society, 1989
- The Action of an Infinite Permutation Group on Unordered Subsets of a SetProceedings of the London Mathematical Society, 1983
- Countable homogeneous partially ordered setsAlgebra universalis, 1979
- Transitivity of permutation groups on unordered setsMathematische Zeitschrift, 1976