Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...

Let Fn denote a free group of rank n. The group Out(Fn) contains mapping class groups of compact surfaces and maps onto GL(n,Z). It is perhaps not surprising that Out(Fn) behaves at times like a mapping class group and at times like a linear group. J. Birman, A. Lubotzky, and J. McCarthy [BLM83] showed that solvable subgroups of mapping class groups are finitely generated and virtually abelian....

We obtain the following characterization of the solvable radicalR(G) of any finite group G: R(G) coincides with the collection of all g ∈ G such that for any 3 elements a1, a2, a3 ∈ G the subgroup generated by the elements g, aiga i , i = 1, 2, 3, is solvable. In particular, this means that a finite group G is solvable if and only if in each conjugacy class of G every 4 elements generate a solv...

We prove that any finitely generated solvable group of zero entropy contains a nilpotent subgroup of finite index. In particular, any finitely generated solvable group of exponential growth is of uniformly exponential growth.

The classical approach of solvability using group theory is well known and one original motivation is to solve polynomials by radicals. Radicals are square, cube, square root, cube root etc of the original coefficients for the polynomial. A polynomial is solvable by radicals if the permutation group is solvable. This is exact solvability via group theory. With modern computers, we might need to...

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is induced from a character φ of U with solvable factor group U/ker(φ). Using the classification of finite simple groups, we prove that these groups are also s...

Actions of discrete groups on the real line are considered. When the group of homeomorphisms is solvable several sufficient conditions are given which guarantee that the group is semiconjugate to a subgroup of the affine group of the line. In the process of obtaining these results sufficient conditions are also determined for the existence of invariant (quasi-invariant) measures for abelian (so...