Intersection theorems in permutation groups

P. J. Cameron; M. Deza; P. Frankl

doi:10.1007/BF02126798

Intersection theorems in permutation groups

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

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	249-260
Number of pages	12
Journal	Combinatorica
Volume	8
Issue number	3
DOIs	https://doi.org/10.1007/BF02126798
Publication status	Published - 1 Sept 1988

Keywords

AMS subject classification (1980): 20B99

Access to Document

10.1007/BF02126798

Cite this

@article{2d6831c78b624a00ba46135a2fe1b574,

title = "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-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.",

keywords = "AMS subject classification (1980): 20B99",

author = "Cameron, {P. J.} and M. Deza and P. Frankl",

year = "1988",

month = sep,

day = "1",

doi = "10.1007/BF02126798",

language = "English",

volume = "8",

pages = "249--260",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "3",

}

TY - JOUR

T1 - Intersection theorems in permutation groups

AU - Cameron, P. J.

AU - Deza, M.

AU - Frankl, P.

PY - 1988/9/1

Y1 - 1988/9/1

N2 - 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.

AB - 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.

KW - AMS subject classification (1980): 20B99

UR - http://www.scopus.com/inward/record.url?scp=34250085997&partnerID=8YFLogxK

U2 - 10.1007/BF02126798

DO - 10.1007/BF02126798

M3 - Article

AN - SCOPUS:34250085997

SN - 0209-9683

VL - 8

SP - 249

EP - 260

JO - Combinatorica

JF - Combinatorica

IS - 3

ER -

Intersection theorems in permutation groups

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this