Asymptotics of the average height of 2--watermelons with a wall.pdf

Asymptotics of the average height of 2--watermelons with a wall.pdf

  1. 1、本文档共17页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Asymptotics of the average height of 2--watermelons with a wall

a r X i v : m a t h / 0 6 0 7 1 6 3 v 2 [ m a t h .C O ] 4 S e p 2 0 0 6 ASYMPTOTICS OF THE AVERAGE HEIGHT OF 2–WATERMELONS WITH A WALL. MARKUS FULMEK Abstract. We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length n) to the case of p– watermelons with a wall (i.e., to a certain family of p nonintersecting Dyck paths; simple Dyck paths being the special case p = 1.) We work out this asymptotics for the case p = 2 only, since the computations involved are already quite complicated (but might be of some interest in their own right). 1. Introduction The model of vicious walkers was originally introduced by Fisher [9] and received much interest, since it leads to challenging enumerative questions. Here, we consider special configurations of vicious walkers called p–watermelons with a wall . Briefly stated, a p–watermelon of length n is a family P1, . . . Pp of p nonintersecting lattice paths in Z2, where ? Pi starts at (0, 2i? 2) and ends at (2n, 2i? 2), for i = 1, . . . , p, ? all the steps are directed north–east or south–east, i.e., lead from lattice point (i, j) to (i+ 1, j + 1) or to (i+ 1, j ? 1), ? no two paths Pi, Pj have a point in common (this is the meaning of “noninter- secting”). The height of a p–watermelon is the y–coordinate of the highest lattice point contained in any of its paths (since the paths are nonintersecting, it suffices to consider the lattice points contained in the highest path Pp; see Figure 1 for an illustration.) A p–watermelon of length n with a wall has the additional property that none of the paths ever goes below the line y = 0 (since the paths are nonintersecting, it suffices to impose this condition on the lowest path P1; see Figure 2 for an illustration.). In [2], Bonichon and Mosbah considered (amongst other things) the average height H(n, p) of p–watermelons of length n with a wall, H(n, p) = 1 #(all p-watermelons of length n) × ∑ h h ·#(all p-

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档