Let G be a group that is either virtually soluble or virtually free, and let ω be a weight on G. We prove that if G is infinite, then there is some maximal left ideal of finite codimension in the Beurling algebra $\ell^1(G, \omega)$, which fails to be (algebraically) finitely generated. This implies that a conjecture of Dales and Żelazko holds for these Banach algebras. We then go on to give examples of weighted groups for which this property fails in a strong way. For instance, we describe a Beurling algebra on an infinite group in which every closed left ideal of finite codimension is finitely generated and which has many such ideals in the sense of being residually finite dimensional. These examples seem to be hard cases for proving Dales and Żelazko’s conjecture.

In this paper, we generalize the finite generation result of Sormani to non-branching $RCD\left( 0,\,N \right)$ geodesic spaces (and in particular, Alexandrov spaces) with full supportmeasures. This is a special case of the Milnor’s Conjecture for complete non-compact $RCD\left( 0,\,N \right)$ spaces. One of the key tools we use is the Abresch–Gromoll type excess estimates for non-smooth spaces obtained by Gigli–Mosconi.

A variety is said to be a Rees–Sushkevich variety if it is contained in a periodic variety generated by 0-simple semigroups. Recently, all combinatorial Rees–Sushkevich varieties have been shown to be finitely based. The present paper continues the investigation of these varieties by describing those that are Cross, finitely generated, or small. It is shown that within the lattice of combinatorial Rees–Sushkevich varieties, the set ℱ of finitely generated varieties constitutes an incomplete sublattice and the set 𝒮 of small varieties constitutes a strict incomplete sublattice of ℱ. Consequently, a combinatorial Rees–Sushkevich variety is small if and only if it is Cross. An algorithm is also presented that decides if an arbitrarily given finite set Σ of identities defines, within the largest combinatorial Rees–Sushkevich variety, a subvariety that is finitely generated or small. This algorithm has complexity 𝒪(nk) where n is the number of identities in Σ and k is the length of the longest word in Σ.

A non-zero module M having a minimal generator set contains a maximal submodule. If M is Artinian and all submodules of M have minimal generator sets then M is Noetherian; it follows that every left Artinian module of a left perfect ring is Noetherian. Every right Noetherian module of a left perfect ring is Artinian. It follows that a module over a left and right perfect ring (in particular, commutative) is Artinian if and only if it is Noetherian. We prove that a local ring is left perfect if and only if each left module has a minimal generator set.