Explicit Equimodular Curves for Prism-Graph Chromatic Polynomials and the Beraha-Kahane-Weiss Limit Set ()
1. Introduction
For a finite simple graph
, the chromatic polynomial
counts proper vertex colorings when
is a nonnegative integer and extends uniquely to a monic polynomial of degree
with integer coefficients [1]-[3]. Its complex zeros, the chromatic roots, encode subtle structural information about
and have been studied extensively from combinatorial, analytic, and statistical-mechanical perspectives. A central theme is to describe the geometry and asymptotic distribution of these roots for natural recursive families of graphs.
Many such families
admit a finite transfer-matrix representation
(1)
In this setting, the Beraha-Kahane-Weiss (BKW) theorem [4] governs the limiting behavior of chromatic roots as
: accumulation is confined to loci where two or more eigenvalues tie in modulus while dominating all others, together with isolated points arising from the vanishing of a dominant amplitude. Thus, the limiting root set is determined by explicit modulus-tie equations supplemented by dominance inequalities. While such boundaries are often explored numerically, fully explicit real-algebraic descriptions remain rare.
In this paper, we provide an explicit real-algebraic verification of the equimodular geometry for the prism (cyclic ladder) graphs
. Beyond the standard transfer-matrix eigen-branch expansion, we derive closed Cartesian equations for the nontrivial modulus ties involving the quadratic branch
, including the quartic loci
and
, and we formulate the limiting set as a union of explicitly defined dominant subsets of these ties, together with isolated amplitude-zero points.
The prism family
,
, is the smallest natural example in which multibranch competition occurs. Using the transfer-matrix framework together with the symmetric-group reduction introduced by Biggs [5] [6], we obtain an explicit four-branch expansion of the form (1) and determine all associated modulus-tie sets. The distinguishing feature is a closed Cartesian description of the quadratic-linear equimodular loci, which appear as real-algebraic curves of degree four alongside the remaining elementary ties. These formulas replace plot-based boundaries with exact algebraic conditions and permit direct, symbolic verification of the dominance relations required by the BKW mechanism.
Viewed in parallel, cycles and prisms form complementary test cases. Cycles exhibit a single dominant branch, forcing all nontrivial chromatic roots onto the circle
, while prisms mark the transition to higher-degree real-algebraic limit sets generated by competing eigenvalues. Making this transition explicit clarifies the geometric content of the BKW framework and provides a concrete template for the analysis of more complex recursive families.
The paper is organized as follows. Section 2 briefly revisits cycles, fixing notation and recalling the explicit root parametrization and limiting distribution. Section 3 develops the transfer-matrix formulation for prisms, derives the four-branch eigenvalue expansion, and gives a concrete real-algebraic description of the associated BKW limit set, including the quartic modulus-tie curves.
2. Cycles: Chromatic Polynomial and Explicit Roots
Cycles provide a canonical family in which the chromatic polynomial, its full root set, and the limiting root geometry admit closed forms.
They serve here as a reference case: a single dominant eigen-branch controls the asymptotic behavior, yielding an unambiguous accumulation set.
This sharply contrasts with the multibranch behavior encountered later for prisms.
Theorem 2.1 (Chromatic polynomial of cycles). For
,
(2)
Proof. The identity follows by any standard method.
For instance, deletion-contraction on an edge
gives
and since
satisfies (2), induction completes the argument.
Equivalent derivations via endpoint constraints on paths or adjacency-matrix traces lead to the same polynomial identity and are omitted.
With the closed form fixed, the root structure follows immediately.
Theorem 2.2 (Explicit chromatic roots of cycles). Let
and set
. The roots of
consist of
together with the
solutions of
, given explicitly by
(3)
where
and
Proof. This is immediate from the factorization in Theorem 2.1.
Corollary 2.3 (Root locus). All nontrivial chromatic roots of
lie on the circle
Proof. Equation (3) gives
.
Figure 1 illustrates this configuration for representative values of
. As
increases, the nontrivial roots form a rotated regular
-gon on Γ and converge to a uniform angular distribution.
The resulting geometry is rigid and fully determined by a single modulus constraint.
Figure 1. Chromatic roots of
for
. All nontrivial roots lie on the circle
and become uniformly distributed as
grows.
2.1. Cycle: Geometry of the Roots
We retain the indexing from Theorem 2.2.
Corollary 2.4 (Real and imaginary parts). Let
and set
. For each nontrivial chromatic root
,
(4)
where
for even
and
for odd
.
Proof. Writing
with
, Euler’s formula yields the result.
Thus, the translated roots
are equally spaced on the unit circle, with constant angular increment
.
Corollary 2.5 (Real roots and symmetry). The nontrivial chromatic roots of
occur in complex conjugate pairs. They include 0 for all
, include 2 if and only if
is odd, and admit no other real values.
Proof. Real roots correspond to
. The value −1 occurs for all
, while +1 occurs precisely when
is odd.
Remark 2.6 All nontrivial chromatic roots of
lie on Γ and hence in the rectangle
,
, with extremal points 0, 2, and
.
This rigid geometry reflects the presence of a single dominant eigenvalue branch.
Beyond exact location, the roots of
admit a simple asymptotic description: as
they become uniformly distributed on Γ, and the associated logarithmic potential is elementary. Since these facts are classical and not used later, we record them briefly for context.
2.2. Cycles: Equidistribution and Logarithmic Potential
The nontrivial roots of
form an equally spaced set on Γ, up to a parity-dependent rotation. Consequently, the empirical root measures converge weakly to the uniform probability measure on Γ.
Theorem 2.7 (Equidistribution). The measures
converge weakly to the uniform measure
on Γ.
Proof. This follows directly from the explicit parametrization
and standard Riemann-sum convergence.
Lemma 2.8 (Logarithmic potential). For all
,
Proof. By rotational symmetry, the integral reduces to a classical mean-value computation on the unit circle.
Theorem 2.9 (Potential convergence). For every
,
Proof. The closed form
yields the result by a direct comparison of exponential rates in the regimes
,
, and
.
For cycles, the BKW limit set reduces to a single circle. In more complex recursive families, multiple eigenvalue branches compete, and the limiting geometry is dictated by nontrivial modulus ties. This transition motivates the prism analysis that follows.
3. Prisms: Transfer Matrices and the Beraha-Kahane-Weiss Mechanism
3.1. Transfer-Matrix Formulation
Let
denote the prism (cyclic ladder) graph, viewed as
rungs joining two horizontal
-cycles. A transfer matrix arises by propagating a proper coloring rung-by-rung while maintaining distinct colors on each rung.
Definition 3.1 (Rung state space). Fix
and write
. Set
so that rung
is encoded by the ordered pair
.
The horizontal edges enforce
and
, while each rung enforces
, i.e., membership in
.
Definition 3.2 (Transfer matrix). For
, define the matrix
indexed by
by
Figure 2. The prism graph
with 16 vertices and 24 edges. The graph consists of two concentric
-cycles (inner and outer) connected by
vertical edges (rungs). The Cartesian product structure
reflects the natural decomposition into horizontal cycles and vertical paths.
Proposition 3.3 (Trace formula). For every
and every integer
,
In particular, for fixed
the right-hand side is a polynomial in
agreeing with
on
, hence the identity extends to all
.
Proof. A proper
-coloring of
corresponds to a cyclic sequence of states
where each transition satisfies
,
, and
. These are precisely the closed walks of length
in the directed transition graph on
with adjacency matrix
, counted by
.
The eigen-branch expansion follows from the
-symmetry given by relabeling colors.
Lemma 3.4 (Row-column subspace). Fix
and write
. Let
be the subspace of functions
of the form
with
Then
is
-invariant and, for every
,
Equivalently, for each
the pair
is updated by
whose eigenvalues are
and
, each yielding a
-dimensional mean-zero eigenspace in
.
Proof. Fix
and write
. Summing over admissible successors
with
,
,
gives
For the
-sum, fix
and count admissible
. If
then
may be any element of
, giving
choices; if
then
must avoid
, giving
choices. Hence
using
. By symmetry, the
-sum equals
, yielding the stated formula.
Finally,
so the eigenvalues are
and
. Each eigendirection in
, together with the mean-zero condition, contributes a
-dimensional eigenspace in
.
We now identify the spectrum relevant to the trace.
Theorem 3.5 (Eigenvalue expansion). There exist four eigenvalue branches
(5)
with polynomial amplitudes
(6)
such that for all
and all
,
(7)
Proof. Work first at integer inputs
with
, then extend by polynomial identity.
Fix
and set
. Let
be the operator with matrix
, so
by Proposition 3.3. The symmetric group
acts on
by relabeling colors and commutes with
, hence
decomposes into
-isotypic components on which
acts scalarly.
On the fixed line
, each state
has
admissible successors, so
and
.
The
-stable subspace
from Lemma 3.4 has dimension
and splits into eigenspaces with eigenvalues
and
, each of multiplicity
.
Let
be an
-stable complement of
. Then
. Choosing distinct
and
one has
and
, hence
. A direct transition check gives
, so
on
.
Further, the ordered-pair permutation representation of
on
has exactly these four isotypic constituents [6]. Therefore
which matches (7) upon rewriting in terms of
and
. For fixed
, both sides are polynomials in
that agree for all integers
, hence are identical; evaluating at
gives (7) for all
.
Remark 3.6 (Closed form and consistency checks). Substituting (5) and (6) into (7) yields
(8)
In particular,
for all
. Small-
expansions provide checks only; the identity (7) is forced by the trace formula together with the
-reduction producing the four eigen-branches.
3.2. The Beraha-Kahane-Weiss Mechanism
The representation (7) is a finite exponential sum in
. Consequently, root accumulation can occur only where at least two branches tie in modulus at the dominant scale, or at isolated points where a uniquely dominant branch has vanishing amplitude. The Beraha-Kahane-Weiss theorem makes this localization precise.
Theorem 3.7 (BKW accumulation set for prism chromatic roots). Let
be the set of accumulation points in
of chromatic roots of the prism family
. With
as in Theorem 3.5, define
(9)
(10)
Then:
1)
.
2) If
satisfies
, and
is not locally constant near
, then
.
For the prism branches (5), the elementary tie loci are
(11)
(12)
(13)
(14)
The amplitude zeros are
(15)
Thus, on any subset of a tie locus where exactly two branches dominate and the tied amplitudes are nonzero, the points belong to
by (ii).
Proof. (i) Fix
and assume a unique index
satisfies
By continuity, there exists a neighborhood
of
and constants
and
such that
and
for all
and
. Factoring the dominant branch gives
On
one has
uniformly for some
, hence
on
for all sufficiently large
. Thus
cannot be an accumulation point of zeros, proving
.
(ii) Let
with exactly two dominant branches
and
. Shrinking to a neighborhood where all remaining branches are uniformly subdominant, write
uniformly for some
. Since
is analytic and not locally constant, its argument varies in every neighborhood of
, and the two leading terms attain near-opposition for infinitely many
. The standard BKW argument for exponential sums then yields zeros of
arbitrarily close to
for arbitrarily large
, hence
.
Finally, (11)-(14) and (15) follow by direct substitution from (5) and (6).
We now specialize the Beraha-Kahane-Weiss description to the explicit prism eigen-branches, isolating the subsets that can contribute to the limiting chromatic root set.
Corollary 3.8 (Prism limiting set). Let
and
be as in Theorem 3.5. For
define
and define
Then
Moreover, if
is a point at which exactly the two branches
are dominant and
is not locally constant near
, then
.
This is an immediate specialization of Theorem 3.7 to the eigenvalues (5) and amplitudes (6), with the dominance conditions made explicit.
3.3. Quartic Ties Involving the Quadratic Branch
For
the eigen-branch expansion in Theorem 3.5 reads
The ties among
are elementary:
and together with
they account for all ties involving
. The remaining balances tie
with
or
and yield quartic real-algebraic curves.
Theorem 3.9 (Quartic modulus ties for
). Let
with
, and set
The modulus-tie sets
are quartic real-algebraic curves given by
(16)
(17)
Proof. Writing
gives
so
Since
and
, the equalities
and
are equivalent to (16) and (17). Each is polynomial in
and has total degree four.
Corollary 3.10 (Basic properties). The quartic curves
and
satisfy:
1)
, with even intersection multiplicity;
2)
;
3) both curves are invariant under complex conjugation.
Proof. Setting
in (16) gives
, hence
. The + sign yields
; the − sign yields
with no real solutions. Thus
with even multiplicity.
Setting
in (17) gives
, hence
. The − sign yields
, giving
; the + sign has no real solutions. Both equations depend on
only via
, so they are invariant under conjugation.
Remark 3.11 (Dominance on quartic ties). On
we have
. The linear comparison
implies that for every
with
,
, so
cannot be strictly dominant there. On
we have
, and
implies that for every
with
,
, again excluding strict dominance of
on that portion. In these regions the quartic ties cannot contribute to accumulation arcs.
Equations (16) (17) also sharpen the tie geometry beyond what contour plots alone resolve: tangencies and near-intersections can be checked algebraically, and the dominance inequalities can be verified directly without relying on numerical resolution.
4. Conclusion
Cycles and prisms illustrate a sharp transition in chromatic-root geometry, from a single dominant eigen-branch to multibranch competition governed by the Beraha-Kahane-Weiss mechanism. For cycles
, the explicit factorization of
confines all nontrivial roots to the circle
and yields a uniform angular limiting distribution. For prisms
, the transfer-matrix formulation produces a four-branch eigenvalue expansion, placing the limiting root set under precise BKW control.
For the prism family, we give an explicit real-algebraic description of all equimodular boundaries. In addition to the elementary ties among the linear and constant branches, we derive closed Cartesian quartic equations for the quadratic-linear balances.
These identities replace plot-based boundaries with exact algebraic conditions and allow direct verification of the dominance inequalities that determine which portions of the tie loci contribute to the BKW accumulation set.
Figure 3. Modulus-tie curves for
. Dashed curves indicate dominant BKW accumulation arcs; dotted curves are subdominant. Squares show roots for n = 6, 8, 10.
More broadly, prism graphs provide a compact setting in which the full equimodular geometry can be made explicit. The same combination of transfer-matrix reduction, algebraic elimination of modulus ties, and dominance analysis applies to wider cylindrical ladders
and to other recursive families, where additional eigen-branches are expected to generate richer real-algebraic limit sets [7] [8]. Extending these techniques offers a systematic route toward rigorous, computation-assisted descriptions of chromatic-root accumulation geometry beyond the cases accessible by numerical exploration alone.
Funding
This work was supported by the U.S. Department of Education under grant number P382G240006.
Acknowledgement
The authors thank the anonymous reviewers for their helpful suggestions and careful reading of the manuscript.