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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
