Algorithmic use of the Mal'cev correspondence

Bjõrn Uwe Michael Assmann

doi:10.1017/CBO9780511721212.007

Algorithmic use of the Mal'cev correspondence

Bjõrn Uwe Michael Assmann

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsion-free nilpotent group and its corresponding Lie algebra algorithmically. We apply it to fast multiplication of elements of polycyclically presented groups.

Original language	English
Title of host publication	Groups St Andrews 2005
Editors	C M Campbell, M R Quick, E F Roberston, G C Smith
Publisher	Cambridge University Press
Pages	158-169
Volume	1
ISBN (Electronic)	9780511721212
ISBN (Print)	9780521694698
DOIs	https://doi.org/10.1017/CBO9780511721212.007
Publication status	Published - 2007

Publication series

Name	London Mathematical Society Lecture Note Series
Publisher	Cambridge University Press
Number	339

Access to Document

10.1017/CBO9780511721212.007

Cite this

@inbook{1ec8156475b448af8765e64168e3a715,

title = "Algorithmic use of the Mal'cev correspondence",

abstract = "Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsion-free nilpotent group and its corresponding Lie algebra algorithmically. We apply it to fast multiplication of elements of polycyclically presented groups.",

author = "Assmann, {Bj{\~o}rn Uwe Michael}",

year = "2007",

doi = "10.1017/CBO9780511721212.007",

language = "English",

isbn = "9780521694698 ",

volume = "1",

series = "London Mathematical Society Lecture Note Series ",

publisher = "Cambridge University Press",

number = "339",

pages = "158--169",

editor = "Campbell, {C M } and Quick, {M R} and Roberston, {E F } and Smith, {G C}",

booktitle = "Groups St Andrews 2005",

address = "United Kingdom",

}

TY - CHAP

T1 - Algorithmic use of the Mal'cev correspondence

AU - Assmann, Bjõrn Uwe Michael

PY - 2007

Y1 - 2007

N2 - Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsion-free nilpotent group and its corresponding Lie algebra algorithmically. We apply it to fast multiplication of elements of polycyclically presented groups.

AB - Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsion-free nilpotent group and its corresponding Lie algebra algorithmically. We apply it to fast multiplication of elements of polycyclically presented groups.

UR - http://ebooks.cambridge.org/chapter.jsf?bid=CBO9780511721212&cid=CBO9780511721212A014

U2 - 10.1017/CBO9780511721212.007

DO - 10.1017/CBO9780511721212.007

M3 - Chapter

SN - 9780521694698

VL - 1

T3 - London Mathematical Society Lecture Note Series

SP - 158

EP - 169

BT - Groups St Andrews 2005

A2 - Campbell, C M

A2 - Quick, M R

A2 - Roberston, E F

A2 - Smith, G C

PB - Cambridge University Press

ER -

Algorithmic use of the Mal'cev correspondence

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications

Cite this

Algorithmic use of the Mal'cev correspondence

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Projects

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications

Cite this