Sciweavers

ENDM
2007
64views more  ENDM 2007»
13 years 10 months ago
The complexity of the Weight Problem for permutation groups
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...
Peter J. Cameron, Taoyang Wu
EJC
2006
13 years 10 months ago
Two oiseau decompositions of permutations and their application to Eulerian calculus
: 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...
Dominique Foata, Arthur Randrianarivony
APAL
2006
79views more  APAL 2006»
13 years 11 months ago
Cardinal invariants related to permutation groups
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...
Bart Kastermans, Yi Zhang 0008
DM
2010
82views more  DM 2010»
13 years 11 months ago
The complexity of the weight problem for permutation and matrix groups
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 ...
Peter J. Cameron, Taoyang Wu
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 2 months ago
Permutation Groups in NC
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 ...
László Babai, Eugene M. Luks, &Aacut...
ISSAC
2004
Springer
93views Mathematics» more  ISSAC 2004»
14 years 4 months ago
Finding the smallest image of a set
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...
Steve Linton
CVPR
2008
IEEE
15 years 25 days ago
ANSIG - An analytic signature for permutation-invariant two-dimensional shape representation
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...
José J. Rodrigues, Pedro M. Q. Aguiar, Jo&a...