We present some results on character degree sums in connection with several important characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

We give a definition of nilpotent association schemes as a generalization of nilpotent groups and investigate their basic properties. Moreover, for a group-like scheme, we characterize the nilpotency by its character products.

Numerically reliable algorithms for the deadbeat control problem, allowing for a trade-off between the size of the feedback gains and the order of nilpotency of the regulated system, are presented.

We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.

In this paper we provide characterizations of p-nilpotency for fusion systems and p-local finite groups that are inspired by known result for finite groups. In particular, we generalize criteria by Atiyah, Brunetti, Frobenius, Quillen, Stammbach and Tate.