arXiv subjects
Publications and source records attributed to Lucia Sanus.
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We report on recent results concerning minimal $G$-invariant characters of $N$ (which are the sums of the characters on each orbit of the action of $G$ by conjugation on $\text{Irr}(N)$) and their influence on the structure of $N$, as well as their relationship to the $G$-conjugacy classes of $N$.
It is well known that finite groups with exactly two character degrees have an abelian derived subgroup and, consequently, are solvable. Let $G$ be a finite group and $N$ a normal subgroup of $G$. In this paper, we prove that normal subgroups possessing exactly two degrees of minimal $G$-invariant characters are solvable. Furthermore, it is shown that if these degrees are $\{1, f\}$ for some integer $f$, then either $f$ is a prime power or the commutator subgroup $[N,G]$ is abelian. Whether $[N, G]$ is abelian when $f$ is a prime power remains an open problem. Specifically, we prove that this holds when $f=p$.
We consider finite groups having a conjugacy class that is the difference of two normal subgroups. That is, suppose $G$ is a group and $M$ and $N$ are normal subgroups so that $N < M$, and suppose that there is an element $g \in G$ so that the conjugacy class of $g$ is $M \setminus N$. We find a character-theoretic characterization of this condition, and we determine some structural properties of groups with such a conjugacy class. If we add the condition that $M/N$ is the unique minimal normal subgroup of $G/N$, then we obtain a generalization of a result by S.M. Gagola.
We study the conditions under which the head characters of a finite solvable group, as defined by I. M. Isaacs, behave well with respect to restriction. We also determine the intersection of the kernels of all head characters of the group. Using G. Navarro's definition of $\mathfrak{F}'$-characters, we generalize these results for any saturated formation $\mathfrak{F}$ containing the formation of nilpotent groups.
Let $G$ be a finite group and $N$ a proper, nontrivial, normal subgroup of $G$. If, for every element $x$ of $G$ not lying in $N$, the elements in the coset $xN$ all have the same order as $x$, then we say that $(G,N)$ is an {\it{equal order pair}}. This generalizes the concept of a Camina pair, that was introduced by the first author. In the present paper we study several properties of equal order pairs, showing that in many respects they resemble Camina pairs, but with some important differences.
Let $n$ be a non negative integer, and define $D_n$ to be the family of all finite groups having precisely $n$ conjugacy classes of nontrivial subgroups that are not self-normalizing. We are interested in studying the behavior of $D_n$ and its interplay with solvability and nilpotency. We first show that if $G$ belongs to $D_n$ with $n \le 3$, then $G$ is solvable of derived length at most 2. We also show that $A_5$ is the unique nonsolvable group in $D_4$, and that $SL_2(3)$ is the unique solvable group in $D_4$ whose derived length is larger than 2. For a group $G$, we define $D(G)$ to be the number of conjugacy classes of nontrivial subgroups that are not self-normalizing. We determine the relationship between $D(H \times K)$ and $D(H)$ and $D(K)$. We show that if $G$ is nilpotent and lies in $D_n$, then $G$ has nilpotency class at most $n/2$ and its derived length is at most $\log_2 (n/2) + 1$. We consider $D_n$ for several classes of Frobenius groups, and we use this classification to classify the groups in $D_0$, $D_1$, $D_2$, and $D_3$. Finally, we show that if $G$ is solvable and lies in $D_n$ with $n \ge 3$, then $G$ has derived length at most the minimum of $n-1$ and $3 \log_2 (n+1) + 9$.
Let $G$ be a finite group, and let $\text{Irr}(G)$ denote the set of the irreducible complex characters of $G$. An element $g\in G$ is called a vanishing element of $G$ if there exists $χ\in\text{Irr}(G)$ such that $χ(g)=0$ (i.e., $g$ is a zero of $χ$) and, in this case, the conjugacy class $g^G$ of $g$ in $G$ is called a vanishing conjugacy class. In this paper we consider several problems concerning vanishing elements and vanishing conjugacy classes; in particular, we consider the problem of determining the least number of conjugacy classes of a finite group $G$ such that every non-linear $χ\in\text{Irr}(G)$ vanishes on one of them. We also consider the related problem of determining the minimum number of non-linear irreducible characters of a group such that two of them have a common zero.
Let $G$ be a finite group, $p$ a prime and $B$ a Brauer $p$-block of $G$ with defect group $D$. We prove that if the number of irreducible ordinary characters in $B$ is $5$ then $D\cong C_5, C_7, D_8$ or $Q_8$, assuming that the Alperin--McKay conjecture holds for $B$.
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 numbers in cd(G), and two distinct vertices p, q are adjacent if and only if pq divides some number in cd(G). In the series of three papers starting with the present one, we analyze the structure of the finite non-solvable groups whose character degree graph possesses a cut-vertex, i.e., a vertex whose removal increases the number of connected components of the graph.
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $Δ(G)$ as the (simple undirected) graph whose vertices are the prime divisors of the numbers in ${\rm{cd}}(G)$, and two distinct vertices $p$, $q$ are adjacent if and only if $pq$ divides some number in ${\rm{cd}}(G)$. This paper continues the work, started in [7], toward the classification of the finite non-solvable groups whose degree graph possesses a cut-vertex, i.e., a vertex whose removal increases the number of connected components of the graph. While, in [7], groups with no composition factors isomorphic to ${\rm{PSL}}_2(t^a)$ (for any prime power $t^a\geq 4$) were treated, here we consider the complementary situation in the case when $t$ is odd and $t^a> 5$. The proof of this classification will be then completed in the third and last paper of this series ([8]), that deals with the case $t=2$.
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $Δ(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists of the prime divisors of the numbers in ${\rm{cd}}(G)$, two distinct vertices $p$ and $q$ being adjacent if and only if $pq$ divides some number in ${\rm{cd}}(G)$. In this note, we provide an upper bound on the size of ${\rm{V}}(G)$ in terms of the clique number $ω(G)$ (i.e., the maximum size of a subset of ${\rm{V}}(G)$ inducing a complete subgraph) of $Δ(G)$. Namely, we show that $|{\rm{V}}(G)|\leq{\rm{max}}\{2ω(G)+1,\;3ω(G)-4\}$. Examples are given in order to show that the bound is best possible. This completes the analysis carried out in [1] where the solvable case was treated, extends the results in [3,4,9], and answers a question posed by the first author and H.P. Tong-Viet in [4].
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G), two distinct vertices p and q being adjacent if and only if pq divides some number in cd(G). In this paper, we consider the complement of the character degree graph, and we characterize the finite groups for which this complement graph is not bipartite. This extends the analysis of [1], where the solvable case was treated.
Let \(G\) be a finite group, and let \(Δ(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 \(Δ(G)\) is connected, the diameter of \(Δ(G)\) is at most \(3\). In the present paper, we provide a description of the finite solvable groups for which the diameter of this graph attains the upper bound. This also enables us to confirm a couple of conjectures proposed by M.L. Lewis.
We give a characterization of the finite groups having nilpotent or abelian Hall $π$-subgroups which can easily be verified from the character table.