We prove that an element g of prime order > 3 belongs to the solvable radical R(G) of a finite (or, more generally, a linear) group if and only if for every x ∈ G the subgroup generated by g, xgx is solvable. This theorem implies that a finite (or a linear) group G is solvable if and only if in each conjugacy class of G every two elements generate a solvable subgroup.

the theorem 12 in [a note on $p$-nilpotence and solvability of finite groups, j. algebra 321(2009) 1555--1560.] investigated the non-abelian simple groups in which some maximal subgroups have primes indice. in this note we show that this result can be applied to prove that the finite groups in which every non-nilpotent maximal subgroup has prime index aresolvable.

The K-theory of the title is described in terms of the Ktheory of finite subgroups, as generalized sheaf homology of a quotient space. A corollary is that if G is torsion-free, then the Whitehead groups Wh t(ZG) vanish for all i. 1. The main result. Suppose that G is a poly-(finite or cyclic) group. Then there is a virtually connected and solvable Lie group L that contains G as a discrete cocom...

Tits has shown that a finitely generated matrix group either contains a nonabelian free group or has a solvable subgroup of finite index. We give a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. Noting that many computational problems are undecidable for groups with nonabelian free subgroups,...

We exhibit counterexamples to a Conjecture of Nesin, since we build a connected solvable group with finite center and of finite Morley rank in which no normal nilpotent subgroup has a nilpotent complement. The main result says that each centerless connected solvable group G of finite Morley has a normal nilpotent subgroup U and an abelian subgroup T such that G = U o T , if and only if, for any...

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in Zp , whenever p is a fixed prime. For the induction step, we introduce the ...

In this paper, all semigroups are assumed to be finite unless otherwise stated. If H is a pseudovariety of groups (that is, a class of groups closed under formation of finite direct products, subgroups and quotients groups), then it is natural to define a group to be Hsolvable if it has a subnormal series each of whose quotients belongs to H. For instance a group is solvable in the classical se...

A subalgebra B of a Leibniz algebra L is called weak c-ideal if there subideal C such that L=B+C and B∩C⊆BL where BL the largest ideal contained in B. This analogous to concept weakly c-normal subgroup, which has been studied by number authors. We obtain some properties c-ideals use them give characterizations solvable supersolvable algebras generalizing previous results for Lie algebras. note ...

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in Zp , whenever p is a fixed prime. For the induction step, we introduce the ...