COMBING NILPOTENT AND POLYCYCLIC GROUPS

DOI10.1142/S0218196799000102MaRDI QIDQ4513294zbMATH OpenOpenAlexFDO

Authors Robert H. Gilman, Derek F. Holt, Sarah Rees

Publication date 7 November 2000

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9901088

zbMATH Keywords

automatic groupscombingsDehn functionslength functionsnilpotent groupspolycyclic groupsreal-time languages

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Nilpotent groups (20F18) Geometric group theory (20F65) Formal languages and automata (68Q45)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 848021
• Formal language theory and the geometry of 3-manifolds
• From automatic structures to automatic groups.
• A REMARK ABOUT COMBINGS OF GROUPS
• Sol geometry groups are not asynchronously automatic

Cites work

• A shrinking lemma for indexed languages
• Combings of semidirect products and 3-manifold groups
• Formal language theory and the geometry of 3-manifolds
• Indexed Grammars—An Extension of Context-Free Grammars
• Isoperimetric inequalities and the homology of groups
• Nested Stack Automata
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• On the Geometry of Normal Forms in Discrete Groups
• Rational subgroups of biautomatic groups
• Real time computation
• Real-Time Definable Languages

Cited in

(2)

• Non-combability of Hilbert modular groups
• scientific article; zbMATH DE number 848021 (Why is no real title available?)

This page was built for publication: COMBING NILPOTENT AND POLYCYCLIC GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513294)