The covering radius of permutation designs
Combinatorics
2021-08-21 v1 Information Theory
math.IT
Abstract
A notion of -designs in the symmetric group on letters was introduced by Godsil in 1988. In particular -transitive sets of permutations form a -design. We derive upper bounds on the covering radius of these designs, as a function of and and in terms of the largest zeros of Charlier polynomials.
Cite
@article{arxiv.2108.04275,
title = {The covering radius of permutation designs},
author = {Patrick Solé},
journal= {arXiv preprint arXiv:2108.04275},
year = {2021}
}
Comments
8 pages. arXiv admin note: text overlap with arXiv:2105.07979