Explicit formula for the generating series of diagonal 3D rook paths

Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step. We describe the computer-driven \emph{discovery and proof} of the fact that the generating series $G(x)= \sum_{n \geq 0} a_n x^n$ admits the following explicit expression in terms of a Gaussian hypergeometric function: G(x) = 1 + 6 \cdot \int_0^x \frac{\,\pFq21{1/3}{2/3}{2} {\frac{27 w(2-3w)}{(1-4w)^3}}}{(1-4w)(1-64w)} \, dw.Comment: To appear in "S\'eminaire Lotharingien de Combinatoire

Diagonals of rational functions, pullbacked 2F1 hypergeometric functions and modular forms (unabrigded version)

We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of a polynomial of degree two at most) can be expressed as a pullbacked 2F1 hypergeometric function. This result can be seen as the simplest non-trivial family of diagonals of rational functions. We focus on some subcases such that the diagonals of the corresponding rational functions can be written as a pullbacked 2F1 hypergeometric function with two possible rational functions pullbacks algebraically related by modular equations, thus showing explicitely that the diagonal is a modular form. We then generalise this result to eight, nine and ten parameters families adding some selected cubic terms at the denominator of the rational function defining the diagonal. We finally show that each of these previous rational functions yields an infinite number of rational functions whose diagonals are also pullbacked 2F1 hypergeometric functions and modular forms.Comment: 39 page

Geometric and Topological Combinatorics

The 2007 Oberwolfach meeting “Geometric and Topological Combinatorics” presented a great variety of investigations where topological and algebraic methods are brought into play to solve combinatorial and geometric problems, but also where geometric and combinatorial ideas are applied to topological questions

Diagonals of rational functions, pullbacked 2 F 1 hypergeometric functions and modular forms (unabrigded version)

International audienceWe recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of a polynomial of degree two at most) can be expressed as a pullbacked 2 F 1 hypergeometric function. This result can be seen as the simplest non-trivial family of diagonals of rational functions. We focus on some subcases such that the diagonals of the corresponding rational functions can be written as a pullbacked 2 F 1 hypergeometric function with two possible rational functions pullbacks algebraically related by modular equations, thus showing explicitely that the diagonal is a modular form. We then generalise this result to eight, nine and ten parameters families adding some selected cubic terms at the denominator of the rational function defining the diagonal. We finally show that each of these previous rational functions yields an infinite number of rational functions whose diagonals are also pullbacked 2 F 1 hypergeometric functions and modular forms

Computer Algebra for Lattice Path Combinatorics

DoctoralClassifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra methods have been used to explore and solve a number of difficult questions related to lattice walks. In this course, we will give an overview of recent results on structural properties and explicit formulas for generating functions of walks in the quarter plane, with an emphasis on the algorithmic methodology

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

We show that the n-fold integrals $\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, correspond to a distinguished class of function generalising algebraic functions: they are actually diagonals of rational functions. As a consequence, the power series expansions of the, analytic at x=0, solutions of these 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. We also give several results showing that the unique analytical solution of Calabi-Yau ODEs, and, more generally, Picard-Fuchs linear ODEs, with solutions of maximal weights, are always diagonal of rational functions. Besides, in a more enumerative combinatorics context, 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 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 of ODEs.Comment: This paper is the short version of the larger (100 pages) version, available as arXiv:1211.6031 , where all the detailed proofs are given and where a much larger set of examples is displaye

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

We give the exact expressions of the partial susceptibilities $\chi^{(3)}_d$ and $\chi^{(4)}_d$ for the diagonal susceptibility of the Ising model in terms of modular forms and Calabi-Yau ODEs, and more specifically, $_3F_2([1/3,2/3,3/2],\, [1,1];\, z)$ and $_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 $\chi^{(3)}_d$ and $\chi^{(4)}_d$. We also give new results for $\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 $n$-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+1}F_q$ hypergeometric functions, or correspond to the more general solutions of Calabi-Yau equations.Comment: 35 page

Semi-automated modeling approaches to route selection in GIS

As an alternative to traditional graphical intuitive approaches (GIA), a semi-automated modeling approach (SMA) can more efficiently identify linear routes by using powerful iterative and automated methods. In this research, two case studies were investigated to examine critical issues relating to the accuracy and effectiveness of raster-defined algorithmic approaches to linear route location. The results illustrate that different shortest-path algorithms do not necessarily result in markedly different linear routes. However, differing results can occur when using different neighboring-cell links in the cell-based route network construction. Cell-based algorithmic approaches in both Arc/Info and IDRISI software generate very similar results which are comparable to linear modeling with greater than eight neighboring-cell links. Given a specific shortest-path algorithm and its route searching technique, the use of a finer spatial resolution only results in a narrower and smoother route corridor. Importantly, cost surface models can be generated to represent differing cumulative environmental \u27costs\u27 or impacts in which different perceptions of environmental cost can be simulated and evaluated.;Three different simulation techniques comprising Ordered Weighted Combination models (OWC), Dynamic Decision Space (DDS), and Gateway-based approaches, were used to address problems associated with concurrent and dynamic changes in multi-objective decision space. These approaches provide efficient and flexible simulation capability within a dynamic and changing decision space. When aggregation data models were used within a Gateway approach the match of resulting routes between GIA and SMA analyses is close. The effectiveness of SMA is greatly limited when confronted by extensive linear and impermeable barriers or where data is sparse. Overall, achieving consensus on environmental cost surface generation and criteria selection is a prerequisite for a successful SMA outcome. It is concluded that SMA has several positive advantages that certainly complement a GIA in linear route siting and spatial decision-making