ON PROBLEMS CONCERNING FIXED-POINT-FREE PERMUTATIONS an‎d ON THE POLYCIRCULANT CONJECTURE A SURVEY

Fixed-point-free permutations, also known as derangements, have been studied for centuries. In particular, depending on their applications, derangements of prime-power order and of prime order have always played a crucial role in a variety of different branches of mathematics: from number theory to algebraic graph theory. Substantial progress has been made on the study of derangements, many long- standing open problems have been solved, and many new research problems have arisen. The results obtained and the methods developed in this area have also effectively been used to solve other problems regarding nite vertex-transitive graphs. The methods used in this area range from deep group theory, including the classication of the nite simple groups, to combinatorial techniques. This article is devoted to surveying results, open problems and methods in this area.