{"title":"A new lower bound for deterministic pop-stack-sorting","authors":"","doi":"10.1016/j.ejc.2024.104046","DOIUrl":null,"url":null,"abstract":"<div><p>The pop-stack-sorting process is a variation of the stack-sorting process. We consider a deterministic version of this process. We prove a lemma which characterises interior elements of increasing runs after <span><math><mi>t</mi></math></span> iterations of the process and provide a new lower bound of <span><math><mrow><mfrac><mrow><mn>3</mn></mrow><mrow><mn>5</mn></mrow></mfrac><mi>n</mi></mrow></math></span> for the number of iterations of the process to fully sort a uniformly randomly chosen permutation of length <span><math><mi>n</mi></math></span>.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0195669824001318/pdfft?md5=8663c72484e70fd60026d39c421da4b1&pid=1-s2.0-S0195669824001318-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001318","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The pop-stack-sorting process is a variation of the stack-sorting process. We consider a deterministic version of this process. We prove a lemma which characterises interior elements of increasing runs after iterations of the process and provide a new lower bound of for the number of iterations of the process to fully sort a uniformly randomly chosen permutation of length .
期刊介绍：
The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
