In this paper we introduce the graph Γsc(G) associated with a group G, called solvable conjugacy class (abbreviated as SCC-graph), whose vertices are nontrivial classes of G and two distinct C,D adjacent if there exist x∈C y∈D such that 〈x,y〉 is solvable. We discuss connectivity, girth, clique number, several other properties SCC-graph. One our results asserts only finitely many finite groups S...

We give new evidence to the fact that structure of a solvable group can be controlled by irreducible monomial characters. In particular, we inspect role characters in Isaacs–Navarro–Wolf conjecture and Gluck’s conjecture.

Freiman’s theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by Green and Ruzsa to arbitrary abelian groups, where the controlling object is now a coset progression. We extend these results further to solvable groups of bo...

The following structure theorems are proved: An orbit of a real solvable Lie group in projective space that is a complex submanifold is isomorphic to C x (C*)m x Í2 , where Í2 is an open orbit of a real solvable Lie group in a projective rational variety. Also, any homogeneous space of a complex Lie group that is isomorphic to C" can be realized as an orbit in some projective space. As a conseq...

We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...

In this paper we generalize to groups of Galois type some results of P. Hall on finite solvable groups [l; 2; 3]. We need, in a modified form, some results of van Dantzig: the definition of supernatural numbers (which are related to van Dantzig's universal numbers) and Theorem 5, which he proved for ordinary ¿>-Sylow subgroups [6]. Lemmas 1 and 4 and the method of proof in Theorem 5 are due to ...

Applications of hypergroups have mainly appeared in special subclasses. One of the important subclasses is the class of polygroups. In this paper, we study the notions of nilpotent and solvable polygroups by using the notion of heart of polygroups. In particular, we give a necessary and sufficient condition between nilpotent (solvable) polygroups and fundamental groups.