Pith. sign in

REVIEW 4 major objections 5 minor 62 references

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

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

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

Pith's one-line read PrecisionLauricella, a Mathematica package, computes high-precision Laurent expansions in a parameter ε for Lauricella functions FA, FB, and FD in up to three variables at arbitrary complex argument values, using analytic continuation via…

desk verdict A real Mathematica package for epsilon-expansions of Lauricella functions, but the paper's accuracy claim is asserted rather than shown. read the letter →

arxiv 2502.07935 v1 pith:UEY422JC submitted 2025-02-11 cs.MS cs.NAhep-phhep-thmath.NA

M.A. Bezuglov , B.A. Kniehl , A.I. Onishchenko , O.L. Veretin This is my paper · ORCID
classification cs.MScs.NAhep-phhep-thmath.NA MSC 33C6565D2033C70
keywords LauricellafunctionsepsilonexpansionFrobeniusmethodanalyticcontinuationPfaffiansystemhigh-precisioncomputationMathematicapackage
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

PrecisionLauricella is a Mathematica package for numerically expanding Lauricella functions $F_A^{(n)}$, $F_B^{(n)}$, and $F_D^{(n)}$ with $n \leq 3$ in Laurent series in a small parameter $\varepsilon$, given that all function indices depend linearly on $\varepsilon$. The paper's central claim is that Frobenius generalized power series, continued analytically along paths through the argument space, produce these expansions to user-selected precision at arbitrary argument values, including points outside the series' convergence domains. This makes the package an alternative to multidimensional series summation and Mellin–Barnes integral representations, which become expensive when many digits are required. If the claim is correct, the package offers a practical tool for high-precision $\varepsilon$-expansions, with runtime growing linearly in the number of expansion terms.

What carries the argument

The mechanical core is the Pfaffian system, a first-order system $dJ = (M_x dx + M_y dy) J$ for a vector $J$ of $\theta$-derivatives of the Lauricella function, together with the path ansatz $x_i = \kappa_i t$, which reduces it to a single-variable system $dJ/dt = M(t)J$. Solutions are written as Frobenius series $U = \sum_{\lambda\in S} t^\lambda \sum_{n=0}^\infty \sum_{k=0}^{m_\lambda} c_n(\lambda,k) t^n \log^k t$, with exponents determined by eigenvalues of the leading matrix $A_0 = \lim_{t\to 0} tM(t)$ and logarithmic terms appearing when eigenvalues differ by integers. The continuation is organized by an intersection graph of circular convergence regions, with branch cuts handled by treating regions on opposite sides as disjoint; the package finds a path through the graph and multiplies the fundamental solution matrices along it. Finally, the $\varepsilon$-lattice approach with Lagrange interpolation reconstructs the Laurent series coefficients in $\varepsilon$ from independent evaluations.

What would settle it

Pick a target point where the package's analytic continuation requires several overlapping regions and compare its output at 200 digits with an independent high-precision evaluation from a Mellin–Barnes representation or a known polylogarithmic expression; any disagreement larger than the paper's stated error bound would refute the claim of arbitrary-argument correctness. A second check targets the path-existence assumption: attempt a point on a branch cut with both DeltaPrescription → +I and → −I and verify the two results are the appropriate branches of the same analytic function.

Watch

Extended reading notes

Core claim

The central discovery is that a single package can automate the entire pipeline: construct a Pfaffian system for the chosen Lauricella function, restrict it to a line $x_i = \kappa_i t$ through the origin, solve the resulting one-dimensional system by Frobenius generalized power series in overlapping circular regions, and chain those solutions along a path from the origin to the target point. The $\varepsilon$-dependence is handled by evaluating the whole chain on a lattice of numerical $\varepsilon$ values and reconstructing the Laurent coefficients by Lagrange interpolation, which is why the computation parallelizes and why the runtime grows linearly with the number of terms. The paper demonstrates the approach on $F_A^{(n)}$, $F_B^{(n)}$, and $F_D^{(n)}$ for $n \le 3$, reporting accuracy at 20, 100, and 200 digits and comparing where possible with existing tools.

Load-bearing premise

The method assumes that the one-dimensional Frobenius-series solutions really continue the Lauricella function to the requested target point, and specifically that a continuation path with all direction coefficients $\kappa_i$ real and non-negative exists; the paper takes this existence condition from its companion work and does not prove or test it.

Editorial extensions

If this is right

  • Users can request Laurent expansions of $F_A$, $F_B$, and $F_D$ for $n\le 3$ at arbitrary complex argument values to a specified number of digits without implementing multi-dimensional summation or Mellin–Barnes integration themselves.
  • The cost of adding more terms in the $\varepsilon$-expansion grows linearly, so deep expansions (for example ten terms or more) remain practical on a laptop, as the paper's benchmark timings show.
  • Because each $\varepsilon$ lattice point is evaluated independently, the computation parallelizes across available cores; the paper reports timings with 8 and 16 kernels.
  • The package's error estimate $\max\{h^{2n-2\lfloor k/2\rfloor}, \Delta_{\mathrm{Frob}}\}$ gives a user-controllable trade-off between lattice step size, expansion depth, and achievable precision.
  • Where independent tools exist (Appell F2, Appell F1/F3, Lauricella FD(3)), the paper reports agreement, so users can reuse the package as a cross-check for other hypergeometric computations.

Reading between the lines

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

  • If the same Frobenius-path machinery extends to higher $n$ or to other Horn-type hypergeometric families, it could replace Mellin–Barnes integration for a broader class of Feynman-integral master integrals; the package currently stops at $n=3$.
  • The $\varepsilon$-lattice reconstruction implies the method's accuracy at fixed $\varepsilon$-order is limited by the Lagrange interpolation step; a natural test is to compare the reconstructed Laurent coefficients against a direct $\varepsilon$-expansion of the Pfaffian matrices, which the paper does not report.
  • The path-existence condition on $\kappa_i$ is the least tested input; a systematic scan over random target points would show whether 'arbitrary argument values' holds in practice or only for points reachable by the graph-search heuristic.
  • The reported linear runtime in $\varepsilon$-order suggests that the Frobenius truncation order, not the number of $\varepsilon$ terms, will dominate wall-clock time at very high digit counts; users may need to raise InternalPrecision to keep the final digits stable.
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 introduces PrecisionLauricella, a Wolfram Mathematica package for high-precision numerical evaluation of the Lauricella functions F_A, F_B, and F_D with n ≤ 3 and parameters depending linearly on a small parameter ε. The package computes Laurent expansions in ε about ε = 0 at user-specified argument values and precision. The method relies on analytic continuation via Frobenius generalized power series solutions to the Pfaffian systems satisfied by these functions, along piecewise-linear paths in the argument space, followed by reconstruction of the ε-dependence from evaluations on a lattice of ε values. The manuscript describes the algorithm and its flowchart, the package interface and options, and reports timing measurements for several examples. The central claim is that the package provides an accurate and efficient alternative to multidimensional series or Mellin–Barnes representations for these ε-expansions.

Significance. If the implementation is correct, the package would be a useful tool for physics applications, particularly Feynman integral computations, where high-precision ε-expansions of Lauricella functions are frequently needed. The use of one-dimensional Frobenius series rather than multidimensional sums, and the ε-lattice reconstruction with parallelization, are attractive and potentially more efficient than existing approaches. The public repository and supplementary notebook are strengths that support reproducibility. However, the paper does not present the numerical validation necessary to support the claimed accuracy, so the significance is conditional on the authors supplying the missing evidence in a revision.

major comments (4)
  1. [Section 5, first paragraph] The paper asserts: "We validated the accuracy and efficiency of PrecisionLauricella by comparing its results, where applicable, with existing tools ... These comparisons demonstrated the robustness and reliability of the presented approach." However, no numerical comparison, error table, or convergence test appears anywhere in the manuscript. Figures 5 and 6 show only runtime scaling. Without concrete validation data, the reader cannot verify the central claim of high-precision evaluation. I request that the authors include a dedicated validation section with tables comparing against known analytic values (e.g., cases reducible to 2F1 or polylogarithms), against direct series summation inside the convergence region, and against independent numerical tools such as those cited in Refs. [48, 62]. Each comparison should report the requested precision, the achieved error, and the runtime.
  2. [Section 3, Eq. (17)] The error estimate max(h^{2n−2⌊k/2⌋}, Δ_Frob) is stated without derivation, and Δ_Frob is neither defined nor quantified. Since the options FrobeniusNumberTerms="Auto" and InternalPrecision="Auto" presumably rely on this estimate to achieve the requested accuracy, the paper must explain how Δ_Frob is estimated or bounded, and should numerically verify the formula by comparing predicted versus actual errors on test cases. As written, the claimed accuracy control is not testable.
  3. [Section 3, path selection and Eq. (13)] The condition that all κ_i in Eq. (13) be non-negative real numbers is stated to be necessary and the justification is deferred to Ref. [40]; the claim that the search "never more than four times" is likewise unsupported in this paper. The existence of such a path is load-bearing for the analytic continuation engine and hence for the package's promise of evaluating at arbitrary argument values. Please either summarize the argument for path existence, state the precise conditions under which it holds, and describe the failure mode if no path is found; or qualify the "arbitrary argument values" claim to the class of points for which such a path is guaranteed.
  4. [Section 3 (Frobenius truncation) and Section 4 (Auto options)] The automatic determination of the number of Frobenius series terms and of internal precision is not documented. The text says "Auto" determines these "based on the desired accuracy," but no criterion is given. Without a definition of the truncation error Δ_Frob or an empirical convergence test, there is no evidence that the default settings actually deliver the requested accuracy. Please document the automatic truncation strategy and provide a test showing that the achieved error tracks the requested precision across a range of parameter values and expansion orders.
minor comments (5)
  1. [Captions of Figs. 2, 3, 4] "staring point" should be "starting point" in all three captions.
  2. [Section 3, Eq. (17)] The notation "2 n" is ambiguous; it should be clarified whether this means 2n (two times n) and all variables (h, n, k) should be defined in one place near the equation.
  3. [Section 1, Introduction] The phrase "arbitrary argument values" is too strong given the restriction n ≤ 3 and the dependence on path existence. It would be more precise to state "for a wide class of nonsingular argument values" and to note explicitly that singular points and possibly other excluded configurations are not covered.
  4. [Program Summary and References] The companion paper is cited as [1] in the Program Summary but as [40] in the main text; please harmonize the numbering or add a cross-reference so readers are not confused.
  5. [Section 4] A brief usage example with actual numerical output in the text would help readers; the supplementary notebook is mentioned but not visible in the arXiv listing, so the paper should be self-contained enough to demonstrate the package interface.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: the package implements an external Frobenius method, with no fitted parameters and no target quantity redefined as its input.

full rationale

The paper's central claim is that PrecisionLauricella computes high-precision epsilon expansions by analytically continuing Frobenius series solutions of Pfaffian systems. This is an implementation claim, not a derivation in which an output is defined in terms of the quantity it is supposed to predict. The function bases and Pfaffian systems are quoted from Ref. [39], and the analytic-continuation path condition (all kappa_i non-negative real, Section 3, Eq. (13)) is referred to Ref. [40]; these are self-citations by the same group, and they do carry the mathematical justification for the algorithm. However, no equation in the paper constructs a target Laurent coefficient from the very same coefficient, and no fitted parameter is renamed as a prediction. The epsilon-lattice evaluation plus Lagrange interpolation is a standard numerical reconstruction, not a circular fit. The paper does include self-referential validation mentions (Section 5 cites Refs. [38,39], one of which overlaps with the authors), and the absence of numerical tables and the undefined Frobenius truncation error Delta_Frob in Eq. (17) are genuine verification gaps. Those are correctness risks, not instances of circularity under the defined patterns, because they concern unsupported evidence rather than an input-output equivalence. The score is therefore 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters are fitted to data. The central claim depends on four domain assumptions, three of which are inherited from the authors' companion and prior work. The package itself introduces no new physical entities.

assumptions (4)
  • domain assumption Frobenius generalized power series provide convergent analytic continuation of the Lauricella functions from the origin to arbitrary nonsingular points for n<=3.
    Invoked in Section 3 and the flowchart; the proof is delegated to companion paper [40], not included here.
  • domain assumption The Pfaffian systems for F_A, F_B, F_D in Eq. (10) and matrices like Eq. (9) are correct and complete.
    Section 2 states the package uses pre-derived systems from Ref. [39], which shares two authors with the present paper.
  • domain assumption A continuation path along x_i = kappa_i t exists with all kappa_i non-negative real, and the intersection-graph search finds it within at most four refinements.
    Section 3, immediately after Eq. (13), imposes this condition and refers to Ref. [40] for the rationale; no proof appears here.
  • domain assumption The error estimate in Eq. (17) bounds the actual truncation and interpolation errors.
    Eq. (17) is stated without derivation or empirical verification in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of $\texttt{PrecisionLauricella}$: package for numerical computation of Lauricella functions depending on a parameter." pith.science (2026). https://pith.science/paper/UEY422JC

@misc{pith2026250207935,
  author       = {Pith},
  title        = {Pith review of: $\textttPrecisionLauricella$: package for numerical computation of Lauricella functions depending on a parameter},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UEY422JC}},
  note         = {Machine review of arXiv:2502.07935}
}
abstract

We introduce the $\texttt{PrecisionLauricella}$ package, a computational tool developed in Wolfram Mathematica for high-precision numerical evaluations of Lauricella functions with indices linearly dependent on a parameter, $\varepsilon$. The package leverages a method based on analytical continuation via Frobenius generalized power series, providing an efficient and accurate alternative to conventional approaches relying on multi-dimensional series expansions or Mellin--Barnes representations. This one-dimensional approach is particularly advantageous for high-precision calculations and facilitates further optimization through $\varepsilon$-dependent reconstruction from evaluations at specific numerical values, enabling efficient parallelization. The underlying mathematical framework for this method has been detailed in our previous work, while the current paper focuses on the design, implementation, and practical applications of the $\texttt{PrecisionLauricella}$ package.

Figures

Figures reproduced from arXiv: 2502.07935 by the authors.

Figure 1
Figure 1. Flowchart for the PrecisionLauricella package. 3. Algorithm overview In this section, we provide a general overview of the algorithm and its main stages. The flowchart of the algorithm is presented in [PITH_FULL_IMAGE:figures/full_fig_p007_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_p010_2.png] view at source ↗
Figure 3
Figure 3. On the left, one of the possible paths with complex singular points is shown. The [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Analytical continuation with option DeltaPrescription → −I on the left and option DeltaPrescription → +I on the right. The singular points are shown in red and the end point in green, the staring point is at the origin and shaded circles represent convergence regions. …
Figure 5
Figure 5. Figure 5: Average time in seconds required to expand [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]
Figure 6
Figure 6. Figure 6: Average time in seconds required to expand [PITH_FULL_IMAGE:figures/full_fig_p013_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

62 extracted references · 26 canonical work pages

  1. [40]

    M. A. Bezuglov, B. A. Kniehl, A. I. Onishchenko, O. Veretin, High-precision numerical evaluation of Lauricella functions (2 2025). arXiv:2502.03276. 18

    arXiv 2025

  2. [1]

    Weinzierl, Feynman Integrals, 2022

    S. Weinzierl, Feynman Integrals, 2022. arXiv:2201.03593, doi:10.1007/978-3-030-99558-4. 14

    arXiv 2022

  3. [2]

    Dubovyk, J

    I. Dubovyk, J. Gluza, G. Somogyi, Mellin-Barnes Integrals: A Primer on Particle Physics Applications, Lect. Notes Phys. 1008 (2022) pp. arXiv:2211.13733, doi:10.1007/978-3-031-14272-7

    arXiv 2022

  4. [3]

    Smirnov, Feynman Integral Calculus, Springer Berlin Heidelberg, 2006

    V. Smirnov, Feynman Integral Calculus, Springer Berlin Heidelberg, 2006. URL https://books.google.ru/books?id=4ecWm6eRU6gC

    work page 2006

  5. [4]

    O. V. Tarasov, Hypergeometric representation of the two-loop equal mass sunrise diagram, Phys. Lett. B 638 (2006) 195–201. arXiv:hep- ph/0603227, doi:10.1016/j.physletb.2006.05.033

    work page arXiv 2006

  6. [5]

    R. N. Lee, Space-time dimensionality D as complex variable: Calcu- lating loop integrals using dimensional recurrence relation and analyt- ical properties with respect to D, Nucl. Phys. B 830 (2010) 474–492. arXiv:0911.0252, doi:10.1016/j.nuclphysb.2009.12.025

    arXiv 2010

  7. [6]

    R. N. Lee, DRA method: Powerful tool for the calculation of the loop integrals, J. Phys. Conf. Ser. 368 (2012) 012050. arXiv:1203.4868, doi:10.1088/1742-6596/368/1/012050

    arXiv 2012

  8. [7]

    O. V. Tarasov, Functional reduction of one-loop Feynman integrals with arbitrary masses, JHEP 06 (2022) 155. arXiv:2203.00143, doi:10.1007/JHEP06(2022)155

    arXiv 2022

Show all 62 references
  1. [8]

    M. A. Bezuglov, A. V. Kotikov, A. I. Onishchenko, On Se- ries and Integral Representations of Some NRQCD Master In- tegrals, JETP Lett. 116 (1) (2022) 61–69. arXiv:2205.14115, doi:10.1134/S0021364022601026

    2022 arXiv

  2. [9]

    M. A. Bezuglov, A. I. Onishchenko, Non-planar elliptic vertex, JHEP 04 (2022) 045. arXiv:2112.05096, doi:10.1007/JHEP04(2022)045

    2022 arXiv

  3. [10]

    Bl¨ umlein, M

    J. Bl¨ umlein, M. Saragnese, C. Schneider, Hypergeometric Structures in Feynman Integrals, Ann. Math. Artif. Intell. 91 (2023) 591–649. arXiv:2111.15501, doi:10.1007/s10472-023-09831-8

    2023 arXiv

  4. [11]

    Matsubara-Heo, S

    S.-J. Matsubara-Heo, S. Mizera, S. Telen, Four lectures on Euler in- tegrals, SciPost Phys. Lect. Notes 75 (2023) 1. arXiv:2306.13578, doi:10.21468/SciPostPhysLectNotes.75. 15

    2023 arXiv

  5. [12]

    Vanhove, Feynman integrals, toric geometry and mirror symmetry, in: KMPB Conference: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, 2019, pp

    P. Vanhove, Feynman integrals, toric geometry and mirror symmetry, in: KMPB Conference: Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory, 2019, pp. 415–458. arXiv:1807.11466, doi:10.1007/978-3-030-04480-0 17

    2019 arXiv

  6. [13]

    I. M. Gel’fand, General theory of hypergeometric functions, Sov. Math., Dokl. 33 (1986) 573–577

    1986

  7. [14]

    I. M. Gel’fand, A. V. Zelevinskij, M. M. Kapranov, Hypergeometric functions and toric varieties, Funct. Anal. Appl. 23 (2) (1989) 94–106. doi:10.1007/BF01078777

    1989 doi

  8. [15]

    I. M. Gelfand, M. M. Kapranov, A. V. Zelevinsky, Generalized Euler integrals and A-hypergeometric functions , Adv. Math. 84 (2) (1990) 255–271. doi:10.1016/0001-8708(90)90048-R

    1990 doi

  9. [16]

    I. M. Gelfand, M. I. Graev, V. Retakh, General hypergeometric systems of equations and series of hypergeometric type, Russian Mathematical Surveys 47 (1992) 1–88. URL https://api.semanticscholar.org/CorpusID:119749219

    1992

  10. [17]

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

    1994

  11. [18]

    Beukers, Monodromy of a-hypergeometric functions (2013)

    F. Beukers, Monodromy of a-hypergeometric functions (2013). arXiv:1101.0493

    2013 arXiv

  12. [19]

    M. Y. Kalmykov, B. A. Kniehl, Mellin-Barnes representations of Feyn- man diagrams, linear systems of differential equations, and polyno- mial solutions, Phys. Lett. B 714 (2012) 103–109. arXiv:1205.1697, doi:10.1016/j.physletb.2012.06.045

    2012 arXiv

  13. [20]

    de la Cruz, Feynman integrals as A-hypergeometric functions, JHEP 12 (2019) 123

    L. de la Cruz, Feynman integrals as A-hypergeometric functions, JHEP 12 (2019) 123. arXiv:1907.00507, doi:10.1007/JHEP12(2019)123

    2019 arXiv

  14. [21]

    R. P. Klausen, Hypergeometric Series Representations of Feynman Integrals by GKZ Hypergeometric Systems, JHEP 04 (2020) 121. arXiv:1910.08651, doi:10.1007/JHEP04(2020)121. 16

    2020 arXiv

  15. [22]

    Ananthanarayan, S

    B. Ananthanarayan, S. Banik, S. Bera, S. Datta, FeynGKZ: A Mathematica package for solving Feynman integrals using GKZ hy- pergeometric systems, Comput. Phys. Commun. 287 (2023) 108699. arXiv:2211.01285, doi:10.1016/j.cpc.2023.108699

    2023 arXiv

  16. [23]

    Greynat, J

    D. Greynat, J. Sesma, G. Vulvert, Derivatives of the Pochhammer and reciprocal Pochhammer symbols and their use in epsilon-expansions of Appell and Kamp´ e de F´ eriet functions, J. Math. Phys. 55 (2014) 043501. doi:10.1063/1.4870619

    2014 doi

  17. [24]

    Greynat, J

    D. Greynat, J. Sesma, A new approach to the epsilon expansion of gen- eralized hypergeometric functions, Comput. Phys. Commun. 185 (2014) 472–478. arXiv:1302.2423, doi:10.1016/j.cpc.2013.10.001

    2014 arXiv

  18. [25]

    S. A. Yost, V. V. Bytev, M. Y. Kalmykov, B. A. Kniehl, B. F. L. Ward, The Epsilon Expansion of Feynman Diagrams via Hypergeometric Func- tions and Differential Reduction (10 2011). arXiv:1110.0210

    2011 arXiv

  19. [26]

    S. Moch, P. Uwer, S. Weinzierl, Nested sums, expansion of transcen- dental functions and multiscale multiloop integrals, J. Math. Phys. 43 (2002) 3363–3386. arXiv:hep-ph/0110083, doi:10.1063/1.1471366

    2002 arXiv

  20. [27]

    A. I. Davydychev, M. Y. Kalmykov, Massive Feynman diagrams and inverse binomial sums, Nucl. Phys. B 699 (2004) 3–64. arXiv:hep- th/0303162, doi:10.1016/j.nuclphysb.2004.08.020

    2004

  21. [28]

    M. Y. Kalmykov, Gauss hypergeometric function: Reduction, epsilon- expansion for integer/half-integer parameters and Feynman diagrams, JHEP 04 (2006) 056. arXiv:hep-th/0602028, doi:10.1088/1126- 6708/2006/04/056

    2006 arXiv

  22. [29]

    M. Y. Kalmykov, B. F. L. Ward, S. Yost, All order epsilon-expansion of Gauss hypergeometric functions with integer and half/integer val- ues of parameters, JHEP 02 (2007) 040. arXiv:hep-th/0612240, doi:10.1088/1126-6708/2007/02/040

    2007 arXiv

  23. [30]

    M. Y. Kalmykov, B. F. L. Ward, S. A. Yost, On the all-order epsilon- expansion of generalized hypergeometric functions with integer values of parameters, JHEP 11 (2007) 009. arXiv:0708.0803, doi:10.1088/1126- 6708/2007/11/009. 17

    2007 arXiv

  24. [31]

    M. Y. Kalmykov, B. A. Kniehl, All-order epsilon-expansions of hyperge- ometric functions of one variable, Phys. Part. Nucl. 41 (2010) 942–945. arXiv:1003.1965, doi:10.1134/S1063779610060250

    2010 arXiv

  25. [32]

    Huber, D

    T. Huber, D. Maitre, HypExp: A Mathematica package for expand- ing hypergeometric functions around integer-valued parameters, Com- put. Phys. Commun. 175 (2006) 122–144. arXiv:hep-ph/0507094, doi:10.1016/j.cpc.2006.01.007

    2006 arXiv

  26. [33]

    Huber, D

    T. Huber, D. Maitre, HypExp 2, Expanding Hypergeometric Functions about Half-Integer Parameters, Comput. Phys. Commun. 178 (2008) 755–776. arXiv:0708.2443, doi:10.1016/j.cpc.2007.12.008

    2008 arXiv

  27. [34]

    S. Moch, P. Uwer, XSummer: Transcendental functions and symbolic summation in form, Comput. Phys. Commun. 174 (2006) 759–770. arXiv:math-ph/0508008, doi:10.1016/j.cpc.2005.12.014

    2006 arXiv

  28. [35]

    Weinzierl, Symbolic expansion of transcendental functions, Com- put

    S. Weinzierl, Symbolic expansion of transcendental functions, Com- put. Phys. Commun. 145 (2002) 357–370. arXiv:math-ph/0201011, doi:10.1016/S0010-4655(02)00261-8

    2002 arXiv

  29. [36]

    Ablinger, J

    J. Ablinger, J. Bl¨ umlein, C. Schneider, Analytic and Algorithmic As- pects of Generalized Harmonic Sums and Polylogarithms, J. Math. Phys. 54 (2013) 082301. arXiv:1302.0378, doi:10.1063/1.4811117

    2013 arXiv

  30. [37]

    Huang, J

    Z.-W. Huang, J. Liu, NumExp: Numerical epsilon expansion of hyper- geometric functions, Comput. Phys. Commun. 184 (2013) 1973–1980. arXiv:1209.3971, doi:10.1016/j.cpc.2013.03.016

    2013 arXiv

  31. [38]

    Bera, MultiHypExp: A Mathematica Package For Expanding Multi- variate Hypergeometric Functions In Terms Of Multiple Polylogarithms (6 2023)

    S. Bera, MultiHypExp: A Mathematica Package For Expanding Multi- variate Hypergeometric Functions In Terms Of Multiple Polylogarithms (6 2023). arXiv:2306.11718

    2023 arXiv

  32. [39]

    M. A. Bezuglov, A. I. Onishchenko, Expansion of hypergeometric func- tions in terms of polylogarithms with a nontrivial change of vari- ables, Theor. Math. Phys. 219 (3) (2024) 871–896. arXiv:2312.06242, doi:10.1134/S0040577924060011

    2024 arXiv

  33. [41]

    Exton, Multiple hypergeometric functions and applications, Mathe- matics and Its Applications

    H. Exton, Multiple hypergeometric functions and applications, Mathe- matics and Its Applications. Chichester: Ellis Horwood Limited, Pub- lisher; New York etc.: Halsted Press, a division of John Wiley & Sons, Inc. 312 p. (1976)

    1976

  34. [42]

    Appell, J

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

    1926

  35. [43]

    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. 15 (1836) 39–83. doi:10.1515/crll.1836.15.39. URL https://eudml.org/doc/146951

    doi

  36. [44]

    Riemann, Gesammelte mathematische Werke und wissenschaftlicher Nachlass

    B. Riemann, Gesammelte mathematische Werke und wissenschaftlicher Nachlass. Herausgegeben unter Mitwirkung von R. Dedekind von H. Weber., Leipzig, Teubner (1876). (1876). URL www.hti.umich.edu/cgi/t/text/text-idx?c=umhistmath;idno=ABS3163

  37. [45]

    Erd´ elyi, Hypergeometric functions of two variables, Acta Math

    A. Erd´ elyi, Hypergeometric functions of two variables, Acta Math. 83 (1950) 131–164. doi:10.1007/BF02392635

    1950 doi

  38. [46]

    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. 5 (1964) 420–430. doi:10.1063/1.1704134

    1964 doi

  39. [47]

    Ananthanarayan, S

    B. Ananthanarayan, S. Bera, S. Friot, T. Pathak, Olsson.wl: A Mathe- matica Package for the Computation of Linear Transformations of Mul- tivariable Hypergeometric Functions, Springer Proc. Phys. 304 (2024) 738–740. doi:10.1007/978-981-97-0289-3 179

    2024 doi

  40. [48]

    S. Bera, 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. 306 (2025) 109386. arXiv:2403.02237, doi:10.1016/j.cpc.2024.109386

    2025 arXiv

  41. [49]

    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 10 (3) (1969) 524–531

    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 10 (3) (1969) 524–531. 19

    1969

  42. [50]

    S. I. Bezrodnykh, Analytic continuation formulas and Jacobi-type re- lations for Lauricella function, Dokl. Math. 93 (2) (2016) 129–134. doi:10.1134/S1064562416020022

    2016 doi

  43. [51]

    S. I. Bezrodnykh, On the analytic continuation of the Lau- ricella function F (N ) D , Math. Notes 100 (2) (2016) 318–324. doi:10.1134/S0001434616070282

    2016 doi

  44. [52]

    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 57 (2017) 559– 589

    2017

  45. [53]

    S. I. Bezrodnykh, Analytic continuation of the Lauricella function F (N ) D with arbitrary number of variables, Integral Transforms Spec. Funct. 29 (1) (2018) 21–42. doi:10.1080/10652469.2017.1402017

    2018

  46. [54]

    S. I. Bezrodnykh, Analytic continuation of Lauricella’s functions F (N ) A , F(N ) B and F (N ) D , Integral Transforms Spec. Funct. 31 (11) (2020) 921–940. doi:10.1080/10652469.2020.1762081

    2020

  47. [55]

    S. I. Bezrodnykh, The Lauricella hypergeometric function F (N ) D , the Riemann-Hilbert problem, and some applications, Russ. Math. Surv. 73 (6) (2018) 941–1031. doi:10.1070/RM9841

    2018 doi

  48. [56]

    V. V. Bytev, M. Y. Kalmykov, B. A. Kniehl, HYPERDIRE, HYPERgeo- metric functions DIfferential REduction: MATHEMATICA-based pack- ages for differential reduction of generalized hypergeometric functions pFp−1, F1,F2,F3,F4, Comput. Phys. Commun. 184 (2013) 2332–2342. arXiv:1105.3...

    2013 arXiv

  49. [57]

    V. V. Bytev, B. A. Kniehl, HYPERDIRE HYPERgeometric functions DIfferential REduction: Mathematica-based packages for the differential reduction of generalized hypergeometric functions: Horn-type hyperge- ometric functions of two variables, Comput. Phys. Commun. 189 (2015) 128–...

    2015 arXiv

  50. [58]

    V. V. Bytev, M. Y. Kalmykov, S.-O. Moch, HYPERgeometric func- tions DIfferential REduction (HYPERDIRE): MATHEMATICA based 20 packages for differential reduction of generalized hypergeometric func- tions: FD and FS Horn-type hypergeometric functions of three vari- ables, Comput...

    2014 arXiv

  51. [59]

    V. V. Bytev, B. A. Kniehl, HYPERDIRE—HYPERgeometric functions DIfferential REduction: Mathematica-based packages for the differen- tial reduction of generalized hypergeometric functions: Lauricella func- tion Fc of three variables, Comput. Phys. Commun. 206 (2016) 78–83. arXiv...

    2016 arXiv

  52. [60]

    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

  53. [61]

    M. J. Schlosser, Multiple Hypergeometric Series: Appell Series and Beyond, in: LHCPhenoNet School: Integration, Summation and Special Functions in Quantum Field Theory, 2013, pp. 305–324. arXiv:1305.1966, doi:10.1007/978-3-7091-1616-6 13

    2013 arXiv

  54. [62]

    Ananthanarayan, S

    B. Ananthanarayan, S. Bera, S. Friot, O. Marichev, T. Pathak, On the evaluation of the Appell F2 double hypergeometric func- tion, Comput. Phys. Commun. 284 (2023) 108589. arXiv:2111.05798, doi:10.1016/j.cpc.2022.108589. 21

    2023 arXiv

Pith tools

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