Olga Kharlampovich - Academia.edu (original) (raw)
Related Authors
Alvan Ikoku Federal College of Education Owerri in Affiliation with the University of Nigeria
Uploads
Papers by Olga Kharlampovich
arXiv (Cornell University), Jul 11, 2016
De Gruyter eBooks, May 10, 2021
International Journal of Algebra and Computation, Dec 1, 2018
arXiv (Cornell University), Mar 4, 2013
Transactions of the American Mathematical Society, Mar 1, 1999
arXiv (Cornell University), Feb 3, 2014
arXiv (Cornell University), Jun 3, 2020
Birkhäuser Basel eBooks, 2010
arXiv (Cornell University), Jul 7, 2004
Journal of Algebra, Apr 1, 2018
International Journal of Algebra and Computation, Feb 1, 2013
Groups, complexity, cryptology, Oct 16, 2019
arXiv (Cornell University), Jan 27, 2020
arXiv (Cornell University), 2014
arXiv (Cornell University), Jan 13, 2015
arXiv (Cornell University), Jul 8, 2012
Contemporary mathematics, 2005
In this paper we describe an elimination process which is a deterministic rewriting procedure tha... more In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko's decompositions of finitely generated fully residually free groups and cyclic [abelian] JSJ decompositions of freely indecomposable finitely generated fully residually free groups. We apply these results to obtain an effective description of the set of homomorphisms from a given finitely presented group into a free group, or, more generally, into an NTQ group.
Transactions of the American Mathematical Society, 1998
arXiv (Cornell University), Aug 22, 2017
arXiv (Cornell University), Apr 25, 2017
arXiv (Cornell University), Jul 11, 2016
De Gruyter eBooks, May 10, 2021
International Journal of Algebra and Computation, Dec 1, 2018
arXiv (Cornell University), Mar 4, 2013
Transactions of the American Mathematical Society, Mar 1, 1999
arXiv (Cornell University), Feb 3, 2014
arXiv (Cornell University), Jun 3, 2020
Birkhäuser Basel eBooks, 2010
arXiv (Cornell University), Jul 7, 2004
Journal of Algebra, Apr 1, 2018
International Journal of Algebra and Computation, Feb 1, 2013
Groups, complexity, cryptology, Oct 16, 2019
arXiv (Cornell University), Jan 27, 2020
arXiv (Cornell University), 2014
arXiv (Cornell University), Jan 13, 2015
arXiv (Cornell University), Jul 8, 2012
Contemporary mathematics, 2005
In this paper we describe an elimination process which is a deterministic rewriting procedure tha... more In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko's decompositions of finitely generated fully residually free groups and cyclic [abelian] JSJ decompositions of freely indecomposable finitely generated fully residually free groups. We apply these results to obtain an effective description of the set of homomorphisms from a given finitely presented group into a free group, or, more generally, into an NTQ group.
Transactions of the American Mathematical Society, 1998
arXiv (Cornell University), Aug 22, 2017
arXiv (Cornell University), Apr 25, 2017