{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:03:25Z","timestamp":1760061805435},"reference-count":28,"publisher":"Walter de Gruyter GmbH","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the isomorphism problem for the finitely generated torsion free nilpotent groups of Hirsch length at most five. We show how this problem translates to solving an explicitly given set of polynomial equations. Based on this, we introduce a canonical form for each isomorphism type of finitely generated torsion free nilpotent group of Hirsch length at most 5 and, using a variation of our methods, we give an explicit description of its automorphisms.<\/jats:p>","DOI":"10.1515\/gcc-2017-0004","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T10:01:12Z","timestamp":1492596072000},"source":"Crossref","is-referenced-by-count":2,"title":["The isomorphism problem for torsion free nilpotent groups of Hirsch length at most 5"],"prefix":"10.1515","volume":"9","author":[{"given":"Bettina","family":"Eick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ann-Kristin","family":"Engel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","reference":[{"key":"ref301","year":"1993","journal-title":"Nilpotent Groups and Their Automorphisms"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jsco.2002.0540","article-title":"Orbit-stabilizer problems and computing normalizers for polycyclic groups","volume":"34","year":"2002","journal-title":"J. Symbolic Comput."},{"key":"ref291","year":"2005","journal-title":"Handbook of Computational Group Theory"},{"key":"ref21","first-page":"139","article-title":"Computing with infinite polycyclic groups","year":"2001","journal-title":"Groups and Computation III"},{"key":"ref141","year":"1972","journal-title":"Integral Matrices"},{"key":"ref151","year":"1982","journal-title":"A Course in the Theory of Groups"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"3950","DOI":"10.1016\/j.jalgebra.2009.03.027","article-title":"Constructing arithmetic subgroups of unipotent groups","volume":"322","year":"2009","journal-title":"J. Algebra"},{"key":"ref01","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0021-8693(91)90221-S","article-title":"The algorithmic theory of polycyclic-by-finite groups","volume":"142","year":"1991","journal-title":"J. Algebra"},{"key":"ref331","article-title":"The GAP Group GAP Groups Programming Version available fromhttp www gap system org","year":"2005","journal-title":"Algorithms"},{"key":"ref121","year":"2005","journal-title":"Handbook of Computational Group Theory"},{"key":"ref201","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jsco.2002.0540","article-title":"Orbit-stabilizer problems and computing normalizers for polycyclic groups","volume":"34","year":"2002","journal-title":"J. Symbolic Comput."},{"key":"ref251","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0021-8693(79)90197-2","article-title":"A note on finitely generated torsion-free nilpotent groups of class 2","volume":"58","year":"1979","journal-title":"J. Algebra"},{"key":"ref181","doi-asserted-by":"crossref","first-page":"3950","DOI":"10.1016\/j.jalgebra.2009.03.027","article-title":"Constructing arithmetic subgroups of unipotent groups","volume":"322","year":"2009","journal-title":"J. Algebra"},{"key":"ref131","year":"1993","journal-title":"Nilpotent Groups and Their Automorphisms"},{"key":"ref101","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/1971092","article-title":"Some general algorithms, II: Nilpotent groups","volume":"112","year":"1980","journal-title":"Ann. of Math. (2)"},{"key":"ref91","doi-asserted-by":"crossref","first-page":"531","DOI":"10.2307\/1971091","article-title":"Some general algorithms. I: Arithmetic groups","volume":"112","year":"1980","journal-title":"Ann. of Math. (2)"},{"key":"ref241","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.jalgebra.2012.09.031","article-title":"Computing generators of the unit group of an integral abelian group ring","volume":"373","year":"2013","journal-title":"J. Algebra"},{"key":"ref71","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.jalgebra.2012.09.031","article-title":"Computing generators of the unit group of an integral abelian group ring","volume":"373","year":"2013","journal-title":"J. Algebra"},{"key":"ref271","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/1971092","article-title":"Some general algorithms, II: Nilpotent groups","volume":"112","year":"1980","journal-title":"Ann. of Math. (2)"},{"key":"ref81","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0021-8693(79)90197-2","article-title":"A note on finitely generated torsion-free nilpotent groups of class 2","volume":"58","year":"1979","journal-title":"J. Algebra"},{"key":"ref321","year":"1982","journal-title":"A Course in the Theory of Groups"},{"key":"ref191","first-page":"139","article-title":"Computing with infinite polycyclic groups","year":"2001","journal-title":"Groups and Computation III"},{"key":"ref171","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0021-8693(91)90221-S","article-title":"The algorithmic theory of polycyclic-by-finite groups","volume":"142","year":"1991","journal-title":"J. Algebra"},{"key":"ref311","year":"1972","journal-title":"Integral Matrices"},{"key":"ref161","article-title":"The GAP Group GAP Groups Programming Version available fromhttp www gap system org","year":"2005","journal-title":"Algorithms"},{"key":"ref261","doi-asserted-by":"crossref","first-page":"531","DOI":"10.2307\/1971091","article-title":"Some general algorithms. I: Arithmetic groups","volume":"112","year":"1980","journal-title":"Ann. of Math. (2)"},{"key":"ref111","year":"1969","journal-title":"The Edmonton Notes on Nilpotent Groups"},{"key":"ref281","year":"1969","journal-title":"The Edmonton Notes on Nilpotent Groups"}],"container-title":["Groups Complexity Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/gcc.2017.9.issue-1\/gcc-2017-0004\/gcc-2017-0004.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.degruyter.com\/view\/j\/gcc.2017.9.issue-1\/gcc-2017-0004\/gcc-2017-0004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T03:08:43Z","timestamp":1614395323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/gcc-2017-0004\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1515\/gcc-2017-0004","relation":{},"ISSN":["1867-1144","1869-6104"],"issn-type":[{"value":"1867-1144","type":"print"},{"value":"1869-6104","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}