Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf

Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf

ID:34890825

大小:507.99 KB

页数:49页

时间:2019-03-13

Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf_第1页
Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf_第2页
Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf_第3页
Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf_第4页
Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf_第5页
资源描述:

《Beyond alternating permutations Pattern avoidance in Young diagrams and tableaux.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Beyondalternatingpermutations:PatternavoidanceinYoungdiagramsandtableauxNihalGowravaram,RaviJagadeesanMentor:JoelBrewsterLewisNovember28,2012AbstractWeinvestigatepatternavoidanceinalternatingpermutationsandgeneralizationsthereof.First,westudypatternavoidanceinanalternatinganalogu

2、eofYoungdia-grams.Inparticular,weextendBabson-West’snotionofshape-WilfequivalencetoapplytoalternatingpermutationsandsogeneralizeresultsofBackelin-West-XinandOuchterlonytoalternatingpermutations.Second,westudypatternavoidanceinthemoregeneralcontextofpermutationswithrestrictedascen

3、tsanddescents.WeconsideraquestionofLewisregardingpermutationsthatarethereadingwordsofthickenedstaircaseYoungtableaux,thatis,permutationsthathavek−1ascentsfollowedbyadescent,followedbyk−1ascents,etcetera.Wedeterminetherelativesizesofthesetsofpattern-avoiding(k−1)-ascentpermutation

4、sintermsoftheforbiddenpattern.Furthermore,inequalitiesinthesizesofsetsofpattern-avoidingpermutationsinthiscontextarisefromfurtherextensionsofshape-equivalencetypeenumerations.1IntroductionThetheoryofpatternavoidanceinpermutationsisconcernedwithenumerativeproblemsandhasconnections

5、tocomputerscience,algebraiccombinatorics,algebraicgeometry,andarXiv:1301.6796v1[math.CO]28Jan2013representationtheory.Thefundamentalquestionistodeterminethenumberofpermutationsofagivenlengththatavoidacertaintypeofforbiddensubsequence.Forexample,theonlypermutationsthatavoid21areth

6、eidentitypermutations.Thetheoryfirstaroseinthestudyofstack-sortablepermutations;forexample,Knuth[6]showedthatstack-sortablepermuta-tionsareexactlythosethatavoidthepattern231.Additionally,generalizedstack-sortablepermutationsarecharacterizedbytheavoidanceoflongerpatterns;foranexpos

7、ition,see[5,Chapter8].MacDonald[10]demonstratedthatvexillarypermutations,objectsofinterestinalgebraiccombinatorics,arecharacterizedby2143-avoidance.Furthermore,LakshmibaiandSandhya[7]provedthatpermutationsthatsimultaneouslyavoid3412and4231indexsmoothSchubertvarieties,whicharestud

8、iedinalgebraicgeometry.BilleyandWarring-

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

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

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