Search arXivSearch

arXiv · 2608.29482

Parallel Integration over Simple Radical Extensions

Abstract

The parallel Risch (Risch--Norman) method is a fast heuristic for computing elementary integrals over towers of transcendental extensions. Its justification rests on two structural facts about the integral: a bound on its denominator and a description of the logarithms that can occur. Both are known for purely logarithmic towers (Davenport--Trager) and, in the form of a structure theorem, for arbitrary derivations on multivariate rational function fields (Bronstein). We extend both facts to a simple radical extension $L=K(y)$, $y^m=q$, of such a field. The key observations are that the integral closure of $F[t_1,\dots,t_n]$ in $L$ has an explicit basis, so that all factorisation can remain in a polynomial ring, and that the derivation has a well-defined pole order $δ_P\in\{0,1,e_P\}$ at every height-one prime $P$, so that pole orders of derivatives shift by $δ_P$. The denominator of the integral then has the same Hermite-type shape as in the transcendental case, while the admissible logands are precisely the $S$-units of the integral closure for an explicit finite set $S$ of primes; the latter can be larger than the set generated by irreducible polynomials, as the unit $x+\sqrt{x^2+1}$ shows. For $n=1$ we relate these $S$-units to torsion in the Jacobian and, for $m=2$, to the polynomial Pell equation, obtaining a complete description of the logarithmic part in genus~0. We describe the resulting algorithm and give examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Sam Blake. 2026-09-04. Parallel Integration over Simple Radical Extensions. https://arxiv.org/abs/2608.29482

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Recurrences for permutations with long increasing subsequences

We prove two simple bivariate recurrences for the number of permutations with a long increasing subsequence. The two recurrences imply D-finiteness of the sequence in a certain range. As a consequence, we also obtain a proof of a conjecture posed by Kauers and Koutschan in 2023.

math.CO

Towards a universal language of concepts: A survey

Humans can learn and generalize novel concepts from sparse data because they express knowledge in rich structural formats. In this paper, we propose that programs are a strong candidate for universal representation of concepts. We review computational models of concept learning that use programs as their concept representation and evaluate their contribution toward a universal representational language.

cs.AI