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

zbMATH Open1295.05028arXiv1105.4456MaRDI QIDQ658975FDOQ658975

Authors: Alin Bostan, Frédéric Chyzak, Lucien Pech, Mark van Hoeij 

Publication date: 9 February 2012

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: 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 $nimesnimesn$ 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)=su{m}_{ngeq0}{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.]

Full work available at URL: https://arxiv.org/abs/1105.4456

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A combinatorial proof of the recurrence for rook paths
• Enumerating Rook and Queen paths
• Matrix Ansatz, lattice paths and rook placements
• Rook polynomials in three and higher dimensions
• Q-counting rook configurations and a formula of Frobenius
• The general \(\gamma -\) compatible rook length polynomials
• The generalization of rooks problem and quasi-determinant of matrices
• Rook theory and hypergeometric series
• Generalized rook polynomials
• scientific article; zbMATH DE number 10824

zbMATH Keywords

computer algebrahypergeometric functionsgenerating functionslattice pathsfast algorithmsalgebraic functionsenumerative combinatoricscreative telescopingautomated guessing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Classical hypergeometric functions, ({}_2F_1) (33C05) Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited In (9)

• Hypergeometric expressions for generating functions of walks with small steps in the quarter plane
• Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases
• Diagonals of rational functions, pullbacked $\boldsymbol{_2F_1}$ hypergeometric functions and modular forms
• New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences
• The research and progress of the enumeration of lattice paths
• On a conjecture of Cusick concerning the sum of digits of \(n\) and \(n+t\)
• Creative Telescoping for Holonomic Functions
• Some open problems related to creative telescoping
• Counting walks with large steps in an orthant

Uses Software

• DEtools

This page was built for publication: Explicit formula for the generating series of diagonal 3D rook paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658975)