The complexity of central series in nilpotent computable groups

12 years 11 months ago

Download www.math.uwaterloo.ca

The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are independent even when restricted to groups which admit computable orders.

Barbara F. Csima, Reed Solomon

Real-time Traffic

APAL 2011 | Computable Orders | Lower Central Series | Nilpotent Computable Group | Software Engineering |

claim paper

» Computing in Solvable Matrix Groups

» An ObjectOriented Data Model for a Time Series Management System

» Algebraic Theory of DNA Recombination

» Social coding in GitHub transparency and collaboration in an open software repository

» Efficient Security for Large and Dynamic Multicast Groups

» The Group Administration Shell and the GASH Network Computing Environment

» Computational Complexity of Generators and Nongenerators in Algebra

» An Efficient TreeBased Group Key Agreement Using Bilinear Map

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	APAL
Authors	Barbara F. Csima, Reed Solomon

Comments (0)

Sciweavers

The complexity of central series in nilpotent computable groups

APAL 2011 | Computable Orders | Lower Central Series | Nilpotent Computable Group | Software Engineering |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers