Results 1 
1 of
1
ON PERMUTATION CLIQUES
, 1980
"... The symmetric group S, is a metric space with distance d(a, b) = IE(a'b) ( where E(c) is the set of points moved by c E S,. Let L be a given subset of {I. 2,..., n}, a permutation clique A = A(L, n) is any subset A c S, with d(a, b)EL whenever a, b EA, a # b. We give a framework of new and kn ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
and known information on some special A = A(L, n): maximal, largest, largest subgroups of S,, subscheme of Hamming metric scheme, permutation geometry and some other problems related to this metric space. Some links with classical problems of classification of permutation groups and with extrernal problems