🔢 mathematics

Differential Recursions, Projective Discriminants, and Algebraic Generating Functions

This paper investigates two hierarchies of bivariate generating functions defined by differential recursions, revealing their connections to palindromic triangles, algebraic equations with specific Galois groups, and projective discriminants, while proposing conjectures on their algebraicity and transcendence.

Original authors: S. Voloshyn

Published 2026-09-28

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: S. Voloshyn

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the vast landscape of mathematics, there is a constant search for patterns hidden within numbers. Imagine a machine that takes a simple rule and, by repeating it over and over, generates a long list of numbers. Often, these lists look chaotic at first, but mathematicians look for a deeper order, a single equation that can describe the entire list without needing to calculate every single number one by one. This is the realm of generating functions, a tool that turns a sequence of numbers into a single, smooth mathematical object. Sometimes, these objects follow strict, predictable rules that allow them to be described by simple algebraic equations, much like the curve of a circle or a parabola. Other times, the rules are so complex that the resulting object becomes "transcendental," meaning it cannot be captured by any finite algebraic equation and behaves in a much wilder, less predictable way. Understanding where the line is drawn between these two behaviors is a central challenge in the field, as it reveals the fundamental limits of how simple rules can create complex structures.

A researcher named S. Voloshyn has recently explored this boundary by studying two specific families of number lists generated by a particular type of repeating rule involving calculus. These rules start with very simple, rational fractions and produce rows of numbers that form distinct triangular shapes. The researcher discovered that these two families, while starting from different rules, are deeply connected and share a hidden geometric structure. One family, called the "self-dual" family, follows a rule that treats its two main variables in a perfectly balanced way. The other, the "reduced" family, follows a slightly different rule that breaks this balance. Surprisingly, the paper shows that despite this difference, the reduced family remains orderly and algebraic for a wide range of cases, while the self-dual family begins to lose this order as the complexity increases.

The investigation begins with the simplest building blocks: the rows of numbers produced by the rules. For the reduced family, these rows form triangles of integers that are perfectly symmetrical or alternating in a precise pattern. The researcher calculated the first few of these triangles and found they matched known sequences in mathematical databases, confirming that these patterns were not random. As the complexity of the rule increases, the numbers in these triangles grow larger and more intricate, but they retain a rigid internal structure. The paper then moves beyond just listing these numbers to finding the single algebraic equation that governs the entire family. For the simplest case, the equation is a familiar square root, but as the complexity rises, the equations become higher-degree polynomials.

A key discovery in the paper is how these two families relate to each other. The researcher found that the reduced family can be broken down into several smaller, simpler components that all share the same underlying geometric shape. One of these components is directly linked to the self-dual family through a specific mathematical operation. This connection acts like a bridge: for the simplest complex case, the bridge is a direct, one-to-one link, meaning the two families are essentially the same. However, as the complexity increases, the bridge becomes a multi-step process. To get from the reduced family to the self-dual family, one must perform a series of integration steps. This explains why the reduced family stays algebraic and orderly, while the self-dual family, which requires these extra steps, begins to drift into the realm of the transcendental, where no simple algebraic equation can describe it.

The paper also uncovers a universal geometric curve that acts as a skeleton for all these families. This curve is defined by a specific relationship between the variables and possesses a high degree of symmetry, meaning it looks the same when rotated or flipped in specific ways. For the simplest cases, this symmetry is obvious, but even as the families become more complex and the lower-level symmetries break down, this universal curve remains. The researcher showed that the "discriminant," a value that tells us about the nature of the solutions to the equations, is built from this universal curve raised to a specific power, multiplied by other factors that account for the breaking of symmetry. This pattern holds true for the cases tested, including those with degrees six, eight, and ten, suggesting a deep, consistent law governing these structures.

The findings are supported by rigorous calculations for specific cases where the complexity is four, five, and six. In these instances, the researcher derived exact algebraic equations and verified them by checking that they satisfied the original differential rules. The solutions to these equations were found to have a specific type of symmetry group, which is the largest possible group for that number of solutions, indicating a high level of complexity and randomness in their arrangement. The paper concludes with a strong suggestion that this pattern continues for all higher levels of complexity: the reduced family will always be algebraic with a specific degree, while the self-dual family will likely become transcendental for higher levels. The work provides a concrete mechanism for how a simple, symmetric rule can evolve into a complex, transcendental one, offering a new perspective on the delicate balance between order and chaos in mathematical structures.

Technical Summary: Differential Recursions, Projective Discriminants, and Algebraic Generating Functions

Problem Statement
This paper investigates two hierarchies of bivariate generating functions, $L(x, h)$ (self-dual) and $F(x, h)$ (reduced), generated by specific differential recursions. These functions arise from coefficient arrays that form rational functions with highly structured, palindromic, or anti-palindromic integer numerator triangles. The central problem is to determine the algebraic nature of these generating functions for arbitrary order $p \geq 2$ , to characterize their underlying geometric structures, and to understand the relationship between the self-dual and reduced hierarchies. The study is motivated by research into the $SU(N)$ Gross–Witten–Wadia (GWW) model, where these structures first appeared in elementary forms.

Methodology
The author employs a multi-layered analytical approach:

Coefficient Analysis: The study begins at the level of coefficient polynomials, explicitly displaying the first rational members and the integer triangles (OEIS A336110 and A140136) for the third-order case ( $p=3$ ).
Horn Decomposition: The reduced hierarchy is decomposed into $q = p-1$ "Horn-type" companions using residue-class decomposition. This transforms the differential recursion into a system of generalized hypergeometric (Horn) equations.
Differential Intertwining: A differential operator of order $p-3$ is constructed to map the normalized self-dual generating function to the last companion of the reduced hierarchy.
Projective Geometry and Resultants: The principal symbols of the differential systems are analyzed to derive a universal characteristic curve $A_p(X, Y)$ . This curve is defined via a resultant and carries a projective $S_3$ action.
Algebraic Verification: For specific cases ( $p=4, 5, 6$ ), the author reconstructs exact algebraic equations (polynomials in the generating function) and verifies them via implicit differentiation. Galois groups are determined using modular specialization and cycle type analysis.
Discriminant Analysis: The discriminants of the derived algebraic equations are factored to identify universal components, including the characteristic covariant and boundary factors.

Key Contributions and Results

Horn Decomposition and the Differential Bridge:
The reduced hierarchy $F_p$ splits into $q$ Horn companions $\Phi_r$ . Crucially, the last companion $\Phi_q$ is related to the self-dual function $L_p$ by an explicit differential intertwiner $D_p$ of order $p-3$ :
$\Phi_q = D_p L_p$
This establishes that the two hierarchies are not independent. At $p=3$ , the intertwiner is the identity ( $D_3=1$ ), meaning the self-dual function is literally one reduced companion. For $p \geq 4$ , the self-dual function requires $p-3$ inverse differential steps (integrations) to reach an algebraic companion.
Universal Characteristic Curve:
All companions share the same principal symbol, leading to a universal characteristic curve defined by the resultant:
$A_p(X, Y) = \text{Res}_a \left( a^p - (-1)^{p-1}X, (1-a)^p - (-1)^{p-1}Y \right)$
This curve is rationally parametrized and admits a projective $S_3$ action. The geometry of this curve persists even when the scalar lower-order symmetry breaks for $p \geq 4$ .
Symmetry Enhancement at $p=3$ :
The case $p=3$ is exceptional. The lower-order Euler polynomials for the $x$ and $h$ operators coincide, restoring full scalar $S_3$ symmetry. The lifted algebraic geometry becomes tetrahedral with group $S_4$ . The self-dual and nonsymmetric sectors are shown to be two different edge representations (pair sums and squared differences) of a single quartic root configuration. The "sextic" equations observed at $p=3$ are resolvents of this underlying quartic field.
Algebraicity and Galois Groups for $p \geq 4$ :
For the reduced hierarchy, the author obtains exact algebraic equations for $p=4$ (degree 6), $p=5$ (degree 8), and a specialization for $p=6$ (degree 10).
- Degrees: The fiber degrees follow the sequence $2(p-1)$ .
- Galois Groups: The generic Galois groups are identified as $S_6$ , $S_8$ , and $S_{10}$ respectively.
- Discriminant Structure: The discriminants factor into a cube of the universal characteristic covariant $A_p^3$ and a square of a lower-order factor $B_p^2$ . The factor $A_p^3$ represents projective ramification, while $B_p^2$ accounts for lower-order symmetry breaking.
Boundary Factorization:
A universal boundary factorization is proposed for the minimal polynomial on the boundary $H=0$ . This explains the degree $2(p-1)$ and the specific monomial powers $x^{(p-1)(p-2)}$ and $H^{(p-2)^2}$ appearing in the discriminants.
Transcendence of the Self-Dual Hierarchy:
While the reduced hierarchy appears algebraic for $p \geq 4$ , the self-dual hierarchy $L_p$ may not be. Since $L_p$ is obtained by integrating an algebraic function (the Horn companion), it represents an "algebraic primitive problem." The author suggests that for $p \geq 4$ , $L_p$ may be transcendental, with the differential intertwiner providing a concrete mechanism for this potential non-algebraicity.

Significance and Claims
The paper claims to unify several seemingly disparate mathematical objects—coefficient triangles, differential recursions, Horn systems, and algebraic generating functions—into a single rigid geometric structure.

It demonstrates that the "exceptional" behavior at low orders ( $p=2, 3$ ) is part of a continuous hierarchy governed by a universal projective characteristic curve.
It provides strong computational evidence (exact equations and Galois group calculations) for the algebraicity of the reduced hierarchy and the specific degree/Galois group conjectures for arbitrary $p$ .
It offers a precise mechanism (the differential bridge) explaining why the self-dual hierarchy might diverge from algebraicity at $p=4$ , contrasting with the robust algebraicity of the reduced family.

The author concludes that the remaining challenge is to replace the computational evidence with a global construction of the reduced algebraic covering and to rigorously prove the transcendence of the self-dual hierarchy for $p \geq 4$ . The results do not claim to solve the GWW model but rather to elucidate the mathematical structures underlying its generating functions.

More like this