Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
This work provides a theoretical framework for counting independent sets in a specific family of graph powers, but the results are incremental and domain-specific.
The authors study independent sets in strong powers of circulant graphs, deriving a transfer operator whose spectral radius is governed by a low-dimensional orbit-compressed operator. They compute the independence polynomial exactly for strong cylinders and tori, with verification for C7.
We study independent sets in strong powers of circulant graphs using a transfer matrix formulation. The compatibility constraints separate into intra-layer and inter-layer components, yielding a transfer operator that is equivariant under the dihedral group action. The characteristic polynomial of the transfer operator factors into an \emph{anomalous} component (arising from the trivial isotypic component, with rational coefficients) and a \emph{cyclotomic} component (arising from nontrivial Fourier modes, splitting over the maximal real cyclotomic subfield). We show that the spectral radius is attained in the trivial isotypic component, so the dominant exponential growth is governed by a low-dimensional orbit-compressed operator. The independence polynomial is computed exactly for strong cylinders and tori, with the cyclotomic sector contributing a sparse correction confined to high-weight coefficients. All results are verified for $C_7$.