197 research outputs found
Explicit formula for the generating series of diagonal 3D rook paths
Let denote the number of ways in which a chess rook can move from a
corner cell to the opposite corner cell of an
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 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
Recurrence and Polya number of general one-dimensional random walks
The recurrence properties of random walks can be characterized by P\'{o}lya
number, i.e., the probability that the walker has returned to the origin at
least once. In this paper, we consider recurrence properties for a general 1D
random walk on a line, in which at each time step the walker can move to the
left or right with probabilities and , or remain at the same position
with probability (). We calculate P\'{o}lya number of this
model and find a simple expression for as, , where is
the absolute difference of and (). We prove this rigorous
expression by the method of creative telescoping, and our result suggests that
the walk is recurrent if and only if the left-moving probability equals to
the right-moving probability .Comment: 3 page short pape
- …