Sharp sets of permutations

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A set of permutations is sharp if its cardinality is the product of the distinct non-zero Hamming distances between pairs of permutations in the set. We give a number of new results and constructions for sharp sets and groups and for the more special geometric sets and groups, using a mixture of algebraic and combinatorial techniques.

Original languageEnglish
Pages (from-to)220-247
Number of pages28
JournalJournal of Algebra
Volume111
Issue number1
DOIs
Publication statusPublished - 1 Jan 1987

Fingerprint

Dive into the research topics of 'Sharp sets of permutations'. Together they form a unique fingerprint.

Cite this