357 research outputs found

    NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions

    Get PDF
    This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be the first general implementation of the fast high-precision numerical evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our descriptions contain improvements over existing algorithms. We also provide references to relevant ideas not currently used in NumGfun

    Rigorous Multiple-Precision Evaluation of D-Finite Functions in SageMath

    Get PDF
    We present a new open source implementation in the SageMath computer algebra system of algorithms for the numerical solution of linear ODEs with polynomial coefficients. Our code supports regular singular connection problems and provides rigorous error bounds

    Experimental mathematics on the magnetic susceptibility of the square lattice Ising model

    Full text link
    We calculate very long low- and high-temperature series for the susceptibility χ\chi of the square lattice Ising model as well as very long series for the five-particle contribution χ(5)\chi^{(5)} and six-particle contribution χ(6)\chi^{(6)}. These calculations have been made possible by the use of highly optimized polynomial time modular algorithms and a total of more than 150000 CPU hours on computer clusters. For χ(5)\chi^{(5)} 10000 terms of the series are calculated {\it modulo} a single prime, and have been used to find the linear ODE satisfied by χ(5)\chi^{(5)} {\it modulo} a prime. A diff-Pad\'e analysis of 2000 terms series for χ(5)\chi^{(5)} and χ(6)\chi^{(6)} confirms to a very high degree of confidence previous conjectures about the location and strength of the singularities of the nn-particle components of the susceptibility, up to a small set of ``additional'' singularities. We find the presence of singularities at w=1/2w=1/2 for the linear ODE of χ(5)\chi^{(5)}, and w2=1/8w^2= 1/8 for the ODE of χ(6)\chi^{(6)}, which are {\it not} singularities of the ``physical'' χ(5)\chi^{(5)} and χ(6),\chi^{(6)}, that is to say the series-solutions of the ODE's which are analytic at w=0w =0. Furthermore, analysis of the long series for χ(5)\chi^{(5)} (and χ(6)\chi^{(6)}) combined with the corresponding long series for the full susceptibility χ\chi yields previously conjectured singularities in some χ(n)\chi^{(n)}, n7n \ge 7. We also present a mechanism of resummation of the logarithmic singularities of the χ(n)\chi^{(n)} leading to the known power-law critical behaviour occurring in the full χ\chi, and perform a power spectrum analysis giving strong arguments in favor of the existence of a natural boundary for the full susceptibility χ\chi.Comment: 54 pages, 2 figure

    Computing hypergeometric functions rigorously

    Get PDF
    We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions 0F1{}_0F_1, 1F1{}_1F_1, 2F1{}_2F_1 and 2F0{}_2F_0 (or the Kummer UU-function) are supported for unrestricted complex parameters and argument, and by extension, we cover exponential and trigonometric integrals, error functions, Fresnel integrals, incomplete gamma and beta functions, Bessel functions, Airy functions, Legendre functions, Jacobi polynomials, complete elliptic integrals, and other special functions. The output can be used directly for interval computations or to generate provably correct floating-point approximations in any format. Performance is competitive with earlier arbitrary-precision software, and sometimes orders of magnitude faster. We also partially cover the generalized hypergeometric function pFq{}_pF_q and computation of high-order parameter derivatives.Comment: v2: corrected example in section 3.1; corrected timing data for case E-G in section 8.5 (table 6, figure 2); adjusted paper siz

    Effective Bounds for P-Recursive Sequences

    Get PDF
    We describe an algorithm that takes as input a complex sequence (un)(u_n) given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound (vn)(v_n) such that unvn|u_n| \leq v_n for all nn. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of unu_n. We discuss applications to the evaluation of power series with guaranteed precision.Comment: 26 page

    The Enumeration of Prudent Polygons by Area and its Unusual Asymptotics

    Get PDF
    Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{kk-sided prudent walks} (with k=1,2,3,4k=1,2,3,4) are, in essence, only allowed to grow along kk directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-M\'elou, Schwerdtfeger; 2010). We consider the enumeration of \emph{prudent polygons} by \emph{area}. For the 3-sided variety, we find that the generating function is expressed in terms of a qq-hypergeometric function, with an accumulation of poles towards the dominant singularity. This expression reveals an unusual asymptotic structure of the number of polygons of area nn, where the critical exponent is the transcendental number log23\log_23 and and the amplitude involves tiny oscillations. Based on numerical data, we also expect similar phenomena to occur for 4-sided polygons. The asymptotic methodology involves an original combination of Mellin transform techniques and singularity analysis, which is of potential interest in a number of other asymptotic enumeration problems.Comment: 27 pages, 6 figure

    Diagonal Ising susceptibility: elliptic integrals, modular forms and Calabi-Yau equations

    Full text link
    We give the exact expressions of the partial susceptibilities χd(3)\chi^{(3)}_d and χd(4)\chi^{(4)}_d for the diagonal susceptibility of the Ising model in terms of modular forms and Calabi-Yau ODEs, and more specifically, 3F2([1/3,2/3,3/2],[1,1];z)_3F_2([1/3,2/3,3/2],\, [1,1];\, z) and 4F3([1/2,1/2,1/2,1/2],[1,1,1];z)_4F_3([1/2,1/2,1/2,1/2],\, [1,1,1]; \, z) hypergeometric functions. By solving the connection problems we analytically compute the behavior at all finite singular points for χd(3)\chi^{(3)}_d and χd(4)\chi^{(4)}_d. We also give new results for χd(5)\chi^{(5)}_d. We see in particular, the emergence of a remarkable order-six operator, which is such that its symmetric square has a rational solution. These new exact results indicate that the linear differential operators occurring in the nn-fold integrals of the Ising model are not only "Derived from Geometry" (globally nilpotent), but actually correspond to "Special Geometry" (homomorphic to their formal adjoint). This raises the question of seeing if these "special geometry" Ising-operators, are "special" ones, reducing, in fact systematically, to (selected, k-balanced, ...) q+1Fq_{q+1}F_q hypergeometric functions, or correspond to the more general solutions of Calabi-Yau equations.Comment: 35 page

    Ising n-fold integrals as diagonals of rational functions and integrality of series expansions: integrality versus modularity

    Full text link
    We show that the n-fold integrals χ(n)\chi^{(n)} of the magnetic susceptibility of the Ising model, as well as various other n-fold integrals of the "Ising class", or n-fold integrals from enumerative combinatorics, like lattice Green functions, are actually diagonals of rational functions. As a consequence, the power series expansions of these solutions of linear differential equations "Derived From Geometry" are globally bounded, which means that, after just one rescaling of the expansion variable, they can be cast into series expansions with integer coefficients. Besides, in a more enumerative combinatorics context, we show that generating functions whose coefficients are expressed in terms of nested sums of products of binomial terms can also be shown to be diagonals of rational functions. We give a large set of results illustrating the fact that the unique analytical solution of Calabi-Yau ODEs, and more generally of MUM ODEs, is, almost always, diagonal of rational functions. We revisit Christol's conjecture that globally bounded series of G-operators are necessarily diagonals of rational functions. We provide a large set of examples of globally bounded series, or series with integer coefficients, associated with modular forms, or Hadamard product of modular forms, or associated with Calabi-Yau ODEs, underlying the concept of modularity. We finally address the question of the relations between the notion of integrality (series with integer coefficients, or, more generally, globally bounded series) and the modularity (in particular integrality of the Taylor coefficients of mirror map), introducing new representations of Yukawa couplings.Comment: 100 page
    corecore