A nonassociative algebra is nilpotent if there is some n such that the product of any n elements, no matter how they are associated, is zero. Several related, but more general, notions are left nilpotency, solvability, local nilpotency, and nillity. First the complexity of several decision problems for these properties is examined. In finite-dimensional algebras over a finite field it is shown ...

Let $G$ be a $p$-group of order $p^n$ and $Phi$=$Phi(G)$ be the Frattini subgroup of $G$. It is shown that the nilpotency class of $Autf(G)$, the group of all automorphisms of $G$ centralizing $G/ Fr(G)$, takes the maximum value $n-2$ if and only if $G$ is of maximal class. We also determine the nilpotency class of $Autf(G)$ when $G$ is a finite abelian $p$-group.

In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...

In this paper, we consider the finitely presented groups $G_{m}$ and $K(s,l)$ as follows;$$G_{m}=langle a,b| a^m=b^m=1,~[a,b]^a=[a,b],~[a,b]^b=[a,b]rangle $$$$K(s,l)=langle a,b|ab^s=b^la,~ba^s=a^lbrangle;$$and find the $n^{th}$-commutativity degree for each of them. Also we study the concept of $n$-abelianity on these groups, where $m,n,s$ and $l$ are positive integers, $m,ngeq 2$ and $g.c.d(s,...

One of the most interesting aspects in the theory of cellular automata is the study of different types of nilpotency, that is, different ways in which a cellular automaton can force a particular symbol (usually called 0) to appear frequently in all its spacetime diagrams. The simplest such notion, called simply ‘nilpotency’, is that the cellular automaton c maps every configuration to a uniform...