The Enumeration of Prudent Polygons by Area and its Unusual Asymptotics

Abstract

Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-Mélou, Schwerdtfeger; 2010). We consider the enumeration of \emph{prudent polygons} by \emph{area}. For the 3-sided variety, we find that the generating function is expressed in terms of a $q$-hypergeometric function, with an accumulation of poles towards the dominant singularity. This expression reveals an unusual asymptotic structure of the number of polygons of area $n$, where the critical exponent is the transcendental number ${\log }_{2}3$ and and the amplitude involves tiny oscillations. Based on numerical data, we also expect similar phenomena to occur for 4-sided polygons. The asymptotic methodology involves an original combination of Mellin transform techniques and singularity analysis, which is of potential interest in a number of other asymptotic enumeration problems.

The series below eqn. (17) was wrong. The correct series is now given. No other changes

References in corpus (3)

• Families of prudent self-avoiding walks
• Exactly solved models of polyominoes and polygons
• Mean asymptotic behaviour of radix-rational sequences and dilation equations (Extended version)

Cited by in corpus (3)

• A solvable non-directed model of polymer adsorption
• The perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons
• Errata and Addenda to Mathematical Constants