Reducibility of Cartesian product quantum graph equipped with group action
Shimei Li, Kai Zhang, Jia Zhao
TL;DR
This work studies the reducibility of the Laplacian on the Cartesian product quantum graph $Γ_{n_1}\Box Γ_{n_2}$ under a $G_{n_1}\times G_{n_2}$ symmetry by applying finite-group representation theory to decompose the relevant function space and operator. The authors construct a periodic quantum-graph framework, derive a quotient-graph decomposition, and obtain a factorization of the secular determinant into blocks associated with irreducible representations; notably, when $\gcd(n_1,n_2)=1$ the product is equivalent to the circulant graph $C_{n_1n_2}(n_1,n_2)$, simplifying spectral analysis and enabling isospectral-graph constructions. The main contributions are a complete decomposition of $L^2(Γ_{n_1}\Box Γ_{n_2})$ and $\mathscr{H}$, the quotient-graph framework for the secular determinant, and explicit decomposition formulas that connect to circulant graphs in the coprime case. These results provide a practical pathway to study spectra and design isospectral quantum graphs using symmetry reductions.
Abstract
We consider a Cartesian product quantum graph $Γ_{n_1}\BoxΓ_{n_2}$ with standard vertex conditions, and complete the decomposition of Hilbert space $L^2(Γ_{n_1}\BoxΓ_{n_2})$ and the Laplacian $\mathscr{H}$ on it by employing the relevant theories of group representation. The concept of $Γ_{n_1}\BoxΓ_{n_2}$ equipped with the action of the cyclic group $G_{n_1}\times G_{n_2}$ is defined through the introduction of periodic quantum graph and cyclic groups. We also constructed its quotient graph and accomplish the decomposition of its secular determinant. Furthermore, under the condition that $\gcd(n_1,n_2)=1$, it can be regarded as equivalent to a circulant graph $C_{n_1n_2}(n_1,n_2)$. This work also provides a new method for the construction of isospectral graphs.
