The covering radius of permutation designs

08/09/2021
by   Patrick Solé, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro