par Bogaerts, Mathieu 
;Dukes, Peter
Référence Discrete mathematics, 326, 1, page (34-43)
Publication Publié, 2014
;Dukes, PeterRéférence Discrete mathematics, 326, 1, page (34-43)
Publication Publié, 2014
Article révisé par les pairs
| Résumé : | We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym(n). In particular, we compute orbits of ordered pairs on Sym(n) acted upon by conjugation and inversion, explore a block diagonalization of the associated algebra, and obtain improved upper bounds on the size M(n,D) of permutation codes of lengths n=6,7. For instance, these techniques detect the nonexistence of the projective plane of order six via M(6,5)<30 and yield a new upper bound M(7,4)≤535 for a challenging open case. Each of these represents an improvement on earlier Delsarte linear programming results. © 2014 Elsevier B.V. All rights reserved. |
