惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
V2EX
人人都是产品经理
人人都是产品经理
WordPress大学
WordPress大学
博客园 - Franky
小众软件
小众软件
酷 壳 – CoolShell
酷 壳 – CoolShell
Apple Machine Learning Research
Apple Machine Learning Research
爱范儿
爱范儿
IT之家
IT之家
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
V
Visual Studio Blog
S
SegmentFault 最新的问题
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
有赞技术团队
有赞技术团队
B
Blog RSS Feed
Last Week in AI
Last Week in AI
Jina AI
Jina AI
博客园 - 司徒正美
The Cloudflare Blog
博客园_首页
博客园 - 聂微东
宝玉的分享
宝玉的分享
大猫的无限游戏
大猫的无限游戏

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Pretty good fractional revival on abelian Cayley graphs
[Submitted on 26 Mar 2025 (v1), last revised 8 Jul 2026 (this ve · 2025-03-26 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $\Gamma$ be a graph with the adjacency matrix $A$. The transition matrix of $\Gamma$, 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 $\Gamma$ 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}} = \alpha{\textbf{e}_{a}} + \beta{\textbf{e}_{b}}$, where $\alpha, \beta \in \mathbb{C}$ such that $\beta \neq 0$ and $|\alpha|^2 + |\beta|^2 = 1$. The graph $\Gamma$ 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}} = \alpha{\textbf{e}_{a}} + \beta{\textbf{e}_{b}}$, where $\alpha, \beta \in \mathbb{C}$ such that $\beta \neq 0$ and $|\alpha|^2 + |\beta|^2 = 1$. In the definition of PGFR, if $\alpha=0$ then $\Gamma$ 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.

Submission history

From: Akash Kalita [view email]
[v1] Wed, 26 Mar 2025 09:44:03 UTC (14 KB)
[v2] Fri, 22 Aug 2025 04:49:31 UTC (13 KB)
[v3] Thu, 16 Oct 2025 05:26:52 UTC (16 KB)
[v4] Wed, 8 Jul 2026 16:56:49 UTC (17 KB)