A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series

Details A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series

2006-06-23

arxiv.org/abs/math/0606605v2

Mathematics

Group Theory

15 pages, sending to a Journal

Scientific paper

In this paper we describe an algorithm for finding the nilpotency class, and the upper central series of the maximal normal p-subgroup N(G) of the automorphism group, Aut(G) of a bounded (or finite) abelian p-group G. This is the first part of two papers devoted to compute the nilpotency class of N(G) using formulas, and algorithms that work in almost all groups. Here, we prove that for p>2 the algorithm always runs. The algorithm describes a sequence of ideals of the Jacobson radical, J, and because N(G)=J+1, this sequence induces the upper central series in N(G).

Affiliated with

Also associated with

No associations

Rating

A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series 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 A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new algorithm for finding the nilpotency class of a finite p-group describing the upper central series will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529801