Bona---A survey of stack-sorting disciplines.pdf

Bona---A survey of stack-sorting disciplines.pdf

ID:34890831

大小:127.13 KB

页数:16页

时间:2019-03-13

Bona---A survey of stack-sorting disciplines.pdf_第1页
Bona---A survey of stack-sorting disciplines.pdf_第2页
Bona---A survey of stack-sorting disciplines.pdf_第3页
Bona---A survey of stack-sorting disciplines.pdf_第4页
Bona---A survey of stack-sorting disciplines.pdf_第5页
资源描述:

《Bona---A survey of stack-sorting disciplines.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Asurveyofstack-sortingdisciplinesMikl´osB´onaDepartmentofMathematics,UniversityofFloridaGainesvilleFL32611-8105bona@math.ufl.edu∗Submitted:May19,2003;Accepted:Jun18,2003;Published:Jul27,2003MRSubjectClassifications:05A15,05A16AbstractWereviewthevariouswaysthatstacks,

2、theirvariationsandtheircombinations,havebeenusedassortingdevices.Inparticular,weshowthattheyhavebeenakeymotivatorforthestudyofpermutationpatterns.WealsoshowthattheyhaveconnectionstootherareasincombinatoricssuchasYoungtableau,planargraphtheory,andsimplicialcomplexes.

3、1IntroductionThestacksortingproblemintroducedbyKnuth[29]inthe1960’swasafoundinginspi-rationinthestudyofpermutationpatterns.Simultaneouslyitintroducedthenotionofpatterncontainment,definingaclassofpermutationsbyaforbiddenset,andtheenu-merationofpermutationsinsuchclasse

4、s.SoonafterwardsvariousgeneralizationsbyTarjan[36],Pratt[33],andEvenandItai[24]werestudiedandtheseauthorsposedquestionsaboutpermutationpatternswhicheventodaycannotbeeasilyanswered.But,fromaround1973throughto1992whenHerbertWilfdeliveredaninfluentialaddresstotheSIAMmee

5、tingonDiscreteMathematics,thesequestionslayalmostuntouched.The1990’sandthenewmilleniumsawarenaissanceofpermutationpatternresearchandstacksortingproblemsreturnedasoneofitsmaindrivers.Inthissurveyweshallreviewboththeearlyworkandmorerecentworkonstacksorting.Weshallseet

6、hatittouchesonmanyareasofcombinatoricsandremainsafascinatingsourceofopenproblems.∗SupportedbyaYoungInvestigatorGrantoftheNationalSecurityAgency.Thepaperwaswrittenduringaone-monthstayoftheauthoratLABRI,attheUniversityofBordeauxI,France.theelectronicjournalofcombinato

7、rics9(2)(2003),#A11Astackisalast-in,first-outlinearsequenceaccessedatoneendcalledthetop.Itemsareaddedandremovedfromthetopendbypushandpopoperations.Initssimplestformastackisusedtorearrangeapermutationp=p1,p2,...,pnasfollows.Theelementsofparepushedontoaninitiallyemptys

8、tackandanoutputpermutationisformedbypoppingelementsfromthestack.Theoutputpermutationobviouslydependsonhowthepushandpopoperationsareinterle

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

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

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