• DOI:10.1016/j.ejc.2019.103025
Corpus ID: 119737311

Covering radius in the Hamming permutation space

@article{Hendrey2020CoveringRI,
  title={Covering radius in the Hamming permutation space},
  author={Kevin Hendrey and Ian M. Wanless},
  journal={Eur. J. Comb.},
  year={2020},
  volume={84}
}

Kevin Hendrey, Ian M. Wanless

Published 2020

Mathematics, Computer Science

Eur. J. Comb.

Abstract Let S n denote the set of permutations of { 1 , 2 , … , n } . The function f ( n , s ) is defined to be the minimum size of a subset S ⊆ S n with the property that for any ρ ∈ S n there exists some σ ∈ S such that the Hamming distance between ρ and σ is at most n − s . The value of f ( n , 2 ) is the subject of a conjecture by Kezdy and Snevily, which implies several famous conjectures about Latin squares. We prove that the odd n case of the Kezdy–Snevily Conjecture implies the whole… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed