The factor problem.

2004 ◽  
pp. 44-69
Author(s):  
L. L. Thurstone
Keyword(s):  
2015 ◽  
Vol 114 (6) ◽  
Author(s):  
D. Adikaram ◽  
D. Rimal ◽  
L. B. Weinstein ◽  
B. Raue ◽  
P. Khetarpal ◽  
...  

2007 ◽  
Vol 17 (08) ◽  
pp. 1611-1634 ◽  
Author(s):  
ABDÓ ROIG ◽  
ENRIC VENTURA ◽  
PASCAL WEIL

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 free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem — to decide whether a word is an element of some basis of the free group — and the free factor problem can also be solved in polynomial time.


2013 ◽  
Vol 59 (2) ◽  
pp. 415-430
Author(s):  
P.V. Danchev

Abstract Structural results on the Direct Factor Problem, the Classification Problem and the Isomorphism Problem are proved for modular group algebras of certain sorts of abelian groups.


Sign in / Sign up

Export Citation Format

Share Document