Affiliation:
1. TVP Laboratories, Moscow, Russia
Abstract
AbstractOrthomorphisms of Abelian groups with the minimum possible Cayley distance between them are studied. We describe the class of transformations mapping the given orthomorphism into the set of all orthomorphisms such that their Cayley distance from this orthomorphism takes the minimal possible value 2. Algorithms are suggested that construct all orthomorphisms separated from the given one by the minimum possible distance, and the complexity of these algorithms is estimated. Examples of Abelian groups are presented such that the set of all their orthomorphisms contains elements which are separated from all other orthomorphisms by a distance larger than the minimum possible.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference48 articles.
1. “On the subgroup distance problem”;Electr. Colloq. Comput. Compl.,2006
2. “Bol loops of order pq”;Math. Proc. Cambr. Phil. Soc.,1981
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献