Intersection theorems in permutation groups

Abstract

The Hamming distance between two permutations of a finite set X is the number of elements of X on which they differ. In the first part of this paper, we consider bounds for the cardinality of a subset (or subgroup) of a permutation group P on X with prescribed distances between its elements. In the second part. We consider similar results for sets of s… (More)
DOI: 10.1007/BF02126798

Topics

  • Presentations referencing similar topics