Nguyen Ngoc Hung
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nguyen Ngoc Hung has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Yong Yang
Department of Mathematics, Texas State University
7 shared publications - Alexander Moretó
Departament de Matemàtiques, Universitat de València, Burjassot, Spain
5 shared publications - Amanda A. Schaeffer Fry
Department of Mathematics and Statistics, Metropolitan State University of Denver, Denver, USA
5 shared publications - Pham Huu Tiep
Department of Mathematics, Rutgers University, Piscataway, USA
5 shared publications - Attila Maróti
Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda Utca 13-15, H-1053 Budapest, Hungary
4 shared publications - Attila Maróti
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
4 shared publications
Latest Publications
- 14 September 2026
- Published by Springer Nature in Acta Mathematica Vietnamica
- Vol. 51 (3) , 337-351
Problems on the Conductor of Finite Group Characters
- 14 September 2026
- Published by Springer Nature in Acta Mathematica Vietnamica
- Vol. 51 (3) , 337-351
Problems on the Conductor of Finite Group Characters
- Open Access
- 26 November 2025
- Published by Cambridge University Press (CUP) in Proceedings of the Royal Society of Edinburgh: Section A Mathematics
- p. 1-17
Wreath products and the non-coprime k ( GV ) problem
Let $G = X \wr H$ be the wreath product of a nontrivial finite group X with k conjugacy classes and a transitive permutation group H of degree n acting on the set of n direct factors of X n . If H is semiprimitive, then $k(G) \leq k^n$ for every sufficiently large n or k . This result solves a case of the non-coprime k ( GV ) problem and provides an affirmative answer to a question of Garzoni and Gill for semiprimitive permutation groups. The proof does not require the classification of finite simple groups.- 26 November 2025
- Published by Cambridge University Press (CUP) in Proceedings of the Royal Society of Edinburgh: Section A Mathematics
- p. 1-17
Open AccessWreath products and the non-coprime k ( GV ) problem
Let $G = X \wr H$ be the wreath product of a nontrivial finite group X with k conjugacy classes and a transitive permutation group H of degree n acting on the set of n direct factors of X n . If H is semiprimitive, then $k(G) \leq k^n$ for every sufficiently large n or k . This result solves a case of the non-coprime k ( GV ) problem and provides an affirmative answer to a question of Garzoni and Gill for semiprimitive permutation groups. The proof does not require the classification of finite simple groups. - 24 December 2024
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 309 (2) , 1-19
The field of values of prime-degree characters and Feit’s conjecture
- 24 December 2024
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 309 (2) , 1-19
The field of values of prime-degree characters and Feit’s conjecture
- Open Access
The $p$-rationality of height-zero characters
We propose and present evidence for a conjectural global-local phenomenon concerning the $p$-rationality of $p$-height-zero characters. Specifically, if $χ$ is a height-zero character of a finite group $G$ and $D$ is a defect group of the $p$-block of $G$ containing $χ$, then the $p$-rationality of $χ$ can be captured inside the normalizer $N_G(D)$.Open AccessThe $p$-rationality of height-zero characters
We propose and present evidence for a conjectural global-local phenomenon concerning the $p$-rationality of $p$-height-zero characters. Specifically, if $χ$ is a height-zero character of a finite group $G$ and $D$ is a defect group of the $p$-block of $G$ containing $χ$, then the $p$-rationality of $χ$ can be captured inside the normalizer $N_G(D)$. - 11 July 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (3) , 1157-1179
The codegree isomorphism problem for finite simple groups
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups and only depends on the classification by means of Artin–Tits’ simple order theorem.
- 11 July 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (3) , 1157-1179
The codegree isomorphism problem for finite simple groups
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups and only depends on the classification by means of Artin–Tits’ simple order theorem.
- Open Access
- 24 April 2024
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 262 (1) , 327-358
Bounding p-Brauer characters in finite groups with two conjugacy classes of p-elements
Let k(B0) and l(B0) respectively denote the number of ordinary and p-Brauer irreducible characters in the principal block B0 of a finite group G. We prove that, if k(B0)−l(B0) = 1, then l(B0) ≥ p − 1 or else p = 11 and l(B0) = 9. This follows from a more general result that for every finite group G in which all non-trivial p-elements are conjugate, l(B0) ≥ p − 1 or else p = 11 and $$G/{{\bf{O}}_{{p^\prime }}}(G) \cong C_{11}^2\, \rtimes\,{\rm{SL}}(2,5)$$ . These results are useful in the study of principal blocks with few characters.We propose that, in every finite group G of order divisible by p, the number of irreducible Brauer characters in the principal p-block of G is always at least $$2\sqrt {p - 1} + 1 - {k_p}(G)$$ , where kp(G) is the number of conjugacy classes of p-elements of G. This indeed is a consequence of the celebrated Alperin weight conjecture and known results on bounding the number of p-regular classes in finite groups.- 24 April 2024
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 262 (1) , 327-358
Open AccessBounding p-Brauer characters in finite groups with two conjugacy classes of p-elements
Let k(B0) and l(B0) respectively denote the number of ordinary and p-Brauer irreducible characters in the principal block B0 of a finite group G. We prove that, if k(B0)−l(B0) = 1, then l(B0) ≥ p − 1 or else p = 11 and l(B0) = 9. This follows from a more general result that for every finite group G in which all non-trivial p-elements are conjugate, l(B0) ≥ p − 1 or else p = 11 and $$G/{{\bf{O}}_{{p^\prime }}}(G) \cong C_{11}^2\, \rtimes\,{\rm{SL}}(2,5)$$ . These results are useful in the study of principal blocks with few characters.We propose that, in every finite group G of order divisible by p, the number of irreducible Brauer characters in the principal p-block of G is always at least $$2\sqrt {p - 1} + 1 - {k_p}(G)$$ , where kp(G) is the number of conjugacy classes of p-elements of G. This indeed is a consequence of the celebrated Alperin weight conjecture and known results on bounding the number of p-regular classes in finite groups. - 11 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 117 (2) , 105-129
COMMON ZEROS OF IRREDUCIBLE CHARACTERS
We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $\mathsf {S}_n$ , it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this phenomenon, we introduce the common-zero graph of a finite group G, with nonlinear irreducible characters of G as vertices, and edges connecting characters that vanish on some common group element. We show that for solvable and simple groups, the number of connected components of this graph is bounded above by three. Lastly, the result for $\mathsf {S}_n$ is applied to prove the nonequivalence of the metrics on permutations induced from faithful irreducible characters of the group.- 11 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 117 (2) , 105-129
COMMON ZEROS OF IRREDUCIBLE CHARACTERS
We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $\mathsf {S}_n$ , it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this phenomenon, we introduce the common-zero graph of a finite group G, with nonlinear irreducible characters of G as vertices, and edges connecting characters that vanish on some common group element. We show that for solvable and simple groups, the number of connected components of this graph is bounded above by three. Lastly, the result for $\mathsf {S}_n$ is applied to prove the nonequivalence of the metrics on permutations induced from faithful irreducible characters of the group.- 25 October 2023
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 377 (01) , 323-344
The continuity of 𝑝-rationality and a lower bound for 𝑝’-degree characters of finite groups
Let p p be a prime and G G a finite group. We propose a strong bound for the number of p ′ p’ -degree irreducible characters of G G in terms of the commutator factor group of a Sylow p p -subgroup of G G . The bound arises from a recent conjecture of Navarro and Tiep [Forum Math. Pi 9 (2021), pp. 1–28] on fields of character values and a phenomenon called the continuity of p p -rationality level of p ′ p’ -degree characters. This continuity property in turn is predicted by the celebrated McKay-Navarro conjecture (see G. Navarro [Ann. of Math. (2) 160 (2004), pp. 1129–1140]). We achieve both the bound and the continuity property for p = 2 p=2 .
- 25 October 2023
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 377 (01) , 323-344
The continuity of 𝑝-rationality and a lower bound for 𝑝’-degree characters of finite groups
Let p p be a prime and G G a finite group. We propose a strong bound for the number of p ′ p’ -degree irreducible characters of G G in terms of the commutator factor group of a Sylow p p -subgroup of G G . The bound arises from a recent conjecture of Navarro and Tiep [Forum Math. Pi 9 (2021), pp. 1–28] on fields of character values and a phenomenon called the continuity of p p -rationality level of p ′ p’ -degree characters. This continuity property in turn is predicted by the celebrated McKay-Navarro conjecture (see G. Navarro [Ann. of Math. (2) 160 (2004), pp. 1129–1140]). We achieve both the bound and the continuity property for p = 2 p=2 .
- Open Access
- 26 May 2023
- Published by Mathematical Sciences Publishers in Algebra & Number Theory
- Vol. 17 (6) , 1127-1151
On Héthelyi–Külshammer’s conjecture for principal blocks
We prove that the number of irreducible ordinary characters in the principal p-block of a finite group G of order divisible by p is always at least 2 √ p-1. This confirms a conjecture of Héthelyi and Külshammer (2000) for principal blocks and provides an affirmative answer to Brauer's problem 21 (1963) for principal blocks of bounded defect. Our proof relies on recent works of Maróti (2016) and Malle and Maróti (2016) on bounding the conjugacy class number and the number of p ′-degree irreducible characters of finite groups, earlier works of Broué, Malle and Michel (1993) and Cabanes and Enguehard (2004) on the distribution of characters into unipotent blocks and e-Harish-Chandra series of finite reductive groups, and known cases of the Alperin-McKay conjecture. The first author thanks Gunter Malle for several stimulating discussions on the relation between the relative Weyl groups of e-split Levi subgroups and maximal tori, and both authors
- 26 May 2023
- Published by Mathematical Sciences Publishers in Algebra & Number Theory
- Vol. 17 (6) , 1127-1151
Open AccessOn Héthelyi–Külshammer’s conjecture for principal blocks
We prove that the number of irreducible ordinary characters in the principal p-block of a finite group G of order divisible by p is always at least 2 √ p-1. This confirms a conjecture of Héthelyi and Külshammer (2000) for principal blocks and provides an affirmative answer to Brauer's problem 21 (1963) for principal blocks of bounded defect. Our proof relies on recent works of Maróti (2016) and Malle and Maróti (2016) on bounding the conjugacy class number and the number of p ′-degree irreducible characters of finite groups, earlier works of Broué, Malle and Michel (1993) and Cabanes and Enguehard (2004) on the distribution of characters into unipotent blocks and e-Harish-Chandra series of finite reductive groups, and known cases of the Alperin-McKay conjecture. The first author thanks Gunter Malle for several stimulating discussions on the relation between the relative Weyl groups of e-split Levi subgroups and maximal tori, and both authors
- 12 May 2023
- Published by Springer Nature in European Journal of Mathematics
- Vol. 9 (2) , 1-17
Degrees and fields of values of irreducible characters
- 12 May 2023
- Published by Springer Nature in European Journal of Mathematics
- Vol. 9 (2) , 1-17
Degrees and fields of values of irreducible characters