Square lattice Ising model $tilde{chi}^{(5)}$ ODE in exact arithmetic

We obtain in exact arithmetic the order 24 linear differential operator $L_{24}$ and right hand side $E^{(5)}$ of the inhomogeneous equation$L_{24}(Phi^{(5)}) = E^{(5)}$, where $Phi^{(5)} =tilde{chi}^{(5)}-tilde{chi}^{(3)}/2+tilde{chi}^{(1)}/120$ is a linear combination of $n$-particle contributions to the susceptibility of the square lattice Ising model. In Bostan, et al. (J. Phys. A: Math. Theor. {bf 42}, 275209 (2009)) the operator $L_{24}$ (modulo a prime) was shown to factorize into $L_{12}^{(rm left)} cdot L_{12}^{(rm right)}$; here we prove that no further factorization of the order 12 operator $L_{12}^{(rm left)}$ is possible. We use the exact ODE to obtain the behaviour of $tilde{chi}^{(5)}$ at the ferromagnetic critical point and to obtain a limited number of analytic continuations of $tilde{chi}^{(5)}$ beyond the principal disk defined by its high temperature series. Contrary to a speculation in Boukraa, et al (J. Phys. A: Math. Theor. {bf 41} 455202 (2008)), we find that $tilde{chi}^{(5)}$ is singular at $w=1/2$ on an infinite number of branches.

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

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 $chi^{(5)}$ and six-particle contribution $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 $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 $chi^{(5)}$ {it modulo} a prime. A diff-Pade analysis of 2000 terms series for $chi^{(5)}$ and $chi^{(6)}$ confirms to a very high degree of confidence previous conjectures about the location and strength of the singularities of the $n$-particle components of the susceptibility, up to a small set of ``additional singularities. We find the presence of singularities at $w=1/2$ for the linear ODE of $chi^{(5)}$, and $w^2= 1/8$ for the ODE of $chi^{(6)}$, which are {it not} singularities of the ``physical $chi^{(5)}$ and $chi^{(6)},$ that is to say the series-solutions of the ODEs which are analytic at $w =0$. Furthermore, analysis of the long series for $chi^{(5)}$ (and $chi^{(6)}$) combined with the corresponding long series for the full susceptibility $chi$ yields previously conjectured singularities in some $chi^{(n)}$, $n ge 7$. We also present a mechanism of resummation of the logarithmic singularities of the $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$.

Exact generating function for 2-convex polygons

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $m$ indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case $m=2$ using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the $x$ and $y$ direction are distinguished. In so doing, we develop tools that would allow for the case $m > 2$ to be studied. %In our proof we use a `divide and conquer approach, factorising 2-convex %polygons by extending a line along the base of its indents. We then use %the inclusion-exclusion principle, the Hadamard product and extensions to %known methods to derive the generating functions for each case.

Families of m-convex polygons: m = 2

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $m$ indentations in the side. We use a `divide and conquer approach, factorising 2-convex polygons by extending a line along the base of its indents. We then use the inclusion-exclusion principle, the Hadamard product and extensions to known methods to derive the generating functions for each case.