Pattern avoidance classes and subpermutations
Published in ArXiv.org • Feb 11, 2004
NobleIDNI1P89W19R35S88
Authors:,,
M. D. Atkinson
M. M. Murphy
N. Ruskuc
Abstract
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows th...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!