Permutations sortable by two stacks in series

From MaRDI portal
(Redirected from Publication:343835)




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.









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)