Combing nilpotent and polycyclic groups

Details Combing nilpotent and polycyclic groups Combing nilpotent and polycyclic groups

1999-01-21

arxiv.org/abs/math/9901088v1

Mathematics

Group Theory

To appear in the International Journal of Algebra and Computation

Scientific paper

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2 nilpotent group with cyclic commutator subgroup is real-time combable, as are also all 2 or 3-generated class 2 nilpotent groups, and groups in certain families of nilpotent groups, e.g. the finitely generated Heisenberg groups, groups of unipotent matrices over the integers and the free class 2 nilpotent groups. Further it is shown that any polycyclic-by-finite group embeds in a real-time combable group. All the combings constructed in the article are boundedly asynchronous, and those for nilpotent-by-finite groups have polynomially bounded length functions, of degree equal to the nilpotency class, c. This result verifies a polynomial upper bound on the Dehn functions of those groups of degree c+1.

Affiliated with

Also associated with

No associations

Rating

Combing nilpotent and polycyclic groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combing nilpotent and polycyclic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combing nilpotent and polycyclic groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545235