- The paper develops a graph-theoretic framework using generalized Paley graphs (GP-graphs) to determine exact solution counts of monic systems of diagonal equations over finite fields
- Using GP-graphs, the paper provides three different methods of calculation (walks, adjacency matrices, and spectra), allowing a computational approach.
- The results are specifically applied to both the general and Hermitian-form systems cases, with closed-form, recursive, and hypergeometric expressions derived for Hermitian-form systems
Overview
This paper by Podestá and Videla develops a graph-theoretic framework for computing the exact number of solutions of monic systems of diagonal equations (SDEs) over finite fields. The central object is a new family of Cayley graphs, the diagonal generalized Paley graphs Γ(κ,q)=Cay(Fqm,Rκ) with connection set Rκ={(xk1,…,xkm):x∈Fq∗} for κ=(k1,…,km). The authors show that solution counts of systems
X1ki+⋯+Xski=βi,1≤i≤m,
can be recovered from walks, adjacency matrices, or the spectrum of Γ(κ,q), and they specialize to Hermitian-form systems where closed-form, recursive, and hypergeometric expressions are obtained.
Diagonal GP-graphs and their spectrum
The graph Γ(κ,q) is loopless and regular of degree (q−1)/dκ, where dκ=gcd(k1,…,km,q−1). Its eigenvalues admit an explicit description via Weil sums: for each additive character indexed by α∈(Fq)m,
λα,κ,q=dκ1(Wχ(fα,κ)−1),
where Rκ={(xk1,…,xkm):x∈Fq∗}0. This is a direct generalization of the classical GP-graph spectrum. As an application, when the graph is undirected (which requires Rκ={(xk1,…,xkm):x∈Fq∗}1 even, or Rκ={(xk1,…,xkm):x∈Fq∗}2 odd with Rκ={(xk1,…,xkm):x∈Fq∗}3 for all Rκ={(xk1,…,xkm):x∈Fq∗}4), the Ihara zeta function is given explicitly through the Ihara–Bass determinant formula, with circuit rank Rκ={(xk1,…,xkm):x∈Fq∗}5 and eigenvalues expressed entirely in terms of Weil sums. The undirectedness hypothesis is a genuine restriction: the zeta-function results do not cover directed instances of these graphs.
Solution counts via walks and adjacency matrices
The key combinatorial bridge is that an Rκ={(xk1,…,xkm):x∈Fq∗}6-walk from Rκ={(xk1,…,xkm):x∈Fq∗}7 to Rκ={(xk1,…,xkm):x∈Fq∗}8 in Rκ={(xk1,…,xkm):x∈Fq∗}9 corresponds to solutions with non-zero coordinates of the system with right-hand side κ=(k1,…,km)0, with multiplicity exactly κ=(k1,…,km)1:
κ=(k1,…,km)2
From this, three equivalent expressions follow. First, a walk-counting formula:
κ=(k1,…,km)3
Second, an adjacency-matrix formula, κ=(k1,…,km)4. Third, since the adjacency matrix of a Cayley graph is normal, diagonalization converts this into a spectral expression. A recursive relation also holds: the count for κ=(k1,…,km)5 variables reduces to counts with non-zero coordinates for smaller numbers of variables κ=(k1,…,km)6.
A notable structural result connects homogeneous solution counts to the logarithmic expansion of the Ihara zeta function: κ=(k1,…,km)7 is completely determined by the numbers κ=(k1,…,km)8, obtained via binomial inversion between total and strictly non-zero solution counts. Thus prime-cycle data of the graph encode the arithmetic of these diagonal systems.
For homogeneous systems, the count depends only on the spectrum:
κ=(k1,…,km)9
with an equivalent character-sum/Weil-sum form
X1ki+⋯+Xski=βi,1≤i≤m,0
Under the non-degeneracy assumption on all X1ki+⋯+Xski=βi,1≤i≤m,1, this yields the uniform Weil-type bound
X1ki+⋯+Xski=βi,1≤i≤m,2
independent of X1ki+⋯+Xski=βi,1≤i≤m,3. An instructive worked example — the system X1ki+⋯+Xski=βi,1≤i≤m,4, X1ki+⋯+Xski=βi,1≤i≤m,5 over X1ki+⋯+Xski=βi,1≤i≤m,6 — confirms X1ki+⋯+Xski=βi,1≤i≤m,7, exactly the Weil-expected value X1ki+⋯+Xski=βi,1≤i≤m,8, verified simultaneously by the matrix, spectral, and spectral-moment methods. The paper also notes a minor algebraic typo in Theorem 3.3 of Cao–Chou–Gu (2016) concerning the case where both X1ki+⋯+Xski=βi,1≤i≤m,9 and Γ(κ,q)0 are odd, supplying a corrected piecewise formula consistent with their example.
The specialization to Γ(κ,q)1 exploits the fact that the diagonal GP-graph Γ(κ,q)2 is isomorphic to the Hermitian-form graph Γ(κ,q)3 with Γ(κ,q)4, whose spectrum was computed by Stanton. Since Γ(κ,q)5, Theorem on the homogeneous case yields the closed formula (Γ(κ,q)6):
Γ(κ,q)7
where the multiplicities Γ(κ,q)8 are explicit positive integers satisfying a one-term recursion. Two consequences deserve emphasis. First, because Γ(κ,q)9 does not depend on Γ(κ,q)0, computing Γ(κ,q)1 once suffices to obtain solution counts for any number of variables over a fixed field. Second, the same spectrum gives the full Ihara zeta function of the Hermitian-form graph as a rational function. A Weil-type corollary gives Γ(κ,q)2.
Small cases are treated explicitly: for Γ(κ,q)3 the closed formula
Γ(κ,q)4
holds in Γ(κ,q)5; for Γ(κ,q)6 a more involved but still closed expression is given; for Γ(κ,q)7 summation formulas and first values are provided. Closed-form treatment for Γ(κ,q)8 and large Γ(κ,q)9 becomes cumbersome, which the authors acknowledge as evidence of intrinsic complexity rather than a deficiency of the method.
Using a functional equation (q−1)/dκ2 for the generating polynomial (q−1)/dκ3 (with (q−1)/dκ4), the paper derives several strong results:
- Uniform small-(q−1)/dκ5 formulas: (q−1)/dκ6 and (q−1)/dκ7 hold for every (q−1)/dκ8, with analogous expressions for (q−1)/dκ9.
- Two-term recursion valid for all dκ=gcd(k1,…,km,q−1)0: dκ=gcd(k1,…,km,q−1)1.
- Explicit Gaussian-binomial sums: separating parity of dκ=gcd(k1,…,km,q−1)2, dκ=gcd(k1,…,km,q−1)3 equals a finite sum over dκ=gcd(k1,…,km,q−1)4 involving dκ=gcd(k1,…,km,q−1)5-binomial coefficients dκ=gcd(k1,…,km,q−1)6 and factors dκ=gcd(k1,…,km,q−1)7.
Consequently dκ=gcd(k1,…,km,q−1)8 is a monic polynomial in dκ=gcd(k1,…,km,q−1)9 of explicitly known degree α∈(Fq)m0 for even α∈(Fq)m1 and α∈(Fq)m2 for odd α∈(Fq)m3, with lowest-degree term α∈(Fq)m4. This degree structure yields an injectivity result: for fixed α∈(Fq)m5, the map α∈(Fq)m6 is injective on α∈(Fq)m7, so no two distinct Hermitian-form systems (with at least two variables) have the same number of solutions. The proof uses the α∈(Fq)m8-adic valuation to recover α∈(Fq)m9 and monotonicity in λα,κ,q=dκ1(Wχ(fα,κ)−1),0 to recover λα,κ,q=dκ1(Wχ(fα,κ)−1),1.
The divisibility pattern observed in small cases leads the authors to conjecture improved congruences, e.g. λα,κ,q=dκ1(Wχ(fα,κ)−1),2 and λα,κ,q=dκ1(Wχ(fα,κ)−1),3; these remain unproven.
Hypergeometric connection
The final section shows that λα,κ,q=dκ1(Wχ(fα,κ)−1),4 is a terminating basic hypergeometric series, giving
λα,κ,q=dκ1(Wχ(fα,κ)−1),5
Termination is forced by the upper parameter λα,κ,q=dκ1(Wχ(fα,κ)−1),6, so the infinite series truncates at degree λα,κ,q=dκ1(Wχ(fα,κ)−1),7, matching the polynomial exactly. A contiguous relation for λα,κ,q=dκ1(Wχ(fα,κ)−1),8 recovers the two-term recursion, and the sequence λα,κ,q=dκ1(Wχ(fα,κ)−1),9 satisfies a second-order linear Rκ={(xk1,…,xkm):x∈Fq∗}00-difference equation, hence is Rκ={(xk1,…,xkm):x∈Fq∗}01-holonomic. The authors connect this to Stanton's affine Rκ={(xk1,…,xkm):x∈Fq∗}02-Krawtchouk polynomials: within the Rκ={(xk1,…,xkm):x∈Fq∗}03-Askey scheme, those Rκ={(xk1,…,xkm):x∈Fq∗}04 spherical functions degenerate into terminating Rκ={(xk1,…,xkm):x∈Fq∗}05 series, so the hypergeometric representation reflects the underlying association-scheme geometry rather than being incidental.
Limitations and open questions
Several qualifications apply. The Ihara zeta function results require undirectedness, excluding odd-characteristic parameters not dividing Rκ={(xk1,…,xkm):x∈Fq∗}06. The Weil-type bounds require the non-degeneracy assumption on all polynomials Rκ={(xk1,…,xkm):x∈Fq∗}07. The general closed-form and recursion results are specific to the Hermitian-family exponents Rκ={(xk1,…,xkm):x∈Fq∗}08; arbitrary exponent vectors Rκ={(xk1,…,xkm):x∈Fq∗}09 are covered only by the spectral/Weil-sum expressions, which still require evaluating Weil sums. The congruence conjectures for Rκ={(xk1,…,xkm):x∈Fq∗}10 and Rκ={(xk1,…,xkm):x∈Fq∗}11 are supported only by computed data up to moderate Rκ={(xk1,…,xkm):x∈Fq∗}12. Finally, the extension to non-monic coefficient matrices Rκ={(xk1,…,xkm):x∈Fq∗}13 is not addressed here, and the companion treatment of the single-equation case Rκ={(xk1,…,xkm):x∈Fq∗}14 via GP-graphs is deferred to forthcoming work.
Conclusion
The paper establishes that exact solution counts for monic diagonal systems over finite fields can be read off from spectral data of diagonal GP-graphs, provides three interchangeable computational formalisms (walks, adjacency matrices, spectra), and delivers complete closed-form, recursive, and hypergeometric descriptions for the Hermitian-form family for arbitrary numbers of equations and variables. The injectivity theorem and the monic-polynomial structure of Rκ={(xk1,…,xkm):x∈Fq∗}15 are concrete structural outputs, while the divisibility conjectures and the directed/non-Hermitian cases remain open problems directly raised by the framework.