Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

High-precision numerical evaluation of Lauricella functions

T0 review · 4 major / 5 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that Lauricella functions with indices linear in a parameter ε can be evaluated to high precision at arbitrary complex arguments by chaining one-dimensional Frobenius series through a Pfaffian system, with the…

desk verdict Useful new tool for Lauricella functions, but the analytic-continuation claims need verification and the missing comparison table holds it back. read the letter →

arxiv 2502.03276 v1 pith:ZZLCUOZ2 submitted 2025-02-05 hep-th hep-phmath-phmath.MP

M.A. Bezuglov , B.A. Kniehl , A.I. Onishchenko , O.L. Veretin This is my paper · ORCID
classification hep-thhep-phmath-phmath.MP MSC 33C6533C7065D20
keywords LauricellafunctionsFrobeniusmethodanalyticcontinuationepsilonexpansionPfaffiansystemshigh-precisionnumericalevaluationAppellFeynmanintegrals
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper presents a method—implemented in the Mathematica package PrecisionLauricella—for high-precision numerical evaluation of the Lauricella functions $F_A^{(n)}$, $F_B^{(n)}$, and $F_D^{(n)}$ with $n \leq 3$, when the function indices depend linearly on a small parameter $\varepsilon$. The output is a Laurent series in $\varepsilon$, the kind of object one meets when Feynman integrals are expanded in dimensional regularization. The method replaces multi-dimensional hypergeometric sums with one-dimensional Frobenius generalized power series solving the function's Pfaffian differential system along a path, and then patches these series together by analytic continuation through overlapping convergence regions. A second idea is to evaluate the whole chain at several numerical values of $\varepsilon$ and reconstruct the Laurent coefficients by Lagrange interpolation, which makes the computation easy to parallelize. A sympathetic reader would take the central claim to be that this combination yields fast, accurate $\varepsilon$-expansions at arbitrary complex arguments.

What carries the argument

The engine is the Frobenius generalized power series solution of the one-dimensional Pfaffian system $dJ/dt = M_t J$ obtained along the line $x_i = \kappa_i t$. Near a singular point the fundamental solution matrix is expanded as $U = \sum_{\lambda\in S} t^\lambda \sum_{n} \sum_{k=0}^{m_\lambda} c^{(\lambda)}_{n,k} t^n \log^k t$, with recurrence relations for the coefficients $c^{(\lambda)}_{n,k}$; analytic continuation is performed by chaining such expansions through an intersection graph of convergence disks, using a three-quarter-radius overlap criterion and fixed branch cuts, and the $\varepsilon$ dependence is reconstructed by Lagrange interpolation over lattice values of $\varepsilon$ rather than by symbolic expansion of the recurrences.

What would settle it

Take a Lauricella function that reduces to multiple polylogarithms, say $F_1(\tfrac12; 1, \varepsilon; \tfrac32; x, y)$, evaluate it at a point with negative real parts and a tiny imaginary part near a branch cut using the package, and compare with an independent high-precision evaluation from the multiple-polylogarithm representation at the same $\varepsilon$ values; a mismatch in the reported digits would show that the continuation graph or the $+i\delta$ cut convention picked the wrong branch.

Watch

Extended reading notes

Core claim

The central claim is that an $\varepsilon$-expansion of a Lauricella function with indices linear in $\varepsilon$ can be computed at any point of $\mathbb{C}^n$ by four steps: restrict the Pfaffian system to a line $x_i = \kappa_i t$; solve the resulting one-dimensional ordinary differential system by generalized Frobenius series that may contain logarithms; continue the solution from the origin by gluing local series across overlapping disks whose centers are found by a graph search, with branch cuts fixed by a $+i\delta$ convention; and finally evaluate at several small lattice values of $\varepsilon$, reconstructing the Laurent series by interpolation. The authors demonstrate the pipeline on the Appell function $F_1(\tfrac12; 1, \varepsilon; \tfrac32; \tfrac43, \tfrac74)$, reporting 30 digits through order $\varepsilon^3$, and they cross-check such values against multiple-polylogarithm representations.

Load-bearing premise

Everything depends on the assumption that the differential-equation systems the package starts from are complete and correct, and that the automatic path-finding never slips to the wrong branch of the function; if either fails, the package returns a numerical value without an error flag.

Editorial extensions

If this is right

  • The package produces Laurent expansions in $\varepsilon$ for $F_A$, $F_B$, and $F_D$ with $n \leq 3$ at arbitrary complex arguments, to a requested number of $\varepsilon$ terms and decimal places.
  • Because the series are one-dimensional, the method avoids the nested multi-dimensional sums of Mellin–Barnes or re-expansion approaches, which should allow higher precision with comparable or less effort.
  • The interpolation step makes the $\varepsilon$ lattice evaluations independent of one another, so the computation parallelizes across cores and its runtime grows roughly linearly with the number of $\varepsilon$ terms.
  • The same differential-equation-plus-Frobenius machinery extends, in the authors' view, to other hypergeometric families and to Feynman master integrals, where one-dimensional generalized power series valid over kinematic space would facilitate subsequent phase-space integration.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The three-quarter-overlap and grid-density choices are heuristic; a cheap robustness test would be to re-run the same point with a different grid density and use the spread of results as an empirical error bar.
  • Because the method fixes a Riemann sheet by cut conventions, looping the continuation path around a singular locus would let the same machinery read off monodromy transformations numerically, something the paper lists as future work rather than a delivered result.
  • The lattice-step $h$ can be tuned against the Frobenius truncation error through the stated estimate, so an automatic step-selection rule would make the package safer for users who do not know the function's analytic structure.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper presents a numerical method, implemented in a Mathematica package called PrecisionLauricella, for evaluating Lauricella functions whose indices depend linearly on a small parameter ε. The method computes one-dimensional Frobenius generalized power series solutions to Pfaffian differential-equation systems, performs analytic continuation in the argument space via a graph-based chaining of convergence regions, and reconstructs the Laurent expansion in ε by Lagrange interpolation over a small set of numerical ε values rather than by a symbolic expansion. The paper includes one fully worked numerical example for the Appell function F1 and timing tables for several Lauricella and Appell functions.

Significance. If the method is correct and robust, it provides a useful alternative to Mellin–Barnes and multi-dimensional series approaches for high-precision ε-expansions of Lauricella functions, with the practical advantages of one-dimensional series and straightforward parallelization. The ε-interpolation idea is simple and effective, and the availability of the package is a concrete asset. However, the paper does not supply the independent numerical validation that would establish the central claim of high-precision evaluation at arbitrary complex arguments; all displayed examples use real arguments, and the advertised check against multiple polylogarithms is not shown numerically. The analytic-continuation algorithm of Section 3.2 is heuristic, with internal inconsistencies that need to be resolved. The underlying Frobenius machinery is standard, but the paper's contributions—the continuation strategy and the ε-interpolation error estimate—need firmer support.

major comments (4)
  1. [§3.4, Eq. (3.53), and §4] The paper claims an independent check of the F1 example using multiple polylogarithms and tools like HandyG or GiNaC, but no comparison is shown. The only numerical output is Eq. (3.59) for F1 at a real point, and Tables 1–5 report timings only, not accuracy. Since the central claim is high-precision evaluation, the absence of a validation table (including at least one genuinely complex target point) leaves the correctness of the package unestablished. Please add explicit comparisons against independent high-precision values for every function and parameter point presented.
  2. [§3.2] The analytic-continuation description is internally inconsistent and heuristic. The text states that 'In all steps, the corresponding paths will have κ_i ≥ 0' and that 'all the singular points will lie on the real axis', yet the described positive- and negative-imaginary-direction steps require complex κ_i, and footnote 8 correctly notes that complex κ_i rotate the branch cuts after projection onto the t-plane. The 3/4-overlap rule and the grid-refinement-until-a-path-is-found strategy are not proved to cover all of Cn on the principal sheet. Because all displayed target points have real arguments, the complex-sheet behavior is not tested. The continuation path in Figure 4 does use complex expansion centers, which partially exercises the machinery, but a complex target point with an independent verification is still missing.
  3. [§3.3, Eq. (3.51)] The error estimate in Eq. (3.51) appears inconsistent with the four-point interpolation example. With 2n = 4 lattice points and k = 4 expansion terms (ε^0 through ε^3), the exponent 2n − 2⌊k/2⌋ = 0, giving a vacuous bound; the explicit expansions in Eq. (3.50) give O(h^4) for the constant and linear terms and O(h^2) for the quadratic and cubic terms. The general formula needs to be corrected and derived, since it is used to choose the lattice step and to claim a target precision.
  4. [§3.1, Eqs. (3.32)–(3.33)] The recurrence relations for the Frobenius coefficients are stated without derivation, and the solution of the underdetermined homogeneous system (3.33) is described only vaguely: the free parameters 'may either be matched with the matrix t^{A0} or generated randomly'. For a paper whose contribution is a numerical method, this is not a complete algorithmic specification. Please either derive the recurrences and the normalization procedure in detail or provide a precise reference where they are fully documented.
minor comments (5)
  1. [§3.2] There is a typo: 'staring' should be 'starting' in the description of the third step of the continuation procedure.
  2. [§3.4] The package name appears as 'PrecisionLauriecella' in one paragraph; it should be 'PrecisionLauricella'.
  3. [§2, Eq. (2.16)] The definition '|k| = Pn j=1' is missing the summation index and upper limit; it should read '|k| = sum_{j=1}^n k_j'.
  4. [Figure 4 caption] The caption lists the points {0, 9/7 − i, 39/14 − i, 53/14 − i/2} as the centers of convergence regions, but it also says 'Red points denote singularities'. Please clarify which points are singularities and which are expansion centers.
  5. [§3.3] In Eq. (3.48) and surrounding text, the notation for the expansion variable switches between 'ϵ' and 'ε'; please use a single symbol consistently.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the Frobenius-series evaluation and epsilon reconstruction are not equivalent to their inputs; the only self-citation burden is routine reliance on the authors' earlier Pfaffian systems, which is not a circular reduction.

full rationale

The derivation chain is: Pfaffian ODE systems from Ref. [32] -> one-dimensional Frobenius series solutions -> analytic continuation via connection matrices -> evaluation at discrete numerical epsilon points -> Lagrange interpolation to Laurent coefficients. No step reduces to its own output. The epsilon expansion is not fitted: values at epsilon in {±mh} are obtained by solving the ODE system at fixed numerical epsilon, and the Laurent coefficients are then obtained by polynomial interpolation; the target coefficients are not used as boundary conditions. The analytic continuation uses the standard relation U(t) = U'(t)(U'(t_m))^{-1}U(t_m) in overlapping convergence regions, so the gluing matrices are computed from series values, not from the final answer. The Pfaffian systems are a self-citation ('In our work, we utilize pre-derived Pfaffian systems from Ref. [32]'), but they are differential equations for the actual Lauricella functions, one of which (the Appell F1 system) is displayed explicitly; they are not fitted to the Frobenius output and can be checked by substitution. The advertised MPL check is also taken from the authors' own package Diogenes [32], and the actual numerical comparison is not shown ('This will provide us with an independent check'), which weakens the validation; however, the MPL representation is a distinct representation, not the Frobenius-series result by construction. The heuristic graph continuation in Sec. 3.2, including the 3/4-radius overlap rule and +i-delta cut convention, is unproven and has internal tensions (the text says 'in all steps, the corresponding paths will have kappa_i >= 0' while describing imaginary-direction steps, and says 'all the singular points will lie on the real axis' while footnote 8 says complex kappa_i rotate the t-plane cuts); these are correctness risks for wrong-sheet evaluation, not circular reductions. Overall: no prediction is equivalent to its input, so the circularity score is low.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The core method rests on standard Frobenius and analytic-continuation mathematics, on the authors' earlier Pfaffian systems, and on several algorithmic assumptions that are not proven in this paper. No new physical entities are introduced.

free parameters (2)
  • epsilon interpolation lattice step h = 10^{-18} in the 30-digit example
    User-chosen step for the symmetric epsilon lattice in Eq. (3.48); not fitted to target data, but controls the interpolation error in Eq. (3.51).
  • convergence-region overlap threshold = 3/4
    Hand-chosen constant defining graph edges in Section 3.2; the text says the choice is 'somewhat arbitrary'.
assumptions (5)
  • domain assumption The pre-derived Pfaffian systems for F_A, F_B, F_D from Ref. [32] are correct and complete for n up to 3.
    Section 3 uses these systems as input; any error there propagates to all outputs.
  • standard math The Pfaffian systems are Fuchsian at t=0 and the generalized Frobenius ansatz Eq. (3.30) with finite log powers is valid.
    Explicitly assumed at the start of Section 3.1; standard for hypergeometric systems.
  • domain assumption All Lauricella singular points lie on the real axis and the fixed horizontal cut convention with +i delta prescription selects the desired Riemann sheet.
    Section 3.2 relies on this to build paths with kappa_i >= 0; if false, the path construction fails or selects the wrong sheet.
  • ad hoc to paper The interpolation error formula Eq. (3.51) correctly bounds the reconstruction of Laurent coefficients.
    Section 3.3 states the estimate without derivation; it appears inconsistent with the explicit errors in Eq. (3.50).
  • ad hoc to paper The graph-based analytic continuation with the 3/4-overlap rule terminates and covers the whole Cn for the implemented functions.
    Section 3.2 describes a heuristic grid search with no proof of termination or coverage.

how reviews work

0 comments
Cite this review

Pith. "Pith review of High-precision numerical evaluation of Lauricella functions." pith.science (2026). https://pith.science/paper/ZZLCUOZ2

@misc{pith2026250203276,
  author       = {Pith},
  title        = {Pith review of: High-precision numerical evaluation of Lauricella functions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZZLCUOZ2}},
  note         = {Machine review of arXiv:2502.03276}
}
abstract

We present a method for high-precision numerical evaluations of Lauricella functions, whose indices are linearly dependent on some parameter $\varepsilon$, in terms of their Laurent series expansions at zero. This method is based on finding analytic continuations of these functions in terms of Frobenius generalized power series. Being one-dimensional, these series are much more suited for high-precision numerical evaluations than multi-dimensional sums arising in approaches to analytic continuations based on re-expansions of hypergeometric series or Mellin--Barnes integral representations. To accelerate the calculation procedure further, the $\varepsilon$ dependence of the result is reconstructed from the evaluations of given Lauricella functions at specific numerical values of $\varepsilon$, which, in addition, allows for efficient parallel implementation. The method has been implemented in the $\texttt{PrecisionLauricella}$ package, written in Wolfram Mathematica language.

Figures

Figures reproduced from arXiv: 2502.03276 by the authors.

Figure 1
Figure 1. Massless pentagon integral on the left and two-loop sunset on the right. Dashed lines [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. On the left, one of the possible paths with complex singular points is shown. The [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. One-loop triangle with six independent scales. [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: This figure illustrates the path of the analytic continuation of the system in Eq. (3.57) [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: Examples of Feynman integrals on which we tested our method. Dashed lines denote [PITH_FULL_IMAGE:figures/full_fig_p018_5.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. $\texttt{PrecisionLauricella}$: package for numerical computation of Lauricella functions depending on a parameter

    cs.MS 2025-02 conditional novelty 4.0 of 10

    PrecisionLauricella is a Mathematica package that computes epsilon-expansions of Lauricella F_A, F_B, and F_D functions for n up to 3 using Frobenius-series analytic continuation.

Reference graph

Works this paper leans on

94 extracted references · 28 canonical work pages · cited by 1 Pith paper

  1. [1]

    Weinzierl, Feynman Integrals

    S. Weinzierl, Feynman Integrals. 1 2022, 2201.03593

    arXiv 2022

  2. [2]

    Mellin-Barnes Integrals: A Primer on Particle Physics Applications,

    I. Dubovyk, J. Gluza, and G. Somogyi, “Mellin-Barnes Integrals: A Primer on Particle Physics Applications,” Lect. Notes Phys. , vol. 1008, p. pp., 2022, 2211.13733

    arXiv 2022

  3. [3]

    Smirnov, Feynman Integral Calculus

    V. Smirnov, Feynman Integral Calculus. Springer Berlin Heidelberg, 2006

    2006

  4. [4]

    Hypergeometric representation of the two-loop equal mass sunrise dia- gram,

    O. V. Tarasov, “Hypergeometric representation of the two-loop equal mass sunrise dia- gram,” Phys. Lett. B , vol. 638, pp. 195–201, 2006, hep-ph/0603227

    arXiv 2006

  5. [5]

    Space-time dimensionality D as complex variable: Calculating loop integrals using dimensional recurrence relation and analytical properties with respect to D,

    R. N. Lee, “Space-time dimensionality D as complex variable: Calculating loop integrals using dimensional recurrence relation and analytical properties with respect to D,” Nucl. Phys. B , vol. 830, pp. 474–492, 2010, 0911.0252

    arXiv 2010

  6. [6]

    DRA method: Powerful tool for the calculation of the loop integrals,

    R. N. Lee, “DRA method: Powerful tool for the calculation of the loop integrals,” J. Phys. Conf. Ser. , vol. 368, p. 012050, 2012, 1203.4868

    arXiv 2012

  7. [7]

    Functional reduction of one-loop Feynman integrals with arbitrary masses,

    O. V. Tarasov, “Functional reduction of one-loop Feynman integrals with arbitrary masses,” JHEP, vol. 06, p. 155, 2022, 2203.00143

    arXiv 2022

  8. [8]

    On Series and Integral Represen- tations of Some NRQCD Master Integrals,

    M. A. Bezuglov, A. V. Kotikov, and A. I. Onishchenko, “On Series and Integral Represen- tations of Some NRQCD Master Integrals,” JETP Lett., vol. 116, no. 1, pp. 61–69, 2022, 2205.14115

    arXiv 2022

Show all 94 references
  1. [9]

    Non-planar elliptic vertex,

    M. A. Bezuglov and A. I. Onishchenko, “Non-planar elliptic vertex,” JHEP, vol. 04, p. 045, 2022, 2112.05096

    2022 arXiv

  2. [10]

    Hypergeometric Structures in Feynman Integrals,

    J. Bl¨ umlein, M. Saragnese, and C. Schneider, “Hypergeometric Structures in Feynman Integrals,” Ann. Math. Artif. Intell. , vol. 91, pp. 591–649, 2023, 2111.15501

    2023 arXiv

  3. [11]

    Four lectures on Euler integrals,

    S.-J. Matsubara-Heo, S. Mizera, and S. Telen, “Four lectures on Euler integrals,” SciPost Phys. Lect. Notes , vol. 75, p. 1, 2023, 2306.13578

    2023 arXiv

  4. [12]

    Feynman integrals, toric geometry and mirror symmetry,

    P. Vanhove, “Feynman integrals, toric geometry and mirror symmetry,” in KMPB Confer- ence: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory , pp. 415–458, 2019, 1807.11466

    2019 arXiv

  5. [13]

    General theory of hypergeometric functions,

    I. M. Gel’fand, “General theory of hypergeometric functions,” Sov. Math., Dokl. , vol. 33, pp. 573–577, 1986. 22

    1986

  6. [14]

    Hypergeometric functions and toric varieties,

    I. M. Gel’fand, A. V. Zelevinskij, and M. M. Kapranov, “Hypergeometric functions and toric varieties,” Funct. Anal. Appl. , vol. 23, no. 2, pp. 94–106, 1989

    1989

  7. [15]

    Generalized Euler integrals and A-hypergeometric functions ,

    I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, “Generalized Euler integrals and A-hypergeometric functions ,” Adv. Math., vol. 84, no. 2, pp. 255–271, 1990

    1990

  8. [16]

    General hypergeometric systems of equations and series of hypergeometric type,

    I. M. Gelfand, M. I. Graev, and V. Retakh, “General hypergeometric systems of equations and series of hypergeometric type,” Russian Mathematical Surveys, vol. 47, pp. 1–88, 1992

    1992

  9. [17]

    I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, resultants, and multidimensional determinants . Boston, MA: Birkh¨ auser, 1994

    1994

  10. [18]

    Monodromy of a-hypergeometric functions,

    F. Beukers, “Monodromy of a-hypergeometric functions,” 2013, 1101.0493

    2013 arXiv

  11. [19]

    Mellin-Barnes representations of Feynman diagrams, linear systems of differential equations, and polynomial solutions,

    M. Y. Kalmykov and B. A. Kniehl, “Mellin-Barnes representations of Feynman diagrams, linear systems of differential equations, and polynomial solutions,” Phys. Lett. B , vol. 714, pp. 103–109, 2012, 1205.1697

    2012 arXiv

  12. [20]

    Feynman integrals as A-hypergeometric functions,

    L. de la Cruz, “Feynman integrals as A-hypergeometric functions,” JHEP, vol. 12, p. 123, 2019, 1907.00507

    2019 arXiv

  13. [21]

    Hypergeometric Series Representations of Feynman Integrals by GKZ Hy- pergeometric Systems,

    R. P. Klausen, “Hypergeometric Series Representations of Feynman Integrals by GKZ Hy- pergeometric Systems,” JHEP, vol. 04, p. 121, 2020, 1910.08651

    2020 arXiv

  14. [22]

    FeynGKZ: A Mathematica pack- age for solving Feynman integrals using GKZ hypergeometric systems,

    B. Ananthanarayan, S. Banik, S. Bera, and S. Datta, “FeynGKZ: A Mathematica pack- age for solving Feynman integrals using GKZ hypergeometric systems,” Comput. Phys. Commun., vol. 287, p. 108699, 2023, 2211.01285

    2023 arXiv

  15. [23]

    Analytic result for the one-loop scalar pentagon integral with massless propagators,

    B. A. Kniehl and O. V. Tarasov, “Analytic result for the one-loop scalar pentagon integral with massless propagators,” Nucl. Phys. B , vol. 833, pp. 298–319, 2010, 1001.3848

    2010 arXiv

  16. [24]

    Two-loop sunset diagrams with three massive lines,

    B. A. Kniehl, A. V. Kotikov, A. Onishchenko, and O. Veretin, “Two-loop sunset diagrams with three massive lines,” Nucl. Phys. B , vol. 738, pp. 306–316, 2006, hep-ph/0510235

    2006 arXiv

  17. [25]

    HypExp: A Mathematica package for expanding hypergeometric functions around integer-valued parameters,

    T. Huber and D. Maitre, “HypExp: A Mathematica package for expanding hypergeometric functions around integer-valued parameters,” Comput. Phys. Commun. , vol. 175, pp. 122– 144, 2006, hep-ph/0507094

    2006 arXiv

  18. [26]

    HypExp 2, Expanding Hypergeometric Functions about Half- Integer Parameters,

    T. Huber and D. Maitre, “HypExp 2, Expanding Hypergeometric Functions about Half- Integer Parameters,” Comput. Phys. Commun. , vol. 178, pp. 755–776, 2008, 0708.2443

    2008 arXiv

  19. [27]

    XSummer: Transcendental functions and symbolic summation in form,

    S. Moch and P. Uwer, “XSummer: Transcendental functions and symbolic summation in form,” Comput. Phys. Commun. , vol. 174, pp. 759–770, 2006, math-ph/0508008

    2006 arXiv

  20. [28]

    Symbolic expansion of transcendental functions,

    S. Weinzierl, “Symbolic expansion of transcendental functions,” Comput. Phys. Commun. , vol. 145, pp. 357–370, 2002, math-ph/0201011

    2002 arXiv

  21. [29]

    Analytic and Algorithmic Aspects of Gen- eralized Harmonic Sums and Polylogarithms,

    J. Ablinger, J. Bl¨ umlein, and C. Schneider, “Analytic and Algorithmic Aspects of Gen- eralized Harmonic Sums and Polylogarithms,” J. Math. Phys. , vol. 54, p. 082301, 2013, 1302.0378. 23

    2013 arXiv

  22. [30]

    NumExp: Numerical epsilon expansion of hypergeometric func- tions,

    Z.-W. Huang and J. Liu, “NumExp: Numerical epsilon expansion of hypergeometric func- tions,” Comput. Phys. Commun. , vol. 184, pp. 1973–1980, 2013, 1209.3971

    1973 arXiv

  23. [31]

    MultiHypExp: A Mathematica Package For Expanding Multivariate Hypergeo- metric Functions In Terms Of Multiple Polylogarithms,

    S. Bera, “ MultiHypExp: A Mathematica Package For Expanding Multivariate Hypergeo- metric Functions In Terms Of Multiple Polylogarithms,” 6 2023, 2306.11718

    2023 arXiv

  24. [32]

    Expansion of hypergeometric functions in terms of polylogarithms with a nontrivial change of variables,

    M. A. Bezuglov and A. I. Onishchenko, “Expansion of hypergeometric functions in terms of polylogarithms with a nontrivial change of variables,” Theor. Math. Phys. , vol. 219, no. 3, pp. 871–896, 2024, 2312.06242

    2024 arXiv

  25. [33]

    Multiple hypergeometric functions and applications

    H. Exton, “Multiple hypergeometric functions and applications.” Mathematics and Its Ap- plications. Chichester: Ellis Horwood Limited, Publisher; New York etc.: Halsted Press, a division of John Wiley & Sons, Inc. 312 p., 1976

    1976

  26. [34]

    Fonctions hyperg´ eom´ etriques et hypersph´ eriques. Polynˆ omes d’Hermite

    P. Appell and J. Kamp´ e de F´ eriet, “Fonctions hyperg´ eom´ etriques et hypersph´ eriques. Polynˆ omes d’Hermite..” Paris: Gauthier-Villars. vii, 434 p. (1926)., 1926

    1926

  27. [35]

    ¨Uber die hypergeometrische Reihe 1 + α.β 1.γ x + α(α+1)β(β+1) 1.2.γ.(γ+1) x2 + α(α+1)(α+2)β(β+1)(β+2) 1.2.3.γ(γ+1)(γ+2) x3 + · · ·.,

    E. E. Kummer, “ ¨Uber die hypergeometrische Reihe 1 + α.β 1.γ x + α(α+1)β(β+1) 1.2.γ.(γ+1) x2 + α(α+1)(α+2)β(β+1)(β+2) 1.2.3.γ(γ+1)(γ+2) x3 + · · ·.,” J. Reine Angew. Math. , vol. 15, pp. 39–83, 1836

  28. [36]

    Gesammelte mathematische Werke und wissenschaftlicher Nachlass. Heraus- gegeben unter Mitwirkung von R. Dedekind von H. Weber

    B. Riemann, “Gesammelte mathematische Werke und wissenschaftlicher Nachlass. Heraus- gegeben unter Mitwirkung von R. Dedekind von H. Weber..” Leipzig, Teubner (1876)., 1876

  29. [37]

    Hypergeometric functions of two variables,

    A. Erd´ elyi, “Hypergeometric functions of two variables,”Acta Math., vol. 83, pp. 131–164, 1950

    1950

  30. [38]

    Integration of the partial differential equations for the hypergeometric functions F1 and FD of two and more variables,

    P. O. M. Olsson, “Integration of the partial differential equations for the hypergeometric functions F1 and FD of two and more variables,” J. Math. Phys. , vol. 5, pp. 420–430, 1964

    1964

  31. [39]

    Olsson.wl: A Mathematica Package for the Computation of Linear Transformations of Multivariable Hypergeometric Func- tions,

    B. Ananthanarayan, S. Bera, S. Friot, and T. Pathak, “Olsson.wl: A Mathematica Package for the Computation of Linear Transformations of Multivariable Hypergeometric Func- tions,” Springer Proc. Phys. , vol. 304, pp. 738–740, 2024

    2024

  32. [40]

    Analytic continuations and numerical evaluation of the Appell F1, F3, Lauricella FD(3) and Lauricella-Saran FS(3) and their application to Feynman integrals,

    S. Bera and T. Pathak, “Analytic continuations and numerical evaluation of the Appell F1, F3, Lauricella FD(3) and Lauricella-Saran FS(3) and their application to Feynman integrals,” Comput. Phys. Commun. , vol. 306, p. 109386, 2025, 2403.02237

    2025 arXiv

  33. [41]

    Analytic continuation of appell’s hypergeometric series f 2 to the vicinity of the singular point x= 1, y= 1,

    G. Hahne, “Analytic continuation of appell’s hypergeometric series f 2 to the vicinity of the singular point x= 1, y= 1,” Journal of Mathematical Physics , vol. 10, no. 3, pp. 524–531, 1969

    1969

  34. [42]

    Analytic continuation formulas and Jacobi-type relations for Lauricella function,

    S. I. Bezrodnykh, “Analytic continuation formulas and Jacobi-type relations for Lauricella function,” Dokl. Math. , vol. 93, no. 2, pp. 129–134, 2016

    2016

  35. [43]

    On the analytic continuation of the Lauricella function F (N ) D ,

    S. I. Bezrodnykh, “On the analytic continuation of the Lauricella function F (N ) D ,” Math. Notes, vol. 100, no. 2, pp. 318–324, 2016

    2016

  36. [44]

    Analytic continuation of the appell function f 1 and integration of the associated system of equations in the logarithmic case,

    S. I. Bezrodnykh, “Analytic continuation of the appell function f 1 and integration of the associated system of equations in the logarithmic case,” Computational Mathematics and Mathematical Physics, vol. 57, pp. 559–589, 2017. 24

    2017

  37. [45]

    Analytic continuation of the Lauricella function F (N ) D with arbitrary number of variables,

    S. I. Bezrodnykh, “Analytic continuation of the Lauricella function F (N ) D with arbitrary number of variables,” Integral Transforms Spec. Funct., vol. 29, no. 1, pp. 21–42, 2018

    2018

  38. [46]

    Analytic continuation of Lauricella’s functions F (N ) A , F(N ) B and F (N ) D ,

    S. I. Bezrodnykh, “Analytic continuation of Lauricella’s functions F (N ) A , F(N ) B and F (N ) D ,” Integral Transforms Spec. Funct., vol. 31, no. 11, pp. 921–940, 2020

    2020

  39. [47]

    The Lauricella hypergeometric function F (N ) D , the Riemann-Hilbert prob- lem, and some applications,

    S. I. Bezrodnykh, “The Lauricella hypergeometric function F (N ) D , the Riemann-Hilbert prob- lem, and some applications,” Russ. Math. Surv. , vol. 73, no. 6, pp. 941–1031, 2018

    2018

  40. [48]

    HYPERDIRE, HYPERgeometric func- tions DIfferential REduction: MATHEMATICA-based packages for differential reduction of generalized hypergeometric functions pFp−1, F1,F2,F3,F4,

    V. V. Bytev, M. Y. Kalmykov, and B. A. Kniehl, “HYPERDIRE, HYPERgeometric func- tions DIfferential REduction: MATHEMATICA-based packages for differential reduction of generalized hypergeometric functions pFp−1, F1,F2,F3,F4,” Comput. Phys. Commun. , vol. 184, pp. 2332–2342, 201...

    2013 arXiv

  41. [49]

    V. V. Bytev and B. A. Kniehl, “HYPERDIRE HYPERgeometric functions DIfferential REduction: Mathematica-based packages for the differential reduction of generalized hy- pergeometric functions: Horn-type hypergeometric functions of two variables,” Comput. Phys. Commun. , vol. 189...

    2015 arXiv

  42. [50]

    V. V. Bytev, M. Y. Kalmykov, and S.-O. Moch, “HYPERgeometric functions DIfferential REduction (HYPERDIRE): MATHEMATICA based packages for differential reduction of generalized hypergeometric functions: FD and FS Horn-type hypergeometric functions of three variables,” Comput. P...

    2014 arXiv

  43. [51]

    V. V. Bytev and B. A. Kniehl, “HYPERDIRE—HYPERgeometric functions DIfferential REduction: Mathematica-based packages for the differential reduction of generalized hyper- geometric functions: Lauricella function Fc of three variables,” Comput. Phys. Commun. , vol. 206, pp. 78–8...

    2016 arXiv

  44. [52]

    Numerical evaluation of appell’s f1 hypergeometric function,

    F. D. Colavecchia, G. Gasaneo, and J. E. Miraglia, “Numerical evaluation of appell’s f1 hypergeometric function,” Computer physics communications , vol. 138, no. 1, pp. 29–43, 2001

    2001

  45. [53]

    f1: a code to compute appell’s f1 hypergeometric func- tion,

    F. Colavecchia and G. Gasaneo, “f1: a code to compute appell’s f1 hypergeometric func- tion,” Computer Physics Communications , vol. 157, no. 1, pp. 32–38, 2004

    2004

  46. [54]

    On the evaluation of the Appell F2 double hypergeometric function,

    B. Ananthanarayan, S. Bera, S. Friot, O. Marichev, and T. Pathak, “On the evaluation of the Appell F2 double hypergeometric function,” Comput. Phys. Commun. , vol. 284, p. 108589, 2023, 2111.05798

    2023 arXiv

  47. [55]

    Sulle funzioni ipergeometriche a piu variabili,

    G. Lauricella, “Sulle funzioni ipergeometriche a piu variabili,” Rendiconti del Circolo Matematico di Palermo , vol. 7, pp. 111–158, 1893

  48. [56]

    Bateman, Higher transcendental functions [volumes i-iii] , vol

    H. Bateman, Higher transcendental functions [volumes i-iii] , vol. 1. McGRA W-HILL book company, 1953

    1953

  49. [57]

    Iwasaki, H

    K. Iwasaki, H. Kimura, S. Shimomura, and M. Yoshida, From Gauß to Painlev´ e. A modern theory of special functions. Dedicated to Tosihusa Kimura on the occasion of his sixtieth birthday, vol. E16 of Aspects Math. Braunschweig: Friedr. Vieweg & Sohn, 1991. 25

    1991

  50. [58]

    Aomoto and M

    K. Aomoto and M. Kita, Theory of hypergeometric functions. With an appendix by Toshitake Kohno. Springer Monogr. Math., Berlin: Springer, 2011

    2011

  51. [59]

    Multiple Hypergeometric Series: Appell Series and Beyond,

    M. J. Schlosser, “Multiple Hypergeometric Series: Appell Series and Beyond,” in LHCPhe- noNet School: Integration, Summation and Special Functions in Quantum Field Theory , pp. 305–324, 2013, 1305.1966

    2013 arXiv

  52. [60]

    Polylogarithms and physical applications,

    C. Vergu, “Polylogarithms and physical applications,” Notes for the Summer School “Poly- logarithms as a Bridge between Number Theory and Particle Physics , 2013

    2013

  53. [61]

    Multiple polylogarithms, cyclotomy and modular complexes,

    A. B. Goncharov, “Multiple polylogarithms, cyclotomy and modular complexes,” Mathe- matical Research Letters, vol. 5, pp. 497–516, 1998

    1998

  54. [62]

    Multiple polylogarithms and mixed tate motives,

    A. B. Goncharov, “Multiple polylogarithms and mixed tate motives,” arXiv preprint math/0103059, 2001

    2001 arXiv

  55. [63]

    On hypergeometric functions of two variables.,

    P. Appell, “On hypergeometric functions of two variables.,”Resal J. (3), vol. 8, pp. 173–216, 1882

  56. [64]

    On the convergence of hypergeometric series of two and three variables.,

    J. Horn, “On the convergence of hypergeometric series of two and three variables.,” Math. Ann., vol. 34, pp. 577–600, 1889

  57. [65]

    GKZ hypergeometric structures,

    J. Stienstra, “GKZ hypergeometric structures,” in Instanbul 2005: CIMPA Summer School on Arithmetic and Geometry Around Hypergeometric Functions , 11 2005, math/0511351

    2005 arXiv

  58. [66]

    ¨Uber den Zusammenhang zwischen den linearen Differential- und Differenzen- gleichungen.,

    H. Mellin, “ ¨Uber den Zusammenhang zwischen den linearen Differential- und Differenzen- gleichungen.,” Acta Math., vol. 25, pp. 139–164, 1901

    1901

  59. [67]

    Coddington and N

    A. Coddington and N. Levinson, Theory of Ordinary Differential Equations . International series in pure and applied mathematics, R.E. Krieger, 1984

    1984

  60. [68]

    Three lectures on hypergeometric functions,

    E. Cattani, “Three lectures on hypergeometric functions,” 2006

    2006

  61. [69]

    Saito, B

    M. Saito, B. Sturmfels, and N. Takayama, Gr¨ obner deformations of hypergeometric differ- ential equations, vol. 6 of Algorithms Comput. Math. Berlin: Springer, 2000

    2000

  62. [70]

    D-modules and holonomic functions,

    A.-L. Sattelberger and B. Sturmfels, “D-modules and holonomic functions,” 2019, 1910.01395

    2019 arXiv

  63. [71]

    Advanced applications of the holonomic systems approach,

    C. Koutschan, “Advanced applications of the holonomic systems approach,” ACM Com- mun. Comput. Algebra , vol. 43, p. 119, jun 2010

    2010

  64. [72]

    On the computation of finite bottom-quark mass effects in Higgs boson production,

    R. Mueller and D. G. ¨Ozt¨ urk, “On the computation of finite bottom-quark mass effects in Higgs boson production,” JHEP, vol. 08, p. 055, 2016, arXiv:1512.08570

    2016 arXiv

  65. [73]

    Two-loop gg → Hg amplitude mediated by a nearly massless quark,

    K. Melnikov, L. Tancredi, and C. Wever, “Two-loop gg → Hg amplitude mediated by a nearly massless quark,” JHEP, vol. 11, p. 104, 2016, arXiv:1610.03747

    2016 arXiv

  66. [74]

    Three-loop massive tadpoles and poly- logarithms through weight six,

    B. A. Kniehl, A. F. Pikelner, and O. L. Veretin, “Three-loop massive tadpoles and poly- logarithms through weight six,” JHEP, vol. 08, p. 024, 2017, arXiv:1705.05136. 26

    2017 arXiv

  67. [75]

    Solving differential equations for Feynman integrals by expansions near singular points,

    R. N. Lee, A. V. Smirnov, and V. A. Smirnov, “Solving differential equations for Feynman integrals by expansions near singular points,”JHEP, vol. 03, p. 008, 2018, arXiv:1709.07525

    2018 arXiv

  68. [76]

    Evaluating ‘elliptic’ master integrals at special kinematic values: using differential equations and their solutions via expansions near singular points,

    R. N. Lee, A. V. Smirnov, and V. A. Smirnov, “Evaluating ‘elliptic’ master integrals at special kinematic values: using differential equations and their solutions via expansions near singular points,” JHEP, vol. 07, p. 102, 2018, arXiv:1805.00227

    2018 arXiv

  69. [77]

    Two-loop dia- grams in non-relativistic QCD with elliptics,

    B. A. Kniehl, A. V. Kotikov, A. I. Onishchenko, and O. L. Veretin, “Two-loop dia- grams in non-relativistic QCD with elliptics,” Nucl. Phys. , vol. B948, p. 114780, 2019, arXiv:1907.04638

    2019 arXiv

  70. [78]

    Generalised power series expansions for the elliptic planar families of Higgs + jet production at two loops,

    F. Moriello, “Generalised power series expansions for the elliptic planar families of Higgs + jet production at two loops,” JHEP, vol. 01, p. 150, 2020, 1907.13234

    2020 arXiv

  71. [79]

    Evaluating a family of two-loop non-planar master inte- grals for Higgs + jet production with full heavy-quark mass dependence,

    R. Bonciani, V. Del Duca, H. Frellesvig, J. M. Henn, M. Hidding, L. Maestri, F. Moriello, G. Salvatori, and V. A. Smirnov, “Evaluating a family of two-loop non-planar master inte- grals for Higgs + jet production with full heavy-quark mass dependence,” JHEP, vol. 01, p. 132, 2...

    2020 arXiv

  72. [80]

    The complete set of two-loop master integrals for Higgs + jet production in QCD,

    H. Frellesvig, M. Hidding, L. Maestri, F. Moriello, and G. Salvatori, “The complete set of two-loop master integrals for Higgs + jet production in QCD,” JHEP, vol. 06, p. 093, 2020, 1911.06308

    2020 arXiv

  73. [81]

    DiffExp, a Mathematica package for computing Feynman integrals in terms of one-dimensional series expansions,

    M. Hidding, “DiffExp, a Mathematica package for computing Feynman integrals in terms of one-dimensional series expansions,” Comput. Phys. Commun. , vol. 269, p. 108125, 2021, 2006.05510

    2021 arXiv

  74. [82]

    Feynman Integrals in Dimen- sional Regularization and Extensions of Calabi-Yau Motives,

    K. B¨ onisch, C. Duhr, F. Fischbach, A. Klemm, and C. Nega, “Feynman Integrals in Dimen- sional Regularization and Extensions of Calabi-Yau Motives,” 8 2021, arXiv:2108.05310

    2021 arXiv

  75. [83]

    Evaluation of Feynman integrals with arbitrary complex masses via series expansions,

    T. Armadillo, R. Bonciani, S. Devoto, N. Rana, and A. Vicini, “Evaluation of Feynman integrals with arbitrary complex masses via series expansions,” Comput. Phys. Commun. , vol. 282, p. 108545, 2023, 2205.03345

    2023 arXiv

  76. [84]

    Macaulay matrix for Feynman integrals: linear relations and intersection numbers,

    V. Chestnov, F. Gasparotto, M. K. Mandal, P. Mastrolia, S. J. Matsubara-Heo, H. J. Munch, and N. Takayama, “Macaulay matrix for Feynman integrals: linear relations and intersection numbers,” JHEP, vol. 09, p. 187, 2022, 2204.12983

    2022 arXiv

  77. [85]

    D-module techniques for solving dif- ferential equations in the context of Feynman integrals,

    J. Henn, E. Pratt, A.-L. Sattelberger, and S. Zoia, “D-module techniques for solving dif- ferential equations in the context of Feynman integrals,” Lett. Math. Phys. , vol. 114, no. 3, p. 87, 2024, 2303.11105

    2024 arXiv

  78. [86]

    Numerical evaluation of multiple polylogarithms,

    J. Vollinga and S. Weinzierl, “Numerical evaluation of multiple polylogarithms,” Comput. Phys. Commun. , vol. 167, p. 177, 2005, hep-ph/0410259

    2005 arXiv

  79. [87]

    handyG —Rapid numerical evaluation of generalised polylogarithms in Fortran,

    L. Naterop, A. Signer, and Y. Ulrich, “handyG —Rapid numerical evaluation of generalised polylogarithms in Fortran,” Comput. Phys. Commun., vol. 253, p. 107165, 2020, 1909.01656

    2020 arXiv

  80. [88]

    The monodromy representation of Lauricella’s hypergeometric function FC,

    Y. Goto, “The monodromy representation of Lauricella’s hypergeometric function FC,” Ann. Sc. Norm. Super. Pisa, Cl. Sci. (5) , vol. 16, no. 4, pp. 1409–1445, 2016. 27

    2016

  81. [89]

    Monodromy representations of hypergeometric systems with respect to fundamental series solutions,

    K. Matsumoto, “Monodromy representations of hypergeometric systems with respect to fundamental series solutions,” Tˆ ohoku Math. J. (2), vol. 69, no. 4, pp. 547–570, 2017

    2017

  82. [90]

    Lauricella’s FC with finite irreducible monodromy group,

    Y. Goto, “Lauricella’s FC with finite irreducible monodromy group,” J. Math. Soc. Japan , vol. 74, no. 1, pp. 151–175, 2022

    2022

  83. [91]

    Normalizing Flows for Probabilistic Modeling and Inference,

    G. Papamakarios, E. Nalisnick, D. J. Rezende, S. Mohamed, and B. Lakshminarayanan, “Normalizing Flows for Probabilistic Modeling and Inference,” J. Machine Learning Res. , vol. 22, no. 1, pp. 2617–2680, 2021, 1912.02762

    2021 arXiv

  84. [92]

    i-flow: High-dimensional Integration and Sampling with Normalizing Flows,

    C. Gao, J. Isaacson, and C. Krause, “i-flow: High-dimensional Integration and Sampling with Normalizing Flows,” Mach. Learn. Sci. Tech., vol. 1, no. 4, p. 045023, 2020, 2001.05486

    2020 arXiv

  85. [93]

    Adaptive monte carlo augmented with normalizing flows,

    M. Gabri´ e, G. M. Rotskoff, and E. Vanden-Eijnden, “Adaptive monte carlo augmented with normalizing flows,” Proceedings of the National Academy of Sciences, vol. 119, no. 10, p. e2109420119, 2022, https://www.pnas.org/doi/pdf/10.1073/pnas.2109420119

    2022 doi

  86. [94]

    PrecisionLauricella: package for numerical computation of Lauricella functions depending on a parameter,

    M. Bezuglov, B. Kniehl, A. Onishchenko, and O. Veretin, “PrecisionLauricella: package for numerical computation of Lauricella functions depending on a parameter,” to appear, 2025. 28

    2025

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.