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...

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...

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 matrix equation X +AX−1AT = B, arising in parameter estimation of certain time series models, is solvable only for certain values of the matrices A,B. We present a numerical method to modify A,B in order to make the matrix equation solvable. Since solvability depends on the location of the eigenvalues of the palindromic matrix polynomial λA+ λB+A , our method works by moving those eigenvalu...

This paper presents a new algorithm for constructing a complete list of pairwise inequivalent ordinary irreducible representations of a finite solvable group G. The input of the algorithm is a pc-presentation corresponding to a composition series refining a chief series of G. Modifying the Baum-Clausen-Algorithm for supersolvable groups and combining this with an idea of Plesken for constructin...

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 paper, we classify the indecomposable non-nilpotent solvable Lie algebras with $N(R_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $N(R_n,m,r)$.We also prove that these solvable Lie algebras are complete and unique, up to isomorphism.

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 ...