Holonomic functions of several complex variables and singularities of anisotropic Ising n-fold integrals

Lattice statistical mechanics, often provides a natural (holonomic) framework to perform singularity analysis with several complex variables that would, in a general mathematical framework, be too complex, or could not be defined. Considering several Picard-Fuchs systems of two-variables "above" Calabi-Yau ODEs, associated with double hypergeometric series, we show that holonomic functions are actually a good framework for actually finding the singular manifolds. We, then, analyse the singular algebraic varieties of the n-fold integrals $\chi^{(n)}$, corresponding to the decomposition of the magnetic susceptibility of the anisotropic square Ising model. We revisit a set of Nickelian singularities that turns out to be a two-parameter family of elliptic curves. We then find a first set of non-Nickelian singularities for $\chi^{(3)}$ and $\chi^{(4)}$, that also turns out to be rational or ellipic curves. We underline the fact that these singular curves depend on the anisotropy of the Ising model. We address, from a birational viewpoint, the emergence of families of elliptic curves, and of Calabi-Yau manifolds on such problems. We discuss the accumulation of these singular curves for the non-holonomic anisotropic full susceptibility.Comment: 36 page

Low Complexity Algorithms for Linear Recurrences

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over the rational numbers. The algorithms for these tasks all involve as an intermediate quantity an integer N (dispersion or root of an indicial polynomial) that is potentially exponential in the bit size of their input. Previous algorithms have a bit complexity that is at least quadratic in N. We revisit them and propose variants that exploit the structure of solutions and avoid expanding polynomials of degree N. We give two algorithms: a probabilistic one that detects the existence or absence of nonzero polynomial and rational solutions in O ( √ N log 2 N) bit operations; a deterministic one that computes a compact representation of the solution in O(N log 3 N) bit operations. Similar speedups are obtained in indefinite and definite hypergeometric summation. We describe the results of an implementation