Enumeration of snakes and cycle-alternating permutations.pdf

Enumeration of snakes and cycle-alternating permutations.pdf

ID:34891037

大小:288.85 KB

页数:22页

时间:2019-03-13

Enumeration of snakes and cycle-alternating permutations.pdf_第1页
Enumeration of snakes and cycle-alternating permutations.pdf_第2页
Enumeration of snakes and cycle-alternating permutations.pdf_第3页
Enumeration of snakes and cycle-alternating permutations.pdf_第4页
Enumeration of snakes and cycle-alternating permutations.pdf_第5页
资源描述:

《Enumeration of snakes and cycle-alternating permutations.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、ENUMERATIONOFSNAKESANDCYCLE-ALTERNATINGPERMUTATIONSMATTHIEUJOSUAT-VERGES`TothememoryofVladimirArnol’dAbstract.SpringernumbersareananalogofEulernumbersforthegroupofsignedpermutations.Arnol’dshowedthattheycountsomeobjectscalledsnakes,thatgeneralizealternatingpermutations.Hoffmanestablishedalinkbetw

2、eenSpringernumbers,snakes,andsomepolynomialsrelatedwiththesuccessivederivativesoftrigonometricfunctions.Thegoalofthisarticleistogivefurthercombinatorialpropertiesofderivativepolynomials,intermsofsnakesandotherobjects:cycle-alternatingpermutations,weightedDyckorMotzkinpaths,increasingtreesandfore

3、sts.Weobtainthegen-eratingfunctions,intermsoftrigonometricfunctionsforexponentialonesandintermsofJ-fractionsforordinaryones.Wealsodefinenaturalq-analogs,makealinkwithnormalorderingproblemsandcombinatorialtheoryofdifferentialequations.1.IntroductionItiswell-knownthattheEulernumbersEndefinedbyX∞nzEn=

4、tanz+secz(1)n!n=0countalternatingpermutationsinSn,i.e.σsuchthatσ1>σ2<σ3>...σn.Thestudyofthese,aswellasotherclassesofpermutationscountedbyEn,isavasttopicinenumerativecombinatorics,seethesurveyofStanley[21].ByaconstructionduetoSpringer[20],thereisanintegerK(W)definedforanyCoxetergroupWsuchthatK(Sn)

5、=En.Asforthegroupsofsignedpermutations,Arnol’d[1]introducedsomeparticularkindofsignedpermutationscalledsnakes,countedbythenumbersK(SBn)andK(SDn).Thussnakescanbeconsideredasa“signedanalog”ofalternatingpermutations.Algorithmically,Arnol’d[1]givesamethodtocomputetheseintegersarXiv:1011.0929v1[math.

6、CO]3Nov2010withrecurrencesorganizedintriangulararrayssimilartotheSeidel-EntrigertriangleofEulernumbersEn(seeforexample[11]).Inthisarticle,wearemostlyinterestedinthenumbersSn=K(SBn),whichwerepresviouslyconsideredbyGlaisher[9,§§109and119]inanothercontext.Springer[20]showsthattheysatisfyX∞nz1Sn=,(2

7、)n!cosz−sinzn=0andwecallSnthenthSpringernumber(althoughthereisintheoryaSpringernumberassociatedwitheachCoxetergroup,thisnamewithoutfurtherspecificationusuallyDate:November4,2010.2000MathematicsSubjectClassification.Primary:05A

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。