Exhaustive Symbolic Integration: Integration by Differentiation and the Landscape of Symbolic Integrability
Harry Desmond

TL;DR
This paper presents Exhaustive Symbolic Integration (ESI), a comprehensive method for enumerating and analyzing symbolic integrability across various operator bases, revealing how operator choices influence integrability and discovering new integrable forms.
Contribution
The paper introduces ESI, a systematic enumeration approach to assess symbolic integrability, and demonstrates its effectiveness in identifying integrable functions and challenging existing computer algebra systems.
Findings
The integrability fraction declines as complexity increases.
Adding logarithms significantly increases the integrability fraction.
ESI identifies integrals that resist standard computer algebra systems.
Abstract
We introduce Exhaustive Symbolic Integration (ESI), a method that enumerates all symbolic functions up to a given complexity within a specified operator basis and determines which admit closed-form antiderivatives within the same class. This allows us to compute the "integrability fraction" (the fraction of functions whose derivatives lie within the same class), which we do for five operator bases including combinations of rational functions, powers, exponentials, logarithms and trigonometric functions. We find that declines at high complexity and that the operator basis has a dramatic effect -- in particular, adding the logarithm boosts by a factor of 3 and produces or exacerbates a clear peak at . We also deploy ESI as a novel integration algorithm, identifying three integrals that resist SymPy, Mathematica, RUBI, FriCAS, Maxima and Giac…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
