Intersection theorems in permutation groups

P. J. Cameron*, M. Deza, P. Frankl

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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-tuples of permutations; the role of Hamming distance is played by the number of elements of X on which, for some i, the ith permutations of the two tuples differ.

Original languageEnglish
Pages (from-to)249-260
Number of pages12
JournalCombinatorica
Volume8
Issue number3
DOIs
Publication statusPublished - 1 Sept 1988

Keywords

  • AMS subject classification (1980): 20B99

Fingerprint

Dive into the research topics of 'Intersection theorems in permutation groups'. Together they form a unique fingerprint.

Cite this