“…For groups L = L n (2 k ), the recognizability problem is solved for n = 2 (see [2]), n = 3 (see [3,4]), n = 4 (see [5]), n = 16 (see [16]), n = 2 m 32 (see [7]), and for k = 1 (see [8,9]); in all these cases L turns out to be recognizable by spectrum. As follows from [10,11], for n > 5, the group L = L n (2 k ) is recognizable by spectrum among its covers, i.e., among finite groups containing L as a homomorphic image (see Lemma 5).…”