The Enumeration Of Prudent Polygons By Area And Its Unusual Asymptotics

JOURNAL OF COMBINATORIAL THEORY SERIES A(2011)

引用 4|浏览2
暂无评分
摘要
Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and 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 recently been enumerated by length and perimeter by Bousquet-Melon and Schwerdtfeger. We consider the enumeration of prudent polygons by 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 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. Crown Copyright (C) 2011 Published by Elsevier Inc. All rights reserved.
更多
查看译文
关键词
Asymptotics,Prudent polygons,Area enumeration,Mellin transforms,q-Series
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要