Sciweavers

22 search results - page 3 / 5
» Random Generation of Finitely Generated Subgroups of a Free ...
Sort
View
APAL
2005
67views more  APAL 2005»
13 years 4 months ago
Free abelian lattice-ordered groups
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...
Andrew M. W. Glass, Angus Macintyre, Franço...
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 4 months ago
Restricted Walks in Regular Trees
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...
Laura Ciobanu, Sasa Radomirovic
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 4 months ago
Generic-case complexity, decision problems in group theory and random walks
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...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
EUROCRYPT
2005
Springer
13 years 10 months ago
The RSA Group is Pseudo-Free
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...
Daniele Micciancio
CAEPIA
2003
Springer
13 years 10 months ago
Rotation-Based Ensembles
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...
Juan José Rodríguez, Carlos J. Alons...