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:
This item has been viewed 4 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Ruscuk_2013_TAMS_Geometric.pdf244.17 kBAdobe PDFView/Open
Title: Geometric grid classes of permutations
Authors: Albert, M.H.
Atkinson, M.D.
Bouvel, M.
Ruskuc, Nik
Vatter, V.
Keywords: QA Mathematics
Issue Date: Nov-2013
Citation: Albert , M H , Atkinson , M D , Bouvel , M , Ruskuc , N & Vatter , V 2013 , ' Geometric grid classes of permutations ' Transactions of the American Mathematical Society , vol 365 , no. 11 , pp. 5859-5881 . , 10.1090/S0002-9947-2013-05804-7
Abstract: A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope ±1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods, we prove that such classes are specified by finite sets of forbidden permutations, are partially well ordered, and have rational generating functions. Furthermore, we show that these properties are inherited by the subclasses (under permutation involvement) of such classes, and establish the basic lattice theoretic properties of the collection of all such subclasses.
Version: Publisher PDF
Status: Peer reviewed
ISSN: 0002-9947
Type: Journal article
Rights: © Copyright 2013 American Mathematical Society. First published in Transactions of the American Mathematical Society in 365(11) 2013, published by the American Mathematical Society.
Appears in Collections:Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research
University of St Andrews Research
Mathematics & Statistics 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: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)