Searcharxiv⌕ Search

arXiv subjects

Hung P. Tong-Viet

Publications and source records attributed to Hung P. Tong-Viet.

At least 37 records · Page 2Linked to original sources

Brauer characters and normal Sylow $p$-subgroups

In this paper, we study some variations of the well-known Itô-Michler theorem for $p$-Brauer characters using various inequalities involving the $p$-Brauer character degrees of finite groups. Several new criteria for the existence of a normal Sylow $p$-subgroup of finite groups are obtained using the $p$-parts and $p'$-parts of the $p$-Brauer character degrees.

math.GR↗

Real class sizes

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is disconnected. Moreover, we show that if the sizes of all non-central real conjugacy classes of a finite group $G$ have the same $2$-part and the Sylow $2$-subgroup of $G$ satisfies certain condition, then $G$ is solvable.

math.GR↗

Upper and lower bounds on Chillag table sums

Chillag has showed that there is a single generalization showing that the sums of ordinary character tables, Brauer character, and projective indecomposable characters are positive integers. We show that Chillag's construction also applies to Isaacs' $π$-partial characters. We show that if an extra condition is assumed, then we can obtain upper and lower bounds on the Chillag's table sums. We will demonstrate that this condition holds for Brauer characters, $π$-partial characters, and projective indecomposable characters, and so we obtain upper and lower bounds for the table sums in those cases. We also obtain results regarding the sums of rows and columns in these tables.

math.GR↗

Groups satisfying the two-prime hypothesis with a composition factor isomorphic to ${\rm PSL}_2(q)$ for $q\geq 7$

Let $G$ be a finite group, and write ${\rm cd}(G)$ for the degree set of the complex irreducible characters of $G$. The group $G$ is said to satisfy the {\it two-prime hypothesis} if, for any distinct degrees $a, b \in {\rm cd}(G)$, the total number of (not necessarily different) primes of the greatest common divisor ${\rm gcd}(a, b)$ is at most $2$. In this paper, we prove an upper bound on the number of irreducible character degrees of a nonsolvable group that has a composition factor isomorphic to ${\rm PSL}_2 (q)$ for $q \geq 7$.

math.GR↗

Brauer characters of $q^\prime$- degree

We show that if $p$ is a prime and $G$ is a finite $p$-solvable group satisfying the condition that a prime $q$ divides the degree of no irreducible $p$-Brauer character of $G$, then the normalizer of some Sylow $q$-subgroup of $G$ meets all the conjugacy classes of $p$-regular elements of $G$.

math.GR↗

Primitive permutation groups and derangements of prime power order

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation groups with the extremal property that the order of every derangement is an $r$-power, for some fixed prime $r$. First we show that these groups are either almost simple or affine, and we determine all the almost simple groups with this property. We also prove that an affine group $G$ has this property if and only if every two-point stabilizer is an $r$-group. Here the structure of $G$ has been extensively studied in work of Guralnick and Wiegand on the multiplicative structure of Galois field extensions, and in later work of Fleischmann, Lempken and Tiep on $r'$-semiregular pairs.

math.GR↗

Finite groups have more conjugacy classes

We prove that for every $ε> 0$ there exists a $δ> 0$ so that every group of order $n \geq 3$ has at least $δ\log_{2} n/{(\log_{2} \log_{2} n)}^{3+ε}$ conjugacy classes. This sharpens earlier results of Pyber and Keller. Bertram speculates whether it is true that every finite group of order $n$ has more than $\log_{3}n$ conjugacy classes. We answer Bertram's question in the affirmative for groups with a trivial solvable radical.

math.GR↗

Complex group algebras of the double covers of the symmetric and alternating groups

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double covers of $\Al_n$ and $\Sy_n$, respectively. We prove that $\CC G\cong \CC \AAA$ if and only if $G\cong \AAA$, and $\CC G\cong \CC \SSS^+\cong\CC\SSS^-$ if and only if $G\cong \SSS^+$ or $\SSS^-$. This in particular completes the proof of a conjecture proposed by the second and fourth authors that every finite quasi-simple group is determined uniquely up to isomorphism by the structure of its complex group algebra. The known results on prime power degrees and relatively small degrees of irreducible (linear and projective) representations of the symmetric and alternating groups together with the classification of finite simple groups play an essential role in the proofs.

math.RT↗

Projective special linear groups $PSL_4(q)$ are determined by the set of their character degrees

Let $G$ be a finite group and let $cd(G)$ be the set of all irreducible complex character degrees of $G$. It was conjectured by Huppert in Illinois J. Math. 44 (2000) that, for every non-abelian finite simple group $H$, if $cd(G)=cd(H)$ then $G\cong H\times A$ for some abelian group $A$. In this paper, we confirm the conjecture for the family of projective special linear groups $\textrm{PSL}_4(q)$ with $q\geq 13$.

math.GR↗

Huppert's Conjecture for Alternating groups

We prove that the alternating groups of degree at least $5$ are uniquely determined up to an abelian direct factor by the degrees of their irreducible complex representations. This confirms Huppert's Conjecture for alternating groups.

math.GR↗

Derangements in primitive permutation groups, with an application to character theory

Let $G$ be a finite primitive permutation group and let $κ(G)$ be the number of conjugacy classes of derangements in $G$. By a classical theorem of Jordan, $κ(G) \geqslant 1$. In this paper we classify the groups $G$ with $κ(G)=1$, and we use this to obtain new results on the structure of finite groups with an irreducible complex character that vanishes on a unique conjugacy class. We also obtain detailed structural information on the groups with $κ(G)=2$, including a complete classification for almost simple groups.

math.GR↗

Finite groups whose prime graphs are regular

Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by ρ(G) the set of primes which divide some character degrees of G. The prime graph Δ(G) associated to G is a graph whose vertex set is ρ(G) and there is an edge between two distinct primes p and q if and only if the product pq divides some character degree of G. In this paper, we show that the prime graph Δ(G) of a finite group G is 3-regular if and only if it is a complete graph with four vertices.

math.GR↗

Groups with some arithmetic conditions on real class sizes

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real conjugacy class size of a finite group G, then G is solvable. We also study the structure of such groups in detail. This generalizes several results in the literature.

math.GR↗

Groups whose prime graphs have no triangles

Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let ρ(G) be the set of all primes which divide some character degree of G. The prime graph Δ(G) attached to G is a graph whose vertex set is ρ(G) and there is an edge between two distinct primes u and v if and only if the product uv divides some character degree of G. In this paper, we show that if G is a finite group whose prime graph Δ(G) has no triangles, then Δ(G) has at most 5 vertices. We also obtain a classification of all finite graphs with 5 vertices and having no triangles which can occur as prime graphs of some finite groups. Finally, we show that the prime graph of a finite group can never be a cycle nor a tree with at least 5 vertices.

math.GR↗

On a generalization of M-group

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a generalization of Taketa's Theorem on the solvability of M-group.

math.GR↗

Influence of strongly closed 2-subgroups on the structure of finite groups

Let $H\leq K$ be subgroups of a group G. We say that H is strongly closed in K with respect to G if whenever $a^g \in K$ where $a \in H, g \in G,$ then $a^g \in H.$ In this paper, we investigate the structure of a group G under the assumption that every subgroup of order $2^m$ (and 4 if m = 1) of a 2- Sylow subgroup S of G is strongly closed in S with respect to G. Some results related to 2-nilpotence and supersolvability of a group G are obtained. This is a complement to Guo and Wei (J. Group Theory 13 (2010), no. 2, 267-276).

math.GR↗

Rank 3 permutation characters and maximal subgroups

In this paper we classify all maximal subgroups M of a nearly simple primitive rank 3 group G of type L=Omega_{2m+1}(3), m > 3; acting on an L-orbit E of non-singular points of the natural module for L such that 1_P^G <=1_M^G where P is a stabilizer of a point in E. This result has an application to the study of minimal genera of algebraic curves which admit group actions.

math.GR↗