Skip to Content
SymmetrySymmetry
  • Article
  • Open Access

13 July 2026

21 Pages

Quartic Equimodular Curves and Spectral Reductions in Prism-Derived Chromatic Polynomials

,
and
Department of Mathematics, Computer Science, and Engineering Technology, Elizabeth City State University, Elizabeth City, NC 27909, USA
*
Author to whom correspondence should be addressed.
This article belongs to the Section B: Mathematics

Abstract

We study limiting chromatic-root loci for several recursively constructed prism-derived graph families by means of finite transfer-matrix reductions. For each family, the chromatic polynomial admits a spectral expansion P ( G n , z ) = ∑ j α j ( z ) λ j ( z ) n , so the Beraha–Kahane–Weiss theorem reduces the asymptotic analysis to dominant spectral competition and residual amplitude cancellation. For the antiprism family A n , the reduced transfer operator has discriminant Δ ( z ) = 9 − 4 z . The unit-modulus conditions for the two nontrivial spectral branches pull back to the irreducible quartic x 4 − 8 x 3 + 2 x 2 y 2 + 21 x 2 − 8 x y 2 − 18 x + y 4 + 5 y 2 = 0 . We prove that this entire quartic is the equimodular accumulation locus for A n , with the node at z = 3 separating the two dominance types. The same quartic arises for the circulant family C n ( 1 , 2 ) through the same reduced spectral normal form. We also prove that A n has a nonfixed isolated accumulation point at the fifth Beraha number B 5 = ( 3 + 5 ) / 2 , and that C n ( 1 , 2 ) has the same isolated point along its even subsequence after the residual branches + 1 and − 1 are combined by parity. In contrast, for C n ( 1 , 3 ) , the identity λ + ( z ) λ − ( z ) = − 1 collapses the reduced-sector equimodular locus to the vertical segment R ( z ) = 2 , | I ( z ) | ≤ 2 . For the generalized Petersen family G ( n , 2 ) , we obtain an irreducible cubic equation for one invariant sector, indicating the first obstruction to the quadratic pullback method while leaving the full branch expansion open.

1. Introduction

The chromatic polynomial P ( G , z ) counts the proper colorings of a finite graph G as a polynomial in the number of colors. Introduced by Birkhoff [1] and systematically developed by Whitney [2], it occupies a central position in algebraic graph theory, combinatorics, and statistical mechanics. Through the Fortuin–Kasteleyn representation [3,4], the chromatic polynomial appears as the zero-temperature antiferromagnetic specialization of the Potts partition function [5]; like the all-terminal reliability polynomial [6], it is a one-variable specialization of the Tutte polynomial [4]. Extending the variable from positive integers to the complex plane transforms the problem from combinatorial enumeration to the study of algebraic and geometric root distributions.
For recursively constructed graph families { G n } , the chromatic roots often accumulate on structured subsets of C as n → ∞ . Understanding the geometry of these limiting sets has become a central theme in chromatic-root theory. The transfer-matrix method expresses the chromatic polynomial in the form P ( G n , z ) = ∑ j α j ( z ) λ j ( z ) n , where the λ j ( z ) are spectral branches of a finite transfer operator and the amplitudes α j ( z ) encode the invariant-sector structure. The theorem of Beraha, Kahane, and Weiss [7] then identifies two accumulation mechanisms: roots accumulate where two dominant branches have equal modulus, producing continuous accumulation curves, and at zeros of the amplitude of a uniquely dominant branch, producing isolated accumulation points.
Transfer-matrix methods for Potts-model partition functions and chromatic polynomials were developed extensively in [8,9]. Structural results on zero-free intervals appear in [10,11]. Explicit equimodular geometry for the prism family was obtained in [12], and finite-n Cassini-type bounds were established in [13]. Related spectral behavior for circulant graph families was investigated in [14].
The present article extends this program to several recursively layered families amenable to the same sector-decomposition analysis. We use the term prism-derived for any such family whose transfer operator admits a finite interface reduction in the kind developed in Section 2. For the families built on a two-vertex interface—the prism Y n , the antiprism A n , the Möbius ladder M n , the circulant C n ( { 1 , 2 } ) , and the open-boundary ladder L n —this reduction is the decomposition C Ω q = C 1 ⊕ W q ⊕ U q , and the general expansion of Theorem 1 applies once the transition rule of the family is checked to preserve it. The chord family C n ( { 1 , 3 } ) and the generalized Petersen family G ( n , 2 ) instead require a three-color interface state and are governed by orbit-type sectors of a different dimension; they lie outside the two-vertex expansion theorem and are analyzed directly in Section 4.3 and Section 5.
Although these families differ substantially at the graph-theoretic level, they share a common spectral mechanism governed by low-dimensional transfer reductions.
The antiprism family provides the central example. Its reduced transfer matrix has discriminant Δ ( z ) = 9 − 4 z , and the conditions | λ ± ( z ) | = 1 —representing competition between the row–column branches and the constant residual—pull back under w 2 = 9 − 4 z to circle equations in the w-plane whose preimages form the irreducible quartic Q ( x , y ) = 0 of (4). We prove that the entire quartic is the equimodular accumulation locus for A n (Proposition 5). In addition, the family has a nonfixed isolated accumulation point at the fifth Beraha number B 5 = ( 3 + 5 ) / 2 = ϕ 2 , arising from amplitude cancellation within a region where the constant residual is uniquely dominant.
The circulant family C n ( { 1 , 2 } ) independently reproduces the same quartic through the identical discriminant Δ ( z ) = 9 − 4 z , showing that the limiting curve is spectrally rather than combinatorially determined. By contrast, the chord family C n ( { 1 , 3 } ) satisfies λ + ( z ) λ − ( z ) = − 1 , which forces both reduced branches onto the unit circle simultaneously and collapses the equimodular locus of the reduced spectral pair to the vertical segment Re ( z ) = 2 , | Im ( z ) | ≤ 2 . At the opposite extreme, the ladder family L n has a single spectral branch z 2 − 3 z + 3 ; its chromatic polynomial factors as z ( z − 1 ) ( z 2 − 3 z + 3 ) n − 1 . Thus, no branch competition arises; the full fixed-zero set is { 0 , 1 , ( 3 + i 3 ) / 2 , ( 3 − i 3 ) / 2 } , and after the universal chromatic factors z ( z − 1 ) are removed, the only nontrivial fixed zeros and the only zeros of unbounded multiplicity are ( 3 ± i 3 ) / 2 .
The generalized Petersen family G ( n , 2 ) marks the transition to higher-order spectral behavior: its reduced transfer operator has an irreducible cubic characteristic polynomial over Q ( z ) , and the corresponding accumulation geometry lies beyond the quadratic circle-pullback method.
These examples lead to a structural observation, stated as Remark 2, relating the dimension and splitting structure of the reduced characteristic polynomial to the topology of the equimodular set. The main structural results are established in Theorems 3–9.

2. Transfer-Matrix Framework and Equimodular Geometry

A family { G n } n ≥ n 0 is recursively layered if each graph is obtained by iterating a fixed layer construction along a prescribed interface, with the admissibility of each new layer determined entirely by the current and next interface colorings. In the closed case, the terminal interface is identified with the initial one.
Definition 1
(State space and transfer operator). Let q ≥ 3 be an integer. For a two-vertex interface, set [ q ] = { 1 , … , q } and let Ω q = { ( a , b ) ∈ [ q ] 2 : a ≠ b } denote the set of proper q-colorings of that interface; in particular | Ω q |   =   q ( q − 1 ) . The transfer operator T q is the Ω q × Ω q matrix whose ( s , s ′ ) -entry equals 1 if the transition s → s ′ satisfies all layer constraints and equals 0 otherwise.
The transfer operator recasts the proper-coloring problem as counting walks in a directed state graph.
Proposition 1
(Trace formula). Let { G n } be a recursively layered graph family with transfer matrix T q . If the family is closed cyclically after n layers, then P ( G n , q ) = tr ( T q n ) for every integer q ≥ 3 . If the family has open boundary conditions, then P ( G n , q ) = v T T q n − 1 w , where v and w are the indicator vectors of admissible initial and terminal interface states, respectively.
Proof. 
In the closed case, a proper q-coloring of G n determines a sequence s 0 , s 1 , … , s n − 1 of interface states, in which each transition s i → s i + 1 mod n is admissible; the transfer rule records exactly the coloring constraints between consecutive layers, so the correspondence is bijective. The number of such closed state sequences is tr ( T q n ) . In the open-boundary case, the closing condition is removed: v selects admissible initial states, w selects admissible terminal states, and v T T q n − 1 w counts admissible state paths from the initial boundary to the terminal boundary. □
For fixed n, an identity established for all integers q ≥ 3 extends to all z ∈ C as soon as both sides are polynomial in q, since two polynomials that agree on an infinite set of integers are identical.
Equip C Ω q with the standard inner product ⟨ f , g ⟩ = ∑ ( a , b ) ∈ Ω q f ( a , b ) ¯ g ( a , b ) . The symmetric group S q acts on C Ω q by relabeling colors; the transfer operators considered below commute with this action, and the inner product is S q -invariant, so the orthogonal complement of any invariant subspace is again invariant. Set W q = { f ( a , b ) = g ( a ) + h ( b ) : ∑ i g ( i ) = ∑ i h ( i ) = 0 } . For any f = g ( a ) + h ( b ) ∈ W q , one has ⟨ 1 , f ⟩ = ∑ a ≠ b ( g ( a ) + h ( b ) ) = ( q − 1 ) ∑ a g ( a ) + ( q − 1 ) ∑ b h ( b ) = 0 , so W q ⊥ C 1 . For q ≥ 3 , the map ( g , h ) ↦ [ f ( a , b ) = g ( a ) + h ( b ) ] from zero-sum pairs to W q is injective: if g ( a ) + h ( b ) = 0 for all a ≠ b , then fixing b and varying a, g must be constant; then, ∑ a g ( a ) = 0 forces g ≡ 0 , and hence, h ≡ 0 . Thus, dim W q = 2 ( q − 1 ) . Define U q as the orthogonal complement of C 1 ⊕ W q in C Ω q . The dimension count dim U q = q ( q − 1 ) − 1 − 2 ( q − 1 ) = q 2 − 3 q + 1 yields the S q -invariant decomposition C Ω q = C 1 ⊕ W q ⊕ U q .
Every two-vertex family treated below the transition rule is checked directly to preserve this decomposition; where a family requires a larger interface, as with C n ( { 1 , 3 } ) and G ( n , 2 ) , the corresponding invariant sectors are constructed separately in Section 4.3 and Section 5.
Remark 1
(Characterization of U q ). An element f ∈ C Ω q belongs to U q if and only if every row sum ∑ b ≠ a f ( a , b ) and every column sum ∑ a ≠ b f ( a , b ) vanishes. The q row-sum conditions and q column-sum conditions share exactly one linear dependency (total row sum equals total column sum), so their joint rank is 2 q − 1 , and the common zero-set has dimension q ( q − 1 ) − ( 2 q − 1 ) = q 2 − 3 q + 1 = dim U q . To confirm that this zero-set equals U q , write f = c 1 + w + u with w ( a , b ) = g ( a ) + h ( b ) ∈ W q and u ∈ U q , and suppose all row and column sums of f vanish. The row sum at a of c 1 + w is c ( q − 1 ) + ( q − 1 ) g ( a ) − h ( a ) (using ∑ b h ( b ) = 0 to evaluate ∑ b ≠ a h ( b ) = − h ( a ) ); summing over a gives c ( q − 1 ) q = 0 , hence, c = 0 . The row equation then reads h ( a ) = ( q − 1 ) g ( a ) for each a, and the column equation gives g ( b ) = ( q − 1 ) h ( b ) = ( q − 1 ) 2 g ( b ) . Since ( q − 1 ) 2 ≠ 1 for q ≥ 3 , one has g ≡ h ≡ 0 and therefore, f = u ∈ U q .
Let J denote the transposition involution ( J f ) ( a , b ) = f ( b , a ) . Since every orbit of J on Ω q has size two (as a ≠ b prevents fixed points), the J-symmetric and J-antisymmetric subspaces of C Ω q each have dimension q ( q − 1 ) / 2 . The subspace C 1 is J-symmetric. For f ( a , b ) = g ( a ) + h ( b ) ∈ W q , the J-symmetric part is ( f + J f ) / 2 = ( ϕ ( a ) + ϕ ( b ) ) / 2 , where ϕ = g + h satisfies ∑ i ϕ ( i ) = 0 , and the J-antisymmetric part is ( f − J f ) / 2 = ( ψ ( a ) − ψ ( b ) ) / 2 , where ψ = g − h satisfies ∑ i ψ ( i ) = 0 ; each is parameterized by a zero-sum function on [ q ] , so both symmetric and antisymmetric parts of W q have dimension q − 1 . Writing U q + and U q − for the J-symmetric and J-antisymmetric parts of U q , dimension subtraction gives dim U q + = q ( q − 1 ) / 2 − 1 − ( q − 1 ) = q ( q − 3 ) / 2 and dim U q − = q ( q − 1 ) / 2 − ( q − 1 ) = ( q − 1 ) ( q − 2 ) / 2 . Note that dim U q + = 0 at q = 3 , consistent with dim U 3 = 1 = dim U 3 − .
Among the families studied in Section 4 and Section 5, the residual action T q f = − J f for every f ∈ U q holds for the circulant C n ( { 1 , 2 } ) ; we call this the J-reversal residual condition. The prism Y n and the Möbius ladder M n instead satisfy T q | U q = + Id (the residual eigenvalue λ 3 = 1 of [12]), as does the antiprism A n (Proposition 4). The residual action must in every case be verified directly from the transition rule.
Proposition 2
(J-reversal residual eigenvalues). If a recursively layered family satisfies T q f = − J f for every f ∈ U q , then T q | U q has eigenvalue − 1 with multiplicity q ( q − 3 ) / 2 and eigenvalue + 1 with multiplicity ( q − 1 ) ( q − 2 ) / 2 .
Proof. 
For f ∈ U q + , J f = f so T q f = − J f = − f ; for f ∈ U q − , J f = − f so T q f = − J f = f . The multiplicities are dim U q + = q ( q − 3 ) / 2 and dim U q − = ( q − 1 ) ( q − 2 ) / 2 . □
The antiprism does not satisfy the J-reversal condition; its residual sector is computed separately in Section 3. Whenever the residual sector contributes only the eigenvalues ± 1 with multiplicities polynomial in q—as holds for every family treated below—the sector decomposition yields the following expansion.
Theorem 1
(Branch expansion). Let { G n } be a closed recursively layered graph family with two-vertex interface. Assume T q preserves C 1 ⊕ W q ⊕ U q ; that the induced action on W q ≅ C 2 ⊗ V q − 1 , where V q − 1 = { f : [ q ] → C : ∑ i f ( i ) = 0 } , takes the form A q ⊗ I q − 1 for a 2 × 2 matrix A q with entries polynomial in q; and that the residual sector contributes only the eigenvalues ± 1 with multiplicities polynomial in q. Then,
P ( G n , z ) = α 0 ( z ) λ 0 ( z ) n + ( z − 1 ) λ + ( z ) n + ( z − 1 ) λ − ( z ) n + α − 1 ( z ) ( − 1 ) n + α 1 ( z ) ,
where λ ± ( z ) are the eigenvalues of A q | q = z and the α j are polynomials in z. If the residual sector contributes only eigenvalue + 1 , the term α − 1 ( z ) ( − 1 ) n is absent.
Proof. 
For integer q ≥ 3 , Proposition 1 gives P ( G n , q ) = tr ( T q n ) . The constant sector contributes α 0 ( q ) λ 0 ( q ) n . Since the row–column action is A q ⊗ I q − 1 , one has T q n | W q = A q n ⊗ I q − 1 and the row–column trace is ( q − 1 ) tr ( A q n ) = ( q − 1 ) ( λ + ( q ) n + λ − ( q ) n ) , which accounts for the amplitude ( q − 1 ) = z − 1 in (1). The residual sector contributes α − 1 ( q ) ( − 1 ) n + α 1 ( q ) by hypothesis. The power sum λ + ( q ) n + λ − ( q ) n is polynomial in q via the Newton recurrence S n = tr ( A q ) · S n − 1 − det ( A q ) · S n − 2 , with S 0 = 2 and S 1 = tr ( A q ) , both polynomial in q. Hence, the right side of (1) is polynomial in q and agrees with P ( G n , q ) for every integer q ≥ 3 ; two polynomials agreeing on infinitely many values are identical, so the formula holds for all z ∈ C . □
The asymptotic geometry of chromatic-root accumulation is governed by the dominant branches in (1). The equimodular locus  E = ⋃ i ≠ j { z ∈ C : | λ i ( z ) | = | λ j ( z ) | } and its role in limiting root geometry is made precise by the following theorem.
Theorem 2
(Beraha–Kahane–Weiss [7]). Let P n ( z ) = ∑ j = 1 m α j ( z ) λ j ( z ) n on a domain D ⊆ C , where each α j and λ j is analytic and no two distinct branches differ by a unimodular constant on any open subset of D. A point z 0 ∈ D is a limit point of zeros of { P n } if and only if either at least two branches achieve the maximum modulus at z 0 and the ratio of any two such dominant branches is not locally constant, or a unique branch λ j is dominant at z 0 and α j ( z 0 ) = 0 .
The first condition produces accumulation along curves of equal dominant-branch modulus; the second produces isolated accumulation points through amplitude cancellation. In the quadratic cases below, the branches take the form λ ± ( z ) = f ( z ) ± Δ ( z ) / 2 with Δ linear in z. The branch Δ ( z ) is analytic on any simply connected domain avoiding the ray { z ∈ R : Δ ( z ) ≥ 0 } ; BKW applies to each such analytic branch on its domain of definition, and the equimodular locus E is independent of branch-cut choice since it is defined by modulus conditions | λ i |   =   | λ j | , which are symmetric between the two determinations of Δ . The accumulation set of { P n } is a subset of E : it consists precisely of those equimodular points where the dominant branches are not related by a unimodular constant, together with isolated points from amplitude cancellation. Accordingly, in each family, we identify the candidate equimodular locus first, then verify dominant-branch conditions to determine which components support the actual accumulation. Setting w 2 = Δ ( z ) and writing w = u + i v , the conditions | λ ± ( z ) | = 1 , equivalently | f ( z ) ± w | = 2 , become circle equations in the w-plane. Their pullbacks under the quadratic map w 2 = Δ ( z ) are real quartic curves in ( Re z , Im z ) .
Proposition 3
(Isolated accumulation criterion). Let P n ( z ) = ∑ k = 1 m α k ( z ) λ k ( z ) n satisfy the hypotheses of Theorem 2. Suppose λ j is uniquely dominant throughout a neighborhood U of z 0 , that α j ( z 0 ) = 0 , and that α j is not identically zero near z 0 . Then, z 0 is an isolated limit point of zeros of { P n } .
Proof. 
Shrink U to obtain η ∈ ( 0 , 1 ) with | λ k ( z ) | ≤ η | λ j ( z ) | for all k ≠ j and z ∈ U . Write P n ( z ) = λ j ( z ) n α j ( z ) + r n ( z ) , where r n ( z ) = ∑ k ≠ j α k ( z ) ( λ k ( z ) / λ j ( z ) ) n satisfies | r n ( z ) | ≤ C η n on compact subsets of U for some constant C, so r n → 0 uniformly on compact subsets of U. Since α j is analytic and not identically zero, its zero at z 0 is isolated; choose r > 0 with B ( z 0 , r ) ¯ ⊂ U and α j ≠ 0 on ∂ B ( z 0 , r ) . For all sufficiently large n, | r n ( z ) | < | α j ( z ) | on ∂ B ( z 0 , r ) , so Rouché’s theorem gives α j + r n and α j the same number of zeros inside B ( z 0 , r ) . Applying this to every sufficiently small r > 0 shows that zeros of α j + r n accumulate at z 0 . After shrinking U, λ j ≠ 0 throughout, so λ j ( z ) n does not contribute zeros and the zeros of P n in U coincide with those of α j + r n . Since λ j is uniquely dominant throughout U, no equimodular curve intersects U, so the accumulation at z 0 is isolated. □

3. The Antiprism Family

For n ≥ 3 , the antiprism A n has vertex set { u i , v i : i ∈ Z / n Z } and edges u i u i + 1 , v i v i + 1 , u i v i , and u i v i + 1 , with all indices read modulo n; see Figure 1. A transfer state is a pair ( a , b ) ∈ Ω q , where a = c ( u i ) and b = c ( v i ) . A transition ( a , b ) → ( a ′ , b ′ ) is admissible precisely when a ′ ≠ a , b ′ ≠ b , b ′ ≠ a , and a ′ ≠ b ′ . To count admissible successors: b ′ must avoid { a , b } , giving q − 2 choices; for each such b ′ (with b ′ ≠ a already enforced), a ′ must avoid { a , b ′ } , giving another q − 2 choices. Hence, every state has exactly ( q − 2 ) 2 admissible successors, and the constant-sector eigenvalue is λ 0 ( q ) = ( q − 2 ) 2 .
Figure 1. Three graph families: prism Y 6 , antiprism A 6 , and Möbius ladder M 6 (each on 12 vertices; here M n denotes the n-layer twisted ladder).
The induced action on the row–column sector is given by
A q A = − ( q − 3 ) − ( q − 2 ) 1 − ( q − 2 ) .
To verify this, let F ( a , b ) = g ( a ) + h ( b ) with ∑ i g ( i ) = ∑ i h ( i ) = 0 . Summing g ( a ′ ) + h ( b ′ ) over admissible successors, and using ∑ g = ∑ h = 0 to evaluate the resulting partial sums, one obtains ( T q A F ) ( a , b ) = − ( q − 3 ) g ( a ) − ( q − 2 ) h ( a ) + g ( b ) − ( q − 2 ) h ( b ) . The coefficient pair ( g , h ) is therefore mapped to ( − ( q − 3 ) g − ( q − 2 ) h , g − ( q − 2 ) h ) , which is the action of A q A on the two-dimensional coefficient factor. The characteristic polynomial is λ 2 − ( 5 − 2 q ) λ + ( q − 2 ) 2 , the discriminant is Δ ( q ) = 9 − 4 q , and the spectral branches are λ ± ( q ) = 5 − 2 q ± 9 − 4 q / 2 .
Because A n does not satisfy the J-reversal condition T q f = − J f on U q , its residual sector requires a direct computation from the transition rule.
Proposition 4
(Antiprism residual action). For every f ∈ U q and every ( a , b ) ∈ Ω q , one has ( T q A f ) ( a , b ) = f ( a , b ) . Consequently, T q A | U q = + Id , and the residual sector contributes eigenvalue + 1 with multiplicity q 2 − 3 q + 1 .
Proof. 
Fix ( a , b ) ∈ Ω q . The admissible successors are those ( a ′ , b ′ ) ∈ Ω q satisfying a ′ ≠ a , b ′ ≠ b , and b ′ ≠ a . Apply inclusion–exclusion to these three forbidden conditions starting from ∑ ( a ′ , b ′ ) ∈ Ω q f ( a ′ , b ′ ) . Since f ∈ U q , every row sum and every column sum of f vanishes by Remark 1; in particular the full sum, the row sum at a ′ = a , and the column sums at b ′ = b and b ′ = a all equal zero. Among the pairwise intersections: { a ′ = a } ∩ { b ′ = b } contributes the single term f ( a , b ) (valid since a ≠ b ); { a ′ = a } ∩ { b ′ = a } is empty in Ω q because it forces a ′ = b ′ ; and { b ′ = b } ∩ { b ′ = a } is empty because it forces a = b . The triple intersection is empty. Inclusion–exclusion therefore gives ( T q A f ) ( a , b ) = 0 − 0 − 0 − 0 + f ( a , b ) + 0 + 0 − 0 = f ( a , b ) . Since ( a , b ) was arbitrary, T q A fixes U q pointwise. The multiplicity is dim U q = q ( q − 1 ) − 1 − 2 ( q − 1 ) = q 2 − 3 q + 1 . □
Together, the preceding computation and the row–column reduction give tr ( ( T q A ) n ) = ( q − 2 ) 2 n + ( q − 1 ) tr ( ( A q A ) n ) + ( q 2 − 3 q + 1 ) , from which the branch expansion follows immediately.
Theorem 3
(Branch expansion of A n ). For all z ∈ C and all n ≥ 3 ,
P ( A n , z ) = ( z − 2 ) 2 n + ( z − 1 ) λ + ( z ) n + ( z − 1 ) λ − ( z ) n + ( z 2 − 3 z + 1 ) ,
where λ ± ( z ) = 5 − 2 z ± 9 − 4 z / 2 .
Proof. 
For integers q ≥ 3 , Proposition 1 gives P ( A n , q ) = tr ( ( T q A ) n ) . The constant sector contributes ( q − 2 ) 2 n . The row–column sector contributes ( q − 1 ) tr ( ( A q A ) n ) = ( q − 1 ) ( λ + ( q ) n + λ − ( q ) n ) . Proposition 4 gives the residual contribution q 2 − 3 q + 1 . Summing yields (3) for all integers q ≥ 3 . The power sum S n = λ + n + λ − n satisfies the Newton recurrence S n = ( 5 − 2 z ) S n − 1 − ( z − 2 ) 2 S n − 2 with S 0 = 2 and S 1 = 5 − 2 z , both polynomial in z, so S n is polynomial in z for each fixed n. Both sides of (3) are therefore polynomial in z and agree for infinitely many integer values, hence, they are identical for all z ∈ C . □
Verification at n = 3 . One has λ ± ( 3 ) = ( − 1 ± i 3 ) / 2 = e ± 2 π i / 3 , so λ ± ( 3 ) 3 = 1 . Substituting into (3) gives P ( A 3 , 3 ) = 1 6 + ( 3 − 1 ) ( 1 + 1 ) + ( 9 − 9 + 1 ) = 6 . The graph A 3 is the octahedral graph, equivalently the complete tripartite graph K 2 , 2 , 2 [15]. Its proper 3-colorings assign one color class to each antipodal pair, and hence, there are 3 ! = 6 such colorings. This confirms P ( A 3 , 3 ) = P ( K 2 , 2 , 2 , 3 ) = 6 .
Setting w = 9 − 4 z , so that w 2 = 9 − 4 z and 5 − 2 z = ( 1 + w 2 ) / 2 , the spectral branches factor as λ ± ( z ) = ( w ± 1 ) 2 / 4 . The product formula λ + ( z ) λ − ( z ) = ( w 2 − 1 ) 2 / 16 simplifies via w 2 − 1 = 8 − 4 z = 4 ( 2 − z ) to λ + ( z ) λ − ( z ) = ( z − 2 ) 2 = λ 0 ( z ) . Writing a =   | λ + ( z ) | and b =   | λ − ( z ) | , the four branch moduli are λ 0 : | z − 2 | 2 = a b ; λ + : a ; λ − : b ; residual: 1. No two of the four branches λ 0 , λ + , λ − , 1 differ by a unimodular constant: each pairwise ratio equals one of λ + , λ − , λ + / λ − , λ 0 or a reciprocal thereof, and none of these is constant on an open set, so the hypotheses of Theorem 2 hold. Their pairwise equimodular boundaries are a = 1 , b = 1 , a b = 1 , and a = b . The boundary a b = 1 , i.e., | z − 2 | = 1 , is a circle in the z-plane; the boundary a = b reduces to Re ( w ) = 0 , a half-line on the real axis x ≥ 9 / 4 . The candidate equimodular locus governed by the Beraha–Kahane–Weiss theorem is therefore contained in the union of the quartic arising from a = 1 and b = 1 (competition between the row–column branches and the constant residual branch of modulus 1) together with this circle and half-line; the actual accumulation set is the subset on which the relevant pair of branches is dominant, determined rigorously in Proposition 5 and illustrated in Figure 2.
Figure 2. (a) the two unit-modulus circles a = 1 , b = 1 in the w-plane (schematic). (b) the equimodular locus of A n , plotted as computed solution points of Q ( x , y ) = 0 from (4); the dashed circle | z − 2 | = 1 separates the outer arc (where λ 0 and one row–column branch dominate) from the inner arc (where a row–column branch and the residual 1 dominate), and the red point is the isolated accumulation point z ∗ = B 5 of Theorem 5. (a) Unit-modulus circles in the w-plane (schematic); (b) computed points of Q ( x , y ) = 0 with the circle | z − 2 | = 1 .
Theorem 4
(Quartic equimodular curve). Fix a determination of w = 9 − 4 z on a simply connected domain avoiding the ray { z ∈ R : 9 − 4 z ≥ 0 } , and label the branches by λ ± ( z ) = ( w ± 1 ) 2 / 4 . For this determination, the two loci { z ∈ C : | λ + ( z ) | = 1 } and { z ∈ C : | λ − ( z ) | = 1 } are in general distinct: for example, with w ( 0 ) = 3 one has λ + ( 0 ) = 4 and λ − ( 0 ) = 1 , so z = 0 lies on the second locus but not the first. Their union is the real quartic curve Q ( x , y ) = 0 , where z = x + i y and
Q ( x , y ) : = x 4 − 8 x 3 + 2 x 2 y 2 + 21 x 2 − 8 x y 2 − 18 x + y 4 + 5 y 2 .
This union is independent of the chosen determination, since replacing w by − w interchanges λ + and λ − . Moreover, Q is irreducible over Q [ x , y ] .
Proof. 
Let z = x + i y and choose a square root w = u + i v satisfying w 2 = 9 − 4 z . Equating real and imaginary parts of w 2 = 9 − 4 z gives u 2 − v 2 = 9 − 4 x and u v = − 2 y .
Since λ ± ( z ) = ( w ± 1 ) 2 4 , the condition | λ + ( z ) | = 1 is equivalent to | w + 1 | = 2 . Expanding yields ( u + 1 ) 2 + v 2 = 4 , or equivalently u 2 + v 2 + 2 u = 3 . Combining this relation with u 2 − v 2 = 9 − 4 x gives u 2 + u = 6 − 2 x and v 2 = 2 x − 3 − u .
Squaring the identity u v = − 2 y yields u 2 v 2 = 4 y 2 . Substituting u 2 = 6 − 2 x − u and v 2 = 2 x − 3 − u gives ( 6 − 2 x − u ) ( 2 x − 3 − u ) = 4 y 2 . After expansion and a second substitution of u 2 = 6 − 2 x − u , the equation simplifies to ( 6 − 2 x ) ( 2 x − 2 ) − 4 u = 4 y 2 , and hence, u = ( x − 1 ) ( 3 − x ) − y 2 .
Substituting this expression for u into u 2 + u = 6 − 2 x and simplifying yields precisely the quartic equation Q ( x , y ) = 0 . Therefore, every point satisfying | λ + ( z ) | = 1 lies on the quartic Q ( x , y ) = 0 .
For the branch λ − , the condition | λ − ( z ) | = 1 is equivalent to | w − 1 | = 2 , or u 2 + v 2 − 2 u = 3 . The resulting system differs from the preceding one only by replacing u with − u . The same elimination therefore produces the identical quartic polynomial Q ( x , y ) . Consequently, every point satisfying | λ − ( z ) | = 1 also lies on Q ( x , y ) = 0 . Combining the two forward inclusions, every point of { | λ + ( z ) | = 1 } ∪ { | λ − ( z ) | = 1 } satisfies Q ( x , y ) = 0 .
It remains to prove the converse and verify that the elimination process introduces no extraneous points. Assume that Q ( x , y ) = 0 and define u = ( x − 1 ) ( 3 − x ) − y 2 . Direct substitution into Q shows that u 2 + u = 6 − 2 x . Now define v 2 : = 2 x − 3 − u . Then, u 2 − v 2 = u 2 − ( 2 x − 3 − u ) = u 2 + u − 2 x + 3 = 9 − 4 x .
Moreover, u 2 v 2 = u 2 ( 2 x − 3 − u ) . Using u 2 = 6 − 2 x − u gives u 2 v 2 = ( 6 − 2 x − u ) ( 2 x − 3 − u ) = 4 y 2 , and therefore, ( u v ) 2 = 4 y 2 .
To show that v is real, first suppose that u ≠ 0 . Then, v 2 = 4 y 2 / u 2 ≥ 0 . If u = 0 , the identity u 2 + u = 6 − 2 x forces x = 3 . Substituting x = 3 into u = ( x − 1 ) ( 3 − x ) − y 2 gives y = 0 , and consequently, v 2 = 2 x − 3 − u = 3 > 0 . Hence, v 2 ≥ 0 in all cases, so a real value of v exists. Choose its sign so that u v = − 2 y .
Setting w = u + i v , we obtain w 2 = ( u 2 − v 2 ) + 2 i u v = ( 9 − 4 x ) − 4 i y = 9 − 4 z . Thus, w is indeed a square root of 9 − 4 z .
Next, | w + 1 | 2 = ( u + 1 ) 2 + v 2 = u 2 + v 2 + 2 u + 1 . Using u 2 + u = 6 − 2 x and v 2 = 2 x − 3 − u yields | w + 1 | 2 = ( 6 − 2 x ) + ( 2 x − 3 ) + 1 = 4 , so | w + 1 | = 2 . If the fixed determination of 9 − 4 z equals this w, then | λ + ( z ) | = ( w + 1 ) 2 / 4 = 1 ; if it equals − w , then | λ − ( z ) | = ( − w − 1 ) 2 / 4 = | w + 1 | 2 / 4 = 1 . In either case, the point z lies in the union { | λ + ( z ) | = 1 } ∪ { | λ − ( z ) | = 1 } .
We conclude that { z ∈ C : | λ + ( z ) | = 1 } ∪ { z ∈ C : | λ − ( z ) | = 1 } = { ( x , y ) ∈ R 2 : Q ( x , y ) = 0 } , and, since interchanging w and − w merely swaps the two sets in the union, this locus is independent of the chosen determination of 9 − 4 z .
For irreducibility, write Q = y 4 + A ( x ) y 2 + B ( x ) , where A ( x ) = 2 x 2 − 8 x + 5 and B ( x ) = x ( x − 2 ) ( x − 3 ) 2 .
Since Q is primitive as a polynomial in y, Gauss’s lemma reduces the problem to irreducibility over the field F = Q ( x ) . The polynomial B ( x ) is not a square in F because the factors x and x − 2 occur with odd multiplicity. Furthermore, A ( x ) 2 − 4 B ( x ) = 25 − 8 x , which is not a square in F since it has a simple zero at x = 25 / 8 .
Assume, for contradiction, that Q is reducible over F. If Q possessed a linear factor, then it would have a root y 0 ∈ F . Consequently, y 0 2 would be a root of t 2 + A ( x ) t + B ( x ) , forcing y 0 2 = − A ( x ) ± A ( x ) 2 − 4 B ( x ) / 2 . This would imply 25 − 8 x ∈ F , contrary to the preceding observation. Therefore, Q has no linear factor over F.
Any nontrivial factorization must therefore be quadratic. Since the coefficient of y 3 vanishes, such a factorization has the form Q = ( y 2 + p y + r ) ( y 2 − p y + s ) , with p , r , s ∈ F . Comparing coefficients gives p ( s − r ) = 0 , r + s − p 2 = A , and r s = B .
If p = 0 , then r and s are roots of t 2 − A ( x ) t + B ( x ) . Its discriminant is A ( x ) 2 − 4 B ( x ) = 25 − 8 x , which is not a square in F, a contradiction.
If s = r , then r 2 = B ( x ) , which would make B ( x ) a square in F, again a contradiction.
Both possibilities are impossible. Hence, no quadratic factorization exists, and Q is irreducible over F = Q ( x ) . Gauss’s lemma then implies that Q is irreducible over Q [ x , y ] . □
Setting y = 0 gives Q ( x , 0 ) = x ( x − 2 ) ( x − 3 ) 2 , so the quartic meets the real axis at x = 0 , x = 2 , and x = 3 ; the double factor at x = 3 marks a singular point of the curve. Indeed, Q x ( 3 , 0 ) = Q y ( 3 , 0 ) = 0 , while Q x x ( 3 , 0 ) = 6 , Q y y ( 3 , 0 ) = − 2 , Q x y ( 3 , 0 ) = 0 give Hessian determinant 6 · ( − 2 ) − 0 = − 12 < 0 , so ( 3 , 0 ) is a node at which two real branches cross, not a smooth tangency. In Beraha notation B k = 4 cos 2 ( π / k ) , these real intersections are B 2 = 0 , B 4 = 2 , and B 6 = 3 .
The next proposition determines which points of Q ( x , y ) = 0 actually carry accumulation of chromatic roots, rather than leaving this to the figure.
Proposition 5
(Dominant arcs on the antiprism quartic). Write μ 0 = ( z − 2 ) 2 , μ 1 = λ + ( z ) , μ 2 = λ − ( z ) , and μ 3 = 1 for the four branches of (3), so that μ 1 μ 2 = μ 0 . On the component of Q ( x , y ) = 0 where | μ 1 |   = 1 one has | μ 2 |   =   | μ 0 |   = | z − 2 | 2 , and on the component where | μ 2 |   = 1 one has | μ 1 |   =   | μ 0 |   = | z − 2 | 2 . Consequently, away from the node z = 3 , exactly two branches attain the maximum modulus, the ratio of these two dominant branches equals λ + ( z ) or λ − ( z ) and is nonconstant, and the corresponding amplitudes in (3) are nonzero; at z = 3 all four branches have modulus 1. Hence, the entire curve Q ( x , y ) = 0 is the equimodular accumulation locus of { A n } . The circle | z − 2 | = 1 meets Q ( x , y ) = 0 only at the node z = 3 and separates it into an outer arc | z − 2 | > 1 , on which μ 0 and the modulus- | z − 2 | 2 row–column branch dominate, and an inner arc | z − 2 | < 1 , on which the unit-modulus row–column branch and the residual μ 3 = 1 dominate.
Proof. 
The identity μ 1 μ 2 = μ 0 is λ + λ − = ( z − 2 ) 2 . On | μ 1 |   = 1 , it gives | μ 2 |   =   | μ 0 | / | μ 1 |   =   | μ 0 |   = | z − 2 | 2 ; the case | μ 2 |   = 1 is symmetric. At such a point, the four moduli are | z − 2 | 2 , 1 , | z − 2 | 2 , 1 , so the maximum equals max ( | z − 2 | 2 , 1 ) . On Q ( x , y ) = 0 , the equation | z − 2 | = 1 forces z = 3 : writing y 2 = 1 − ( x − 2 ) 2 and substituting into Q gives Q = 2 ( x − 3 ) , whereas x = 3 and y = 0 . Away from z = 3 one has | z − 2 | ≠ 1 , so the maximum is attained by exactly two branches. If | z − 2 | > 1 the dominant pair is { μ 0 , μ 2 } on the first component (respectively { μ 0 , μ 1 } on the second), with ratio μ 0 / μ 2 = μ 1 = λ + (respectively μ 0 / μ 1 = μ 2 = λ − ); if | z − 2 | < 1 the dominant pair is { μ 1 , μ 3 } (respectively { μ 2 , μ 3 } ), with ratio μ 1 / μ 3 = λ + (respectively λ − ). At the node z = 3 , all four moduli equal 1; among the tied branches, the pair { μ 1 , μ 3 } has nonconstant ratio λ + and nonzero amplitudes z − 1 = 2 and z 2 − 3 z + 1 = 1 , so this multiple-tie point also accumulates. In every case the ratio of two dominant branches is a nonconstant analytic function. The amplitudes 1, z − 1 , and z 2 − 3 z + 1 appearing in (3) do not vanish on Q ( x , y ) = 0 : their zeros z = 1 and z = ( 3 ± 5 ) / 2 give Q ( 1 , 0 ) = − 4 , Q ( ( 3 − 5 ) / 2 , 0 ) = − ( 2 + 5 ) , and Q ( ( 3 + 5 ) / 2 , 0 ) = 5 − 2 , all nonzero. Applying Theorem 2 on each analytic branch domain, as in the remark following it, identifies every point of Q ( x , y ) = 0 as an accumulation point of zeros of { P ( A n , z ) } , with the two dominance types separated by the node z = 3 . □
Theorem 5
(Isolated accumulation point). The antiprism family has an isolated accumulation point at z ∗ = ( 3 + 5 ) / 2 = ϕ 2 = B 5 . This is the unique zero of the residual amplitude α 1 ( z ) = z 2 − 3 z + 1 lying in the open region where the constant residual branch is uniquely dominant.
Proof. 
Set z ∗ = ( 3 + 5 ) / 2 . Then, 9 − 4 z ∗ = 3 − 2 5 < 0 , so 9 − 4 z ∗ = i s with s = 2 5 − 3 > 0 , and | λ ± ( z ∗ ) |   =   | ( 1 ± i s ) 2 | / 4 = ( 1 + s 2 ) / 4 . Substituting s 2 = 2 5 − 3 gives 1 + s 2 = 2 5 − 2 , hence, | λ ± ( z ∗ ) |   = ( 5 − 1 ) / 2 < 1 . Also, | λ 0 ( z ∗ ) |   = ( z ∗ − 2 ) 2 = ( ( 5 − 1 ) / 2 ) 2 = ( 3 − 5 ) / 2 < 1 . Since all three non-residual branches have modulus less than 1 at z ∗ and the constant residual has modulus 1, the residual is uniquely dominant at z ∗ and remains so throughout a neighborhood U of z ∗ .
The residual amplitude is α 1 ( z ) = z 2 − 3 z + 1 . Its roots are ( 3 ± 5 ) / 2 , so α 1 ( z ∗ ) = 0 and α 1 ≢ 0 . Proposition 3 therefore implies that z ∗ is an isolated limit point of chromatic roots of { A n } .
The other root z ∗ ∗ = ( 3 − 5 ) / 2 satisfies | λ 0 ( z ∗ ∗ ) | = ( z ∗ ∗ − 2 ) 2 = ( 1 + 5 ) 2 / 4 = ϕ 2 > 1 , so λ 0 is dominant at z ∗ ∗ and the residual branch is not. Hence, z ∗ is the only zero of α 1 in the region where the residual is uniquely dominant. □
Proposition 6.
z ∗ = ( 3 + 5 ) / 2 = 4 cos 2 ( π / 5 ) = ϕ 2 = B 5 .
Proof. 
The identity cos ( π / 5 ) = ( 1 + 5 ) / 4 gives 4 cos 2 ( π / 5 ) = ( 1 + 5 ) 2 / 4 = ( 3 + 5 ) / 2 . Since ϕ = ( 1 + 5 ) / 2 , one has ϕ 2 = ( 3 + 5 ) / 2 . Hence, z ∗ = 4 cos 2 ( π / 5 ) = ϕ 2 = B 5 . □

4. Spectral Deformations: Möbius, Circulant, and Chord

The antiprism’s accumulation geometry is driven by the discriminant Δ ( z ) = 9 − 4 z of its reduced transfer matrix and the flat residual eigenvalue + 1 . The three families studied here each arise from a closely related construction and deviate from the antiprism in one precisely controlled way: the Möbius ladder preserves the prism spectrum but alters the amplitudes through a twisted closure; the circulant C n ( { 1 , 2 } ) (see, for e.g., Figure 3a) independently reproduces the discriminant 9 − 4 z ; and the chord family C n ( { 1 , 3 } ) (see, for e.g., Figure 3b) satisfies a product identity on its reduced branches that forces the quartic geometry to degenerate to a segment. The contrast among these cases shows that the equimodular geometry is determined by the discriminant and determinant of the reduced transfer matrix, not by the graph structure alone.
Figure 3. Circulant graphs defined by jump sets { 1 , 2 } and { 1 , 3 } , illustrated for n = 6 . Panel (b) shows the jump structure only; the chord analysis of Section 4.3 assumes n ≥ 7 , for which the two distance-3 neighbors are distinct.

4.1. The Möbius Ladder

The Möbius ladder M n , shown in Figure 1c, is obtained from the prism Y n by a twisted cyclic closure: the terminal interface ( u n , v n ) is identified with ( v 1 , u 1 ) rather than ( u 1 , v 1 ) . A proper q-coloring of M n corresponds to a state sequence s 0 , s 1 , … , s n − 1 in which each transition s i → s i + 1 is admissible and the closing condition is s n = J ( s 0 ) rather than s n = s 0 , where J is the transposition involution ( J f ) ( a , b ) = f ( b , a ) . The number of such twisted closed walks is tr ( T q n J ) , giving the twisted trace formula P ( M n , q ) = tr ( T q n J ) .
Since the local transition rule for M n is identical to that of the prism Y n , the transfer matrix and its eigenvalues are unchanged. By [12], the prism transfer operator has four spectral branches λ 0 = q 2 − 3 q + 3 , λ 1 = 3 − q , λ 2 = 1 − q , and λ 3 = 1 , with corresponding eigenspaces: the constant space C 1 for λ 0 ; the J-symmetric subspace of W q for λ 1 ; the J-antisymmetric subspace of W q for λ 2 ; and U q for λ 3 . The computation of tr ( T q n J ) proceeds sector by sector. Writing P j for the spectral projector onto the eigenspace of λ j :
The constant sector: J 1 = 1 , so tr ( P 0 J ) = 1 T J 1 / | Ω q | = 1 , contributing ( q 2 − 3 q + 3 ) n .
The row–column sector: on the J-symmetric eigenspace of λ 1 , J acts as the identity, so tr ( P 1 J ) = q − 1 , contributing ( q − 1 ) ( 3 − q ) n . On the J-antisymmetric eigenspace of λ 2 , J acts as − Id , so tr ( P 2 J ) = − ( q − 1 ) , contributing − ( q − 1 ) ( 1 − q ) n .
The residual sector: since J has no fixed point on Ω q (a fixed point would require a = b ), tr ( J ) = 0 . The four sector contributions must sum to zero: tr ( P res J ) = tr ( J ) − tr ( P 0 J ) − tr ( P 1 J ) − tr ( P 2 J ) = 0 − 1 − ( q − 1 ) + ( q − 1 ) = − 1 , contributing 1 n · ( − 1 ) = − 1 .
Summing gives
P ( M n , z ) = ( z 2 − 3 z + 3 ) n + ( z − 1 ) ( 3 − z ) n − ( z − 1 ) ( 1 − z ) n − 1 .
Both sides are polynomial in z and agree for all integers q ≥ 3 , so the identity holds for all z ∈ C . Since the twisted closure modifies amplitudes but not eigenvalues, M n shares its pairwise equimodular loci with the prism family.

4.2. The Circulant C n ( { 1 , 2 } ) and the Shared Discriminant

For n ≥ 5 , let X n = C n ( { 1 , 2 } ) have vertex set Z / n Z with edges i ∼ i ± 1 and i ∼ i ± 2 . The bound n ≥ 5 ensures the graph is simple: when n = 4 , the vertex i + 2 ≡ i − 2 ( mod 4 ) collapses two distance-2 neighbors to one, giving C 4 ( { 1 , 2 } ) = K 4 , while for n = 5 all adjacencies are distinct and C 5 ( { 1 , 2 } ) = K 5 .
The transfer construction records two consecutive colors as a state ( a , b ) ∈ Ω q . A transition ( a , b ) → ( b , c ) is admissible when c ∉ { a , b } , enforcing both the distance-1 constraint c ≠ b and the distance-2 constraint c ≠ a . For fixed ( a , b ) , there are exactly q − 2 admissible choices for c, giving constant-sector eigenvalue λ 0 ( q ) = q − 2 .
To derive the row–column action, let F ( a , b ) = g ( a ) + h ( b ) with ∑ i g ( i ) = ∑ i h ( i ) = 0 . Then, ( T q X F ) ( a , b ) = ∑ c ∉ { a , b } ( g ( b ) + h ( c ) ) = ( q − 2 ) g ( b ) + ∑ c ∉ { a , b } h ( c ) . Since ∑ c h ( c ) = 0 and a ≠ b , one has ∑ c ∉ { a , b } h ( c ) = − h ( a ) − h ( b ) , and thus, ( T q X F ) ( a , b ) = − h ( a ) + ( q − 2 ) g ( b ) − h ( b ) . The coefficient pair ( g , h ) maps to ( − h , ( q − 2 ) g − h ) , so the reduced action on the row–column sector is A q X = 0 − 1 q − 2 − 1 , with characteristic polynomial λ 2 + λ + ( q − 2 ) and discriminant Δ ( q ) = 1 − 4 ( q − 2 ) = 9 − 4 q . The reduced spectral branches are therefore λ ± ( z ) = ( − 1 ± 9 − 4 z ) / 2 .
For the residual sector, let f ∈ U q . Then, ( T q X f ) ( a , b ) = ∑ c ∉ { a , b } f ( b , c ) = ∑ c ≠ b f ( b , c ) − f ( b , a ) , and ∑ c ≠ b f ( b , c ) = 0 by the zero row-sum condition of Remark 1. Hence, ( T q X f ) ( a , b ) = − f ( b , a ) = − ( J f ) ( a , b ) , so T q X | U q = − J . Proposition 2 therefore applies, and the residual sector contributes eigenvalue − 1 with multiplicity q ( q − 3 ) / 2 and eigenvalue + 1 with multiplicity ( q − 1 ) ( q − 2 ) / 2 . The two residual branches + 1 and − 1 differ by the unimodular constant − 1 ; the hypothesis of Theorem 2 therefore excludes this pair from producing an accumulation curve, consistent with their common modulus being constant. Among the remaining pairs, every ratio is one of λ 0 / λ ± , λ + / λ − , λ ± / ( ± 1 ) , or λ 0 / ( ± 1 ) , none constant on an open set, so apart from the excluded pair { + 1 , − 1 } , the hypotheses of Theorem 2 are met.
Theorem 6
(Branch expansion of C n ( { 1 , 2 } ) ). For all z ∈ C and all n ≥ 5 ,
P ( C n ( { 1 , 2 } ) , z ) = ( z − 2 ) n + ( z − 1 ) λ + ( z ) n + ( z − 1 ) λ − ( z ) n + z ( z − 3 ) 2 ( − 1 ) n + ( z − 1 ) ( z − 2 ) 2 ,
where λ ± ( z ) = ( − 1 ± 9 − 4 z ) / 2 . For n = 5 , this reduces to P ( K 5 , z ) = z ( z − 1 ) ( z − 2 ) ( z − 3 ) ( z − 4 ) .
Proof. 
For integer q ≥ 3 , the trace formula gives P ( C n ( { 1 , 2 } ) , q ) = tr ( ( T q X ) n ) . The constant sector contributes ( q − 2 ) n . Since the row–column action is A q X ⊗ I q − 1 , the row–column sector contributes ( q − 1 ) ( λ + ( q ) n + λ − ( q ) n ) . By Proposition 2, the residual sector contributes q ( q − 3 ) 2 ( − 1 ) n + ( q − 1 ) ( q − 2 ) 2 . Summing yields (6) for all integers q ≥ 3 . The power sum λ + n + λ − n is polynomial in q by the Newton recurrence with initial values S 0 = 2 and S 1 = − 1 and step S k = − S k − 1 − ( q − 2 ) S k − 2 ; all other terms in (6) are visibly polynomial. Hence, both sides are polynomial in q, and the polynomial identity extends the formula to all z ∈ C .
For n = 5 , C 5 ( { 1 , 2 } ) = K 5 . Evaluating the right side of (6) at z = 0 , 1 , 2 , 3 , 4 gives 0 in each case (verified from the recurrence with det A q X = q − 2 ), so the formula yields a monic degree-five polynomial with roots 0 , 1 , 2 , 3 , 4 , confirming P ( C 5 ( { 1 , 2 } ) , z ) = P ( K 5 , z ) . □
Setting w = 9 − 4 z , the circulant branches are λ ± ( z ) = ( − 1 ± w ) / 2 . The equimodular conditions | λ ± ( z ) | = 1 become | − 1 ± w | = 2 , i.e., | w ∓ 1 | = 2 , which are exactly the same two circles in the w-plane that arise in the antiprism analysis (Theorem 4), with branch labels interchanged. Their pullback under w 2 = 9 − 4 z is again the quartic Q ( x , y ) = 0 from (4). The shared discriminant 9 − 4 z is thus the precise spectral reason for the identical limiting geometry, even though the two families differ substantially as graphs.
Corollary 1
(Shared w-plane modulus locus implies shared equimodular geometry). Let { G n } and { H n } be closed recursively layered graph families whose reduced 2 × 2 transfer matrices have spectral branches λ ± G , λ ± H and a common linear discriminant Δ ( z ) . Fix w = Δ ( z ) , so w 2 = Δ ( z ) , and suppose that under this substitution the conditions { | λ + G | = 1 } , { | λ − G | = 1 } and the conditions { | λ + H | = 1 } , { | λ − H | = 1 } determine the same unordered pair of curves C in the w-plane. Then, the reduced unit-modulus loci coincide,
{ z ∈ C : | λ + G | = 1 } ∪ { z : | λ − G | = 1 } = { z ∈ C : | λ + H | = 1 } ∪ { z : | λ − H | = 1 } ,
and equal the preimage of C under the covering w 2 = Δ ( z ) .
In particular, for the antiprism A n and the circulant C n ( { 1 , 2 } ) the common discriminant is Δ ( z ) = 9 − 4 z and the common w-plane locus is the pair of circles | w + 1 | = 2 , | w − 1 | = 2 ; its pullback under w 2 = 9 − 4 z is the irreducible quartic Q ( x , y ) = 0 of Theorem 4. This holds even though the trace and determinant of the two reduced matrices differ.
Proof. 
Because Δ is linear with a nonzero leading coefficient, w 2 = Δ ( z ) defines a single-valued map π : w ↦ z = Δ − 1 ( w 2 ) . For a 2 × 2 reduced operator, each condition | λ ± ( z ) | = 1 pulls back under w 2 = Δ ( z ) to a condition on w alone; by hypothesis, the union of the two conditions is, for both families, the same curve set C . Hence,
{ z : | λ + G | = 1 } ∪ { z : | λ − G | = 1 } = π ( C ) = { z : | λ + H | = 1 } ∪ { z : | λ − H | = 1 } .
For the two named families, λ ± A = ( w ± 1 ) 2 / 4 gives | λ + A |   = 1 ⇔ | w + 1 | = 2 and | λ − A |   = 1 ⇔ | w − 1 | = 2 , while λ ± X = ( − 1 ± w ) / 2 gives | λ + X |   = 1 ⇔ | w − 1 | = 2 and | λ − X |   = 1 ⇔ | w + 1 | = 2 . Both produce the unordered pair C = { | w − 1 | = 2 , | w + 1 | = 2 } , whose pullback under w 2 = 9 − 4 z was computed in Theorem 4 to be Q ( x , y ) = 0 . □
Because the two residual branches + 1 and − 1 differ by the constant unimodular factor − 1 , Theorem 2 cannot be applied to them as independent branches; the residual sector must first be combined after fixing the parity of n, as recorded by the following elementary lemma.
Lemma 1
(Parity reduction for residual branches + 1 and − 1 ). Let P n ( z ) = ∑ j = 1 r a j ( z ) λ j ( z ) n + α − ( z ) ( − 1 ) n + α + ( z ) . For ϵ ∈ { 0 , 1 } , write n = 2 m + ϵ . Then,
P 2 m + ϵ ( z ) = ∑ j = 1 r a j ( z ) λ j ( z ) ϵ λ j ( z ) 2 m + β ϵ ( z ) ,
where β 0 ( z ) = α + ( z ) + α − ( z ) and β 1 ( z ) = α + ( z ) − α − ( z ) . The set of limit points of zeros of { P n } is the union of the sets of limit points of the two parity subsequences { P 2 m } and { P 2 m + 1 } .
Proof. 
Substituting n = 2 m + ϵ gives λ j n = λ j ϵ ( λ j 2 ) m and ( − 1 ) n = ( − 1 ) ϵ , which yields (7) and the two amplitudes. If z 0 is a limit point of zeros of { P n } , there are n k → ∞ and zeros z k → z 0 ; one parity occurs for infinitely many n k , so z 0 is a limit point of that parity subsequence. The converse is immediate, since each parity subsequence is a subsequence of { P n } . □
For X n = C n ( { 1 , 2 } ) , the amplitudes are α − ( z ) = z ( z − 3 ) / 2 and α + ( z ) = ( z − 1 ) ( z − 2 ) / 2 , so β 0 ( z ) = z 2 − 3 z + 1 for even n and β 1 ( z ) = 1 for odd n. The even residual amplitude therefore has the same zeros as the antiprism residual amplitude, and this produces an isolated accumulation point along the even subsequence.
Proposition 7
(Even-subsequence isolated point for C n ( { 1 , 2 } ) ). Let X n = C n ( { 1 , 2 } ) and z ∗ = ( 3 + 5 ) / 2 = B 5 . Then, z ∗ is an isolated accumulation point of chromatic roots of the even subsequence { P ( X 2 m , z ) } , hence, of the full family { P ( X n , z ) } ; the odd subsequence has no isolated point from residual amplitude cancellation.
Proof. 
By Lemma 1 the even subsequence has residual branch 1 with amplitude β 0 ( z ) = z 2 − 3 z + 1 , and β 0 ( z ∗ ) = 0 . At z ∗ , 9 − 4 z ∗ = 3 − 2 5 < 0 , so 9 − 4 z ∗ = i s with s = 2 5 − 3 , and | λ ± ( z ∗ ) | 2 = ( 1 + s 2 ) / 4 = ( 5 − 1 ) / 2 < 1 ; also, | z ∗ − 2 | 2 = ( ( 5 − 1 ) / 2 ) 2 = ( 3 − 5 ) / 2 < 1 . In the squared-branch system { ( z − 2 ) 2 , λ + 2 , λ − 2 , 1 } of (7), the residual branch 1 is therefore uniquely dominant at z ∗ , and remains so throughout a neighborhood. Since β 0 ≢ 0 , Proposition 3 gives an isolated accumulation point at z ∗ . The other zero z ∗ ∗ = ( 3 − 5 ) / 2 is excluded because | z ∗ ∗ − 2 | = ( 1 + 5 ) / 2 > 1 , so ( z − 2 ) 2 dominates there. For odd n, the residual amplitude is β 1 ≡ 1 , which has no zeros, so no residual isolated point arises. □
Away from the isolated point, the whole quartic accumulates for each parity, exactly as for the antiprism.
Proposition 8
(Dominance on the circulant quartic). Let λ 0 ( z ) = z − 2 and λ ± ( z ) = ( − 1 ± 9 − 4 z ) / 2 , so that λ + λ − = z − 2 = λ 0 by Vieta. On Q ( x , y ) = 0 , if | λ i |   = 1 for one row–column branch and λ j denotes the other, then | λ j |   =   | λ 0 |   = | z − 2 | , and the four moduli are | z − 2 | , 1 , | z − 2 | , 1 . The circle | z − 2 | = 1 meets Q ( x , y ) = 0 only at z = 3 . Away from z = 3 , the dominant pair is { λ 0 , λ j } when | z − 2 | > 1 and { λ i , 1 } when | z − 2 | < 1 ; at z = 3 all relevant branches have modulus 1. Applying Theorem 2 after the parity split of Lemma 1, whose squared branches carry the nonconstant ratios λ i 2 , the entire quartic Q ( x , y ) = 0 is the equimodular accumulation locus of each parity subsequence of { X n } .
Proof. 
The product identity is Vieta’s formula for λ 2 + λ + ( z − 2 ) . On | λ i |   = 1 , the relation | λ i λ j |   = | z − 2 | gives | λ j |   = | z − 2 | =   | λ 0 | , so the four moduli are | z − 2 | , 1 , | z − 2 | , 1 . The circulant equimodular locus is the same quartic Q ( x , y ) = 0 (Corollary 1), and on it, | z − 2 | = 1 forces z = 3 by the substitution y 2 = 1 − ( x − 2 ) 2 , which gives Q = 2 ( x − 3 ) . If | z − 2 | > 1 , the branches λ 0 , λ j dominate; after the parity split, their squares have equal modulus and ratio ( λ 0 / λ j ) 2 = λ i 2 , which is nonconstant. If | z − 2 | < 1 , the branches λ i , 1 dominate, with squared ratio λ i 2 , again nonconstant. At z = 3 , all branches tie, and at least one admissible dominant-pair ratio is nonconstant. The relevant amplitudes do not vanish on Q ( x , y ) = 0 : z − 1 ≠ 0 there, the even residual amplitude z 2 − 3 z + 1 has zeros ( 3 ± 5 ) / 2 ∉ Q , and the odd residual amplitude is 1. Hence, Theorem 2 gives accumulation along the entire quartic for both parities. □
The two parity subsequences of M n and C n ( { 1 , 2 } ) are shown in Figure 4.
Figure 4. (a) prism and Möbius ladder M 10 , governed by the prism equimodular curve from λ 0 = z 2 − 3 z + 3 (distinct from Q); this panel is schematic. (b) the shared quartic (4) governing C n ( { 1 , 2 } ) , plotted as computed solution points of Q ( x , y ) = 0 ; the red point is the even-subsequence isolated accumulation point B 5 of Proposition 7. (a) Prism and Möbius ladder roots (schematic); (b) C n ( { 1 , 2 } ) : computed Q ( x , y ) = 0 and even-subseq. point B 5 .

4.3. The Chord Graph C n ( { 1 , 3 } ) and a Degenerate Equimodular Locus

For n ≥ 7 , let C n ( { 1 , 3 } ) have vertex set Z / n Z and edges i ∼ i ± 1 and i ∼ i ± 3 . The bound n ≥ 7 ensures the two distance-3 neighbors i ± 3 are distinct: for n = 6 , one has i + 3 ≡ i − 3 ( mod 6 ) , so the jump-3 edges form a perfect matching and the local transition counts below change; the analysis assumes the generic case n ≥ 7 . The distance-3 edges couple vertices three steps apart, so the transfer construction must retain three consecutive colors. A transfer state has the form ( a , b , c ) with a ≠ b and b ≠ c , representing the color triple ( x i − 2 , x i − 1 , x i ) . Appending d = x i + 1 requires d ≠ c (the distance-1 edge i ∼ i + 1 ) and d ≠ a (the distance-3 edge ( i − 2 ) ∼ ( i + 1 ) ); no distance-2 constraint arises since i − 1 and i + 1 are not adjacent in C n ( { 1 , 3 } ) .
Under the S q -orbit decomposition, the state space { ( a , b , c ) : a ≠ b , b ≠ c } has two orbit types: Type I, where a = c (count q ( q − 1 ) ), and Type II, where a ≠ c (count q ( q − 1 ) ( q − 2 ) ). For an S q -invariant function f that takes value x on Type I and y on Type II:
On a Type I state ( a , b , a ) : d avoids only { a } , giving q − 1 successors. Exactly one has d = b (type Type I successor ( b , a , b ) ) and q − 2 have d ∉ { a , b } (Type II successors). Hence, ( T q C f ) ( a , b , a ) = x + ( q − 2 ) y .
On a Type II state ( a , b , c ) with a ≠ c : d avoids { a , c } , giving q − 2 successors. Exactly one has d = b (the Type I successor ( b , c , b ) ) and q − 3 have d ∉ { a , b , c } (Type II successors). Hence, ( T q C f ) ( a , b , c ) = x + ( q − 3 ) y .
The reduced action on the two-dimensional orbit-type sector is therefore represented by B q C = 1 q − 2 1 q − 3 , with characteristic polynomial ( λ − 1 ) ( λ − ( q − 3 ) ) − ( q − 2 ) = λ 2 − ( q − 2 ) λ − 1 , giving the reduced spectral branches λ ± ( z ) = ( z − 2 ) ± z 2 − 4 z + 8 / 2 and the product λ + ( z ) λ − ( z ) = − 1 (Vieta).
Theorem 7
(Equimodular locus of the reduced spectral pair for C n ( { 1 , 3 } ) ). The reduced branches satisfy λ + ( z ) λ − ( z ) = − 1 , and the equimodular locus of the pair { λ + , λ − } is exactly E C = { z ∈ C : Re z = 2 , | Im z | ≤ 2 } .
Proof. 
The product identity is immediate from Vieta’s formulas. If | λ + ( z ) | =   | λ − ( z ) | , then taking moduli gives | λ + ( z ) | 2 = | λ + ( z ) λ − ( z ) | = 1 , so both branches have modulus 1. Choose θ ∈ R with λ + ( z ) = e i θ . Substituting into λ 2 − ( z − 2 ) λ − 1 = 0 and dividing by e i θ gives e i θ − e − i θ = z − 2 , i.e., 2 i sin θ = z − 2 , hence, z = 2 + 2 i sin θ . Thus, Re z = 2 and | Im z | ≤ 2 .
Conversely, let z = 2 + i t with | t | ≤ 2 and choose θ ∈ R with 2 sin θ = t . Then, z − 2 = e i θ − e − i θ , and substituting λ = e i θ into the characteristic equation gives e 2 i θ − ( e i θ − e − i θ ) e i θ − 1 = e 2 i θ − e 2 i θ + 1 − 1 = 0 . So e i θ is a root. The second root is − e − i θ (since the product of the two roots equals − 1 ), which also has modulus 1. Hence, | λ + ( z ) | =   | λ − ( z ) | , completing the characterization. □
We stress that Theorem 7 describes only the reduced 2 × 2 orbit-type sector B q C ; the full transfer decomposition and the dominance of λ ± over the residual sectors are not established here, so the segment is the reduced-pair equimodular locus rather than a proven limiting root set. The product identity λ + λ − = − 1 is the spectral mechanism that collapses the quartic geometry. Whereas the antiprism and circulant families have | λ + |   = 1 and | λ − |   = 1 defining distinct circles in the w-plane whose pullbacks produce a quartic, the chord family has | λ + |   =   | λ − |   = 1 simultaneously, and the parametrization z = 2 + 2 i sin θ traces out a line segment rather than the nondegenerate quartic algebraic curve found in the antiprism and circulant cases. This transition from quartic to segment is the geometric content of level two in the spectral hierarchy of Section 6.

5. The Ladder Graph and the Generalized Petersen Family

The two families studied here occupy opposite ends of the spectral hierarchy. The ladder graph L n (Figure 5a) has a single dominant spectral branch, so the Beraha–Kahane–Weiss mechanism produces no equimodular accumulation curve whatsoever. The generalized Petersen graph G ( n , 2 ) (Figure 5b) has an irreducible cubic spectral equation, placing its accumulation geometry beyond the quadratic analysis of the preceding sections. Together they delimit the range of behavior stated in Remark 2.
Figure 5. Ladder graph L n and Generalized Petersen family G ( n , 2 ) for n = 6 .

5.1. The Ladder Graph L n

The ladder L n = P n □ P 2 is the Cartesian product of a path on n vertices with a single edge; it has 2 n vertices arranged as two parallel paths connected by n rungs. Because the family has open boundary conditions, the transfer formula of Proposition 1 applies in its vector form. A transfer state is a pair ( a , b ) ∈ Ω q . A transition ( a , b ) → ( a ′ , b ′ ) is admissible when a ′ ≠ a , b ′ ≠ b , and a ′ ≠ b ′ . For a fixed state ( a , b ) , there are initially q ( q − 1 ) ordered pairs ( a ′ , b ′ ) with a ′ ≠ b ′ ; exactly q − 1 have a ′ = a , exactly q − 1 have b ′ = b , and exactly one pair satisfies both conditions (namely ( a , b ) itself). Inclusion–exclusion gives q ( q − 1 ) − 2 ( q − 1 ) + 1 = q 2 − 3 q + 3 admissible successors for every state, so T q 1 = ( q 2 − 3 q + 3 ) 1 .
Theorem 8
(Chromatic polynomial of L n ). For all n ≥ 1 and all z ∈ C , P ( L n , z ) = z ( z − 1 ) ( z 2 − 3 z + 3 ) n − 1 . The full fixed-zero set is { 0 , 1 , ( 3 + i 3 ) / 2 , ( 3 − i 3 ) / 2 } ; the zeros 0 and 1 occur with fixed multiplicity 1, while ( 3 ± i 3 ) / 2 occur with multiplicity n − 1 . After the universal chromatic factors z ( z − 1 ) are removed, the only remaining fixed zeros—and the only zeros of unbounded multiplicity—are ( 3 ± i 3 ) / 2 . Since a single spectral branch survives the open-boundary projection, no equimodular accumulation curve occurs.
Proof. 
The first rung of L n is an edge and contributes q ( q − 1 ) colorings. Since T q 1 = ( q 2 − 3 q + 3 ) 1 , the open-boundary transfer formula with v = w = 1 gives P ( L n , q ) = 1 T T q n − 1 1 = ( q 2 − 3 q + 3 ) n − 1 1 T 1 = q ( q − 1 ) ( q 2 − 3 q + 3 ) n − 1 for every integer q ≥ 0 . Both sides are polynomial in q, so the identity holds for all z ∈ C .
The factorization shows that every zero of P ( L n , z ) is either 0, 1, or a root of z 2 − 3 z + 3 . The roots of z 2 − 3 z + 3 are ( 3 ± i 3 ) / 2 , and each appears with multiplicity n − 1 for all n ≥ 2 ; they are therefore fixed zeros of the family of unbounded multiplicity, and trivially its only nontrivial limit points. Since the chromatic polynomial involves only the single spectral branch λ ( z ) = z 2 − 3 z + 3 , no two branches can compete in modulus, and the first condition of Theorem 2 never applies. The sole accumulation mechanism is that of fixed zeros, and no equimodular accumulation curve arises. □
Figure 6 compares the isolated-point behavior of the ladder with the vertical segment arising for C n ( { 1 , 3 } ) .
Figure 6. Degenerate limiting geometries for the chord and ladder families. Both panels are exact: the chord panel shows the reduced-sector segment of Theorem 7; the ladder panel shows the exact fixed zeros of Theorem 8.

5.2. The Generalized Petersen Family G ( n , 2 )

For n ≥ 5 , the generalized Petersen graph G ( n , 2 ) has vertex set { u i , v i : i ∈ Z / n Z } with outer cycle edges u i u i + 1 , spokes u i v i , and inner edges v i v i + 2 . Unlike the prism and antiprism families, the inner edges couple vertices separated by two layers, so the transfer process must retain one previous inner color. Accordingly, a transfer state is represented by a triple ( a , b , c ) = ( c ( u i ) , c ( v i ) , c ( v i − 1 ) ) , where the spoke constraint forces a ≠ b .
A transition ( a , b , c ) → ( a ′ , b ′ , b ) is admissible precisely when the new layer satisfies all adjacency constraints: a ′ ≠ a (from the outer edge u i u i + 1 ), a ′ ≠ b ′ (from the spoke u i + 1 v i + 1 ), and b ′ ≠ c (from the inner edge v i − 1 v i + 1 ). The colour-relabeling group S q acts on the state set { ( a , b , c ) : a ≠ b } , and an S q -invariant function depends only on the equality pattern of ( a , b , c ) . Since a ≠ b is fixed, there are exactly three patterns, so the invariant sector is 3-dimensional, spanned by the indicators of
T 1 = { c = a } , T 2 = { c = b } , T 3 = { a , b , c distinct } .
Write an invariant f as the triple ( x 1 , x 2 , x 3 ) of its values on T 1 , T 2 , T 3 . The reduced action sends f to the function whose value at a state is ∑ f ( a ′ , b ′ , b ) over the admissible successors ( a ′ , b ′ , b ) , those with a ′ ≠ a , a ′ ≠ b ′ , and b ′ ≠ c ; a successor lies in T 1 when b = a ′ , in T 2 when b = b ′ , and in T 3 otherwise. Counting the successors of each pattern gives the following.
From T 1 (so c = a ): the T 1 successors ( a ′ = b ) require b ′ ∉ { a , b } , giving q − 2 ; the T 2 successors ( b ′ = b ) require a ′ ∉ { a , b } , giving q − 2 ; the T 3 successors require a ′ ∉ { a , b } then b ′ ∉ { a , b , a ′ } , giving ( q − 2 ) ( q − 3 ) .
From T 2 (so c = b ): the T 1 successors ( a ′ = b ) require b ′ ≠ b , giving q − 1 ; no T 2 successor exists, since b ′ = b violates b ′ ≠ c = b ; the T 3 successors require a ′ ∉ { a , b } and b ′ ∉ { a ′ , b } , giving ( q − 2 ) 2 .
From T 3 ( a , b , c distinct): the T 1 successors ( a ′ = b ) require b ′ ∉ { b , c } , giving q − 2 ; the T 2 successors ( b ′ = b ) require a ′ ∉ { a , b } , giving q − 2 ; the T 3 successors require a ′ ∉ { a , b } and b ′ ∉ { a ′ , b , c } , which yields q − 2 choices of b ′ when a ′ = c and q − 3 otherwise, hence, ( q − 2 ) + ( q − 3 ) 2 = q 2 − 5 q + 7 .
Collecting the counts as the matrix whose ( i , j ) -entry is the number of type- T j successors of a type- T i state gives
B q = q − 2 q − 2 ( q − 2 ) ( q − 3 ) q − 1 0 ( q − 2 ) 2 q − 2 q − 2 q 2 − 5 q + 7 .
The remaining S q -isotypic sectors contribute lower-dimensional residual blocks that we do not record here.
We can check with the case when q = 3 . Direct enumeration of the admissible single-layer extensions yields the integer matrix B 3 = 1 1 0 2 0 1 1 1 1 , whose characteristic polynomial is λ 3 − 2 λ 2 − 2 λ + 2 , in agreement with Theorem 9. We emphasize that Theorem 9 establishes the cubic as the spectral equation of this three-dimensional invariant sector; its dominance over the remaining S q -isotypic sectors is not established here, and a complete branch expansion of P ( G ( n , 2 ) , z ) , including the residual amplitudes, is not derived. The higher-degree accumulation geometry below is therefore stated as structural evidence and an open direction, not as a proved classification.
Theorem 9
(Cubic spectral equation). The characteristic polynomial of B q | q = z is f ( λ , z ) = λ 3 − ( z 2 − 4 z + 5 ) λ 2 − ( z 3 − 5 z 2 + 8 z − 4 ) λ + ( z − 1 ) ( z − 2 ) , and f ( λ , z ) is irreducible over Q ( z ) .
Proof. 
Setting p = z − 2 , a direct expansion of det ( λ I − B q ) | q = z gives λ 3 − ( p 2 + 1 ) λ 2 − p 2 ( p + 1 ) λ + p ( p + 1 ) . Substituting back: p 2 + 1 = ( z − 2 ) 2 + 1 = z 2 − 4 z + 5 ; p 2 ( p + 1 ) = ( z − 2 ) 2 ( z − 1 ) = z 3 − 5 z 2 + 8 z − 4 ; and p ( p + 1 ) = ( z − 2 ) ( z − 1 ) = ( z − 1 ) ( z − 2 ) . This gives the stated polynomial. One can verify that at z = 3 , we have f ( λ , 3 ) = λ 3 − 2 λ 2 − 2 λ + 2 with a direct expansion from B 3 = 1 1 0 2 0 1 1 1 1 to confirm the result.
For irreducibility over Q ( z ) : since f is monic in λ with coefficients in Q [ z ] and Q [ z ] is integrally closed, any root of f in Q ( z ) must lie in Q [ z ] . A cubic over a field is reducible if and only if it has a root in that field, so it suffices to show f has no root p ( z ) ∈ Q [ z ] . The constant term ( z − 1 ) ( z − 2 ) forces p ( z ) to divide ( z − 1 ) ( z − 2 ) in Q [ z ] , so p ( z ) ∈ { c , c ( z − 1 ) , c ( z − 2 ) , c ( z − 1 ) ( z − 2 ) } for some c ∈ Q × .
If p ( z ) = c : the leading power of z in f ( c , z ) is z 3 with coefficient − c , forcing c = 0 , a contradiction.
If p ( z ) = c ( z − 1 ) : the coefficient of z 4 in f ( p ( z ) , z ) is − c 2 − c , so c = − 1 . Then, f ( 1 − z , z ) = − ( z − 1 ) ( z 2 − 2 z + 2 ) ; since z 2 − 2 z + 2 = ( z − 1 ) 2 + 1 has no real roots and is not identically zero, f ( 1 − z , z ) ≢ 0 .
If p ( z ) = c ( z − 2 ) : the z 4 coefficient is again − c 2 − c , giving c = − 1 . Then, f ( 2 − z , z ) = z − 2 ≢ 0 .
If p ( z ) = c ( z − 1 ) ( z − 2 ) : the coefficient of z 6 in f ( p ( z ) , z ) is c 3 − c 2 , giving c = 1 . Then, f ( ( z − 1 ) ( z − 2 ) , z ) = − ( z − 1 ) ( z − 2 ) ( z 2 − 3 z + 1 ) ≢ 0 .
In every case f ( p ( z ) , z ) ≢ 0 , so f has no root in Q ( z ) and is therefore irreducible over Q ( z ) . □
The three spectral branches of G ( n , 2 ) are thus algebraic of degree three over Q ( z ) . Their equimodular geometry is not governed by a single quadratic discriminant, and the pairwise modulus-competition locus is a higher-degree real algebraic set whose structure lies beyond the methods of the preceding sections. The numerical root distributions in Figure 7 are consistent with multibranch cubic competition but do not constitute a proof of a specific algebraic degree for the accumulation set.
Figure 7. Schematic chromatic-root distribution for G ( n , 2 ) ( n = 5 , 6 , 7 , 8 , 10 ); curves and points illustrate multibranch cubic competition and are not computed loci. This figure is exploratory only and is not used as evidence for the results of the paper.

6. Spectral Hierarchy and Consequences

The families studied in the preceding sections are governed by a common spectral mechanism: the limiting chromatic-root geometry is determined not by the graph structure directly, but by the dimension and algebraic properties of the reduced transfer operator—specifically its discriminant, its determinant, and the moduli of its branches relative to the constant residual eigenvalue. The following remark summarizes the four qualitatively distinct outcomes exhibited by the families of this paper.
Remark 2
(Spectral hierarchy). The preceding examples exhibit a structural relationship between the reduced transfer spectrum and the geometry of the limiting chromatic-root locus.
1. 
For 2 × 2 reduced transfer operators with linear discriminant, the unit-modulus conditions reduce under w 2 = Δ ( z ) to circle equations in the w-plane. Their quadratic pullbacks produce quartic equimodular curves, as in the antiprism and circulant families C n ( { 1 , 2 } ) , for which the whole quartic is proved to accumulate; see Theorem 4, Proposition 5, and Corollary 1.
2. 
When λ + ( z ) λ − ( z ) = − 1 identically, the equimodular condition forces both branches onto the unit circle, collapsing the reduced-sector geometry to a real line segment rather than a quartic curve; see Theorem 7.
3. 
For reduced transfer operators of degree at least three with irreducible characteristic polynomial over Q ( z ) , the equimodular geometry arises from higher-degree algebraic branch competition and is not governed by the quadratic pullback mechanism; see Theorem 9.
4. 
If the boundary conditions project onto a single dominant spectral branch, then no dominant branch competition occurs, and no equimodular accumulation curve arises; see Theorem 8.
These examples suggest that the algebraic complexity of the reduced transfer spectrum strongly constrains the topology and geometry of the limiting chromatic-root set.
Each level of this hierarchy is realized by one or more families studied above. The antiprism A n and the circulant C n ( { 1 , 2 } ) both fall under item 1: they share the discriminant Δ ( z ) = 9 − 4 z , so the conditions | λ ± ( z ) | = 1 produce the same two circles in the w-plane and, upon pullback, the same irreducible quartic Q ( x , y ) = 0 from (4), and for both this whole quartic carries accumulation by Propositions 5 and 8 together with Corollary 1. Despite their common quartic locus, the two families differ in the way the residual sector enters the trace. For the antiprism, the residual branch is + 1 with amplitude z 2 − 3 z + 1 , giving the isolated accumulation point z ∗ = B 5 . For the circulant, the residual branches + 1 and − 1 must be combined by parity (Lemma 1): the even subsequence carries the same amplitude z 2 − 3 z + 1 , and hence, the same isolated point B 5 (Proposition 7), while the odd subsequence carries the constant amplitude 1 and has no such point. Thus, both the antiprism and the even circulant subsequence exhibit the isolated point B 5 . The prism Y n also realizes item 1, but through a different quadratic mechanism: its reduced row–column matrix has the constant discriminant 4, so the relevant quadratic branch is the constant-sector eigenvalue λ 0 = z 2 − 3 z + 3 , whose unit-modulus competition produces a quartic equimodular curve distinct from Q ( x , y ) . The Möbius ladder M n shares the full prism spectrum, and hence, shares that same prism quartic—again not Q ( x , y ) . Thus, the shared quartic Q of (4) is specific to the pair { A n , C n ( { 1 , 2 } ) } , which alone realize the linear-discriminant pullback w 2 = 9 − 4 z .
The chord family C n ( { 1 , 3 } ) falls under item 2. Its reduced branches satisfy λ + ( z ) λ − ( z ) = − 1 (Theorem 7), and the unit-circle parametrization λ + = e i θ forces z − 2 = 2 i sin θ , collapsing the reduced-sector equimodular locus to the segment E C = { Re z = 2 , | Im z | ≤ 2 } . The determinant condition λ + λ − = − 1 is specific to this family; a general unit-determinant condition | λ + λ − |   = 1 would yield a one-dimensional equimodular locus, but not necessarily a vertical segment.
The ladder L n realizes item 4: the open boundary conditions project entirely onto the single branch λ ( z ) = z 2 − 3 z + 3 , so no branch competition arises and the zeros ( 3 ± i 3 ) / 2 are fixed for all n ≥ 2 . The generalized Petersen family G ( n , 2 ) realizes item 3: its characteristic polynomial is irreducible of degree three over Q ( z ) (Theorem 9), placing its accumulation geometry beyond the quadratic circle-pullback method.
Table 1 summarizes the spectral profiles, and Figure 8 depicts the hierarchy schematically.
Table 1. Spectral profiles of the prism-derived families.
Figure 8. Spectral hierarchy for prism-derived graph families.
The chromatic polynomial arises as the zero-temperature antiferromagnetic specialization of the Potts partition function [3,5], and in the thermodynamic limit, the dominant transfer branch determines the free energy while the equimodular set marks the complex phase boundary [4,8]. Under this correspondence, the quartic (4) is the complex phase boundary for both the antiprism and circulant families; the segment { Re z = 2 , | Im z | ≤ 2 } constitutes the equimodular locus of the reduced spectral pair and is therefore the component of the phase boundary of the chord family arising from reduced-sector competition; contributions from the full transfer operator, including any residual sector, are not characterized here.
Several problems remain open. A structural classification of circulant families C n ( S ) whose reduced discriminant equals 9 − 4 q would clarify the combinatorial origin of the shared quartic geometry. Whether higher Beraha numbers B k arise as isolated accumulation points in other prism-derived families through amplitude cancellation within a uniquely dominant residual region remains unresolved. The irreducibility of the cubic spectral equation for G ( n , 2 ) suggests the existence of higher-degree equimodular sets, but the algebraic structure of the corresponding accumulation set, together with the missing residual-sector analysis and a full branch expansion, is not yet understood. More broadly, a general theory relating the degree and splitting field of the reduced characteristic polynomial to the topology of the limiting root set would unify the hierarchy of the present paper.

Author Contributions

Conceptualization, R.L.-B.; Methodology, R.L.-B. and J.D.A.; Software, G.C.M.; Validation, J.D.A.; Formal analysis, R.L.-B.; Investigation, R.L.-B., J.D.A. and G.C.M.; Data curation, G.C.M.; Writing—original draft, R.L.-B.; Writing—review & editing, R.L.-B. and J.D.A.; Visualization, R.L.-B. and G.C.M.; Supervision, J.D.A.; Project administration, J.D.A.; Funding acquisition, J.D.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the United States Department of Education, grant number P382G240006.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Birkhoff, G.D. A determinant formula for the number of ways of coloring a map. Ann. Math. 1912, 14, 42–46. [Google Scholar] [CrossRef] [Scilit]
  2. Whitney, H. The coloring of graphs. Ann. Math. 1932, 33, 688–718. [Google Scholar] [CrossRef] [Scilit]
  3. Fortuin, C.M.; Kasteleyn, P.W. On the random-cluster model I. Introduction and relation to other models. Physica 1972, 57, 536–564. [Google Scholar] [CrossRef] [Scilit]
  4. Welsh, D.J.A.; Merino, C. The Potts model and the Tutte polynomial. J. Math. Phys. 2000, 41, 1127–1152. [Google Scholar] [CrossRef] [Scilit]
  5. Potts, R.B. Some generalized order-disorder transformations. Proc. Camb. Philos. Soc. 1952, 48, 106–109. [Google Scholar] [CrossRef] [Scilit]
  6. Colbourn, C.J. The Combinatorics of Network Reliability; Oxford University Press: Oxford, UK, 1987. [Google Scholar]
  7. Beraha, S.; Kahane, J.; Weiss, N.J. Limits of zeros of recursively defined families of polynomials. In Studies in Foundations and Combinatorics, Advances in Mathematics, Supplementary Studies; Academic Press: Cambridge, MA, USA, 1978; Volume 1, pp. 213–232. [Google Scholar]
  8. Salas, J.; Sokal, A.D. Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I. General theory and square-lattice chromatic polynomial. J. Stat. Phys. 2001, 104, 609–699. [Google Scholar] [CrossRef] [Scilit]
  9. Shrock, R.; Tsai, S.-H. Asymptotic limits and zeros of chromatic polynomials and ground-state entropy of Potts antiferromagnets. Phys. Rev. E 1997, 55, 5165–5178. [Google Scholar] [CrossRef] [Scilit]
  10. Jackson, B. A zero-free interval for chromatic polynomials of graphs. Comb. Probab. Comput. 1993, 2, 325–336. [Google Scholar] [CrossRef] [Scilit]
  11. Thomassen, C. The zero-free intervals for chromatic polynomials of graphs. Comb. Probab. Comput. 1997, 6, 497–506. [Google Scholar] [CrossRef] [Scilit]
  12. Allagan, J.; Voloshin, V.; Deriglazov, V.; Lopez-Bonilla, R.N. Explicit equimodular curves for prism-graph chromatic polynomials and the Beraha–Kahane–Weiss limit set. Amer. J. Comput. Math. 2026, 16, 14–26. [Google Scholar] [CrossRef]
  13. Allagan, J.; Voloshin, V.; Gao, W.; Deriglazov, V. Chromatic roots of prism graphs: Cassini geometry and a uniform finite-n bound. J. Comb. Math. Comb. Comput. 2026; to appear.
  14. Lopez-Bonilla, R.N.; Allagan, J.; Langley, S.M.; Clinton, A.J. Chromatic polynomials of C n ( 3 ) graphs. J. Adv. Math. Comput. Sci. 2025, 40, 79–98. [Google Scholar] [CrossRef] [Scilit]
  15. Biggs, N. Algebraic Graph Theory, 2nd ed.; Cambridge University Press: Cambridge, UK, 1993. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.