Finding the smallest image of a set
S Linton - Proceedings of the 2004 international symposium on …, 2004 - dl.acm.org
Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004•dl.acm.org
We describe an algorithm for finding a canonical image of a set of points under the action of
a permutation group. Specifically if we order images by sorting them and ordering the
resulting sequences lexicographically, we find the first image. This has applications to
combinatorial and other search problems, allowing isomorphic results to be eliminated more
efficiently. We give worst-case asymptotic running time estimates and practical results
obtained with a GAP implementation.
a permutation group. Specifically if we order images by sorting them and ordering the
resulting sequences lexicographically, we find the first image. This has applications to
combinatorial and other search problems, allowing isomorphic results to be eliminated more
efficiently. We give worst-case asymptotic running time estimates and practical results
obtained with a GAP implementation.
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering the resulting sequences lexicographically, we find the first image. This has applications to combinatorial and other search problems, allowing isomorphic results to be eliminated more efficiently.We give worst-case asymptotic running time estimates and practical results obtained with a GAP implementation.