Conjectureson the Enumeration of TableauxofBounded Height.pdf

Conjectureson the Enumeration of TableauxofBounded Height.pdf

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

Conjectureson the Enumeration of TableauxofBounded Height(1) Fran?coisBergeron,LucFavreau,andDanielKrob Abstract:W e expressgeneralconjecturesforthe explicitform of P -recurrencesforthe num ber of Young standardtableauxofheight bounded by h. These recurrencesarecompatiblewith known resultsand Regev’s asymptoticevaluations. R ?esum?e en fran?cais Le but de cettenote estessentiellement de pr?esenterdes conjecturesainsique des indicationssurlesraisonsquinous ont port?eesμa ?enoncercesconjectures.Les conjectures portentsurlaformeexplicited’?equationsde r?ecurrenceque semblesatisfairelasuiteth (n), desnom bresde tableauxde Young de hauteurborn?eepar h,ainsique lasuitet (2) h (n),des nom bresde pairesde telstableauxayant m e?me forme(voir(2)).La formedesr?ecurrences (1a et2a) etcertainsaspectsexplicitesdes coe–cients(1b,1c,1d,2b,2c,2d et2e)font l’objetde cesconjecturesdans lecas g?en?eral,et pour lecas h impair,on donne encore plusde d?etails(1eet 1f). Un r?esultatde Zeilberger[3]assureque de tellesr?ecurrences (voir(3))existent mais sa d?emonstrationne semblepas permettrede d?eduireune forme expliciteaussipr?eciseque (4)ou (6).On mon treaussique lecomp ortementasymptotique dessolutionsdesrecurrencesobtenuespar lebiaisde nos conjecturesestcompatibleavec lesr?esultatsde Regev [2]surlecomp ortement asymptotiquedesnom bresth (n). 1.1.Introduction Letusflrstflx somenotation.A partition? ofa positive integern isa sequenceof integers?1 ? ?2 ? :::? ?k 0 such that P i ?i = n.W ewrite? ‘ n toexpressthisfact, anddenote‘(?)= k thenumberofparts(the?i’s)of?.W esay thatk istheheighth(?) of?.The heightoftheempty partition(of0)issettobe 0.The (Ferrer’s)diagramofa partitionisthesetofpoints(i;j)2 Z 2 such that1? j? ?i. A YoungstandardtableauT isan injective labelingofa Ferrer’sdiagramby the elementsoff1;2;:::;ng,such thatT(i;j) T(i+ 1;j),for1 ? i k,and T(i;j) T(i;j+ 1),for1 ? j ?i. W e furthersay that? istheshape ofthetableauT. Fora given?,thenumberf? oftableauxofshape? isgivenby theh

文档评论(0)

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

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

1亿VIP精品文档

相关文档