Papers for

symbolic computation developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Algorithm computes matrix determinants over rings without division

On computing the determinant over a ring

Abstract: An algorithm is presented for computing the determinant and the characteristic polynomial of a matrix $A$ over an arbitrary commutative ring R. The algorithm uses $O(n^ω)$ ring additions, subtractions and multiplications, where $ω>2$ is a feasible exponent for matrix multiplication, that is, such that two $n\times n$ matrices over R can be multiplied using $O(n^ω)$ ring operations. The algorithm involves no division and no zero test, and its control depends only on $n$: for each $n$ it is a straight-line program. The approach combines a polynomial matrix point of view and a block Krylov point of view on the characteristic polynomial, which makes Strassen's elimination of divisions efficient. A bivariate matrix $λI-L(t)$, obtained from $A$ by a homotopy, is compressed in $\log n$ steps, each of which halves the dimension while only doubling the degree in $λ$. The cost of the homotopy is controlled by truncating the power series in $t$ at an order that only grows with the compression steps, from a constant to $n$.

Thu 5 NovSymbolic ComputationComputational Complexity
The gist
Calculating the determinant of a matrix is key in many math and computer problems, but it can be tricky over general number systems called rings. The authors present an algorithm that computes the determinant and related polynomials purely using additions, subtractions, and multiplications—no division or checking for zeros needed. Their method cleverly reduces the matrix size step-by-step while controlling complexity, making the process efficient and predictable.
Open → 2611.07786v1

Parallel integration method extends to special functions with new certificates

Parallel Integration over Simple Radical Extensions III: Antiderivatives in Terms of Special Functions

Abstract: We extend the parallel integration method for mixed towers of Part~II from elementary antiderivatives to antiderivatives in special functions. The class covered is the incomplete gamma function $Γ(s,\cdot)$ at rational $s$, which contains $\Ei$, $\li$, $\Si$, $\Ci$, $\erf$ and the Fresnel integrals, together with the elliptic integrals $F$, $E$, $Π$. Each special function enters through a \emph{kernel}: a known element of the tower whose antiderivative is that function. It is either fixed by residues or added as one more column of the single linear system, and no Risch differential equation is solved. We prove where kernels can have poles; the $\erf$ kernels live in the sub-critical window of radical towers. The denominator theory, degree bounds and certificates of Part~II carry over, and new criteria decide most places that Part~II leaves to a guess. Elliptic integrals are carried by the radical, and a non-torsion residue divisor becomes a third-kind term. We prove that special functions are introduced only when necessary. Elementary answers are returned unchanged, and in strict mode a special function comes with a certificate that the integrand has no elementary integral. When no complete answer is found, a partial answer with a reduced remainder is returned. All examples are computed by a SymPy implementation and verified by differentiation.

Sat 3 OctSymbolic Computation
The gist
Integration means finding a function whose slope matches a given function, and sometimes the answer uses complex special functions. The authors expand a method that worked for simpler cases so it now includes many special functions like error functions and elliptic integrals. They also create ways to decide when these special functions must appear instead of simpler answers and provide guarantees about the form of these solutions. The method is implemented in software and tested on examples to make sure it works.
Open → 2610.04477v1

Complete reduction method speeds up telescoping in complex sum models

Complete Reductions and Idempotent Representations for $RΠΣ^*$-towers

Abstract: $RΠΣ^*$-extensions form a rich class of difference rings that provide a unified algebraic framework for modeling indefinite nested sums, transcendental products, and nested products over roots of unity structures that frequently appear in combinatorics, number theory, and particle physics. For a large subclass of these extensions whose ring of constants is a field, we introduce a complete reduction approach to resolve the telescoping problem without solving any difference equations. More precisely, we explicitly construct a complement to the subspace of differences over the constant field and develop an algorithm that decomposes any element of the extension into the sum of a difference and a component lying in this complement. Consequently, summability holds if and only if this complementary component is zero. This structural approach yields significant speed-ups for parameterized telescoping and, notably, creative telescoping for deriving linear recurrences of definite sums. Finally, we compute an explicit idempotent representation that extends existing telescoping algorithms and our complete reduction framework to the general class of $RΠΣ^*$-extensions, opening up previously untreatable classes of sums and products.

Mon 21 SeptSymbolic Computation
The gist
The paper deals with a complex math problem of breaking down very complicated sums and products into simpler pieces, a common challenge in combinatorics and physics. The authors present a new way to split these sums without solving difficult equations, making it easier to decide if a sum can be simplified or not. Their approach speeds up calculations that involve finding patterns or recurrences in sums, which can be useful whenever nested sums or products appear. They also extend their method to cover even broader cases that were not manageable before.
Open → 2609.24845v1

Advanced techniques solve complex equations in particle physics calculations

Holonomic techniques for massive 3-loop form factors: the gluonic case

Abstract: Massive three-loop form factors for vector, axial-vector, scalar, and pseudoscalar currents are vital for precision collider phenomenology. Extending the quarkonic framework to the more complex gluonic case, in Ref. (arXiv:2609.22034 [hep-ph]) we computed these contributions widely using advanced computer algebra, automated guessing, and large-scale PSLQ searches. Here, we outline the core strategy of the large-moment method and illustrate its main challenges, including solving record-sized recurrences and differential equations. Our high-precision evaluation provides an exact analytic representation around $s=0$ in terms of MZVs. We achieved a complete analytic series expansion around $s=\pm\infty$ for the first time, which depends on MZVs and three constants out of higher number spaces, along with reliable analytic continuations across $s \in (-\infty, \infty)$, serving as a landmark benchmark for modern symbolic computation.

Mon 21 SeptSymbolic Computation
The gist
Calculations involving how particles like gluons behave are very complex but important for understanding particle collisions precisely. The authors extended previous methods used for quarks to handle the more difficult gluon case using powerful computer tools. They managed to find exact mathematical expressions and series expansions that describe these particles’ behaviors across a wide range of conditions. This work provides a valuable benchmark for future symbolic computations in high-energy physics.
Open → 2609.24279v1

Improved method for integrals with mixed radical extensions in algebraic towers

Parallel Integration over Simple Radical Extensions II: Mixed Towers

Abstract: In Part I we extended the structure theorems underlying the Risch--Norman (parallel Risch) method to a simple radical extension $L=K(y)$, $y^m=q$, of a differential field $K=F(t_1,\dots,t_n)$ closed under the derivation. Here we remove the closure hypothesis: the radical may occupy any position in the tower, so that the derivatives of the generators above it involve $y$ --- the setting of Bronstein's algorithm for mixed elementary functions. The working ring is $\cA=\cO[t_{j+1},\dots,t_n]$, the integral closure of $F[t_1,\dots,t_n]$ in $L$: a Krull domain, free over the polynomial ring on Trager's basis, so that all factorisation remains in a unique factorisation domain. The denominator of the derivation is no longer an element but a divisor $\fd_D$ on $\cA$, and the valuation lemma takes the unified form $v_P(Dg)=v_P(g)-(1+v_P(\fd_D))$ at normal height-one primes, subsuming the shifts $\{1,e_P\}$ of Part I; the proof localises and requires no cancellation analysis. Stability of the class group and the unit group, $\Cl(\cA)\cong\Cl(\cO)$ and $\cA^*=\cO^*$, splits the admissible logands into $S$-units of $\cO$ --- computed by the machinery of Part I --- and irreducible polynomials moving in the upper variables, whose residues must be constants. We prove degree bounds in the top variable and describe the resulting algorithm, which --- unlike the classical parallel method, whose failure proves nothing --- returns certificates of non-elementarity in two situations: a residue outside the constant field, and, when every bound in force is proved, a residue-free remainder that the linear system shows to be non-exact.

Sat 12 SeptSymbolic Computation
The gist
Calculating certain complicated integrals often involves working with nested functions built from roots and other operations. The authors extended previous work to handle cases where the root functions can appear anywhere within these nested towers, a more general and challenging situation. They created a framework that guarantees unique factorization for the algebraic objects involved, which helps properly analyze these integrals. Their method can also prove when no simpler, 'elementary' integral exists, giving a clear certificate instead of just failing silently.
Open → 2609.13643v1