Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/2140
This item has been viewed 2 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
HuczynskaRuskuc2008EJnlCombSuper4.pdf284.96 kBAdobe PDFView/Open
Title: Pattern classes of permutations via bijections between linearly ordered sets
Authors: Huczynska, Sophie
Ruskuc, Nikola
Keywords: Restricted permutations
QA Mathematics
Issue Date: Jan-2008
Citation: Huczynska , S & Ruskuc , N 2008 , ' Pattern classes of permutations via bijections between linearly ordered sets ' European Journal of Combinatorics , vol 29 , no. 1 , pp. 118-139 .
Abstract: A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X 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 A and B. Concentrating on the situation where A is arbitrary and B = N, we demonstrate how the order-theoretic properties of A determine the structure of X and we establish results about independence, contiguousness and subrepresentations for classes admitting multiple representations of this form.
Version: Postprint
Status: Peer reviewed
URI: http://hdl.handle.net/10023/2140
DOI: http://dx.doi.org/10.1016/j.ejc.2006.12.005
ISSN: 0195-6698
Type: Journal article
Rights: This is an author version of this article. The published version (c) 2007 Elsevier Ltd. is available from www.sciencedirect.com
Appears in Collections:Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research
University of St Andrews Research
Pure Mathematics Research



This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)