Showing math.COShow all
3 papers · 1 filter
math.CO2012
Semidefinite programming for permutation codes
Mathieu Bogaerts, Peter Dukes
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym. In particular, we compute orb…
math.CO2012
Abelian 1-factorizations of complete multipartite graphs
Mathieu Bogaerts
An automorphism group G of a 1-factorization of the complete multipartite graph consists in permutations of the vertices of the graph mapping factors to factors. In…
math.CO2009
Isometries and Construction of Permutation Arrays
Mathieu Bogaerts
An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the charac…