Zobrazeno 1 - 10
of 1 167
pro vyhledávání: '"Nguyen Tung T."'
Publikováno v:
Green Processing and Synthesis, Vol 12, Iss 1, Pp 3475-6 (2023)
Quinazolinone synthesis usually requires employing sensitive substrates, hazardous solvents, large excess oxidants, and expensive catalysts. In this study, an efficient and environmentally benign pathway was developed to synthesize 2-phenylquinazolin
Externí odkaz:
https://doaj.org/article/cc927ec29f054dfeb1469043c338210c
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, inspired by
Externí odkaz:
http://arxiv.org/abs/2411.01768
Autor:
Nguyen, Tung T., Tân, Nguyen Duy
A graph is called integral if its eigenvalues are integers. In this article, we provide the necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra $R$ to be integral. This generalizes the work of So who studies the cas
Externí odkaz:
http://arxiv.org/abs/2411.00307
Gcd-graphs over the ring of integers modulo $n$ are a natural generalization of unitary Cayley graphs. The study of these graphs has foundations in various mathematical fields, including number theory, ring theory, and representation theory. Using th
Externí odkaz:
http://arxiv.org/abs/2409.01929
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra, representation theor
Externí odkaz:
http://arxiv.org/abs/2409.01922
Autor:
Nguyen, Tung T., Tân, Nguyen Duy
In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to be prime.
Externí odkaz:
http://arxiv.org/abs/2403.05635
Autor:
Chudnovsky, Maria, Cizek, Michal, Crew, Logan, Mináč, Ján, Nguyen, Tung T., Spirkl, Sophie, Tân, Nguyên Duy
The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, we utilize tools from group theory and ring theory to study this proble
Externí odkaz:
http://arxiv.org/abs/2401.06062
We define the finite number ring ${\Bbb Z}_n [\sqrt [m] r]$ where $m,n$ are positive integers and $r$ in an integer akin to the definition of the Gaussian integer ${\Bbb Z}[i]$. This idea is also introduced briefly in [7]. By definition, this finite
Externí odkaz:
http://arxiv.org/abs/2312.01019
Autor:
Chebolu, Sunil K., Merzel, Jonathan, Mináč, Ján, Nguyen, Tung T., Pasini, Federico, Tân, Nguyên Duy
Given a collection $\{ G_i\}_{i=1}^d$ of finite groups and a ring $R$, we have previously introduced and studied certain foundational properties of the join ring $\mathcal{J}_{G_1, G_2, \ldots, G_d}(R)$. This ring bridges two extreme worlds: matrix r
Externí odkaz:
http://arxiv.org/abs/2308.13428
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) = \sum_{a=1}^n \c
Externí odkaz:
http://arxiv.org/abs/2307.14896