Sciweavers

532 search results - page 9 / 107
» Graphically abelian groups
Sort
View
APAL
2008
96views more  APAL 2008»
13 years 10 months ago
On superstable CSA-groups
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...
Abderezak Ould Houcine
ICPR
2008
IEEE
14 years 4 months ago
Non-Abelian invariant feature detection
We present a novel formulation of non-Abelian invariant feature detection. By choosing suitable measuring functions, we show that the measuring space and the corresponding feature...
Yaniv Gur, Nir A. Sochen
PAIRING
2007
Springer
14 years 3 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo
EJC
2006
13 years 9 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik
STACS
2010
Springer
14 years 4 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall