ENUMERATION AND DIVISIBILITY OF HIGHER DIMENSIONAL KING WALKS
- 28 July 2025
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 113 (2) , 177-188
Abstract
The lattice walks in the plane starting at the origin $\mathbf {0}$ with steps in $\{-1,0,1\}^{2}\setminus \{\mathbf {0}\}$ are called king walks. We investigate enumeration and divisibility for higher dimensional king walks confined to certain regions. Specifically, we establish an explicit formula for the number of $(r+s)$ -dimensional king walks of length n ending at $(a_1,\ldots ,a_r,b_1,\ldots ,b_s)$ which never dip below $x_i=0$ for $i=1,\ldots ,r$ . We also derive divisibility properties for the number of $(r+s)$ -dimensional king walks of length p (an odd prime) through group actions.
Keywords
Funding Information
- National Natural Science Foundation of China (12171370)
This publication has 15 references indexed in Scilit:
- On the nature of the generating series of walks in the quarter planeInventiones Mathematicae, 2018
- Hypergeometric expressions for generating functions of walks with small steps in the quarter planeEuropean Journal of Combinatorics, 2017
- Singularity Analysis Via the Iterated Kernel MethodCombinatorics, Probability and Computing, 2014
- Non-D-finite excursions in the quarter planeJournal of Combinatorial Theory, Series A, 2014
- On the functions counting walks with small steps in the quarter planePublications mathématiques de l'IHÉS, 2012
- A history and a survey of lattice path enumerationJournal of Statistical Planning and Inference, 2010
- Two non-holonomic lattice walks in the quarter planeTheoretical Computer Science, 2009
- Proof of Ira Gessel's lattice path conjectureProceedings of the National Academy of Sciences, 2009
- Enumerative Combinatorics1999
- A probabilistic method for lattice path enumerationJournal of Statistical Planning and Inference, 1986