Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Covering radius sets of permutations

Date

Authors

Cameron, Peter J

Wanless, Ian

Publisher

Elsevier

Abstract

We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n,s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r≤n-s. We study f(n,s) in the general case and also in t

Keywords

Keywords: Mathematical models; Mathematical operators; Problem solving; Theorem proving; Affine planes; Covering radius; Dominating sets; Latin squares; Minkowski planes; Multiply trasitive groups; Permutations; Steiner triple systems; Set theory Affine planes; Covering radius; Dominating sets; Latin squares; Minkowski planes; Multiply transitive groups; Permutations; Steiner triple systems

URI

http://hdl.handle.net/1885/83643

Collections

ANU Research Publications

Source

Discrete Mathematics

Type

Journal article

DOI

10.1016/j.disc.2004.08.024

Restricted until

2037-12-31

Downloads

File

Description

01_Cameron_Covering_radius_sets_of_2005.pdf (250.18 KB)