Search arXivSearch

arXiv · 2503.20367

Pretty good fractional revival on abelian Cayley graphs

Abstract

Let $Γ$ be a graph with the adjacency matrix $A$. The transition matrix of $Γ$, denoted $H(t)$, is defined as $H(t) := \exp(-\textbf{i}tA)$, where $\textbf{i} := \sqrt{-1}$ and $t$ is a real variable. The graph $Γ$ is said to exhibit fractional revival (FR in short) between the vertices $a$ and $b$ if there exists a positive real number $t$ such that $H(t){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. The graph $Γ$ is said to exhibit pretty good fractional revival (PGFR in short) between the vertices $a$ and $b$ if there exists a sequence of real numbers $\{t_k\}$ with $\lim_{k\to\infty} H(t_k){\textbf{e}_{a}} = α{\textbf{e}_{a}} + β{\textbf{e}_{b}}$, where $α, β\in \mathbb{C}$ such that $β\neq 0$ and $|α|^2 + |β|^2 = 1$. In the definition of PGFR, if $α=0$ then $Γ$ is said to exhibit pretty good state transfer (PGST in short) between $a$ and $b$. In this paper, we obtain some sufficient conditions for circulant graphs exhibiting PGFR. We also find some sufficient conditions for non-circulant abelian Cayley graphs exhibiting PGFR. From these sufficient conditions, we find infinite families of circulant graphs and non-circulant abelian Cayley graphs exhibiting PGFR that fail to exhibit FR and PGST. Finally, we obtain some necessary conditions for some families of circulant graphs exhibiting PGFR. Some of our results generalize the results of Chan et al. [Pretty good quantum fractional revival in paths and cycles. \textit {Algebr. Comb.} 4(6) (2021), 989-1004.] for cycles.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akash Kalita, Bikash Bhattacharjya. 2026-07-08. Pretty good fractional revival on abelian Cayley graphs. https://arxiv.org/abs/2503.20367

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