Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Permutation Classes of Polynomial Growth M. H. Albert
 

Summary: Permutation Classes of Polynomial Growth
M. H. Albert
, M. D. Atkinson
Department of Computer Science
University of Otago, Dunedin, New Zealand
and
Robert Brignall
Department of Mathematics and Statistics
St Andrews, UK.
May 15, 2007
Abstract
A pattern class is a set of permutations closed under the formation
of subpermutations. Such classes can be characterised as those permuta-
tions not involving a particular set of forbidden permutations. A simple
collection of necessary and sufficient conditions on sets of forbidden per-
mutations which ensure that the associated pattern class is of polynomial
growth is determined. A catalogue of all such sets of forbidden permuta-
tions having three or fewer elements is provided together with bounds on
the degrees of the associated enumerating polynomials.
1 Introduction

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago

 

Collections: Computer Technologies and Information Sciences