Abstract The study of the complexity equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (Inf. Comput. 178 (1), 253–262, 2002) where they showed that this is for nilpotent while it -complete non-solvable groups. Since then, several results have appeared showing can be solved polynomial time certain solvable G having a normal subgroup H with factor / . Thi...

The subgroup pattern of a finite groups G is the table of marks of G together with a list of representatives of the conjugacy classes of subgroups of G. In this article we present an algorithm for the computation of the subgroup pattern of a cyclic extension of G from the subgroup pattern of G. Repeated application of this algorithm yields an algorithm for the computation of the table of marks ...

Let $X$ be a (smooth) compact complex surface. We show that the torsion subgroup of biholomorphic automorphism group $\operatorname{Aut}(X)$ is virtually nilpotent. Moreover, we study Tits alternative and virtual derived length solvable subgroups $\operatorname{Aut}(X)$.

Let k be a local field, and Γ ≤ GLn(k) a linear group over k. We prove that either Γ contains a relatively open solvable subgroup, or it contains a relatively dense free subgroup. This result has applications in dynamics, Riemannian foliations and profinite groups.

1. A considerable amount is known about the structure of finite factorizable groups—that is, groups G which can be represented in the form AB, where A and B are subgroups of G. Such groups are known to be solvable under a variety of assumptions on the subgroups A and B. If A and B are both Abelian, Ito [6] has shown that G is actually metabelian. If A and B are both cyclic, it is easy to see th...

Let k be a local field, and Γ ≤ GLn(k) a linear group over k. We prove that Γ contains either a relatively open solvable subgroup or a relatively dense free subgroup. This result has applications in dynamics, Riemannian foliations and profinite groups.

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and relevant homomorphisms are also calculable in quadratic time. The algorithm also decides if a finitely generated subgroup has finite index.

In this paper, persents the definitions of strongly prime ideal, strongly prime N-subgroup, Pseudo-valuation near ring and Pseudo-valuation N-group. Some of their properties have also been proven by theorems. Then it is shown that, if N be near ring with quotient near-field K and P be a strongly prime ideal of near ring N, then is a strongly prime ideal of ‎‎, for any multiplication subset S of...

in which GiCG and Gi+1/Gi ⊂ Z(G/Gi) for all i. We call G solvable if it admits a normal series (1.1) in which Gi+1/Gi is abelian for all i. Every nilpotent group is solvable. Nilpotent groups include finite p-groups, and some theorems about p-groups extend to nilpotent groups (e.g., any nontrivial normal subgroup of a nilpotent group has a nontrivial intersection with the center). There is a la...

In this article we define a new form of unipotence in groups finite Morley rank which extends Burdges to any characteristic. particular, show that every connected solvable group $G$ has definable subgroup $H$ whose derived $H'$ is good unipotent rank.