arXiv Analytics

Sign in

arXiv:math/0211213 [math.CO]AbstractReferencesReviewsResources

Restricted permutations and queue jumping

M. H. Albert, R. E. L. Aldred, M. D. Atkinson, H. van Ditmarsch, C. C. Handley, D. A. Holton

Published 2002-11-13Version 1

A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding both 4231 and 42513, and enumeration results for such permutations are given.

Related articles: Most relevant | Search more
arXiv:math/0505094 [math.CO] (Published 2005-05-05)
Enumerating Segmented Patterns in Compositions and Encoding by Restricted Permutations
arXiv:1811.10503 [math.CO] (Published 2018-11-26)
On restricted permutations of $\{1,\ldots,n\}$
arXiv:math/0301033 [math.CO] (Published 2003-01-05, updated 2003-03-02)
A generalization of the Simion-Schmidt bijection for restricted permutations