Journal of Group Theory
Editor-in-Chief: Wilson, John S.
Managing Editor: Howie, James / Kramer, Linus / Parker, Christopher W.
Editorial Board Member: Abért, Miklós / Borovik, Alexandre V. / Boston, Nigel / Bridson, Martin R. / Caprace, Pierre-Emmanuel / Giovanni, Francesco / Guralnick, Robert / Jaikin Zapirain, Andrei / Kessar, Radha / Khukhro, Evgenii I. / Kochloukova, Dessislava H. / Malle, Gunter / Olshanskii, Alexander / Remy, Bertrand / Robinson, Derek J.S. / Willis, George
6 Issues per year
IMPACT FACTOR 2013: 0.346
Mathematical Citation Quotient 2013: 0.41
Volume 17 (2014)
Volume 16 (2013)
Volume 15 (2012)
Volume 14 (2011)
Volume 13 (2010)
Volume 12 (2009)
Volume 11 (2008)
Volume 10 (2007)
Volume 9 (2006)
Volume 8 (2005)
Volume 7 (2004)
Volume 6 (2003)
Volume 5 (2002)
Volume 4 (2001)
Volume 3 (2000)
Volume 2 (1999)
Most Downloaded Articles
- Complete homology and related dimensions of groups by Jo, Jang Hyun
- Simple groups are characterized by their non-commuting graphs by Solomon, Ronald M. and Woldar, Andrew J.
- Verbally closed subgroups of free groups by Myasnikov, Alexei G. and Roman'kov, Vitaly
- Locally graded groups with a Bell condition on infinite subsets by Delizia, Costantino and Tortora, Antonio
- Groups whose Chermak–Delgado lattice is a chain by Brewster, Ben/ Hauck, Peter and Wilcox, Elizabeth
Solving one-variable equations in free groups
1Intrinsyc Software International, Inc., 700 W. Pender St., Vancouver, BC, V6C 1G8, Canada. E-mail: (email)
2Stevens Institute of Technology, Hoboken NJ 07030-5991, U.S.A. E-mail: (email)
3McGill University, Montreal, QC, H3A 2K6, Canada. E-mail: (email)
Citation Information: Journal of Group Theory. Volume 12, Issue 2, Pages 317–330, ISSN (Online) 1435-4446, ISSN (Print) 1433-5883, DOI: 10.1515/JGT.2008.080, November 2008
- Published Online:
Equations in free groups have become prominent recently in connection with the solution to the well-known Tarski conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method for writing down in principle all solutions. However, no practical method is known; the best estimate for the complexity of the decision procedure is P-space.
The special case of one-variable equations in free groups has been open for a number of years, although it is known that the solution sets admit simple descriptions. We use cancellation arguments to give a short and direct proof of this result and also to give a practical polynomial-time algorithm for finding solution sets. One-variable equations are the only general subclass of equations in free groups for which such results are known.
We improve on previous attempts to use cancellation arguments by employing a new method of reduction motivated by techniques from formal language theory. Our paper is self-contained; we assume only knowedge of basic facts about free groups.