Due to copyright restrictions, this file is not available for public download
Click here to request a copy from the OU Author.
|Google Scholar:||Look up in Google Scholar|
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study of permutation classes. We demonstrate how classes containing only finitely many simple permutations satisfy a number of special properties relating to enumeration, partial well-order and the property of being finitely based.
|Item Type:||Book Chapter|
|Copyright Holders:||2010 Cambridge University Press|
|Academic Unit/School:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Depositing User:||Robert Brignall|
|Date Deposited:||08 Oct 2010 10:20|
|Last Modified:||30 Nov 2016 11:19|
|Share this page:|