Sciweavers

22 search results - page 2 / 5
» Random Generation of Finitely Generated Subgroups of a Free ...
Sort
View
IJAC
2007
116views more  IJAC 2007»
13 years 4 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 5 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 4 months ago
Average-case complexity and decision problems in group theory
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
JSYML
2010
120views more  JSYML 2010»
12 years 11 months ago
Universally measurable subgroups of countable index
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Christian Rosendal
BIRTHDAY
2006
Springer
13 years 8 months ago
Finitely Presented Abelian Lattice-Ordered Groups
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
Andrew M. W. Glass, Françoise Point