Pattern classes of permutations via bijections between linearly ordered sets

A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class XX which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets AA and BB. Concentrating on the situation where AA is arbitrary and B=NB=N, we demonstrate how the order-theoretic properties of AA determine the structure of XX and we establish results about independence, contiguity and subrepresentations for classes admitting multiple representations of this form.