Permutations sortable by two stacks in series

From MaRDI portal
Publication:343835

DOI10.1016/J.AAM.2016.09.003zbMATH Open1351.05008arXiv1510.08663OpenAlexW2962822399MaRDI QIDQ343835FDOQ343835


Authors: Andrew Elvey Price, Anthony J Guttmann Edit this on Wikidata


Publication date: 29 November 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: 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 S(z) sim A (1 - mu cdot z)^gamma, where mu=12.45pm0.15, gamma=1.5pm0.3, and Aapprox0.02.


Full work available at URL: https://arxiv.org/abs/1510.08663




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Permutations sortable by two stacks in series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343835)