Walks in the quadrant with interacting boundaries : genus zero case
Pierre Bonnet

TL;DR
This paper classifies the generating functions of genus zero lattice walks with interacting boundaries, revealing they are mostly hypertranscendental, with some algebraic cases depending on boundary contact weights.
Contribution
It extends the classification of lattice walk generating functions to models with boundary interactions, using $q$-difference equations and analyzing algebraic relations among weights.
Findings
Most generating functions are hypertranscendental.
Certain weight relations lead to algebraic or rational generating functions.
Complete classification for all real boundary interaction weights in genus zero models.
Abstract
The study of lattice walks restricted to the first quadrant has shed a lot of interest in the past twenty years. In particular, there has been an important effort to classify models of weighted walks with small steps with respect to the algebraic-differential nature of their generating function. The techniques that were developed in the course of this work are now applied to different extensions of those walks. One of these extensions, called walks with interacting boundaries, consists in accounting for the number of contacts of the walk with the axes, with motivation coming from statistical physics. These contacts are encoded as two additional parameters for the generating function, the Boltzmann weights. For one notable family of models, called genus zero models, we establish in this paper the complete classification of their generating function, for all real values of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Algebraic structures and combinatorial models
