In this paper we describe an algorithm for finding the nilpotency class, and the upper central series of the maximal normal p-subgroup ∆(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 ∆(G) using formulas, and algorithms that work in almost all groups. Here, we prove that for p ≥ 3 t...

Groups with commuting inner mappings are of nilpotency class at most two, but there exist loops with commuting inner mappings and of nilpotency class higher than two, called loops of Csörgő type. In order to obtain small loops of Csörgő type, we expand our programme from Explicit constructions of loops with commuting inner mappings, European J. Combin. 29 (2008), 1662–1681, and analyze the foll...

A one-dimensional cellular automaton is a dynamical system which consisting in a juxtaposition of cells whose state changes over discrete time according to that of their neighbors. One of its simplest behaviors is nilpotency: all configurations of cells are mapped after a finite time into a given “null” configuration. Our main result is that nilpotency is equivalent to the condition that all co...