{"title":"Enumeration of three-quadrant walks via invariants: some diagonally symmetric models","authors":"M. Bousquet-M'elou","doi":"10.4153/S0008414X22000487","DOIUrl":null,"url":null,"abstract":"Abstract In the past \n$20$\n years, the enumeration of plane lattice walks confined to a convex cone—normalized into the first quadrant—has received a lot of attention, stimulated the development of several original approaches, and led to a rich collection of results. Most of these results deal with the nature of the associated generating function: for which models is it algebraic, D-finite, D-algebraic? By model, what we mean is a finite collection of allowed steps. More recently, similar questions have been raised for nonconvex cones, typically the three-quadrant cone \n$\\mathcal {C} = \\{ (i,j) : i \\geq 0 \\text { or } j \\geq 0 \\}$\n . They turn out to be more difficult than their quadrant counterparts. In this paper, we investigate a collection of eight models in \n$\\mathcal {C}$\n , which can be seen as the first level of difficulty beyond quadrant problems. This collection consists of diagonally symmetric models in \n$\\{-1, 0,1\\}^2\\setminus \\{(-1,1), (1,-1)\\}$\n . Three of them are known not to be D-algebraic. We show that the remaining five can be solved in a uniform fashion using Tutte’s notion of invariants, which has already proved useful for some quadrant models. Three models are found to be algebraic, one is (only) D-finite, and the last one is (only) D-algebraic. We also solve in the same fashion the diagonal model \n$\\{ \\nearrow , \\nwarrow , \\swarrow , \\searrow \\}$\n , which is D-finite. The three algebraic models are those of the Kreweras trilogy, \n$\\mathcal S=\\{\\nearrow , \\leftarrow , \\downarrow \\}$\n , \n$\\mathcal S^*=\\{\\rightarrow , \\uparrow , \\swarrow \\}$\n , and \n$\\mathcal S\\cup \\mathcal S^*$\n . Our solutions take similar forms for all six models. Roughly speaking, the square of the generating function of three-quadrant walks with steps in \n$\\mathcal S$\n is an explicit rational function in the quadrant generating function with steps in \n$\\mathscr S:= \\{(j-i,j): (i,j) \\in \\mathcal S\\}$\n . We derive various exact or asymptotic corollaries, including an explicit algebraic description of a positive harmonic function in \n$\\mathcal C$\n for the (reverses of the) five models that are at least D-finite.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4153/S0008414X22000487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Abstract In the past
$20$
years, the enumeration of plane lattice walks confined to a convex cone—normalized into the first quadrant—has received a lot of attention, stimulated the development of several original approaches, and led to a rich collection of results. Most of these results deal with the nature of the associated generating function: for which models is it algebraic, D-finite, D-algebraic? By model, what we mean is a finite collection of allowed steps. More recently, similar questions have been raised for nonconvex cones, typically the three-quadrant cone
$\mathcal {C} = \{ (i,j) : i \geq 0 \text { or } j \geq 0 \}$
. They turn out to be more difficult than their quadrant counterparts. In this paper, we investigate a collection of eight models in
$\mathcal {C}$
, which can be seen as the first level of difficulty beyond quadrant problems. This collection consists of diagonally symmetric models in
$\{-1, 0,1\}^2\setminus \{(-1,1), (1,-1)\}$
. Three of them are known not to be D-algebraic. We show that the remaining five can be solved in a uniform fashion using Tutte’s notion of invariants, which has already proved useful for some quadrant models. Three models are found to be algebraic, one is (only) D-finite, and the last one is (only) D-algebraic. We also solve in the same fashion the diagonal model
$\{ \nearrow , \nwarrow , \swarrow , \searrow \}$
, which is D-finite. The three algebraic models are those of the Kreweras trilogy,
$\mathcal S=\{\nearrow , \leftarrow , \downarrow \}$
,
$\mathcal S^*=\{\rightarrow , \uparrow , \swarrow \}$
, and
$\mathcal S\cup \mathcal S^*$
. Our solutions take similar forms for all six models. Roughly speaking, the square of the generating function of three-quadrant walks with steps in
$\mathcal S$
is an explicit rational function in the quadrant generating function with steps in
$\mathscr S:= \{(j-i,j): (i,j) \in \mathcal S\}$
. We derive various exact or asymptotic corollaries, including an explicit algebraic description of a positive harmonic function in
$\mathcal C$
for the (reverses of the) five models that are at least D-finite.