Skip to content

Research at St Andrews

Enumeration schemes for restricted permutations

Research output: Contribution to journalArticle

Author(s)

Vincent Vatter

School/Research organisations

Abstract

Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.

Close

Details

Original languageEnglish
Pages (from-to)137-159
Number of pages23
JournalCombinatorics, Probability and Computing
Volume17
Issue number1
DOIs
Publication statusPublished - Jan 2008

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by journal

  1. Growing at a Perfect Speed

    Albert, M. H. & Linton, S. A., May 2009, In : Combinatorics, Probability and Computing. 18, 3, p. 301-308 8 p.

    Research output: Contribution to journalArticle

  2. Orbital chromatic and flow roots

    Cameron, P. J. & Kayibi, K. K., 1 May 2007, In : Combinatorics Probability and Computing. 16, 3, p. 401-407 7 p.

    Research output: Contribution to journalArticle

  3. Homomorphism-homogeneous relational structures

    Cameron, P. J. & Nešetřil, J., 1 Jan 2006, In : Combinatorics Probability and Computing. 15, 1-2, p. 91-103 13 p.

    Research output: Contribution to journalArticle

  4. Connectedness, Classes and Cycle Index

    Bender, E. A., Cameron, P. J., Odlyzko, A. M. & Richmond, L. B., 1 Jan 1999, In : Combinatorics Probability and Computing. 8, 1-2, p. 31-43 13 p.

    Research output: Contribution to journalArticle

ID: 18140571

Top