Search arXivSearch

arXiv · 2603.21239

On $U$-unitary Cayley graphs over finite rings

Abstract

Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent work, we studied $U$-unitary Cayley graphs over a finite commutative ring, which unifies several constructions of graphs with arithmetic origins. Among various structural graph-theoretic results on these graphs--such as their connectedness, primeness, and bipartiteness--we show that their spectra can be described via a certain supercharacter theory. Utilizing this spectral description, we are able to find some classes of gcd-graphs that possess perfect state transfer. In this article, we generalize this study to finite non-commutative rings, with a special focus on the case of the matrix rings with coefficients in a finite field. We show, in particular, that gcd-graphs over these matrix rings have no perfect state transfer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tung T. Nguyen, Nguyen Duy Tân. 2026-03-22. On $U$-unitary Cayley graphs over finite rings. https://arxiv.org/abs/2603.21239

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO