22 search results - page 3 / 5 » Random Generation of Finitely Generated Subgroups of a Free ... |
64
Voted
APAL
2005
14 years 10 months ago
2005
Abstract. Let n be a positive integer and FA (n) be the free abelian latticeordered group on n generators. We prove that FA (m) and FA (n) do not satisfy the same first-order sente...
89
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
CORR
2002
Springer
14 years 10 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
108
Voted
EUROCRYPT
2005
Springer
15 years 4 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
84
Voted
CAEPIA
2003
Springer
15 years 4 months ago
2003
Springer
A new method for ensemble generation is presented. It is based on grouping the attributes in dierent subgroups, and to apply, for each group, an axis rotation, using Principal Com...