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
    2 Citations

    Topics from this paper

    Covering radius of permutation groups with infinity-norm
    • PDF

    References

    SHOWING 1-10 OF 12 REFERENCES
    Transversals of Latin squares and covering radius of sets of permutations
    • 5
    • PDF
    Covering radius for sets of permutations
    • 41
    • PDF
    The multicovering radius problem for some types of discrete structures
    • Alan J. Aw
    • Mathematics, Computer Science
    • Des. Codes Cryptogr.
    • 2014
    • 2
    • PDF
    Intersecting Families of Permutations
    • 128
    • PDF
    Degree Conditions for Matchability in 3-Partite Hypergraphs
    • 10
    • PDF
    Surveys in Combinatorics 2011: Transversals in latin squares: a survey
    • 74
    • PDF
    A random construction for permutation codes and the covering radius
    • 22
    • PDF
    Latin Squares with No Transversals
    • 8
    • PDF
    A Survey on Packing and Covering Problems in the Hamming Permutation Space
    • J. Quistorff
    • Computer Science, Mathematics
    • Electron. J. Comb.
    • 2006
    • 23
    • PDF
    On the ratio of optimal integral and fractional covers
    • L. Lovász
    • Mathematics, Computer Science
    • Discret. Math.
    • 1975
    • 1,118
    • Highly Influential