Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-06T22:25:36.651Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalized Stack Permutations

Published online by Cambridge University Press:  01 September 1998

M. D. ATKINSON
M. D. ATKINSON
Affiliation:
School of Mathematical and Computational Sciences North Haugh, St Andrews, Fife KY16 9SS, Scotland (e-mail: mda@dcs.st-and.ac.uk)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Stacks which allow elements to be pushed into any of the top r positions and popped from any of the top s positions are studied. An asymptotic formula for the number un of permutations of length n sortable by such a stack is found in the cases r=1 or s=1. This formula is found from the generating function of un. The sortable permutations are characterized if r=1 or s=1 or r=s=2 by a forbidden subsequence condition.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 3 , September 1998 , pp. 239 - 246
Copyright
1998 Cambridge University Press