Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
: Two transformations are constructed that map the permutation group onto a well-defined subset of a partially commutative monoid generated by the so-called oiseaux. Those transfor...
We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: ag := the least cardina...
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
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 t...
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...