Groups Complexity Cryptology
Managing Editor: Rosenberger, Gerhard / Shpilrain, Vladimir
Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Weil, Pascal
2 Issues per year
SCImago Journal Rank (SJR) 2014: 0.917
Source Normalized Impact per Paper (SNIP) 2014: 1.559
Impact per Publication (IPP) 2014: 0.878
Mathematical Citation Quotient (MCQ) 2014: 0.37
Volume 7 (2015)
Volume 6 (2014)
Random equations in free groups
1Department of Mathematical Sciences, Stevens Institute of Technology, New Jersey, USA.
2Institute of Mathematics and Information Technologies, Omsk State Dostoevskii University, Russia.
Citation Information: Groups – Complexity – Cryptology. Volume 3, Issue 2, Pages 257–284, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: 10.1515/gcc.2011.010, November 2011
- Published Online:
In this paper we study the asymptotic probability that a random equation in a finitely generated free group F is solvable in F. For one-variable equations this probability is zero, but for split equations, i.e., equations of the form v(x 1, . . . , xk) = g, g ∈ F, the probability is strictly between zero and one if k ≥ rank(F) ≥ 2. As a consequence the endomorphism problem in F has intermediate asymptotic density, and we obtain the first natural algebraic examples of subsets of intermediate density in free groups of rank larger than two.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.