Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Combinatorial Gray codes for classes of pattern avoiding permutations

Dukes, Mark and Flanagan, Mark and Mansour, Toufik and Vajnovszki, Vincent (2008) Combinatorial Gray codes for classes of pattern avoiding permutations. Theoretical Computer Science, 396 (1 - 3). 35 - 49. ISSN 0304-3975

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.

Item type: Article
ID code: 34490
Keywords: Theoretical Computer Science, Computer Science(all)
Subjects: UNSPECIFIED
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
Depositing user: Pure Administrator
Date Deposited: 20 Oct 2011 14:44
Last modified: 05 Sep 2014 12:01
URI: http://strathprints.strath.ac.uk/id/eprint/34490

Actions (login required)

View Item