Covering radius for sets of permutations
type: Item
instance of: scholarly article
title: Covering radius for sets of permutations
zbMATH Open document ID: 1078.05001
author: Peter J. Cameron
author: Ian M. Wanless
published in: Discrete Mathematics
publication date: 2005-06-01T00:00:00Z
review text: The authors study the covering radius of sets of permutations with respect to the Hamming distance. In particular, they define \(f(n,s)\) to be the smallest integer \(m\) for which there is a set of \(m\) permutations in \(S_n\) with covering radius \(r \leq n-s\). The authors find an exact formula for \(f(n,1)\) and bounds on \(f(n,s)\) for \(s>1\). In the case when the set of permutations forms a group, they give necessary and sufficient conditions for the covering radius to be exactly \(n\). They also provide some results on the covering radius for several specific groups.
reviewed by: Gary L. Mullen
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 2173233
describes a project that uses: GAP
describes a project that uses: GRAPE
MaRDI profile type: Publication
full work available at URL: j.disc.2004.08.024
OpenAlex ID: W2149378299
cites work: On transversals in Latin squares
cites work: Coding with permutations
cites work: Q4231664
cites work: Intersecting families of permutations
cites work: Q4342497
cites work: Q4769064
cites work: Q3807437
cites work: On the maximum number of permutations with given maximal or minimal distance
cites work: Has Every Latin Square of Order n a Partial Latin Transversal of Size n - 1?
cites work: On the minimal degree of a primitive permutation group
cites work: Complete mappings of finite groups
cites work: Q5480691
cites work: Q4273617
cites work: Q5512231
DOI: 10.1016/J.DISC.2004.08.024
Recommended article: The covering radius of permutation designs
Recommended article: Covering radius in the Hamming permutation space
Recommended article: Transversals of Latin squares and covering radius of sets of permutations
Recommended article: Covering radius of permutation groups with infinity-norm
Recommended article: Covering \(n\)-permutations with \((n+1)\)-permutations
Recommended article: On the mean radius of permutation polytopes
Recommended article: Covering and radius-covering arrays: constructions and classification
Recommended article: Covering radius---Survey and recent results
Recommended article: Covering sets by subsets
Recommended article: An Upper Bound on Covering Radius
description: scientific article; zbMATH DE number 2173233