pith. machine review for the scientific record. sign in

arxiv: 2604.25879 · v1 · submitted 2026-04-28 · 💻 cs.SC · math.CO· math.RA

Recognition: unknown

Arboretum.hs: Symbolic manipulation for algebras of graphs

Eugen Bronasco , Jean-Luc Falcone , Gilles Vilmart
Authors on Pith no claims yet

Pith reviewed 2026-05-07 13:39 UTC · model grok-4.3

classification 💻 cs.SC math.COmath.RA
keywords Haskellsymbolic computationalgebras of treesgraph algebrasalgebraic combinatoricsButcher seriesfunctional programming
0
0 comments X

The pith

The Arboretum.hs Haskell package implements symbolic computations for algebras of trees and graphs by making code follow mathematical definitions directly.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces Arboretum.hs as a package for symbolic computations with algebras of trees and more general graphs. It claims that Haskell's declarative functional style lets implementations closely track mathematical definitions, yielding intuitive and transparent code for users in algebraic and combinatorial work. Compared to imperative approaches in Python or Julia, the package supplies more flexibility to add and extend algebraic operations on tree-based structures. It also adds LaTeX rendering for trees and forests and supplies compile-time safety guarantees. The authors position the package as both a practical tool and a base for research in algebraic combinatorics that reaches beyond the tree-only setting common in Butcher-series methods.

Core claim

Arboretum.hs is a Haskell package for symbolic manipulation of algebras of trees and graphs. Its declarative functional implementation follows mathematical definitions closely, enabling easy introduction of new operations, LaTeX rendering of trees and forests, and safe extension of structures with compile-time guarantees.

What carries the argument

The Arboretum.hs package, which encodes algebraic operations on trees and graphs so that Haskell code directly mirrors the corresponding mathematical definitions.

If this is right

  • Researchers can introduce new algebraic operations with minimal friction for experimentation in algebraic combinatorics.
  • Trees and forests can be rendered directly via built-in LaTeX integration.
  • The package supports work on graph algebras that extend past the tree-only cases used in Butcher-series analysis of numerical integrators.
  • Strong compile-time guarantees reduce the risk of runtime errors when manipulating algebraic structures.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same approach could be applied to other combinatorial objects whose algebraic definitions are currently expressed only in imperative code.
  • Integration with existing symbolic or numerical libraries might let users verify Butcher-series identities directly inside the same environment.
  • Because the code stays close to the mathematics, the package could serve as a readable reference implementation for teaching algebraic combinatorics.

Load-bearing premise

The declarative style of functional programming in Haskell causes implementations to follow mathematical definitions closely enough to stay intuitive and transparent for users.

What would settle it

A side-by-side test in which the same new algebraic operation or graph extension is added in Arboretum.hs and in an equivalent Julia or Python library, then checked for code length, readability, ease of extension, and presence of compile-time errors.

Figures

Figures reproduced from arXiv: 2604.25879 by Eugen Bronasco, Gilles Vilmart, Jean-Luc Falcone.

Figure 1
Figure 1. Figure 1: All connected exotic aromatic forests with stolons up to size 3. view at source ↗
read the original abstract

We design the Arboretum$.$hs package for symbolic computations with algebras of trees and more general graphs in Haskell. Thanks to the declarative nature of functional programming, the package's implementation closely follows mathematical definitions, making the code intuitive and transparent for users working with algebraic and combinatorial structures. To assist with current mathematical research, Arboretum$.$hs supports experimentation by facilitating the introduction of new algebraic operations, as well as providing functionality for rendering trees and forests through LaTeX integration. Compared to recent imperative implementations in languages such as Julia or Python, Arboretum$.$hs offers greater flexibility for manipulating and extending tree-based structures. Its use of Haskell enables safe programming and strong compile-time guarantees, serving both as a practical computational tool and a foundation for further research in algebraic combinatorics, beyond the setting of trees usually considered in the implementation of Butcher series, which are a fundamental tool for the analysis of numerical integrators.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript presents Arboretum.hs, a Haskell package for symbolic computations with algebras of trees and more general graphs. It argues that the declarative style of functional programming allows the implementation to closely follow mathematical definitions, yielding intuitive and transparent code for algebraic and combinatorial structures. The package supports experimentation via new algebraic operations, provides LaTeX rendering for trees and forests, and claims greater flexibility and safety than imperative implementations in Julia or Python, along with strong compile-time guarantees. It is positioned as a practical tool and research foundation in algebraic combinatorics, extending beyond the tree structures typical in Butcher series for numerical integrators.

Significance. If the implementation and claims hold, the package could supply a type-safe, extensible environment for researchers working on graph algebras and algebraic combinatorics, lowering barriers to introducing custom operations while ensuring correctness through Haskell's type system. This addresses practical needs in symbolic computation for areas like Butcher series analysis, where safe manipulation of structures is valuable. The emphasis on transparency and LaTeX integration may also aid documentation and collaboration in the field.

major comments (2)
  1. [Abstract] Abstract: The central claim that 'the package's implementation closely follows mathematical definitions, making the code intuitive and transparent' is asserted without any code excerpts, concrete mathematical definitions being mirrored, usage examples, or verification steps. This absence prevents assessment of whether the declarative style actually delivers the promised closeness and usability for algebraic structures.
  2. [Abstract] Abstract: The statement that Arboretum.hs 'offers greater flexibility for manipulating and extending tree-based structures' compared to recent Julia or Python implementations is not supported by any specific examples of operations, extensions, or side-by-side comparisons. Without such evidence, the claimed practical superiority cannot be evaluated.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting areas where the abstract could better substantiate its claims. We respond to each major comment below and indicate the revisions we will make.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The central claim that 'the package's implementation closely follows mathematical definitions, making the code intuitive and transparent' is asserted without any code excerpts, concrete mathematical definitions being mirrored, usage examples, or verification steps. This absence prevents assessment of whether the declarative style actually delivers the promised closeness and usability for algebraic structures.

    Authors: We agree that the abstract, owing to its length constraints, does not contain code excerpts or explicit mirroring examples. The full manuscript supplies these details in the sections describing the core data types and operations, where the Haskell definitions are shown to parallel the algebraic axioms for trees and graphs. To make the abstract more self-contained, we will add a concise illustrative phrase referencing one such correspondence. revision: yes

  2. Referee: [Abstract] Abstract: The statement that Arboretum.hs 'offers greater flexibility for manipulating and extending tree-based structures' compared to recent Julia or Python implementations is not supported by any specific examples of operations, extensions, or side-by-side comparisons. Without such evidence, the claimed practical superiority cannot be evaluated.

    Authors: The abstract summarizes a comparison developed at greater length in the manuscript's introduction and discussion, where the declarative extensibility via type classes is contrasted with imperative approaches. No direct side-by-side listings appear in the abstract itself. We will revise the abstract to include one brief, concrete example of introducing a custom operation, thereby providing immediate support for the flexibility claim. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper presents a software artifact (Haskell package Arboretum.hs) for symbolic manipulation of tree and graph algebras. It contains no equations, derivations, predictions, or fitted parameters that could reduce to prior definitions by construction. Benefits such as declarative style following mathematical definitions, flexibility, and compile-time safety are standard, well-established properties of pure functional programming and the Haskell type system, invoked as design motivations rather than novel results derived within the paper. No self-citations, uniqueness theorems, or ansatzes are load-bearing for any central claim. The work is self-contained as a description of an implementation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The paper describes an implementation of existing algebraic concepts without introducing new free parameters, axioms, or invented entities; all content rests on standard definitions of trees, graphs, and Butcher series from prior literature.

pith-pipeline@v0.9.0 · 5461 in / 1006 out tokens · 48343 ms · 2026-05-07T13:39:43.151297+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

44 extracted references · 2 canonical work pages

  1. [1]

    (2019) Algebraic structure of aromatic B-series

    Bogfjellmo, G. (2019) Algebraic structure of aromatic B-series. Journal of Computational Dynamics. 6(2), 199–222

    2019

  2. [2]

    & Manchon, D

    Bogfjellmo, G., Curry, C. & Manchon, D. (2017) Hamiltonian B-series and a Lie algebra of non-rooted trees. Numerische Mathematik. 135(1), 97–112

    2017

  3. [3]

    (2025) Algebraic structures and numerical methods for invariant measure sampling of Langevin dynamics

    Bronasco, E. (2025) Algebraic structures and numerical methods for invariant measure sampling of Langevin dynamics. Thesis. University of Geneva

    2025

  4. [4]

    (2025) Exotic B-Series and S-Series: Algebraic Structures and Order Conditions for Invariant Measure Sampling

    Bronasco, E. (2025) Exotic B-Series and S-Series: Algebraic Structures and Order Conditions for Invariant Measure Sampling. Foundations of Computational Mathematics. 25(1), 271–301

    2025

  5. [5]

    (2026) arboretum.hs

    Bronasco, E. (2026) arboretum.hs. https://doi.org/10.5281/zenodo.19737034

    work page doi:10.5281/zenodo.19737034 2026

  6. [6]

    & Busnot Laurent, A

    Bronasco, E. & Busnot Laurent, A. (2026) Hopf algebra structures for the backward error analysis of ergodic stochastic differential equations. Numerische Mathematik

    2026

  7. [7]

    & Vilmart, G

    Bronasco, E., Leimkuhler, B., Phillips, D. & Vilmart, G. (2025) Efficient Langevin sampling with position- dependent diffusion. submitted for publication. (arXiv:2501.02943)

    work page arXiv 2025

  8. [8]

    (2000) Runge–Kutta methods and renormalization

    Brouder, Ch. (2000) Runge–Kutta methods and renormalization. The European Physical Journal C - Particles and Fields. 12(3), 521–534

    2000

  9. [9]

    & Zambotti, L

    Bruned, Y., Hairer, M. & Zambotti, L. (2019) Algebraic renormalisation of regularity structures. Inventiones mathematicae. 215(3), 1039–1156

    2019

  10. [10]

    & Burrage, P

    Burrage, K. & Burrage, P. M. (2000) Order Conditions of Stochastic Runge–Kutta Methods by B-Series. SIAM Journal on Numerical Analysis. 38(5), 1626–1646

    2000

  11. [11]

    Butcher, J. C. (1963) Coefficients for the study of Runge-Kutta integration processes.Journal of the Australian Mathematical Society. 3(2), 185–201

    1963

  12. [12]

    Butcher, J. C. (1972) An algebraic theory of integration methods. Math. Comp. 26, 79–106

    1972

  13. [13]

    Butcher, J. C. (2021) B-Series: Algebraic Analysis of Numerical Methods . vol. 55 of Springer Series in Computational Mathematics. Springer International Publishing. Cham

    2021

  14. [14]

    & Manchon, D

    Calaque, D., Ebrahimi-Fard, K. & Manchon, D. (2011) Two interacting Hopf algebras of trees.Advances in Applied Mathematics. 47(2), 282–308

    2011

  15. [15]

    (1857) On the theory of the analytical forms called trees

    Cayley, A. (1857) On the theory of the analytical forms called trees. Philosophical Magazine. 13, 172–176

  16. [16]

    & Livernet, M

    Chapoton, F. & Livernet, M. (2001) Pre-Lie algebras and the rooted trees operad. International Mathematics Research Notices. 2001(8), 395–408

    2001

  17. [17]

    & Vilmart, G

    Chartier, P., Hairer, E. & Vilmart, G. (2010) Algebraic Structures of B-series.Foundations of Computational Mathematics. 10(4), 407–427

    2010

  18. [18]

    & Murua, A

    Chartier, P. & Murua, A. (2007) Preserving first integrals and volume forms of additively split systems.IMA Journal of Numerical Analysis. 27(2), 381–405

    2007

  19. [19]

    & Kreimer, D

    Connes, A. & Kreimer, D. (1998) Hopf Algebras, Renormalization and Noncommutative Geometry.Commu- nications in Mathematical Physics. 199(1), 203–242

    1998

  20. [20]

    & Khoroshkin, A

    Dotsenko, V. & Khoroshkin, A. (2010) Gr ¨obner bases for operads. Duke Mathematical Journal . 153(2), 363–396. 7https://hackage.haskell.org/package/Operads Arboretum.hs: Symbolic manipulation for algebras of graphs 29

    2010

  21. [21]

    & Munthe-Kaas, H

    Fløystad, G., Manchon, D. & Munthe-Kaas, H. Z. (2021) The universal pre-Lie–Rinehart algebras of aromatic trees. Geometric and Harmonic Analysis on Homogeneous Spaces and Applications. Springer International Publishing. pp. 137–159

    2021

  22. [22]

    (2010) Ramification of rough paths

    Gubinelli, M. (2010) Ramification of rough paths. Journal of Differential Equations. 248(4), 693–721

    2010

  23. [23]

    & Wanner, G

    Hairer, E., Lubich, C. & Wanner, G. (2010)Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations. Springer Berlin Heidelberg

    2010

  24. [24]

    Hairer, E., Nørsett, S. P. & Wanner, G. (1993)Solving Ordinary Differential Equations I. vol. 8 of Springer Series in Computational Mathematics. Springer. Berlin, Heidelberg

    1993

  25. [25]

    & Wanner, G

    Hairer, E. & Wanner, G. (1974) On the Butcher group and general multi-value methods.Computing. 13(1), 1–15

    1974

  26. [26]

    (2014) A theory of regularity structures

    Hairer, M. (2014) A theory of regularity structures. Inventiones mathematicae. 198(2), 269–504

    2014

  27. [27]

    & Tse, P

    Iserles, A., Quispel, G. & Tse, P. (2007) B-Series methods cannot be volume-preserving. BIT Numerical Mathematics. 47(2), 351–378

    2007

  28. [28]

    Ketcheson, D. I. & Ranocha, H. (2023) Computing with B-series.ACM Transactions on Mathematical Software. 49(2)

    2023

  29. [29]

    & Vilmart, G

    Laurent, A. & Vilmart, G. (2020) Exotic aromatic B-series for the study of long time integrators for a class of ergodic SDEs. Mathematics of Computation. 89(321), 169–202

    2020

  30. [30]

    & Vilmart, G

    Laurent, A. & Vilmart, G. (2022) Order conditions for sampling the invariant measure of ergodic stochastic differential equations on manifolds. Foundations of Computational Mathematics. 22(3), 649–695

    2022

  31. [31]

    & Vallette, B

    Loday, J.-L. & Vallette, B. (2012) Algebraic Operads. vol. 346 of Grundlehren Der Mathematischen Wissenschaften. Springer. Berlin, Heidelberg

    2012

  32. [32]

    Lyons, T. J. (1998) Differential equations driven by rough signals.Revista Matem´atica Iberoamericana. 14(2), 215–310

    1998

  33. [33]

    (2017) Algebraic graphs with class (functional pearl)

    Mokhov, A. (2017) Algebraic graphs with class (functional pearl). Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell. New York, NY, USA. Association for Computing Machinery. pp. 2–13

    2017

  34. [34]

    (1995) Lie-Butcher theory for Runge-Kutta methods.BIT Numerical Mathematics

    Munthe-Kaas, H. (1995) Lie-Butcher theory for Runge-Kutta methods.BIT Numerical Mathematics. 35(4), 572–587

    1995

  35. [35]

    & Verdier, O

    Munthe-Kaas, H. & Verdier, O. (2016) Aromatic Butcher Series. Foundations of Computational Mathematics. 16(1), 183–215

    2016

  36. [36]

    Munthe-Kaas, H. Z. & Føllesdal, K. K. (2018) Lie–Butcher Series, Geometry, Algebra and Computation. Discrete Mechanics, Geometric Integration and Lie– Butcher Series. Cham. Springer International Publishing. pp. 71–113

    2018

  37. [37]

    Munthe-Kaas, H. Z. & Wright, W. M. (2006) On the Hopf Algebraic Structure of Lie Group Integrators

    2006

  38. [38]

    (2006) The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series

    Murua, A. (2006) The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series. Foundations of Computational Mathematics. 6(4), 387–426

    2006

  39. [39]

    & Guin, D

    Oudom, J.-M. & Guin, D. (2008) On the Lie enveloping algebra of a pre-Lie algebra.Journal of K-Theory. 2(1), 147–167

    2008

  40. [40]

    & Ketcheson, D

    Ranocha, H. & Ketcheson, D. I. (2021) BSeries.jl: Computing with B-series in Julia. https://github.com/ ranocha/BSeries.jl

    2021

  41. [41]

    & Ketcheson, D

    Ranocha, H. & Ketcheson, D. I. (2021) Bseries.py. https://github.com/ketch/BSeries

    2021

  42. [42]

    R¨oßler, A. (2006) Rooted Tree Analysis for Order Conditions of Stochastic Runge-Kutta Methods for the Weak Approximation of Stochastic Differential Equations.Stochastic Analysis and Applications. 24(1), 97–134

    2006

  43. [43]

    Sundklakk, H. S. (2015) A library for computing with trees and B-Series. Master’s thesis. NTNU. Supervisor: B. Owren

    2015

  44. [44]

    Sundklakk, H. S. (2015) pybs. https://github.com/henriksu/pybs

    2015