Permutations sortable by two stacks in series

详细信息    查看全文

• 作者：Andrew Elvey Price ; Anthony J. Guttmann ; ^{guttmann@unimelb.edu.au" class="auth_mail" title="E-mail the corresponding author}
• 关键词：05 ; 05Axx
• 刊名：Advances in Applied Mathematics
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：83
• 期：Complete
• 页码：81-96
• 全文大小：686 K

文摘

We address the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain nineteen further coefficients approximately. Analysing these coefficients by a variety of methods we conclude that the OGF behaves as where μ=12.45±0.15$\mu =12.45\pm 0.15$, γ=1.5±0.3$\gamma =1.5\pm 0.3$, and A≈0.02$A\approx 0.02$.