Abstract
A notion of t-designs in the symmetric group on n letters was introduced by Godsil in 1988. In particular, t-transitive sets of permutations form a t-design. We derive upper bounds on the covering radius of these designs, as a function of n and t and in terms of the largest zeros of Charlier polynomials.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.
References
Area, I., Dimitrov, D.K., Godoy, E., Paschoa, V.: Zeros of classical orthogonal polynomial of a discrete variable. Math. Comp. 82, 1069–1095 (2013)
Bannai, E., Ito, T.: Algebraic Combinatorics I : Association Schemes. Benjamin/Cummings, Menlo Park, CA (1984)
Blake, I., Cohen, G.D., Deza, M.: Coding with permutations. Information Control 43, 1–19 (1979)
Cameron, P.J.: Permutation codes. European J. Combin. 31, 482–490 (2010)
Cameron, P.J., Wanless, I.: Covering radius for sets of permutations. Discrete Math. 293, 91–109 (2005)
Conder, M., Godsil, C.D.: The symmetric group as a polynomial space. In: Brualdi, R.A., Friedland, S., Klee, V. (eds.) Combinatorial and Graph-Theoretical Problems in Linear Algebra. IMA Series, vol. 150, pp. 219–227. Springer, Berlin (1993)
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Research Report Supplements 10 (1973)
Dimitrov, D.K., Nikolov, G.: Sharp bounds for the extreme zeros of classical orthogonal polynomials. J. Approx. Theory 162, 1793–1804 (2010)
Frobenius, G.: Uber die characktere der mehrfach transitive gruppen, Berliner Bericht (1904), 558–571
Godsil, C.D.: Algebraic Combinatorics. Chapman & Hall, London (1993)
Godsil, C. D.: Polynomial spaces. Discrete Math. 73, 71–88 (1988/89)
Krasikov, I.: Bounds for zeros of the Charlier polynomials. Methods Appl. Anal. 9(4), 599–610 (2002)
Koekkoek, R., Swarttouw, R.F.:The Askey scheme of hypergeometric orthogonal polynomials and its \(q\)-analogue. arXiv:math/9602214
Shi, M., Rioul, O., Solé, P.: Designs in finite metric spaces: a probabilistic approach, graphs and combinatorics, special issue Bannai–Enomoto 75. Published online on May, 31, 2021. https://doi.org/10.1007/s00373-021-02338-1. arXiv:2102.08276
Shi, M., Li, XX., Solé, P.: Designs, permutations, and transitive groups, submitted. arXiv:2105.07979
Solé, P.: Packing radius, covering radius and dual distance. IEEE Trans. Inform. Theory 41(1), 268–272 (1995)
Szegö, G.: Orthogonal Polynomials, vol. 23, 4th edn. AMS Colloqium Publications, Providence, RI (1975)
Tarnanen, H.: Upper bounds on permutation codes via linear programming. European J. Combin. 20, 101–114 (1999)
Acknowledgements
We thank Alexis Bonnecaze, Sam Mattheus, and the two referees for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Solé, P. The covering radius of permutation designs. J Algebr Comb 57, 305–311 (2023). https://doi.org/10.1007/s10801-022-01169-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-022-01169-4