Tung T. Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tung T. Nguyen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jan Minac
Western University
4 shared publications - Nguyen Duy Tân
Hanoi University of Science and Technology
4 shared publications - Lyle Muller
Western University
2 shared publications - Roberto C. Budzinski
Western University
2 shared publications - Jacqueline Đoàn
Department of Mathematics, Western University, London, ON, Canada
1 shared publication - Priya B. Jain
Western University
1 shared publication
Latest Publications
- Open Access
- 10 November 2026
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- p. 1-24
ISOMORPHIC GCD-GRAPHS OVER POLYNOMIAL RINGS
Gcd-graphs over the ring of integers modulo n are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work (J. Mináč, T. T. Nguyen and N. D. Tân, ‘On the gcd-graphs over polynomial rings’, Canad. J. Math. , to appear. Published online (1 October 2025)), inspired by the analogy between number fields and function fields, we define and study gcd-graphs over polynomial rings with coefficients in finite fields. We discover that, in both cases, gcd-graphs share many similar and analogous properties. In this article, we extend this line of research further. Among other topics, we explore an analog of a conjecture of So and a weaker version of Sander and Sander concerning the conditions under which two gcd-graphs are isomorphic or isospectral. We also provide several constructions showing that, unlike the case over $\mathbb {Z}$ double struck upper Z , it is not uncommon for two gcd-graphs over polynomial rings to be isomorphic.- 10 November 2026
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- p. 1-24
Open AccessISOMORPHIC GCD-GRAPHS OVER POLYNOMIAL RINGS
Gcd-graphs over the ring of integers modulo n are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work (J. Mináč, T. T. Nguyen and N. D. Tân, ‘On the gcd-graphs over polynomial rings’, Canad. J. Math. , to appear. Published online (1 October 2025)), inspired by the analogy between number fields and function fields, we define and study gcd-graphs over polynomial rings with coefficients in finite fields. We discover that, in both cases, gcd-graphs share many similar and analogous properties. In this article, we extend this line of research further. Among other topics, we explore an analog of a conjecture of So and a weaker version of Sander and Sander concerning the conditions under which two gcd-graphs are isomorphic or isospectral. We also provide several constructions showing that, unlike the case over $\mathbb {Z}$ double struck upper Z , it is not uncommon for two gcd-graphs over polynomial rings to be isomorphic. - 9 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- p. 1-19
Perfect state transfer on gcd-graphs over a finite Frobenius ring
The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics. Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over [ ] and cubelike graphs. In this paper, building on our recent work on gcd-graphs over an arbitrary finite Frobenius ring, we investigate the existence of PST on these graphs. Our approach is algebraic in nature, enabling us to unify various existing results in the literature.
- 9 July 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- p. 1-19
Perfect state transfer on gcd-graphs over a finite Frobenius ring
The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics. Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over [ ] and cubelike graphs. In this paper, building on our recent work on gcd-graphs over an arbitrary finite Frobenius ring, we investigate the existence of PST on these graphs. Our approach is algebraic in nature, enabling us to unify various existing results in the literature.
- Open Access
- 27 March 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
On gcd-graphs over finite commutative rings
- 27 March 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Open AccessOn gcd-graphs over finite commutative rings
- Open Access
- 28 February 2025
- Published by Association for Mathematical Research
- Vol. 1 (1) , 51-93
Fekete polynomials of principal Dirichlet characters
Fekete polynomials associated to quadratic Dirichlet characters have interesting arithmetic properties, and have been studied in many works. In this paper, we study a seemingly simpler yet rich variant: the Fekete polynomial F_n(x) = ∑_a=1^n χ_n(a) x^a associated to a principal Dirichlet character χ_n of modulus n. We investigate the cyclotomic factors of F_n and conjecturally describe all of them. One interesting observation from our computations is that the non-cyclotomic part f_n of F_n(x)/x seems to be always irreducible. We study this factor closely in the special case that n is a product of two odd primes, proving separability in specific cases, and studying its coefficients and special values. Combining these theoretical results with computational evidence lets us identify the Galois group of fn for small n, and raises precise questions in general.
- 28 February 2025
- Published by Association for Mathematical Research
- Vol. 1 (1) , 51-93
Open AccessFekete polynomials of principal Dirichlet characters
Fekete polynomials associated to quadratic Dirichlet characters have interesting arithmetic properties, and have been studied in many works. In this paper, we study a seemingly simpler yet rich variant: the Fekete polynomial F_n(x) = ∑_a=1^n χ_n(a) x^a associated to a principal Dirichlet character χ_n of modulus n. We investigate the cyclotomic factors of F_n and conjecturally describe all of them. One interesting observation from our computations is that the non-cyclotomic part f_n of F_n(x)/x seems to be always irreducible. We study this factor closely in the special case that n is a product of two odd primes, proving separability in specific cases, and studying its coefficients and special values. Combining these theoretical results with computational evidence lets us identify the Galois group of fn for small n, and raises precise questions in general.
- Open Access
- 1 October 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (10)
Composed solutions of synchronized patterns in multiplex networks of Kuramoto oscillators
Networks with different levels of interactions, including multilayer and multiplex networks, can display a rich diversity of dynamical behaviors and can be used to model and study a wide range of systems. Despite numerous efforts to investigate these networks, obtaining mathematical descriptions for the dynamics of multilayer and multiplex systems is still an open problem. Here, we combine ideas and concepts from linear algebra and graph theory with nonlinear dynamics to offer a novel approach to study multiplex networks of Kuramoto oscillators. Our approach allows us to study the dynamics of a large, multiplex network by decomposing it into two smaller systems: one representing the connection scheme within layers (intra-layer), and the other representing the connections between layers (inter-layer). Particularly, we use this approach to compose solutions for multiplex networks of Kuramoto oscillators. These solutions are given by a combination of solutions for the smaller systems given by the intra- and inter-layer systems, and in addition, our approach allows us to study the linear stability of these solutions.
- 1 October 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (10)
Open AccessComposed solutions of synchronized patterns in multiplex networks of Kuramoto oscillators
Networks with different levels of interactions, including multilayer and multiplex networks, can display a rich diversity of dynamical behaviors and can be used to model and study a wide range of systems. Despite numerous efforts to investigate these networks, obtaining mathematical descriptions for the dynamics of multilayer and multiplex systems is still an open problem. Here, we combine ideas and concepts from linear algebra and graph theory with nonlinear dynamics to offer a novel approach to study multiplex networks of Kuramoto oscillators. Our approach allows us to study the dynamics of a large, multiplex network by decomposing it into two smaller systems: one representing the connection scheme within layers (intra-layer), and the other representing the connections between layers (inter-layer). Particularly, we use this approach to compose solutions for multiplex networks of Kuramoto oscillators. These solutions are given by a combination of solutions for the smaller systems given by the intra- and inter-layer systems, and in addition, our approach allows us to study the linear stability of these solutions.
- Open Access
- 1 May 2022
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 226 (5) , 106933
Heights and Tamagawa numbers of motives
- 1 May 2022
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 226 (5) , 106933
Open AccessHeights and Tamagawa numbers of motives
- Open Access
- 23 March 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (3) , 031104
Geometry unites synchrony, chimeras, and waves in nonlinear oscillator networks
One of the simplest mathematical models in the study of nonlinear systems is the Kuramoto model, which describes synchronization in systems from swarms of insects to superconductors. We have recently found a connection between the original, real-valued nonlinear Kuramoto model and a corresponding complex-valued system that permits describing the system in terms of a linear operator and iterative update rule. We now use this description to investigate three major synchronization phenomena in Kuramoto networks (phase synchronization, chimera states, and traveling waves), not only in terms of steady state solutions but also in terms of transient dynamics and individual simulations. These results provide new mathematical insight into how sophisticated behaviors arise from connection patterns in nonlinear networked systems.
- 23 March 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (3) , 031104
Open AccessGeometry unites synchrony, chimeras, and waves in nonlinear oscillator networks
One of the simplest mathematical models in the study of nonlinear systems is the Kuramoto model, which describes synchronization in systems from swarms of insects to superconductors. We have recently found a connection between the original, real-valued nonlinear Kuramoto model and a corresponding complex-valued system that permits describing the system in terms of a linear operator and iterative update rule. We now use this description to investigate three major synchronization phenomena in Kuramoto networks (phase synchronization, chimera states, and traveling waves), not only in terms of steady state solutions but also in terms of transient dynamics and individual simulations. These results provide new mathematical insight into how sophisticated behaviors arise from connection patterns in nonlinear networked systems.