A permutation group is cofinitary if any non-identity element fixes only finitely many points. This paper presents a survey of such groups. The paper has four parts. Sections 1-6 develop some basic theory, concerning groups with finite orbits, topology, maximality, and normal subgroups. Sections 7-12 give a variety of constructions, both direct and from geometry, combinatorial group theory, trees, and homogeneous relational structures. Sections 13-15 present some generalisations of sharply fc-transitive groups, including an orbit-counting result with a character-theoretic flavour. The final section treats some miscellaneous topics. Several open problems are mentioned. 1
All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
Abstract. In this paper we introduce a new non-associative product for per-mutation groups, which ha...
A permutation group is cofinitary if any non-identity element fixes only finitely many points. This ...
Abstract: The purpose of this paper is to identify, as far as possible, those sequences in the Encyc...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
AbstractA group G⩽Sym(N) is cofinitary if g has finitely many fixed points for every g∈G except the ...
The purpose of this paper is to study the action on cycles of several known classes of oligomorphic ...
In this work we employ a combinatorial process to establish the intransitivity of a non-deranged per...
AbstractWe take the first step towards establishing a theory of Parker vectors for infinite permutat...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
A subgroup X of a group G is called permutable if XY = Y X for all subgroups Y of G. It is well know...
AbstractThe fixity of a finite permutation group G is the maximal number of fixed points of a non-tr...
We construct and characterise a 3-homogeneous but not 2-primitive permutation group H of countable d...
In the first chapter, we define Steinhaus set as a set that meets every isometric copy of another se...
All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
Abstract. In this paper we introduce a new non-associative product for per-mutation groups, which ha...
A permutation group is cofinitary if any non-identity element fixes only finitely many points. This ...
Abstract: The purpose of this paper is to identify, as far as possible, those sequences in the Encyc...
Groups naturally occu as the symmetries of an object. This is why they appear in so many different a...
AbstractA group G⩽Sym(N) is cofinitary if g has finitely many fixed points for every g∈G except the ...
The purpose of this paper is to study the action on cycles of several known classes of oligomorphic ...
In this work we employ a combinatorial process to establish the intransitivity of a non-deranged per...
AbstractWe take the first step towards establishing a theory of Parker vectors for infinite permutat...
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of f...
A subgroup X of a group G is called permutable if XY = Y X for all subgroups Y of G. It is well know...
AbstractThe fixity of a finite permutation group G is the maximal number of fixed points of a non-tr...
We construct and characterise a 3-homogeneous but not 2-primitive permutation group H of countable d...
In the first chapter, we define Steinhaus set as a set that meets every isometric copy of another se...
All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
Abstract. In this paper we introduce a new non-associative product for per-mutation groups, which ha...