Let G be a group and let V be an algebraic variety over an algebraically closed field K. Let A denote the set of K-points of V. We introduce algebraic sofic subshifts ${\Sigma \subset A^G}$ and study endomorphisms $\tau \colon \Sigma \to \Sigma $. We generalize several results for dynamical invariant sets and nilpotency of $\tau $ that are well known for finite alphabet cellular automata. Under mild assumptions, we prove that $\tau $ is nilpotent if and only if its limit set, that is, the intersection of the images of its iterates, is a singleton. If moreover G is infinite, finitely generated and $\Sigma $ is topologically mixing, we show that $\tau $ is nilpotent if and only if its limit set consists of periodic configurations and has a finite set of alphabet values.

Skew left braces arise naturally from the study of non-degenerate set-theoretic solutions of the Yang–Baxter equation. To understand the algebraic structure of skew left braces, a study of the decomposition into minimal substructures is relevant. We introduce chief series and prove a strengthened form of the Jordan–Hölder theorem for finite skew left braces. A characterization of right nilpotency and an application to multipermutation solutions are also given.

It is well-known that an element of a commutative ring with identity is nilpotent if, and only if , it lies in every prime ideal of the ring. A modification of this fact is amenable to a very simple proof mining analysis. We formulate a quantitative version of this modification and obtain an explicit bound. We present an application. This proof mining analysis is the leitmotif for some comments and observations on the methodology of computational extraction. In particular, we emphasize that the formulation of quantitative versions of ordinary mathematical theorems is of independent interest from proof mining metatheorems.

It is shown that the nilpotency of a derivation on a 2-torsion free semiprime ring is always an odd number. Examples are provided to show the necessity of the assumptions.