Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-23T19:18:49.773Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)