Related papers: Constructing solvable groups with derived length f…

In this paper we construct examples of p-groups with derived length three and three character degrees.

Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if…

Let N be a normal subgroup of a finite group G and consider the set cd(G|N) of degrees of irreducible characters of G whose kernels do not contain N. A number of theorems are proved relating the set cd(G|N) to the structure of N. For…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…

We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…

New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…

Let c(d) denote the minimal composition length of all finite solvable groups with solvable (or derived) length d. We prove that c(d) equals 0,1,2,4,5,7,8,13,15 when d=0,1,2,3,4,5,6,7,8.

New families of composition methods with processing of order 4 and 6 are presented and analyzed. They are specifically designed to be used for the numerical integration of differential equations whose vector field is separated into three or…

Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

We give a method to construct new self-adjoint representations of the braid group. In particular, we give a family of irreducible self-adjoint representations of dimension arbitrarily large. Moreover we give sufficient conditions for a…

we obtain a necessary condition for the character degree graph with all of its vertices are odd degree of a finite solvable group G.

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…

We construct solvable groups where the only degree of an irreducible character that is a prime power is $1$ and that have arbitrarily large Fitting heights. We will show that we can construct such groups that also have a Sylow tower. We…

The structure of the character degree graphs $\Delta(G)$, i.e. the prime graphs on the set $\mathrm{cd}(G)$ of the irreducible character degrees of a finite group $G$, such that $G$ is solvable and $\Delta(G)$ has diameter three, remains an…

Some relations between families of two-character CFTs are explained using a slightly generalised coset construction, and the underlying theories (whose existence was only conjectured based on the modular differential equation) are…

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

In this paper we give a way of equipping the derivation algebra of a group algebra with the structure of a graded algebra. The derived group is used as the grading group. For the proof, the identification of the derivation with the…